/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 12:25:54,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 12:25:54,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 12:25:54,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 12:25:54,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 12:25:54,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 12:25:54,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 12:25:54,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 12:25:54,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 12:25:54,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 12:25:54,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 12:25:54,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 12:25:54,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 12:25:54,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 12:25:54,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 12:25:54,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 12:25:54,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 12:25:54,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 12:25:54,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 12:25:54,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 12:25:54,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 12:25:54,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 12:25:54,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 12:25:54,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 12:25:54,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 12:25:54,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 12:25:54,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 12:25:54,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 12:25:54,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 12:25:54,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 12:25:54,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 12:25:54,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 12:25:54,493 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 12:25:54,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 12:25:54,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 12:25:54,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 12:25:54,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 12:25:54,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 12:25:54,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 12:25:54,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 12:25:54,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 12:25:54,502 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-09 12:25:54,564 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 12:25:54,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 12:25:54,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 12:25:54,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 12:25:54,569 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 12:25:54,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 12:25:54,570 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 12:25:54,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 12:25:54,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 12:25:54,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 12:25:54,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 12:25:54,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 12:25:54,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 12:25:54,572 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 12:25:54,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 12:25:54,573 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 12:25:54,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 12:25:54,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 12:25:54,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 12:25:54,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 12:25:54,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 12:25:54,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 12:25:54,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 12:25:54,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-09 12:25:54,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 12:25:54,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 12:25:54,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 12:25:54,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 12:25:54,576 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-09 12:25:54,576 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 12:25:55,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 12:25:55,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 12:25:55,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 12:25:55,063 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 12:25:55,064 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 12:25:55,065 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i [2020-11-09 12:25:55,156 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d59686d8f/0420c1d8963242098a161b9e1596dcfb/FLAGfb18003c3 [2020-11-09 12:25:55,948 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 12:25:55,948 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i [2020-11-09 12:25:55,972 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d59686d8f/0420c1d8963242098a161b9e1596dcfb/FLAGfb18003c3 [2020-11-09 12:25:56,188 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d59686d8f/0420c1d8963242098a161b9e1596dcfb [2020-11-09 12:25:56,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 12:25:56,198 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 12:25:56,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 12:25:56,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 12:25:56,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 12:25:56,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:25:56" (1/1) ... [2020-11-09 12:25:56,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@409f2bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:25:56, skipping insertion in model container [2020-11-09 12:25:56,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:25:56" (1/1) ... [2020-11-09 12:25:56,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 12:25:56,308 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 12:25:56,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 12:25:56,841 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 12:25:56,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 12:25:57,077 INFO L208 MainTranslator]: Completed translation [2020-11-09 12:25:57,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:25:57 WrapperNode [2020-11-09 12:25:57,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 12:25:57,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 12:25:57,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 12:25:57,079 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 12:25:57,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:25:57" (1/1) ... [2020-11-09 12:25:57,111 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:25:57" (1/1) ... [2020-11-09 12:25:57,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 12:25:57,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 12:25:57,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 12:25:57,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 12:25:57,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:25:57" (1/1) ... [2020-11-09 12:25:57,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:25:57" (1/1) ... [2020-11-09 12:25:57,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:25:57" (1/1) ... [2020-11-09 12:25:57,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:25:57" (1/1) ... [2020-11-09 12:25:57,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:25:57" (1/1) ... [2020-11-09 12:25:57,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:25:57" (1/1) ... [2020-11-09 12:25:57,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:25:57" (1/1) ... [2020-11-09 12:25:57,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 12:25:57,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 12:25:57,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 12:25:57,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 12:25:57,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:25:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 12:25:57,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 12:25:57,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 12:25:57,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 12:25:57,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 12:25:57,325 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 12:25:57,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 12:25:57,326 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 12:25:57,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 12:25:57,326 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 12:25:57,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 12:25:57,326 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-09 12:25:57,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-09 12:25:57,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 12:25:57,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 12:25:57,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 12:25:57,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 12:25:57,330 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 12:25:59,716 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 12:25:59,717 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 12:25:59,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:25:59 BoogieIcfgContainer [2020-11-09 12:25:59,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 12:25:59,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 12:25:59,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 12:25:59,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 12:25:59,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:25:56" (1/3) ... [2020-11-09 12:25:59,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360066b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:25:59, skipping insertion in model container [2020-11-09 12:25:59,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:25:57" (2/3) ... [2020-11-09 12:25:59,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360066b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:25:59, skipping insertion in model container [2020-11-09 12:25:59,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:25:59" (3/3) ... [2020-11-09 12:25:59,729 INFO L111 eAbstractionObserver]: Analyzing ICFG mix023_power.opt.i [2020-11-09 12:25:59,748 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 12:25:59,749 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-09 12:25:59,753 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 12:25:59,754 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 12:25:59,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,811 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,811 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,812 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,812 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,813 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,813 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,813 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,814 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,814 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,814 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,828 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,828 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,828 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,828 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,828 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,828 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,833 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,834 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,834 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,834 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,835 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,836 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,837 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,838 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,839 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,839 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,839 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,839 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,841 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,841 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,841 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,841 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,841 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,841 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,841 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,842 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,842 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,843 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,843 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,843 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,844 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,844 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,844 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,844 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,844 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,845 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,845 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,845 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,874 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,874 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,875 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,875 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,875 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,875 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,875 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,876 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,876 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,876 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,876 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,879 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,879 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,880 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,880 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,880 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,880 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,880 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,881 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,881 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,881 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,888 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,888 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,892 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,895 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,895 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,895 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,895 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,897 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,899 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,899 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,899 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,899 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,899 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:25:59,901 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 12:25:59,915 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-09 12:25:59,940 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 12:25:59,940 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 12:25:59,941 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-09 12:25:59,941 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-09 12:25:59,941 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 12:25:59,941 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 12:25:59,941 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 12:25:59,941 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 12:25:59,956 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-09 12:25:59,959 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-09 12:25:59,963 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-09 12:25:59,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 121 transitions, 262 flow [2020-11-09 12:26:00,022 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-11-09 12:26:00,023 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 12:26:00,029 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-11-09 12:26:00,034 INFO L116 LiptonReduction]: Number of co-enabled transitions 2862 [2020-11-09 12:26:00,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:00,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:00,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:26:00,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:00,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:00,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:00,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:26:00,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:00,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 12:26:00,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:00,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:00,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:00,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:00,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:00,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:00,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-09 12:26:00,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 12:26:00,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:01,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:01,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:01,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:01,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:01,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:01,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:26:01,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:01,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:26:01,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:01,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:01,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:01,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:01,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:01,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:26:01,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:01,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:26:01,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-09 12:26:01,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:01,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:01,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:01,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:01,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:01,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:01,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:26:01,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:01,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:26:01,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:01,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:01,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:01,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:01,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:01,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:26:01,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:01,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:26:01,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:01,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-09 12:26:01,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 12:26:01,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:01,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:01,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:01,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:26:01,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:01,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:01,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:01,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:26:01,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:01,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 12:26:01,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:01,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:01,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:01,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:01,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:02,156 WARN L194 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-09 12:26:02,268 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-09 12:26:02,857 WARN L194 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-11-09 12:26:02,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 12:26:02,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:03,365 WARN L194 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2020-11-09 12:26:03,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:03,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:03,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:03,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:03,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:03,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:26:03,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:03,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:26:03,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:03,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:03,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:03,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:03,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:03,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:26:03,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:03,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:26:03,928 WARN L194 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-11-09 12:26:04,060 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-11-09 12:26:04,197 WARN L194 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2020-11-09 12:26:04,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-09 12:26:04,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:04,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:04,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:04,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:04,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:04,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:04,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:26:04,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:04,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:26:04,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:04,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:04,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:04,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:04,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:04,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:26:04,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:04,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:26:05,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:05,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-09 12:26:05,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 12:26:05,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:05,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:05,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:05,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:26:05,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:05,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:05,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:05,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:26:05,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:05,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 12:26:05,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:05,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:05,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:05,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:05,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:06,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 12:26:06,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:06,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-09 12:26:06,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:06,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-09 12:26:06,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:06,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:06,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-09 12:26:06,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 12:26:06,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:06,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:06,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:06,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:26:06,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:06,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:06,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:06,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:26:06,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:06,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 12:26:06,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:06,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:06,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:06,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:06,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:06,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:06,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:06,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:26:06,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:06,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:06,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:06,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:26:06,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:06,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 12:26:06,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:06,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:06,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:06,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:06,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:06,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:06,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-09 12:26:06,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 12:26:06,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:06,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:06,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:06,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:06,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:06,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:06,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:26:06,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:06,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:26:06,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:06,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:06,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:06,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:06,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:06,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:06,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:06,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:07,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:07,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:07,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:26:07,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:07,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:07,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:07,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:26:07,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:07,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 12:26:07,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:07,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:07,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:07,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:07,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:07,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:07,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-09 12:26:07,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 12:26:07,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:07,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:07,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-09 12:26:07,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 12:26:07,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:07,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:07,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:07,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:26:07,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:07,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:07,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:07,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:26:07,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:26:07,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 12:26:07,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:07,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:07,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:07,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:26:07,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:08,652 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2020-11-09 12:26:08,803 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2020-11-09 12:26:09,305 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2020-11-09 12:26:09,468 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2020-11-09 12:26:09,647 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-09 12:26:09,760 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-09 12:26:09,900 WARN L194 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-09 12:26:10,022 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-09 12:26:10,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:10,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:10,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:10,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:10,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:10,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:10,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:10,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:26:10,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:10,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:10,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:10,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:26:10,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:26:10,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:26:10,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:26:10,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:26:10,761 WARN L194 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-11-09 12:26:11,036 WARN L194 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-11-09 12:26:11,581 WARN L194 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-11-09 12:26:11,842 WARN L194 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-11-09 12:26:12,425 INFO L131 LiptonReduction]: Checked pairs total: 7701 [2020-11-09 12:26:12,425 INFO L133 LiptonReduction]: Total number of compositions: 102 [2020-11-09 12:26:12,433 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow [2020-11-09 12:26:12,740 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states. [2020-11-09 12:26:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states. [2020-11-09 12:26:12,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-09 12:26:12,749 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:26:12,750 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:26:12,750 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:26:12,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:26:12,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1877032046, now seen corresponding path program 1 times [2020-11-09 12:26:12,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:26:12,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568573102] [2020-11-09 12:26:12,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:26:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:26:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:26:13,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568573102] [2020-11-09 12:26:13,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:26:13,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 12:26:13,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196552097] [2020-11-09 12:26:13,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:26:13,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:26:13,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:26:13,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:26:13,147 INFO L87 Difference]: Start difference. First operand 3890 states. Second operand 3 states. [2020-11-09 12:26:13,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:26:13,323 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-11-09 12:26:13,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:26:13,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-09 12:26:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:26:13,389 INFO L225 Difference]: With dead ends: 3250 [2020-11-09 12:26:13,389 INFO L226 Difference]: Without dead ends: 2650 [2020-11-09 12:26:13,392 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:26:13,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-11-09 12:26:13,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2020-11-09 12:26:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-11-09 12:26:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2020-11-09 12:26:13,642 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7 [2020-11-09 12:26:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:26:13,643 INFO L481 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2020-11-09 12:26:13,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:26:13,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2020-11-09 12:26:13,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 12:26:13,650 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:26:13,650 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:26:13,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 12:26:13,650 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:26:13,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:26:13,655 INFO L82 PathProgramCache]: Analyzing trace with hash 394130702, now seen corresponding path program 1 times [2020-11-09 12:26:13,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:26:13,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832915364] [2020-11-09 12:26:13,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:26:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:26:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:26:13,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832915364] [2020-11-09 12:26:13,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:26:13,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 12:26:13,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436014912] [2020-11-09 12:26:13,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:26:13,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:26:13,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:26:13,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:26:13,798 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states. [2020-11-09 12:26:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:26:13,841 INFO L93 Difference]: Finished difference Result 2410 states and 9176 transitions. [2020-11-09 12:26:13,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:26:13,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-09 12:26:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:26:13,867 INFO L225 Difference]: With dead ends: 2410 [2020-11-09 12:26:13,867 INFO L226 Difference]: Without dead ends: 2410 [2020-11-09 12:26:13,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:26:13,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-11-09 12:26:14,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2020-11-09 12:26:14,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2020-11-09 12:26:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9176 transitions. [2020-11-09 12:26:14,063 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9176 transitions. Word has length 11 [2020-11-09 12:26:14,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:26:14,064 INFO L481 AbstractCegarLoop]: Abstraction has 2410 states and 9176 transitions. [2020-11-09 12:26:14,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:26:14,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9176 transitions. [2020-11-09 12:26:14,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 12:26:14,073 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:26:14,073 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:26:14,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 12:26:14,073 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:26:14,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:26:14,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1025625581, now seen corresponding path program 1 times [2020-11-09 12:26:14,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:26:14,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571502141] [2020-11-09 12:26:14,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:26:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:26:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:26:14,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571502141] [2020-11-09 12:26:14,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:26:14,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 12:26:14,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52169556] [2020-11-09 12:26:14,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:26:14,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:26:14,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:26:14,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:26:14,172 INFO L87 Difference]: Start difference. First operand 2410 states and 9176 transitions. Second operand 3 states. [2020-11-09 12:26:14,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:26:14,209 INFO L93 Difference]: Finished difference Result 2386 states and 9070 transitions. [2020-11-09 12:26:14,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:26:14,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-11-09 12:26:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:26:14,233 INFO L225 Difference]: With dead ends: 2386 [2020-11-09 12:26:14,233 INFO L226 Difference]: Without dead ends: 2386 [2020-11-09 12:26:14,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:26:14,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2020-11-09 12:26:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2386. [2020-11-09 12:26:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2020-11-09 12:26:14,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 9070 transitions. [2020-11-09 12:26:14,341 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 9070 transitions. Word has length 13 [2020-11-09 12:26:14,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:26:14,341 INFO L481 AbstractCegarLoop]: Abstraction has 2386 states and 9070 transitions. [2020-11-09 12:26:14,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:26:14,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 9070 transitions. [2020-11-09 12:26:14,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 12:26:14,345 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:26:14,345 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:26:14,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 12:26:14,345 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:26:14,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:26:14,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1731039002, now seen corresponding path program 1 times [2020-11-09 12:26:14,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:26:14,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041555353] [2020-11-09 12:26:14,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:26:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:26:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:26:14,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041555353] [2020-11-09 12:26:14,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:26:14,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 12:26:14,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827611153] [2020-11-09 12:26:14,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:26:14,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:26:14,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:26:14,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:26:14,435 INFO L87 Difference]: Start difference. First operand 2386 states and 9070 transitions. Second operand 3 states. [2020-11-09 12:26:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:26:14,469 INFO L93 Difference]: Finished difference Result 2290 states and 8670 transitions. [2020-11-09 12:26:14,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:26:14,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-11-09 12:26:14,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:26:14,491 INFO L225 Difference]: With dead ends: 2290 [2020-11-09 12:26:14,492 INFO L226 Difference]: Without dead ends: 2290 [2020-11-09 12:26:14,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:26:14,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2020-11-09 12:26:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2290. [2020-11-09 12:26:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2290 states. [2020-11-09 12:26:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 8670 transitions. [2020-11-09 12:26:14,592 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 8670 transitions. Word has length 14 [2020-11-09 12:26:14,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:26:14,593 INFO L481 AbstractCegarLoop]: Abstraction has 2290 states and 8670 transitions. [2020-11-09 12:26:14,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:26:14,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 8670 transitions. [2020-11-09 12:26:14,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 12:26:14,597 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:26:14,597 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:26:14,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 12:26:14,598 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:26:14,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:26:14,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2122603733, now seen corresponding path program 1 times [2020-11-09 12:26:14,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:26:14,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582144084] [2020-11-09 12:26:14,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:26:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:26:14,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:26:14,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582144084] [2020-11-09 12:26:14,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:26:14,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:26:14,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677948026] [2020-11-09 12:26:14,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 12:26:14,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:26:14,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 12:26:14,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:26:14,722 INFO L87 Difference]: Start difference. First operand 2290 states and 8670 transitions. Second operand 4 states. [2020-11-09 12:26:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:26:14,803 INFO L93 Difference]: Finished difference Result 2338 states and 8060 transitions. [2020-11-09 12:26:14,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 12:26:14,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-09 12:26:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:26:14,819 INFO L225 Difference]: With dead ends: 2338 [2020-11-09 12:26:14,819 INFO L226 Difference]: Without dead ends: 1738 [2020-11-09 12:26:14,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:26:14,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2020-11-09 12:26:14,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1738. [2020-11-09 12:26:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2020-11-09 12:26:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 5910 transitions. [2020-11-09 12:26:14,889 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 5910 transitions. Word has length 15 [2020-11-09 12:26:14,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:26:14,889 INFO L481 AbstractCegarLoop]: Abstraction has 1738 states and 5910 transitions. [2020-11-09 12:26:14,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 12:26:14,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 5910 transitions. [2020-11-09 12:26:14,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 12:26:14,893 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:26:14,893 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:26:14,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 12:26:14,894 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:26:14,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:26:14,894 INFO L82 PathProgramCache]: Analyzing trace with hash 964996659, now seen corresponding path program 1 times [2020-11-09 12:26:14,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:26:14,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142915211] [2020-11-09 12:26:14,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:26:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:26:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:26:15,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142915211] [2020-11-09 12:26:15,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:26:15,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 12:26:15,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44892791] [2020-11-09 12:26:15,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:26:15,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:26:15,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:26:15,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:26:15,109 INFO L87 Difference]: Start difference. First operand 1738 states and 5910 transitions. Second operand 5 states. [2020-11-09 12:26:15,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:26:15,181 INFO L93 Difference]: Finished difference Result 1500 states and 4716 transitions. [2020-11-09 12:26:15,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:26:15,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-11-09 12:26:15,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:26:15,191 INFO L225 Difference]: With dead ends: 1500 [2020-11-09 12:26:15,191 INFO L226 Difference]: Without dead ends: 1140 [2020-11-09 12:26:15,192 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:26:15,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2020-11-09 12:26:15,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1140. [2020-11-09 12:26:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1140 states. [2020-11-09 12:26:15,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 3518 transitions. [2020-11-09 12:26:15,234 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 3518 transitions. Word has length 17 [2020-11-09 12:26:15,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:26:15,235 INFO L481 AbstractCegarLoop]: Abstraction has 1140 states and 3518 transitions. [2020-11-09 12:26:15,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:26:15,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 3518 transitions. [2020-11-09 12:26:15,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 12:26:15,238 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:26:15,239 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:26:15,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 12:26:15,239 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:26:15,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:26:15,239 INFO L82 PathProgramCache]: Analyzing trace with hash -200781553, now seen corresponding path program 1 times [2020-11-09 12:26:15,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:26:15,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374843469] [2020-11-09 12:26:15,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:26:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:26:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:26:15,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374843469] [2020-11-09 12:26:15,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:26:15,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:26:15,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017315484] [2020-11-09 12:26:15,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:26:15,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:26:15,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:26:15,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:26:15,403 INFO L87 Difference]: Start difference. First operand 1140 states and 3518 transitions. Second operand 6 states. [2020-11-09 12:26:15,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:26:15,491 INFO L93 Difference]: Finished difference Result 1009 states and 3090 transitions. [2020-11-09 12:26:15,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:26:15,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-09 12:26:15,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:26:15,498 INFO L225 Difference]: With dead ends: 1009 [2020-11-09 12:26:15,499 INFO L226 Difference]: Without dead ends: 897 [2020-11-09 12:26:15,499 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:26:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2020-11-09 12:26:15,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 897. [2020-11-09 12:26:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2020-11-09 12:26:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 2789 transitions. [2020-11-09 12:26:15,537 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 2789 transitions. Word has length 20 [2020-11-09 12:26:15,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:26:15,537 INFO L481 AbstractCegarLoop]: Abstraction has 897 states and 2789 transitions. [2020-11-09 12:26:15,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:26:15,537 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 2789 transitions. [2020-11-09 12:26:15,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-09 12:26:15,541 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:26:15,541 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:26:15,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 12:26:15,541 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:26:15,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:26:15,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2072426737, now seen corresponding path program 1 times [2020-11-09 12:26:15,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:26:15,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996278470] [2020-11-09 12:26:15,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:26:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:26:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:26:15,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996278470] [2020-11-09 12:26:15,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:26:15,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:26:15,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898221876] [2020-11-09 12:26:15,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 12:26:15,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:26:15,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 12:26:15,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:26:15,600 INFO L87 Difference]: Start difference. First operand 897 states and 2789 transitions. Second operand 4 states. [2020-11-09 12:26:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:26:15,631 INFO L93 Difference]: Finished difference Result 1151 states and 3501 transitions. [2020-11-09 12:26:15,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 12:26:15,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-11-09 12:26:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:26:15,636 INFO L225 Difference]: With dead ends: 1151 [2020-11-09 12:26:15,637 INFO L226 Difference]: Without dead ends: 900 [2020-11-09 12:26:15,637 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:26:15,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2020-11-09 12:26:15,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 897. [2020-11-09 12:26:15,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2020-11-09 12:26:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 2712 transitions. [2020-11-09 12:26:15,671 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 2712 transitions. Word has length 23 [2020-11-09 12:26:15,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:26:15,672 INFO L481 AbstractCegarLoop]: Abstraction has 897 states and 2712 transitions. [2020-11-09 12:26:15,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 12:26:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 2712 transitions. [2020-11-09 12:26:15,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-09 12:26:15,675 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:26:15,675 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:26:15,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 12:26:15,675 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:26:15,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:26:15,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1622518969, now seen corresponding path program 2 times [2020-11-09 12:26:15,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:26:15,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811737888] [2020-11-09 12:26:15,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:26:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:26:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:26:15,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811737888] [2020-11-09 12:26:15,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:26:15,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 12:26:15,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413746795] [2020-11-09 12:26:15,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:26:15,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:26:15,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:26:15,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:26:15,766 INFO L87 Difference]: Start difference. First operand 897 states and 2712 transitions. Second operand 3 states. [2020-11-09 12:26:15,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:26:15,787 INFO L93 Difference]: Finished difference Result 1263 states and 3697 transitions. [2020-11-09 12:26:15,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:26:15,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-11-09 12:26:15,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:26:15,791 INFO L225 Difference]: With dead ends: 1263 [2020-11-09 12:26:15,793 INFO L226 Difference]: Without dead ends: 791 [2020-11-09 12:26:15,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:26:15,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2020-11-09 12:26:15,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 789. [2020-11-09 12:26:15,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-11-09 12:26:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2158 transitions. [2020-11-09 12:26:15,820 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2158 transitions. Word has length 23 [2020-11-09 12:26:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:26:15,820 INFO L481 AbstractCegarLoop]: Abstraction has 789 states and 2158 transitions. [2020-11-09 12:26:15,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:26:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2158 transitions. [2020-11-09 12:26:15,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-09 12:26:15,824 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:26:15,824 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:26:15,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 12:26:15,824 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:26:15,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:26:15,825 INFO L82 PathProgramCache]: Analyzing trace with hash -930263489, now seen corresponding path program 3 times [2020-11-09 12:26:15,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:26:15,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805678497] [2020-11-09 12:26:15,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:26:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:26:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:26:15,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805678497] [2020-11-09 12:26:15,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:26:16,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 12:26:16,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132523599] [2020-11-09 12:26:16,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 12:26:16,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:26:16,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 12:26:16,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:26:16,001 INFO L87 Difference]: Start difference. First operand 789 states and 2158 transitions. Second operand 7 states. [2020-11-09 12:26:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:26:16,081 INFO L93 Difference]: Finished difference Result 762 states and 2104 transitions. [2020-11-09 12:26:16,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:26:16,081 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-11-09 12:26:16,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:26:16,083 INFO L225 Difference]: With dead ends: 762 [2020-11-09 12:26:16,083 INFO L226 Difference]: Without dead ends: 214 [2020-11-09 12:26:16,083 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:26:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-11-09 12:26:16,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2020-11-09 12:26:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-11-09 12:26:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 543 transitions. [2020-11-09 12:26:16,091 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 543 transitions. Word has length 23 [2020-11-09 12:26:16,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:26:16,091 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 543 transitions. [2020-11-09 12:26:16,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 12:26:16,091 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 543 transitions. [2020-11-09 12:26:16,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-09 12:26:16,092 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:26:16,092 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:26:16,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 12:26:16,093 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:26:16,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:26:16,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1331134533, now seen corresponding path program 1 times [2020-11-09 12:26:16,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:26:16,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530617833] [2020-11-09 12:26:16,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:26:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:26:16,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:26:16,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530617833] [2020-11-09 12:26:16,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:26:16,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 12:26:16,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730084188] [2020-11-09 12:26:16,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:26:16,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:26:16,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:26:16,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:26:16,176 INFO L87 Difference]: Start difference. First operand 214 states and 543 transitions. Second operand 3 states. [2020-11-09 12:26:16,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:26:16,194 INFO L93 Difference]: Finished difference Result 330 states and 834 transitions. [2020-11-09 12:26:16,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:26:16,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-11-09 12:26:16,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:26:16,196 INFO L225 Difference]: With dead ends: 330 [2020-11-09 12:26:16,196 INFO L226 Difference]: Without dead ends: 138 [2020-11-09 12:26:16,197 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:26:16,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-11-09 12:26:16,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2020-11-09 12:26:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-11-09 12:26:16,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 323 transitions. [2020-11-09 12:26:16,202 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 323 transitions. Word has length 27 [2020-11-09 12:26:16,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:26:16,203 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 323 transitions. [2020-11-09 12:26:16,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:26:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 323 transitions. [2020-11-09 12:26:16,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-09 12:26:16,207 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:26:16,207 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:26:16,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 12:26:16,208 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:26:16,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:26:16,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2136042089, now seen corresponding path program 2 times [2020-11-09 12:26:16,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:26:16,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882238238] [2020-11-09 12:26:16,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:26:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:26:16,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:26:16,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882238238] [2020-11-09 12:26:16,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:26:16,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:26:16,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505828956] [2020-11-09 12:26:16,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 12:26:16,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:26:16,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 12:26:16,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:26:16,467 INFO L87 Difference]: Start difference. First operand 138 states and 323 transitions. Second operand 7 states. [2020-11-09 12:26:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:26:16,611 INFO L93 Difference]: Finished difference Result 164 states and 377 transitions. [2020-11-09 12:26:16,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:26:16,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-11-09 12:26:16,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:26:16,612 INFO L225 Difference]: With dead ends: 164 [2020-11-09 12:26:16,612 INFO L226 Difference]: Without dead ends: 80 [2020-11-09 12:26:16,613 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-09 12:26:16,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-11-09 12:26:16,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-11-09 12:26:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-09 12:26:16,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 157 transitions. [2020-11-09 12:26:16,616 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 157 transitions. Word has length 27 [2020-11-09 12:26:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:26:16,619 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 157 transitions. [2020-11-09 12:26:16,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 12:26:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 157 transitions. [2020-11-09 12:26:16,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-09 12:26:16,620 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:26:16,620 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:26:16,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 12:26:16,620 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:26:16,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:26:16,621 INFO L82 PathProgramCache]: Analyzing trace with hash -865695065, now seen corresponding path program 3 times [2020-11-09 12:26:16,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:26:16,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519976301] [2020-11-09 12:26:16,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:26:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 12:26:16,695 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 12:26:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 12:26:16,808 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 12:26:16,877 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 12:26:16,877 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 12:26:16,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 12:26:17,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:26:17 BasicIcfg [2020-11-09 12:26:17,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 12:26:17,050 INFO L168 Benchmark]: Toolchain (without parser) took 20855.47 ms. Allocated memory was 151.0 MB in the beginning and 345.0 MB in the end (delta: 194.0 MB). Free memory was 131.4 MB in the beginning and 223.3 MB in the end (delta: -91.9 MB). Peak memory consumption was 102.6 MB. Max. memory is 8.0 GB. [2020-11-09 12:26:17,050 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 151.0 MB. Free memory is still 123.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 12:26:17,051 INFO L168 Benchmark]: CACSL2BoogieTranslator took 878.15 ms. Allocated memory is still 151.0 MB. Free memory was 130.5 MB in the beginning and 112.5 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 8.0 GB. [2020-11-09 12:26:17,051 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.02 ms. Allocated memory is still 151.0 MB. Free memory was 112.5 MB in the beginning and 110.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 12:26:17,052 INFO L168 Benchmark]: Boogie Preprocessor took 96.52 ms. Allocated memory is still 151.0 MB. Free memory was 109.8 MB in the beginning and 107.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 12:26:17,053 INFO L168 Benchmark]: RCFGBuilder took 2475.58 ms. Allocated memory was 151.0 MB in the beginning and 191.9 MB in the end (delta: 40.9 MB). Free memory was 107.7 MB in the beginning and 78.5 MB in the end (delta: 29.2 MB). Peak memory consumption was 71.0 MB. Max. memory is 8.0 GB. [2020-11-09 12:26:17,058 INFO L168 Benchmark]: TraceAbstraction took 17323.42 ms. Allocated memory was 191.9 MB in the beginning and 345.0 MB in the end (delta: 153.1 MB). Free memory was 78.0 MB in the beginning and 223.3 MB in the end (delta: -145.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 8.0 GB. [2020-11-09 12:26:17,063 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 151.0 MB. Free memory is still 123.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 878.15 ms. Allocated memory is still 151.0 MB. Free memory was 130.5 MB in the beginning and 112.5 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 67.02 ms. Allocated memory is still 151.0 MB. Free memory was 112.5 MB in the beginning and 110.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 96.52 ms. Allocated memory is still 151.0 MB. Free memory was 109.8 MB in the beginning and 107.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2475.58 ms. Allocated memory was 151.0 MB in the beginning and 191.9 MB in the end (delta: 40.9 MB). Free memory was 107.7 MB in the beginning and 78.5 MB in the end (delta: 29.2 MB). Peak memory consumption was 71.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 17323.42 ms. Allocated memory was 191.9 MB in the beginning and 345.0 MB in the end (delta: 153.1 MB). Free memory was 78.0 MB in the beginning and 223.3 MB in the end (delta: -145.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1898 VarBasedMoverChecksPositive, 116 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 96 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.6s, 224 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 12.4s, 131 PlacesBefore, 46 PlacesAfterwards, 121 TransitionsBefore, 33 TransitionsAfterwards, 2862 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 102 TotalNumberOfCompositions, 7701 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L859] 0 pthread_t t605; [L860] FCALL, FORK 0 pthread_create(&t605, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L861] 0 pthread_t t606; [L862] FCALL, FORK 0 pthread_create(&t606, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L863] 0 pthread_t t607; [L864] FCALL, FORK 0 pthread_create(&t607, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L865] 0 pthread_t t608; [L798] 3 y$w_buff1 = y$w_buff0 [L799] 3 y$w_buff0 = 1 [L800] 3 y$w_buff1_used = y$w_buff0_used [L801] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L803] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L804] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L805] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L806] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L807] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L808] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L866] FCALL, FORK 0 pthread_create(&t608, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L828] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L831] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L834] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L837] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L837] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L838] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L839] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L840] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L841] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L841] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L755] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L770] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 y$flush_delayed = weak$$choice2 [L776] 2 y$mem_tmp = y [L777] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L778] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L779] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L780] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L781] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L783] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = y [L785] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L785] 2 y = y$flush_delayed ? y$mem_tmp : y [L786] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L818] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L818] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L872] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L872] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L872] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L872] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L873] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L874] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L874] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L875] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L876] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L876] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix023_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.7s, HoareTripleCheckerStatistics: 421 SDtfs, 467 SDslu, 593 SDs, 0 SdLazy, 196 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 15028 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...