/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:25:14,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:25:14,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:25:14,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:25:14,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:25:14,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:25:14,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:25:14,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:25:14,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:25:14,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:25:14,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:25:14,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:25:14,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:25:14,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:25:14,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:25:14,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:25:14,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:25:14,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:25:14,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:25:14,505 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:25:14,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:25:14,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:25:14,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:25:14,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:25:14,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:25:14,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:25:14,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:25:14,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:25:14,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:25:14,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:25:14,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:25:14,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:25:14,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:25:14,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:25:14,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:25:14,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:25:14,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:25:14,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:25:14,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:25:14,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:25:14,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:25:14,532 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:25:14,566 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:25:14,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:25:14,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:25:14,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:25:14,571 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:25:14,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:25:14,572 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:25:14,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:25:14,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:25:14,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:25:14,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:25:14,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:25:14,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:25:14,573 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:25:14,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:25:14,573 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:25:14,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:25:14,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:25:14,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:25:14,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:25:14,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:25:14,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:25:14,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:25:14,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:25:14,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:25:14,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:25:14,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:25:14,578 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:25:14,578 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:25:14,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:25:14,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:25:14,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:25:14,879 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:25:14,879 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:25:14,880 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_pso.opt.i [2019-12-27 02:25:14,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f056aa9/95b3847aef52423fa15c721b2b753f97/FLAGcc425e56f [2019-12-27 02:25:15,512 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:25:15,513 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_pso.opt.i [2019-12-27 02:25:15,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f056aa9/95b3847aef52423fa15c721b2b753f97/FLAGcc425e56f [2019-12-27 02:25:15,785 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f056aa9/95b3847aef52423fa15c721b2b753f97 [2019-12-27 02:25:15,795 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:25:15,796 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:25:15,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:25:15,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:25:15,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:25:15,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:25:15" (1/1) ... [2019-12-27 02:25:15,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0780ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:15, skipping insertion in model container [2019-12-27 02:25:15,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:25:15" (1/1) ... [2019-12-27 02:25:15,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:25:15,858 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:25:16,396 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:25:16,409 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:25:16,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:25:16,549 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:25:16,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:16 WrapperNode [2019-12-27 02:25:16,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:25:16,551 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:25:16,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:25:16,551 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:25:16,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:16" (1/1) ... [2019-12-27 02:25:16,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:16" (1/1) ... [2019-12-27 02:25:16,621 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:25:16,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:25:16,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:25:16,622 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:25:16,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:16" (1/1) ... [2019-12-27 02:25:16,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:16" (1/1) ... [2019-12-27 02:25:16,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:16" (1/1) ... [2019-12-27 02:25:16,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:16" (1/1) ... [2019-12-27 02:25:16,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:16" (1/1) ... [2019-12-27 02:25:16,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:16" (1/1) ... [2019-12-27 02:25:16,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:16" (1/1) ... [2019-12-27 02:25:16,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:25:16,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:25:16,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:25:16,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:25:16,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:16" (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 [2019-12-27 02:25:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:25:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:25:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:25:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:25:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:25:16,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:25:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:25:16,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:25:16,745 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:25:16,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:25:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:25:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:25:16,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:25:16,748 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:25:17,449 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:25:17,449 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:25:17,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:25:17 BoogieIcfgContainer [2019-12-27 02:25:17,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:25:17,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:25:17,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:25:17,457 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:25:17,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:25:15" (1/3) ... [2019-12-27 02:25:17,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb153e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:25:17, skipping insertion in model container [2019-12-27 02:25:17,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:16" (2/3) ... [2019-12-27 02:25:17,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb153e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:25:17, skipping insertion in model container [2019-12-27 02:25:17,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:25:17" (3/3) ... [2019-12-27 02:25:17,465 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_pso.opt.i [2019-12-27 02:25:17,476 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:25:17,476 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:25:17,483 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:25:17,484 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:25:17,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,521 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,521 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,524 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,525 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,549 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,549 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,549 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,550 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,550 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,576 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,576 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,582 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,585 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,590 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,591 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,592 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:17,610 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:25:17,633 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:25:17,633 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:25:17,634 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:25:17,634 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:25:17,634 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:25:17,634 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:25:17,634 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:25:17,634 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:25:17,659 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 178 transitions [2019-12-27 02:25:17,661 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 178 transitions [2019-12-27 02:25:17,763 INFO L132 PetriNetUnfolder]: 35/175 cut-off events. [2019-12-27 02:25:17,763 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:25:17,776 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 35/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 02:25:17,794 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 178 transitions [2019-12-27 02:25:17,840 INFO L132 PetriNetUnfolder]: 35/175 cut-off events. [2019-12-27 02:25:17,840 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:25:17,846 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 35/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 02:25:17,861 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-27 02:25:17,862 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:25:22,406 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 02:25:22,579 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 02:25:22,648 INFO L206 etLargeBlockEncoding]: Checked pairs total: 41572 [2019-12-27 02:25:22,648 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 02:25:22,653 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 80 transitions [2019-12-27 02:25:23,888 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13626 states. [2019-12-27 02:25:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 13626 states. [2019-12-27 02:25:23,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 02:25:23,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:25:23,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:25:23,900 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:25:23,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:25:23,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1504632550, now seen corresponding path program 1 times [2019-12-27 02:25:23,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:25:23,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608353757] [2019-12-27 02:25:23,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:25:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:25:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:25:24,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608353757] [2019-12-27 02:25:24,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:25:24,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:25:24,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852523031] [2019-12-27 02:25:24,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:25:24,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:25:24,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:25:24,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:25:24,290 INFO L87 Difference]: Start difference. First operand 13626 states. Second operand 3 states. [2019-12-27 02:25:24,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:25:24,734 INFO L93 Difference]: Finished difference Result 13322 states and 50870 transitions. [2019-12-27 02:25:24,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:25:24,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 02:25:24,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:25:24,864 INFO L225 Difference]: With dead ends: 13322 [2019-12-27 02:25:24,864 INFO L226 Difference]: Without dead ends: 12542 [2019-12-27 02:25:24,866 INFO L631 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 [2019-12-27 02:25:25,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12542 states. [2019-12-27 02:25:25,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12542 to 12542. [2019-12-27 02:25:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12542 states. [2019-12-27 02:25:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12542 states to 12542 states and 47820 transitions. [2019-12-27 02:25:25,638 INFO L78 Accepts]: Start accepts. Automaton has 12542 states and 47820 transitions. Word has length 7 [2019-12-27 02:25:25,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:25:25,640 INFO L462 AbstractCegarLoop]: Abstraction has 12542 states and 47820 transitions. [2019-12-27 02:25:25,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:25:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 12542 states and 47820 transitions. [2019-12-27 02:25:25,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:25:25,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:25:25,653 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:25:25,653 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:25:25,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:25:25,654 INFO L82 PathProgramCache]: Analyzing trace with hash 696666680, now seen corresponding path program 1 times [2019-12-27 02:25:25,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:25:25,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387251644] [2019-12-27 02:25:25,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:25:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:25:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:25:25,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387251644] [2019-12-27 02:25:25,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:25:25,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:25:25,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800275776] [2019-12-27 02:25:25,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:25:25,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:25:25,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:25:25,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:25:25,756 INFO L87 Difference]: Start difference. First operand 12542 states and 47820 transitions. Second operand 3 states. [2019-12-27 02:25:25,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:25:25,838 INFO L93 Difference]: Finished difference Result 7513 states and 25047 transitions. [2019-12-27 02:25:25,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:25:25,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:25:25,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:25:25,882 INFO L225 Difference]: With dead ends: 7513 [2019-12-27 02:25:25,882 INFO L226 Difference]: Without dead ends: 7513 [2019-12-27 02:25:25,886 INFO L631 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 [2019-12-27 02:25:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7513 states. [2019-12-27 02:25:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7513 to 7513. [2019-12-27 02:25:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7513 states. [2019-12-27 02:25:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7513 states to 7513 states and 25047 transitions. [2019-12-27 02:25:26,125 INFO L78 Accepts]: Start accepts. Automaton has 7513 states and 25047 transitions. Word has length 13 [2019-12-27 02:25:26,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:25:26,126 INFO L462 AbstractCegarLoop]: Abstraction has 7513 states and 25047 transitions. [2019-12-27 02:25:26,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:25:26,126 INFO L276 IsEmpty]: Start isEmpty. Operand 7513 states and 25047 transitions. [2019-12-27 02:25:26,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:25:26,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:25:26,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:25:26,128 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:25:26,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:25:26,128 INFO L82 PathProgramCache]: Analyzing trace with hash 361138653, now seen corresponding path program 1 times [2019-12-27 02:25:26,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:25:26,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414100912] [2019-12-27 02:25:26,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:25:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:25:26,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:25:26,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414100912] [2019-12-27 02:25:26,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:25:26,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:25:26,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199746474] [2019-12-27 02:25:26,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:25:26,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:25:26,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:25:26,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:25:26,199 INFO L87 Difference]: Start difference. First operand 7513 states and 25047 transitions. Second operand 4 states. [2019-12-27 02:25:26,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:25:26,241 INFO L93 Difference]: Finished difference Result 1752 states and 4700 transitions. [2019-12-27 02:25:26,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:25:26,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 02:25:26,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:25:26,248 INFO L225 Difference]: With dead ends: 1752 [2019-12-27 02:25:26,248 INFO L226 Difference]: Without dead ends: 1752 [2019-12-27 02:25:26,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:25:26,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2019-12-27 02:25:26,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2019-12-27 02:25:26,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2019-12-27 02:25:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 4700 transitions. [2019-12-27 02:25:26,835 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 4700 transitions. Word has length 14 [2019-12-27 02:25:26,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:25:26,836 INFO L462 AbstractCegarLoop]: Abstraction has 1752 states and 4700 transitions. [2019-12-27 02:25:26,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:25:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 4700 transitions. [2019-12-27 02:25:26,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:25:26,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:25:26,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:25:26,838 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:25:26,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:25:26,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1273661692, now seen corresponding path program 1 times [2019-12-27 02:25:26,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:25:26,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781083031] [2019-12-27 02:25:26,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:25:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:25:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:25:26,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781083031] [2019-12-27 02:25:26,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:25:26,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:25:26,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010126542] [2019-12-27 02:25:26,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:25:26,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:25:26,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:25:26,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:25:26,924 INFO L87 Difference]: Start difference. First operand 1752 states and 4700 transitions. Second operand 4 states. [2019-12-27 02:25:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:25:27,084 INFO L93 Difference]: Finished difference Result 2319 states and 6117 transitions. [2019-12-27 02:25:27,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:25:27,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 02:25:27,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:25:27,093 INFO L225 Difference]: With dead ends: 2319 [2019-12-27 02:25:27,094 INFO L226 Difference]: Without dead ends: 2319 [2019-12-27 02:25:27,094 INFO L631 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 [2019-12-27 02:25:27,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2019-12-27 02:25:27,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2159. [2019-12-27 02:25:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2159 states. [2019-12-27 02:25:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 5759 transitions. [2019-12-27 02:25:27,164 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 5759 transitions. Word has length 16 [2019-12-27 02:25:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:25:27,164 INFO L462 AbstractCegarLoop]: Abstraction has 2159 states and 5759 transitions. [2019-12-27 02:25:27,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:25:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 5759 transitions. [2019-12-27 02:25:27,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 02:25:27,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:25:27,171 INFO L411 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, 1, 1] [2019-12-27 02:25:27,171 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:25:27,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:25:27,172 INFO L82 PathProgramCache]: Analyzing trace with hash -164246467, now seen corresponding path program 1 times [2019-12-27 02:25:27,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:25:27,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673353557] [2019-12-27 02:25:27,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:25:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:25:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:25:27,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673353557] [2019-12-27 02:25:27,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:25:27,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:25:27,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66137588] [2019-12-27 02:25:27,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:25:27,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:25:27,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:25:27,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:25:27,244 INFO L87 Difference]: Start difference. First operand 2159 states and 5759 transitions. Second operand 5 states. [2019-12-27 02:25:27,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:25:27,280 INFO L93 Difference]: Finished difference Result 1278 states and 3496 transitions. [2019-12-27 02:25:27,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:25:27,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 02:25:27,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:25:27,285 INFO L225 Difference]: With dead ends: 1278 [2019-12-27 02:25:27,285 INFO L226 Difference]: Without dead ends: 1278 [2019-12-27 02:25:27,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:25:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2019-12-27 02:25:27,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1218. [2019-12-27 02:25:27,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-12-27 02:25:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 3346 transitions. [2019-12-27 02:25:27,316 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 3346 transitions. Word has length 29 [2019-12-27 02:25:27,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:25:27,317 INFO L462 AbstractCegarLoop]: Abstraction has 1218 states and 3346 transitions. [2019-12-27 02:25:27,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:25:27,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 3346 transitions. [2019-12-27 02:25:27,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 02:25:27,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:25:27,321 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:25:27,321 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:25:27,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:25:27,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1707006173, now seen corresponding path program 1 times [2019-12-27 02:25:27,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:25:27,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302923819] [2019-12-27 02:25:27,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:25:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:25:27,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:25:27,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302923819] [2019-12-27 02:25:27,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:25:27,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:25:27,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170679675] [2019-12-27 02:25:27,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:25:27,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:25:27,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:25:27,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:25:27,437 INFO L87 Difference]: Start difference. First operand 1218 states and 3346 transitions. Second operand 3 states. [2019-12-27 02:25:27,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:25:27,452 INFO L93 Difference]: Finished difference Result 1820 states and 4707 transitions. [2019-12-27 02:25:27,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:25:27,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 02:25:27,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:25:27,455 INFO L225 Difference]: With dead ends: 1820 [2019-12-27 02:25:27,455 INFO L226 Difference]: Without dead ends: 642 [2019-12-27 02:25:27,455 INFO L631 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 [2019-12-27 02:25:27,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-12-27 02:25:27,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-12-27 02:25:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-27 02:25:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1436 transitions. [2019-12-27 02:25:27,469 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1436 transitions. Word has length 44 [2019-12-27 02:25:27,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:25:27,469 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 1436 transitions. [2019-12-27 02:25:27,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:25:27,469 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1436 transitions. [2019-12-27 02:25:27,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 02:25:27,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:25:27,472 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:25:27,472 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:25:27,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:25:27,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1883792513, now seen corresponding path program 2 times [2019-12-27 02:25:27,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:25:27,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137993746] [2019-12-27 02:25:27,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:25:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:25:27,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:25:27,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137993746] [2019-12-27 02:25:27,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:25:27,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:25:27,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544661801] [2019-12-27 02:25:27,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:25:27,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:25:27,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:25:27,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:25:27,579 INFO L87 Difference]: Start difference. First operand 642 states and 1436 transitions. Second operand 6 states. [2019-12-27 02:25:27,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:25:27,834 INFO L93 Difference]: Finished difference Result 1644 states and 3615 transitions. [2019-12-27 02:25:27,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:25:27,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-12-27 02:25:27,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:25:27,838 INFO L225 Difference]: With dead ends: 1644 [2019-12-27 02:25:27,838 INFO L226 Difference]: Without dead ends: 1110 [2019-12-27 02:25:27,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:25:27,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2019-12-27 02:25:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 699. [2019-12-27 02:25:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-12-27 02:25:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1564 transitions. [2019-12-27 02:25:27,858 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1564 transitions. Word has length 44 [2019-12-27 02:25:27,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:25:27,858 INFO L462 AbstractCegarLoop]: Abstraction has 699 states and 1564 transitions. [2019-12-27 02:25:27,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:25:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1564 transitions. [2019-12-27 02:25:27,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 02:25:27,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:25:27,861 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:25:27,861 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:25:27,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:25:27,861 INFO L82 PathProgramCache]: Analyzing trace with hash 170447017, now seen corresponding path program 3 times [2019-12-27 02:25:27,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:25:27,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961139318] [2019-12-27 02:25:27,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:25:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:25:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:25:28,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961139318] [2019-12-27 02:25:28,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:25:28,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:25:28,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596267502] [2019-12-27 02:25:28,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:25:28,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:25:28,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:25:28,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:25:28,094 INFO L87 Difference]: Start difference. First operand 699 states and 1564 transitions. Second operand 9 states. [2019-12-27 02:25:29,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:25:29,414 INFO L93 Difference]: Finished difference Result 1586 states and 3398 transitions. [2019-12-27 02:25:29,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:25:29,415 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2019-12-27 02:25:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:25:29,420 INFO L225 Difference]: With dead ends: 1586 [2019-12-27 02:25:29,420 INFO L226 Difference]: Without dead ends: 1586 [2019-12-27 02:25:29,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-27 02:25:29,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2019-12-27 02:25:29,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 889. [2019-12-27 02:25:29,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-12-27 02:25:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1963 transitions. [2019-12-27 02:25:29,446 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1963 transitions. Word has length 44 [2019-12-27 02:25:29,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:25:29,446 INFO L462 AbstractCegarLoop]: Abstraction has 889 states and 1963 transitions. [2019-12-27 02:25:29,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:25:29,447 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1963 transitions. [2019-12-27 02:25:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 02:25:29,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:25:29,449 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:25:29,450 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:25:29,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:25:29,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1420662497, now seen corresponding path program 4 times [2019-12-27 02:25:29,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:25:29,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387722221] [2019-12-27 02:25:29,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:25:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:25:29,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:25:29,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387722221] [2019-12-27 02:25:29,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:25:29,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:25:29,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466927508] [2019-12-27 02:25:29,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:25:29,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:25:29,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:25:29,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:25:29,598 INFO L87 Difference]: Start difference. First operand 889 states and 1963 transitions. Second operand 7 states. [2019-12-27 02:25:30,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:25:30,601 INFO L93 Difference]: Finished difference Result 2234 states and 4915 transitions. [2019-12-27 02:25:30,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 02:25:30,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-27 02:25:30,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:25:30,608 INFO L225 Difference]: With dead ends: 2234 [2019-12-27 02:25:30,609 INFO L226 Difference]: Without dead ends: 2203 [2019-12-27 02:25:30,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-12-27 02:25:30,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2019-12-27 02:25:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 1119. [2019-12-27 02:25:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2019-12-27 02:25:30,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 2576 transitions. [2019-12-27 02:25:30,663 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 2576 transitions. Word has length 44 [2019-12-27 02:25:30,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:25:30,665 INFO L462 AbstractCegarLoop]: Abstraction has 1119 states and 2576 transitions. [2019-12-27 02:25:30,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:25:30,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 2576 transitions. [2019-12-27 02:25:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 02:25:30,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:25:30,671 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:25:30,671 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:25:30,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:25:30,672 INFO L82 PathProgramCache]: Analyzing trace with hash -115488353, now seen corresponding path program 5 times [2019-12-27 02:25:30,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:25:30,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208182724] [2019-12-27 02:25:30,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:25:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:25:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:25:30,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208182724] [2019-12-27 02:25:30,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:25:30,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:25:30,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026446594] [2019-12-27 02:25:30,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:25:30,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:25:30,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:25:30,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:25:30,802 INFO L87 Difference]: Start difference. First operand 1119 states and 2576 transitions. Second operand 3 states. [2019-12-27 02:25:30,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:25:30,818 INFO L93 Difference]: Finished difference Result 1117 states and 2571 transitions. [2019-12-27 02:25:30,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:25:30,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 02:25:30,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:25:30,821 INFO L225 Difference]: With dead ends: 1117 [2019-12-27 02:25:30,821 INFO L226 Difference]: Without dead ends: 1117 [2019-12-27 02:25:30,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:25:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2019-12-27 02:25:30,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 985. [2019-12-27 02:25:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2019-12-27 02:25:30,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 2302 transitions. [2019-12-27 02:25:30,859 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 2302 transitions. Word has length 44 [2019-12-27 02:25:30,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:25:30,860 INFO L462 AbstractCegarLoop]: Abstraction has 985 states and 2302 transitions. [2019-12-27 02:25:30,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:25:30,860 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 2302 transitions. [2019-12-27 02:25:30,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 02:25:30,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:25:30,864 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:25:30,865 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:25:30,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:25:30,865 INFO L82 PathProgramCache]: Analyzing trace with hash 359561549, now seen corresponding path program 1 times [2019-12-27 02:25:30,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:25:30,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391256596] [2019-12-27 02:25:30,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:25:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:25:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:25:31,082 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:25:31,083 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:25:31,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (and (= v_~x~0_55 0) (= 0 v_~weak$$choice0~0_10) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~a~0_52 0) (= 0 v_~y$r_buff1_thd3~0_90) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p2_EAX~0_69) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd0~0_102 0) (= 0 v_~y$w_buff0~0_155) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1010~0.base_32| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1010~0.base_32|) |v_ULTIMATE.start_main_~#t1010~0.offset_22| 0))) (< 0 |v_#StackHeapBarrier_16|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1010~0.base_32| 4)) (= v_~__unbuffered_cnt~0_107 0) (= 0 v_~y$r_buff1_thd2~0_171) (= v_~y$r_buff0_thd1~0_39 0) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~y$r_buff0_thd2~0_208) (= 0 v_~y$flush_delayed~0_44) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$mem_tmp~0_17 0) (= 0 v_~y$r_buff1_thd1~0_40) (= 0 |v_#NULL.base_7|) (= v_~__unbuffered_p2_EBX~0_69 0) (= v_~y$w_buff1~0_114 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1010~0.base_32|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1010~0.base_32|) 0) (= v_~y$w_buff1_used~0_265 0) (= v_~y$r_buff0_thd0~0_92 0) (= v_~y~0_129 0) (= v_~y$w_buff0_used~0_415 0) (= 0 |v_ULTIMATE.start_main_~#t1010~0.offset_22|) (= 0 v_~y$r_buff0_thd3~0_133) (= |v_#valid_68| (store .cse0 |v_ULTIMATE.start_main_~#t1010~0.base_32| 1)) (= 0 v_~__unbuffered_p1_EAX~0_73) (= 0 v_~weak$$choice2~0_85) (= v_~z~0_39 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_17|, ULTIMATE.start_main_~#t1010~0.offset=|v_ULTIMATE.start_main_~#t1010~0.offset_22|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1011~0.base=|v_ULTIMATE.start_main_~#t1011~0.base_33|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_52, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_90, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_39, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_69, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_69, ULTIMATE.start_main_~#t1010~0.base=|v_ULTIMATE.start_main_~#t1010~0.base_32|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_55|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_76|, ~y$w_buff1~0=v_~y$w_buff1~0_114, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_102, ~x~0=v_~x~0_55, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_415, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_155, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_133, ULTIMATE.start_main_~#t1012~0.base=|v_ULTIMATE.start_main_~#t1012~0.base_26|, ~y~0=v_~y~0_129, ULTIMATE.start_main_~#t1012~0.offset=|v_ULTIMATE.start_main_~#t1012~0.offset_15|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_121|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_171, ULTIMATE.start_main_~#t1011~0.offset=|v_ULTIMATE.start_main_~#t1011~0.offset_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_92, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_39, ~weak$$choice2~0=v_~weak$$choice2~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1010~0.offset, #NULL.offset, ULTIMATE.start_main_~#t1011~0.base, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t1010~0.base, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t1012~0.base, ~y~0, ULTIMATE.start_main_~#t1012~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1011~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 02:25:31,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-1-->L822: Formula: (and (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1011~0.base_11| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1011~0.base_11| 4)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1011~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1011~0.base_11|) |v_ULTIMATE.start_main_~#t1011~0.offset_9| 1)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t1011~0.offset_9| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1011~0.base_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1011~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t1011~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1011~0.offset=|v_ULTIMATE.start_main_~#t1011~0.offset_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1011~0.base=|v_ULTIMATE.start_main_~#t1011~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1011~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1011~0.base] because there is no mapped edge [2019-12-27 02:25:31,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L822-1-->L824: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1012~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1012~0.base_10|)) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1012~0.base_10|) 0) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1012~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1012~0.base_10|) |v_ULTIMATE.start_main_~#t1012~0.offset_8| 2))) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1012~0.base_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1012~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t1012~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1012~0.offset=|v_ULTIMATE.start_main_~#t1012~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, ULTIMATE.start_main_~#t1012~0.base=|v_ULTIMATE.start_main_~#t1012~0.base_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1012~0.offset, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1012~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 02:25:31,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L4-->L797: Formula: (and (= ~z~0_Out1534649724 ~__unbuffered_p2_EAX~0_Out1534649724) (not (= P2Thread1of1ForFork2___VERIFIER_assert_~expression_In1534649724 0)) (= ~y$r_buff1_thd1~0_Out1534649724 ~y$r_buff0_thd1~0_In1534649724) (= ~y$r_buff0_thd0~0_In1534649724 ~y$r_buff1_thd0~0_Out1534649724) (= ~z~0_Out1534649724 1) (= ~y$r_buff0_thd3~0_Out1534649724 1) (= ~y$r_buff0_thd3~0_In1534649724 ~y$r_buff1_thd3~0_Out1534649724) (= ~a~0_In1534649724 ~__unbuffered_p2_EBX~0_Out1534649724) (= ~y$r_buff1_thd2~0_Out1534649724 ~y$r_buff0_thd2~0_In1534649724)) InVars {~a~0=~a~0_In1534649724, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1534649724, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1534649724, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1534649724, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1534649724, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In1534649724} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out1534649724, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In1534649724, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1534649724, ~a~0=~a~0_In1534649724, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1534649724, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out1534649724, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1534649724, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1534649724, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1534649724, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1534649724, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out1534649724, ~z~0=~z~0_Out1534649724, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1534649724} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 02:25:31,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_24 1) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.base_11| 0) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= 0 |v_P0Thread1of1ForFork0_#res.offset_11|) (= v_~x~0_27 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~a~0=v_~a~0_24, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_11|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, ~x~0=v_~x~0_27, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 02:25:31,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L756-->L756-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-735221509 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite8_In-735221509| |P1Thread1of1ForFork1_#t~ite8_Out-735221509|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out-735221509| ~y$w_buff0~0_In-735221509)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-735221509 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-735221509 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-735221509 256))) (and (= (mod ~y$w_buff1_used~0_In-735221509 256) 0) .cse1))) (= ~y$w_buff0~0_In-735221509 |P1Thread1of1ForFork1_#t~ite8_Out-735221509|) .cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out-735221509| |P1Thread1of1ForFork1_#t~ite8_Out-735221509|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-735221509, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-735221509, ~y$w_buff0~0=~y$w_buff0~0_In-735221509, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-735221509, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-735221509|, ~weak$$choice2~0=~weak$$choice2~0_In-735221509, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-735221509} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-735221509, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-735221509, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-735221509|, ~y$w_buff0~0=~y$w_buff0~0_In-735221509, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-735221509, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-735221509|, ~weak$$choice2~0=~weak$$choice2~0_In-735221509, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-735221509} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 02:25:31,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L757-->L757-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1390330914 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_In1390330914| |P1Thread1of1ForFork1_#t~ite11_Out1390330914|) (= |P1Thread1of1ForFork1_#t~ite12_Out1390330914| ~y$w_buff1~0_In1390330914)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1390330914 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1390330914 256)) (and (= (mod ~y$r_buff1_thd2~0_In1390330914 256) 0) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In1390330914 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite11_Out1390330914| ~y$w_buff1~0_In1390330914) (= |P1Thread1of1ForFork1_#t~ite11_Out1390330914| |P1Thread1of1ForFork1_#t~ite12_Out1390330914|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1390330914, ~y$w_buff1~0=~y$w_buff1~0_In1390330914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1390330914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1390330914, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In1390330914|, ~weak$$choice2~0=~weak$$choice2~0_In1390330914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1390330914} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1390330914, ~y$w_buff1~0=~y$w_buff1~0_In1390330914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1390330914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1390330914, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1390330914|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1390330914|, ~weak$$choice2~0=~weak$$choice2~0_In1390330914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1390330914} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 02:25:31,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L758-->L758-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1690044172 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out1690044172| |P1Thread1of1ForFork1_#t~ite14_Out1690044172|) (= ~y$w_buff0_used~0_In1690044172 |P1Thread1of1ForFork1_#t~ite14_Out1690044172|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1690044172 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In1690044172 256)) .cse0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In1690044172 256))) (= (mod ~y$w_buff0_used~0_In1690044172 256) 0))) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In1690044172| |P1Thread1of1ForFork1_#t~ite14_Out1690044172|) (= |P1Thread1of1ForFork1_#t~ite15_Out1690044172| ~y$w_buff0_used~0_In1690044172)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1690044172, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1690044172, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1690044172, ~weak$$choice2~0=~weak$$choice2~0_In1690044172, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1690044172|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1690044172} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1690044172, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1690044172, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1690044172, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1690044172|, ~weak$$choice2~0=~weak$$choice2~0_In1690044172, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1690044172|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1690044172} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 02:25:31,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_35 256) 0)) (= v_~y$r_buff0_thd2~0_104 v_~y$r_buff0_thd2~0_103)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_15|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_12|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 02:25:31,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L763-->L771: Formula: (and (= 0 v_~y$flush_delayed~0_14) (= v_~y~0_36 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (not (= 0 (mod v_~y$flush_delayed~0_15 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, ~y~0=v_~y~0_36, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_19|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 02:25:31,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1334458598 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1334458598 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out1334458598|) (not .cse1)) (and (= ~y$w_buff0_used~0_In1334458598 |P2Thread1of1ForFork2_#t~ite28_Out1334458598|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1334458598, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1334458598} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1334458598, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1334458598, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1334458598|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 02:25:31,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In-1095764847 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1095764847 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1095764847 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1095764847 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite29_Out-1095764847| 0)) (and (= ~y$w_buff1_used~0_In-1095764847 |P2Thread1of1ForFork2_#t~ite29_Out-1095764847|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1095764847, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1095764847, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1095764847, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1095764847} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1095764847, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1095764847, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1095764847, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1095764847|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1095764847} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 02:25:31,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L800-->L801: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1361319255 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1361319255 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1361319255 ~y$r_buff0_thd3~0_Out-1361319255)) (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-1361319255)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1361319255, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1361319255} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1361319255, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1361319255|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1361319255} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 02:25:31,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In159824874 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In159824874 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In159824874 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In159824874 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In159824874 |P2Thread1of1ForFork2_#t~ite31_Out159824874|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out159824874|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In159824874, ~y$w_buff0_used~0=~y$w_buff0_used~0_In159824874, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In159824874, ~y$w_buff1_used~0=~y$w_buff1_used~0_In159824874} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In159824874, ~y$w_buff0_used~0=~y$w_buff0_used~0_In159824874, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out159824874|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In159824874, ~y$w_buff1_used~0=~y$w_buff1_used~0_In159824874} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 02:25:31,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_32| v_~y$r_buff1_thd3~0_47)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_31|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 02:25:31,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:25:31,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L830-2-->L830-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1368177560 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1368177560 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out-1368177560| ~y$w_buff1~0_In-1368177560) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite35_Out-1368177560| ~y~0_In-1368177560)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1368177560, ~y~0=~y~0_In-1368177560, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1368177560, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1368177560} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1368177560, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1368177560|, ~y~0=~y~0_In-1368177560, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1368177560, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1368177560} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-27 02:25:31,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L830-4-->L831: Formula: (= v_~y~0_23 |v_ULTIMATE.start_main_#t~ite35_11|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~y~0=v_~y~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-27 02:25:31,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-544619991 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-544619991 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_Out-544619991| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-544619991 |ULTIMATE.start_main_#t~ite37_Out-544619991|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-544619991, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-544619991} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-544619991, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-544619991, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-544619991|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 02:25:31,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1808828244 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1808828244 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1808828244 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1808828244 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1808828244| ~y$w_buff1_used~0_In1808828244) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite38_Out1808828244| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1808828244, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1808828244, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1808828244, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1808828244} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1808828244, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1808828244, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1808828244|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1808828244, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1808828244} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 02:25:31,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-955807034 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-955807034 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-955807034 |ULTIMATE.start_main_#t~ite39_Out-955807034|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite39_Out-955807034|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-955807034, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-955807034} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-955807034, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-955807034|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-955807034} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 02:25:31,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In665926914 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In665926914 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In665926914 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In665926914 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out665926914| ~y$r_buff1_thd0~0_In665926914) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite40_Out665926914|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In665926914, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In665926914, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In665926914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In665926914} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out665926914|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In665926914, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In665926914, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In665926914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In665926914} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 02:25:31,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= v_~__unbuffered_p2_EBX~0_41 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= 0 v_~__unbuffered_p1_EAX~0_44) (= |v_ULTIMATE.start_main_#t~ite40_43| v_~y$r_buff1_thd0~0_72) (= 1 v_~__unbuffered_p2_EAX~0_41) (= v_~x~0_34 2)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:25:31,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:25:31 BasicIcfg [2019-12-27 02:25:31,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:25:31,241 INFO L168 Benchmark]: Toolchain (without parser) took 15444.37 ms. Allocated memory was 145.8 MB in the beginning and 554.7 MB in the end (delta: 408.9 MB). Free memory was 100.7 MB in the beginning and 401.0 MB in the end (delta: -300.3 MB). Peak memory consumption was 108.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:25:31,242 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 145.8 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 02:25:31,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.62 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 156.2 MB in the end (delta: -55.9 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. [2019-12-27 02:25:31,247 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.05 ms. Allocated memory is still 203.4 MB. Free memory was 156.2 MB in the beginning and 154.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:25:31,248 INFO L168 Benchmark]: Boogie Preprocessor took 47.96 ms. Allocated memory is still 203.4 MB. Free memory was 154.3 MB in the beginning and 151.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:25:31,250 INFO L168 Benchmark]: RCFGBuilder took 781.49 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 108.2 MB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. [2019-12-27 02:25:31,252 INFO L168 Benchmark]: TraceAbstraction took 13786.43 ms. Allocated memory was 203.4 MB in the beginning and 554.7 MB in the end (delta: 351.3 MB). Free memory was 108.2 MB in the beginning and 401.0 MB in the end (delta: -292.9 MB). Peak memory consumption was 58.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:25:31,259 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 145.8 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 753.62 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 156.2 MB in the end (delta: -55.9 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.05 ms. Allocated memory is still 203.4 MB. Free memory was 156.2 MB in the beginning and 154.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.96 ms. Allocated memory is still 203.4 MB. Free memory was 154.3 MB in the beginning and 151.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 781.49 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 108.2 MB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13786.43 ms. Allocated memory was 203.4 MB in the beginning and 554.7 MB in the end (delta: 351.3 MB). Free memory was 108.2 MB in the beginning and 401.0 MB in the end (delta: -292.9 MB). Peak memory consumption was 58.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 153 ProgramPointsBefore, 73 ProgramPointsAfterwards, 178 TransitionsBefore, 80 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 22 ChoiceCompositions, 4873 VarBasedMoverChecksPositive, 141 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 158 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 41572 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1010, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L822] FCALL, FORK 0 pthread_create(&t1011, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L824] FCALL, FORK 0 pthread_create(&t1012, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 1 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L797] 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) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L748] 2 x = 2 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L755] 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) VAL [!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)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L755] 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) [L756] 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)) [L757] 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)) [L758] 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)) [L759] 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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))=0, x=2, y=0, y$flush_delayed=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L759] 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)) [L761] 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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))=0, x=2, y=0, y$flush_delayed=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L761] 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)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L797] 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) [L798] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 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 [L830] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=1] [L831] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] 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 [L833] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.4s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1293 SDtfs, 1393 SDslu, 2793 SDs, 0 SdLazy, 1919 SolverSat, 132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13626occurred 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: 1.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 2544 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 40332 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...