/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:24:40,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:24:40,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:24:40,427 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:24:40,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:24:40,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:24:40,429 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:24:40,431 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:24:40,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:24:40,434 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:24:40,435 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:24:40,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:24:40,436 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:24:40,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:24:40,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:24:40,439 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:24:40,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:24:40,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:24:40,443 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:24:40,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:24:40,447 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:24:40,448 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:24:40,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:24:40,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:24:40,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:24:40,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:24:40,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:24:40,458 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:24:40,458 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:24:40,459 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:24:40,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:24:40,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:24:40,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:24:40,464 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:24:40,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:24:40,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:24:40,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:24:40,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:24:40,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:24:40,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:24:40,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:24:40,475 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:24:40,491 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:24:40,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:24:40,493 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:24:40,496 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:24:40,496 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:24:40,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:24:40,496 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:24:40,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:24:40,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:24:40,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:24:40,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:24:40,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:24:40,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:24:40,498 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:24:40,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:24:40,498 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:24:40,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:24:40,498 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:24:40,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:24:40,499 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:24:40,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:24:40,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:24:40,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:24:40,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:24:40,502 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:24:40,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:24:40,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:24:40,502 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:24:40,503 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:24:40,503 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:24:40,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:24:40,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:24:40,782 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:24:40,783 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:24:40,784 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:24:40,785 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-18 13:24:40,862 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5016494a4/9934a4432fba4b5296ca698e92140275/FLAGb1809cae6 [2019-12-18 13:24:41,431 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:24:41,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_pso.opt.i [2019-12-18 13:24:41,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5016494a4/9934a4432fba4b5296ca698e92140275/FLAGb1809cae6 [2019-12-18 13:24:41,699 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5016494a4/9934a4432fba4b5296ca698e92140275 [2019-12-18 13:24:41,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:24:41,712 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:24:41,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:24:41,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:24:41,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:24:41,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:24:41" (1/1) ... [2019-12-18 13:24:41,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@314a820a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:41, skipping insertion in model container [2019-12-18 13:24:41,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:24:41" (1/1) ... [2019-12-18 13:24:41,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:24:41,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:24:42,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:24:42,359 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:24:42,438 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:24:42,509 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:24:42,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:42 WrapperNode [2019-12-18 13:24:42,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:24:42,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:24:42,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:24:42,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:24:42,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:42" (1/1) ... [2019-12-18 13:24:42,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:42" (1/1) ... [2019-12-18 13:24:42,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:24:42,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:24:42,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:24:42,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:24:42,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:42" (1/1) ... [2019-12-18 13:24:42,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:42" (1/1) ... [2019-12-18 13:24:42,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:42" (1/1) ... [2019-12-18 13:24:42,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:42" (1/1) ... [2019-12-18 13:24:42,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:42" (1/1) ... [2019-12-18 13:24:42,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:42" (1/1) ... [2019-12-18 13:24:42,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:42" (1/1) ... [2019-12-18 13:24:42,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:24:42,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:24:42,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:24:42,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:24:42,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:42" (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-18 13:24:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:24:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:24:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:24:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:24:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:24:42,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:24:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:24:42,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:24:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:24:42,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:24:42,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:24:42,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:24:42,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:24:42,682 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:24:43,420 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:24:43,420 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:24:43,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:24:43 BoogieIcfgContainer [2019-12-18 13:24:43,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:24:43,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:24:43,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:24:43,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:24:43,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:24:41" (1/3) ... [2019-12-18 13:24:43,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2317039d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:24:43, skipping insertion in model container [2019-12-18 13:24:43,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:42" (2/3) ... [2019-12-18 13:24:43,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2317039d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:24:43, skipping insertion in model container [2019-12-18 13:24:43,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:24:43" (3/3) ... [2019-12-18 13:24:43,430 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_pso.opt.i [2019-12-18 13:24:43,441 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:24:43,441 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:24:43,449 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:24:43,450 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:24:43,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,486 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,486 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,489 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,490 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,526 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,527 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,527 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,527 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,528 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,539 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,539 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,543 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,562 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,565 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,565 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,566 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:43,582 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:24:43,606 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:24:43,607 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:24:43,607 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:24:43,607 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:24:43,607 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:24:43,607 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:24:43,607 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:24:43,607 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:24:43,632 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 178 transitions [2019-12-18 13:24:43,635 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 178 transitions [2019-12-18 13:24:43,725 INFO L126 PetriNetUnfolder]: 35/175 cut-off events. [2019-12-18 13:24:43,725 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:24:43,748 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. 9/147 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 13:24:43,767 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 178 transitions [2019-12-18 13:24:43,847 INFO L126 PetriNetUnfolder]: 35/175 cut-off events. [2019-12-18 13:24:43,847 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:24:43,856 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. 9/147 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 13:24:43,870 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-18 13:24:43,871 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:24:48,439 WARN L192 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 13:24:48,603 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 13:24:48,662 INFO L206 etLargeBlockEncoding]: Checked pairs total: 41572 [2019-12-18 13:24:48,662 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 13:24:48,667 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 80 transitions [2019-12-18 13:24:49,649 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13626 states. [2019-12-18 13:24:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 13626 states. [2019-12-18 13:24:49,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 13:24:49,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:49,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:24:49,662 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-18 13:24:49,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:49,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1504632550, now seen corresponding path program 1 times [2019-12-18 13:24:49,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:49,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025477582] [2019-12-18 13:24:49,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:49,921 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-18 13:24:49,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025477582] [2019-12-18 13:24:49,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:49,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:24:49,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055531788] [2019-12-18 13:24:49,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:24:49,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:49,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:24:49,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:24:49,950 INFO L87 Difference]: Start difference. First operand 13626 states. Second operand 3 states. [2019-12-18 13:24:50,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:50,400 INFO L93 Difference]: Finished difference Result 13322 states and 50870 transitions. [2019-12-18 13:24:50,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:24:50,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 13:24:50,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:50,569 INFO L225 Difference]: With dead ends: 13322 [2019-12-18 13:24:50,570 INFO L226 Difference]: Without dead ends: 12542 [2019-12-18 13:24:50,575 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-18 13:24:50,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12542 states. [2019-12-18 13:24:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12542 to 12542. [2019-12-18 13:24:51,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12542 states. [2019-12-18 13:24:51,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12542 states to 12542 states and 47820 transitions. [2019-12-18 13:24:51,895 INFO L78 Accepts]: Start accepts. Automaton has 12542 states and 47820 transitions. Word has length 7 [2019-12-18 13:24:51,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:51,897 INFO L462 AbstractCegarLoop]: Abstraction has 12542 states and 47820 transitions. [2019-12-18 13:24:51,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:24:51,897 INFO L276 IsEmpty]: Start isEmpty. Operand 12542 states and 47820 transitions. [2019-12-18 13:24:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:24:51,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:51,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:24:51,909 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-18 13:24:51,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:51,910 INFO L82 PathProgramCache]: Analyzing trace with hash 696666680, now seen corresponding path program 1 times [2019-12-18 13:24:51,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:51,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085611460] [2019-12-18 13:24:51,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:52,053 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-18 13:24:52,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085611460] [2019-12-18 13:24:52,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:52,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:24:52,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51022277] [2019-12-18 13:24:52,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:24:52,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:52,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:24:52,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:24:52,058 INFO L87 Difference]: Start difference. First operand 12542 states and 47820 transitions. Second operand 3 states. [2019-12-18 13:24:52,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:52,195 INFO L93 Difference]: Finished difference Result 7513 states and 25047 transitions. [2019-12-18 13:24:52,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:24:52,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:24:52,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:52,231 INFO L225 Difference]: With dead ends: 7513 [2019-12-18 13:24:52,231 INFO L226 Difference]: Without dead ends: 7513 [2019-12-18 13:24:52,233 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-18 13:24:52,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7513 states. [2019-12-18 13:24:52,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7513 to 7513. [2019-12-18 13:24:52,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7513 states. [2019-12-18 13:24:52,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7513 states to 7513 states and 25047 transitions. [2019-12-18 13:24:52,551 INFO L78 Accepts]: Start accepts. Automaton has 7513 states and 25047 transitions. Word has length 13 [2019-12-18 13:24:52,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:52,551 INFO L462 AbstractCegarLoop]: Abstraction has 7513 states and 25047 transitions. [2019-12-18 13:24:52,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:24:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 7513 states and 25047 transitions. [2019-12-18 13:24:52,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:24:52,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:52,554 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:24:52,554 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-18 13:24:52,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:52,554 INFO L82 PathProgramCache]: Analyzing trace with hash 361138653, now seen corresponding path program 1 times [2019-12-18 13:24:52,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:52,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690578084] [2019-12-18 13:24:52,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:52,661 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-18 13:24:52,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690578084] [2019-12-18 13:24:52,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:52,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:24:52,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778670821] [2019-12-18 13:24:52,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:24:52,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:52,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:24:52,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:24:52,664 INFO L87 Difference]: Start difference. First operand 7513 states and 25047 transitions. Second operand 4 states. [2019-12-18 13:24:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:52,722 INFO L93 Difference]: Finished difference Result 1752 states and 4700 transitions. [2019-12-18 13:24:52,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:24:52,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 13:24:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:52,729 INFO L225 Difference]: With dead ends: 1752 [2019-12-18 13:24:52,729 INFO L226 Difference]: Without dead ends: 1752 [2019-12-18 13:24:52,729 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-18 13:24:52,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2019-12-18 13:24:52,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2019-12-18 13:24:52,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2019-12-18 13:24:52,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 4700 transitions. [2019-12-18 13:24:52,777 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 4700 transitions. Word has length 14 [2019-12-18 13:24:52,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:52,778 INFO L462 AbstractCegarLoop]: Abstraction has 1752 states and 4700 transitions. [2019-12-18 13:24:52,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:24:52,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 4700 transitions. [2019-12-18 13:24:52,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:24:52,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:52,779 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:24:52,779 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-18 13:24:52,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:52,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1273661692, now seen corresponding path program 1 times [2019-12-18 13:24:52,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:52,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448841803] [2019-12-18 13:24:52,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:52,890 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-18 13:24:52,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448841803] [2019-12-18 13:24:52,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:52,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:24:52,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948872438] [2019-12-18 13:24:52,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:24:52,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:52,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:24:52,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:24:52,895 INFO L87 Difference]: Start difference. First operand 1752 states and 4700 transitions. Second operand 4 states. [2019-12-18 13:24:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:53,092 INFO L93 Difference]: Finished difference Result 2319 states and 6117 transitions. [2019-12-18 13:24:53,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:24:53,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:24:53,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:53,100 INFO L225 Difference]: With dead ends: 2319 [2019-12-18 13:24:53,100 INFO L226 Difference]: Without dead ends: 2319 [2019-12-18 13:24:53,101 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-18 13:24:53,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2019-12-18 13:24:53,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2159. [2019-12-18 13:24:53,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2159 states. [2019-12-18 13:24:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 5759 transitions. [2019-12-18 13:24:53,247 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 5759 transitions. Word has length 16 [2019-12-18 13:24:53,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:53,248 INFO L462 AbstractCegarLoop]: Abstraction has 2159 states and 5759 transitions. [2019-12-18 13:24:53,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:24:53,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 5759 transitions. [2019-12-18 13:24:53,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 13:24:53,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:53,252 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-18 13:24:53,252 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-18 13:24:53,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:53,254 INFO L82 PathProgramCache]: Analyzing trace with hash -164246467, now seen corresponding path program 1 times [2019-12-18 13:24:53,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:53,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996067141] [2019-12-18 13:24:53,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:53,339 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-18 13:24:53,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996067141] [2019-12-18 13:24:53,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:53,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:24:53,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023673189] [2019-12-18 13:24:53,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:24:53,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:53,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:24:53,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:24:53,341 INFO L87 Difference]: Start difference. First operand 2159 states and 5759 transitions. Second operand 5 states. [2019-12-18 13:24:53,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:53,376 INFO L93 Difference]: Finished difference Result 1278 states and 3496 transitions. [2019-12-18 13:24:53,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:24:53,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 13:24:53,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:53,381 INFO L225 Difference]: With dead ends: 1278 [2019-12-18 13:24:53,381 INFO L226 Difference]: Without dead ends: 1278 [2019-12-18 13:24:53,381 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-18 13:24:53,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2019-12-18 13:24:53,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1218. [2019-12-18 13:24:53,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-12-18 13:24:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 3346 transitions. [2019-12-18 13:24:53,412 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 3346 transitions. Word has length 29 [2019-12-18 13:24:53,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:53,413 INFO L462 AbstractCegarLoop]: Abstraction has 1218 states and 3346 transitions. [2019-12-18 13:24:53,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:24:53,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 3346 transitions. [2019-12-18 13:24:53,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 13:24:53,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:53,417 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-18 13:24:53,418 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-18 13:24:53,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:53,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1707006173, now seen corresponding path program 1 times [2019-12-18 13:24:53,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:53,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976096346] [2019-12-18 13:24:53,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:53,492 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-18 13:24:53,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976096346] [2019-12-18 13:24:53,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:53,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:24:53,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89185684] [2019-12-18 13:24:53,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:24:53,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:53,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:24:53,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:24:53,496 INFO L87 Difference]: Start difference. First operand 1218 states and 3346 transitions. Second operand 3 states. [2019-12-18 13:24:53,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:53,516 INFO L93 Difference]: Finished difference Result 1820 states and 4707 transitions. [2019-12-18 13:24:53,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:24:53,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 13:24:53,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:53,519 INFO L225 Difference]: With dead ends: 1820 [2019-12-18 13:24:53,519 INFO L226 Difference]: Without dead ends: 642 [2019-12-18 13:24:53,520 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-18 13:24:53,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-12-18 13:24:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-12-18 13:24:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-18 13:24:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1436 transitions. [2019-12-18 13:24:53,534 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1436 transitions. Word has length 44 [2019-12-18 13:24:53,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:53,534 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 1436 transitions. [2019-12-18 13:24:53,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:24:53,535 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1436 transitions. [2019-12-18 13:24:53,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 13:24:53,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:53,539 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-18 13:24:53,539 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-18 13:24:53,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:53,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1883792513, now seen corresponding path program 2 times [2019-12-18 13:24:53,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:53,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252954139] [2019-12-18 13:24:53,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:53,667 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-18 13:24:53,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252954139] [2019-12-18 13:24:53,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:53,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:24:53,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828277023] [2019-12-18 13:24:53,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:24:53,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:53,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:24:53,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:24:53,669 INFO L87 Difference]: Start difference. First operand 642 states and 1436 transitions. Second operand 6 states. [2019-12-18 13:24:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:53,891 INFO L93 Difference]: Finished difference Result 1644 states and 3615 transitions. [2019-12-18 13:24:53,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:24:53,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-12-18 13:24:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:53,906 INFO L225 Difference]: With dead ends: 1644 [2019-12-18 13:24:53,906 INFO L226 Difference]: Without dead ends: 1110 [2019-12-18 13:24:53,907 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-18 13:24:53,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2019-12-18 13:24:53,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 699. [2019-12-18 13:24:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-12-18 13:24:53,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1564 transitions. [2019-12-18 13:24:53,930 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1564 transitions. Word has length 44 [2019-12-18 13:24:53,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:53,931 INFO L462 AbstractCegarLoop]: Abstraction has 699 states and 1564 transitions. [2019-12-18 13:24:53,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:24:53,931 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1564 transitions. [2019-12-18 13:24:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 13:24:53,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:53,933 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-18 13:24:53,933 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-18 13:24:53,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:53,933 INFO L82 PathProgramCache]: Analyzing trace with hash 170447017, now seen corresponding path program 3 times [2019-12-18 13:24:53,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:53,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90837183] [2019-12-18 13:24:53,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:54,114 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-18 13:24:54,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90837183] [2019-12-18 13:24:54,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:54,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:24:54,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129929099] [2019-12-18 13:24:54,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:24:54,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:54,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:24:54,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:24:54,117 INFO L87 Difference]: Start difference. First operand 699 states and 1564 transitions. Second operand 8 states. [2019-12-18 13:24:55,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:55,298 INFO L93 Difference]: Finished difference Result 1657 states and 3522 transitions. [2019-12-18 13:24:55,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 13:24:55,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-12-18 13:24:55,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:55,304 INFO L225 Difference]: With dead ends: 1657 [2019-12-18 13:24:55,305 INFO L226 Difference]: Without dead ends: 1657 [2019-12-18 13:24:55,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-18 13:24:55,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2019-12-18 13:24:55,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 889. [2019-12-18 13:24:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-12-18 13:24:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1963 transitions. [2019-12-18 13:24:55,332 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1963 transitions. Word has length 44 [2019-12-18 13:24:55,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:55,333 INFO L462 AbstractCegarLoop]: Abstraction has 889 states and 1963 transitions. [2019-12-18 13:24:55,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:24:55,333 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1963 transitions. [2019-12-18 13:24:55,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 13:24:55,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:55,335 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-18 13:24:55,336 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-18 13:24:55,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:55,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1420662497, now seen corresponding path program 4 times [2019-12-18 13:24:55,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:55,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609995863] [2019-12-18 13:24:55,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:55,514 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-18 13:24:55,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609995863] [2019-12-18 13:24:55,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:55,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:24:55,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332026196] [2019-12-18 13:24:55,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:24:55,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:55,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:24:55,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:24:55,517 INFO L87 Difference]: Start difference. First operand 889 states and 1963 transitions. Second operand 7 states. [2019-12-18 13:24:56,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:56,506 INFO L93 Difference]: Finished difference Result 2234 states and 4915 transitions. [2019-12-18 13:24:56,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:24:56,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-18 13:24:56,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:56,514 INFO L225 Difference]: With dead ends: 2234 [2019-12-18 13:24:56,514 INFO L226 Difference]: Without dead ends: 2203 [2019-12-18 13:24:56,515 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-18 13:24:56,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2019-12-18 13:24:56,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 1119. [2019-12-18 13:24:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2019-12-18 13:24:56,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 2576 transitions. [2019-12-18 13:24:56,549 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 2576 transitions. Word has length 44 [2019-12-18 13:24:56,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:56,549 INFO L462 AbstractCegarLoop]: Abstraction has 1119 states and 2576 transitions. [2019-12-18 13:24:56,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:24:56,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 2576 transitions. [2019-12-18 13:24:56,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 13:24:56,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:56,553 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-18 13:24:56,553 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-18 13:24:56,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:56,554 INFO L82 PathProgramCache]: Analyzing trace with hash -115488353, now seen corresponding path program 5 times [2019-12-18 13:24:56,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:56,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252901790] [2019-12-18 13:24:56,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:56,621 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-18 13:24:56,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252901790] [2019-12-18 13:24:56,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:56,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:24:56,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24431366] [2019-12-18 13:24:56,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:24:56,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:56,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:24:56,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:24:56,624 INFO L87 Difference]: Start difference. First operand 1119 states and 2576 transitions. Second operand 3 states. [2019-12-18 13:24:56,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:56,638 INFO L93 Difference]: Finished difference Result 1117 states and 2571 transitions. [2019-12-18 13:24:56,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:24:56,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 13:24:56,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:56,642 INFO L225 Difference]: With dead ends: 1117 [2019-12-18 13:24:56,643 INFO L226 Difference]: Without dead ends: 1117 [2019-12-18 13:24:56,643 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-18 13:24:56,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2019-12-18 13:24:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 985. [2019-12-18 13:24:56,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2019-12-18 13:24:56,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 2302 transitions. [2019-12-18 13:24:56,663 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 2302 transitions. Word has length 44 [2019-12-18 13:24:56,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:56,663 INFO L462 AbstractCegarLoop]: Abstraction has 985 states and 2302 transitions. [2019-12-18 13:24:56,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:24:56,663 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 2302 transitions. [2019-12-18 13:24:56,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 13:24:56,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:56,666 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-18 13:24:56,667 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-18 13:24:56,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:56,667 INFO L82 PathProgramCache]: Analyzing trace with hash 359561549, now seen corresponding path program 1 times [2019-12-18 13:24:56,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:56,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691344962] [2019-12-18 13:24:56,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:24:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:24:56,815 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:24:56,815 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:24:56,819 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-18 13:24:56,820 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-18 13:24:56,821 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-18 13:24:56,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L4-->L797: Formula: (and (= 1 ~y$r_buff0_thd3~0_Out97089239) (= ~y$r_buff0_thd1~0_In97089239 ~y$r_buff1_thd1~0_Out97089239) (= ~__unbuffered_p2_EAX~0_Out97089239 ~z~0_Out97089239) (not (= P2Thread1of1ForFork2___VERIFIER_assert_~expression_In97089239 0)) (= ~y$r_buff0_thd0~0_In97089239 ~y$r_buff1_thd0~0_Out97089239) (= ~__unbuffered_p2_EBX~0_Out97089239 ~a~0_In97089239) (= ~y$r_buff0_thd3~0_In97089239 ~y$r_buff1_thd3~0_Out97089239) (= 1 ~z~0_Out97089239) (= ~y$r_buff1_thd2~0_Out97089239 ~y$r_buff0_thd2~0_In97089239)) InVars {~a~0=~a~0_In97089239, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In97089239, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In97089239, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In97089239, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In97089239, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In97089239} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out97089239, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In97089239, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out97089239, ~a~0=~a~0_In97089239, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out97089239, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out97089239, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out97089239, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In97089239, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In97089239, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In97089239, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out97089239, ~z~0=~z~0_Out97089239, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out97089239} 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-18 13:24:56,826 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-18 13:24:56,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L756-->L756-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2136283864 256) 0))) (or (and (not .cse0) (= ~y$w_buff0~0_In2136283864 |P1Thread1of1ForFork1_#t~ite9_Out2136283864|) (= |P1Thread1of1ForFork1_#t~ite8_In2136283864| |P1Thread1of1ForFork1_#t~ite8_Out2136283864|)) (and (= |P1Thread1of1ForFork1_#t~ite8_Out2136283864| |P1Thread1of1ForFork1_#t~ite9_Out2136283864|) (= ~y$w_buff0~0_In2136283864 |P1Thread1of1ForFork1_#t~ite8_Out2136283864|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2136283864 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In2136283864 256)) (and (= 0 (mod ~y$w_buff1_used~0_In2136283864 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In2136283864 256)) .cse1))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2136283864, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2136283864, ~y$w_buff0~0=~y$w_buff0~0_In2136283864, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2136283864, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In2136283864|, ~weak$$choice2~0=~weak$$choice2~0_In2136283864, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2136283864} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2136283864, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2136283864, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out2136283864|, ~y$w_buff0~0=~y$w_buff0~0_In2136283864, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2136283864, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out2136283864|, ~weak$$choice2~0=~weak$$choice2~0_In2136283864, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2136283864} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 13:24:56,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L757-->L757-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1010802612 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out1010802612| ~y$w_buff1~0_In1010802612) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1010802612 256)))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In1010802612 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1010802612 256)) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1010802612 256))))) (= |P1Thread1of1ForFork1_#t~ite11_Out1010802612| |P1Thread1of1ForFork1_#t~ite12_Out1010802612|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite12_Out1010802612| ~y$w_buff1~0_In1010802612) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_In1010802612| |P1Thread1of1ForFork1_#t~ite11_Out1010802612|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1010802612, ~y$w_buff1~0=~y$w_buff1~0_In1010802612, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1010802612, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1010802612, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In1010802612|, ~weak$$choice2~0=~weak$$choice2~0_In1010802612, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1010802612} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1010802612, ~y$w_buff1~0=~y$w_buff1~0_In1010802612, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1010802612, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1010802612, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1010802612|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1010802612|, ~weak$$choice2~0=~weak$$choice2~0_In1010802612, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1010802612} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:24:56,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L758-->L758-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1811457608 256) 0))) (or (and (= ~y$w_buff0_used~0_In1811457608 |P1Thread1of1ForFork1_#t~ite14_Out1811457608|) (= |P1Thread1of1ForFork1_#t~ite15_Out1811457608| |P1Thread1of1ForFork1_#t~ite14_Out1811457608|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1811457608 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1811457608 256)) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In1811457608 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In1811457608 256) 0))) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In1811457608| |P1Thread1of1ForFork1_#t~ite14_Out1811457608|) (= |P1Thread1of1ForFork1_#t~ite15_Out1811457608| ~y$w_buff0_used~0_In1811457608)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1811457608, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1811457608, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1811457608, ~weak$$choice2~0=~weak$$choice2~0_In1811457608, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1811457608|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1811457608} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1811457608, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1811457608, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1811457608, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1811457608|, ~weak$$choice2~0=~weak$$choice2~0_In1811457608, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1811457608|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1811457608} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 13:24:56,835 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-18 13:24:56,837 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-18 13:24:56,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-954602004 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-954602004 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out-954602004| ~y$w_buff0_used~0_In-954602004)) (and (= |P2Thread1of1ForFork2_#t~ite28_Out-954602004| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-954602004, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-954602004} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-954602004, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-954602004, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-954602004|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 13:24:56,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1596609872 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1596609872 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1596609872 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1596609872 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite29_Out1596609872| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite29_Out1596609872| ~y$w_buff1_used~0_In1596609872) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1596609872, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1596609872, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1596609872, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1596609872} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1596609872, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1596609872, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1596609872, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1596609872|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1596609872} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 13:24:56,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L800-->L801: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1274768290 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1274768290 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out1274768290 ~y$r_buff0_thd3~0_In1274768290)) (and (= ~y$r_buff0_thd3~0_Out1274768290 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1274768290, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1274768290} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1274768290, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1274768290|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1274768290} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 13:24:56,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-744303766 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-744303766 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-744303766 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-744303766 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite31_Out-744303766| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite31_Out-744303766| ~y$r_buff1_thd3~0_In-744303766)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-744303766, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-744303766, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-744303766, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-744303766} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-744303766, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-744303766, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-744303766|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-744303766, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-744303766} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 13:24:56,842 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-18 13:24:56,843 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-18 13:24:56,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L830-2-->L830-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1232888387 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1232888387 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In1232888387 |ULTIMATE.start_main_#t~ite35_Out1232888387|) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In1232888387 |ULTIMATE.start_main_#t~ite35_Out1232888387|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1232888387, ~y~0=~y~0_In1232888387, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1232888387, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1232888387} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1232888387, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1232888387|, ~y~0=~y~0_In1232888387, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1232888387, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1232888387} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-18 13:24:56,844 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-18 13:24:56,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-435754656 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-435754656 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_Out-435754656| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-435754656 |ULTIMATE.start_main_#t~ite37_Out-435754656|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-435754656, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-435754656} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-435754656, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-435754656, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-435754656|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 13:24:56,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1833391794 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1833391794 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1833391794 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1833391794 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out1833391794|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1833391794 |ULTIMATE.start_main_#t~ite38_Out1833391794|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1833391794, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1833391794, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1833391794, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1833391794} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1833391794, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1833391794, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1833391794|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1833391794, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1833391794} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 13:24:56,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1793883511 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1793883511 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite39_Out1793883511|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In1793883511 |ULTIMATE.start_main_#t~ite39_Out1793883511|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1793883511, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1793883511} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1793883511, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1793883511|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1793883511} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 13:24:56,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In780310344 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In780310344 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In780310344 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In780310344 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite40_Out780310344|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In780310344 |ULTIMATE.start_main_#t~ite40_Out780310344|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In780310344, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In780310344, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In780310344, ~y$w_buff1_used~0=~y$w_buff1_used~0_In780310344} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out780310344|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In780310344, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In780310344, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In780310344, ~y$w_buff1_used~0=~y$w_buff1_used~0_In780310344} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 13:24:56,848 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-18 13:24:56,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:24:56 BasicIcfg [2019-12-18 13:24:56,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:24:56,964 INFO L168 Benchmark]: Toolchain (without parser) took 15251.83 ms. Allocated memory was 140.0 MB in the beginning and 584.1 MB in the end (delta: 444.1 MB). Free memory was 100.0 MB in the beginning and 180.0 MB in the end (delta: -80.0 MB). Peak memory consumption was 364.1 MB. Max. memory is 7.1 GB. [2019-12-18 13:24:56,965 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 140.0 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 13:24:56,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 796.95 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 100.0 MB in the beginning and 157.8 MB in the end (delta: -57.8 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:24:56,969 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.86 ms. Allocated memory is still 203.9 MB. Free memory was 157.8 MB in the beginning and 155.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:24:56,970 INFO L168 Benchmark]: Boogie Preprocessor took 38.74 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 153.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:24:56,970 INFO L168 Benchmark]: RCFGBuilder took 808.24 ms. Allocated memory is still 203.9 MB. Free memory was 153.1 MB in the beginning and 109.3 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:24:56,974 INFO L168 Benchmark]: TraceAbstraction took 13538.40 ms. Allocated memory was 203.9 MB in the beginning and 584.1 MB in the end (delta: 380.1 MB). Free memory was 109.3 MB in the beginning and 180.0 MB in the end (delta: -70.7 MB). Peak memory consumption was 309.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:24:56,982 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.55 ms. Allocated memory is still 140.0 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 796.95 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 100.0 MB in the beginning and 157.8 MB in the end (delta: -57.8 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.86 ms. Allocated memory is still 203.9 MB. Free memory was 157.8 MB in the beginning and 155.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.74 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 153.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 808.24 ms. Allocated memory is still 203.9 MB. Free memory was 153.1 MB in the beginning and 109.3 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13538.40 ms. Allocated memory was 203.9 MB in the beginning and 584.1 MB in the end (delta: 380.1 MB). Free memory was 109.3 MB in the beginning and 180.0 MB in the end (delta: -70.7 MB). Peak memory consumption was 309.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 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.2s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1300 SDtfs, 1373 SDslu, 2701 SDs, 0 SdLazy, 1781 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s 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.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 2615 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 38784 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...