/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix010_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:21:01,434 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:21:01,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:21:01,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:21:01,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:21:01,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:21:01,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:21:01,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:21:01,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:21:01,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:21:01,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:21:01,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:21:01,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:21:01,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:21:01,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:21:01,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:21:01,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:21:01,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:21:01,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:21:01,493 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:21:01,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:21:01,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:21:01,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:21:01,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:21:01,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:21:01,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:21:01,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:21:01,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:21:01,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:21:01,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:21:01,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:21:01,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:21:01,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:21:01,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:21:01,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:21:01,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:21:01,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:21:01,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:21:01,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:21:01,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:21:01,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:21:01,517 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 05:21:01,537 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:21:01,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:21:01,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:21:01,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:21:01,543 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:21:01,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:21:01,544 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:21:01,544 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:21:01,544 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:21:01,544 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:21:01,544 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:21:01,545 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:21:01,545 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:21:01,545 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:21:01,545 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:21:01,545 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:21:01,545 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:21:01,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:21:01,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:21:01,547 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:21:01,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:21:01,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:21:01,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:21:01,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:21:01,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:21:01,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:21:01,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:21:01,553 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:21:01,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:21:01,553 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:21:01,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:21:01,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:21:01,829 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:21:01,830 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:21:01,831 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:21:01,831 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_rmo.opt.i [2019-12-27 05:21:01,886 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6485e9b93/19689fa055f146ec9b7d55a1da29b759/FLAG27e85a8d6 [2019-12-27 05:21:02,441 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:21:02,442 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_rmo.opt.i [2019-12-27 05:21:02,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6485e9b93/19689fa055f146ec9b7d55a1da29b759/FLAG27e85a8d6 [2019-12-27 05:21:02,704 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6485e9b93/19689fa055f146ec9b7d55a1da29b759 [2019-12-27 05:21:02,712 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:21:02,714 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:21:02,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:21:02,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:21:02,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:21:02,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:21:02" (1/1) ... [2019-12-27 05:21:02,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad6db1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:02, skipping insertion in model container [2019-12-27 05:21:02,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:21:02" (1/1) ... [2019-12-27 05:21:02,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:21:02,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:21:03,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:21:03,288 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:21:03,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:21:03,453 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:21:03,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:03 WrapperNode [2019-12-27 05:21:03,454 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:21:03,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:21:03,455 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:21:03,455 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:21:03,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:03" (1/1) ... [2019-12-27 05:21:03,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:03" (1/1) ... [2019-12-27 05:21:03,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:21:03,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:21:03,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:21:03,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:21:03,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:03" (1/1) ... [2019-12-27 05:21:03,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:03" (1/1) ... [2019-12-27 05:21:03,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:03" (1/1) ... [2019-12-27 05:21:03,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:03" (1/1) ... [2019-12-27 05:21:03,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:03" (1/1) ... [2019-12-27 05:21:03,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:03" (1/1) ... [2019-12-27 05:21:03,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:03" (1/1) ... [2019-12-27 05:21:03,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:21:03,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:21:03,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:21:03,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:21:03,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:21:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:21:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:21:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:21:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:21:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:21:03,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:21:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:21:03,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:21:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:21:03,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:21:03,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:21:03,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:21:03,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:21:03,658 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 05:21:04,446 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:21:04,446 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:21:04,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:21:04 BoogieIcfgContainer [2019-12-27 05:21:04,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:21:04,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:21:04,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:21:04,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:21:04,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:21:02" (1/3) ... [2019-12-27 05:21:04,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acd9077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:21:04, skipping insertion in model container [2019-12-27 05:21:04,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:03" (2/3) ... [2019-12-27 05:21:04,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acd9077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:21:04, skipping insertion in model container [2019-12-27 05:21:04,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:21:04" (3/3) ... [2019-12-27 05:21:04,461 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_rmo.opt.i [2019-12-27 05:21:04,472 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:21:04,473 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:21:04,491 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:21:04,492 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:21:04,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,572 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,572 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,575 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,575 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,596 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,596 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,596 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,597 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,597 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,625 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,625 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,628 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,634 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,634 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,638 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,640 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:04,657 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:21:04,677 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:21:04,677 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:21:04,677 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:21:04,678 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:21:04,678 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:21:04,678 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:21:04,678 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:21:04,678 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:21:04,696 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-27 05:21:04,698 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-27 05:21:04,819 INFO L132 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-27 05:21:04,820 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:21:04,840 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 568 event pairs. 0/182 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 05:21:04,871 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-27 05:21:04,937 INFO L132 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-27 05:21:04,937 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:21:04,950 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 568 event pairs. 0/182 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 05:21:04,983 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-27 05:21:04,984 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:21:09,117 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 05:21:09,255 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 05:21:09,302 INFO L206 etLargeBlockEncoding]: Checked pairs total: 134090 [2019-12-27 05:21:09,302 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-27 05:21:09,306 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 126 transitions [2019-12-27 05:21:12,738 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42246 states. [2019-12-27 05:21:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 42246 states. [2019-12-27 05:21:12,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 05:21:12,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:12,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:21:12,750 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:12,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:12,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1163944889, now seen corresponding path program 1 times [2019-12-27 05:21:12,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:12,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729647028] [2019-12-27 05:21:12,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:13,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:21:13,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729647028] [2019-12-27 05:21:13,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:13,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:21:13,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816090061] [2019-12-27 05:21:13,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:21:13,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:13,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:21:13,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:21:13,047 INFO L87 Difference]: Start difference. First operand 42246 states. Second operand 3 states. [2019-12-27 05:21:14,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:14,049 INFO L93 Difference]: Finished difference Result 41734 states and 169560 transitions. [2019-12-27 05:21:14,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:21:14,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 05:21:14,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:14,434 INFO L225 Difference]: With dead ends: 41734 [2019-12-27 05:21:14,434 INFO L226 Difference]: Without dead ends: 38854 [2019-12-27 05:21:14,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:21:15,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38854 states. [2019-12-27 05:21:17,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38854 to 38854. [2019-12-27 05:21:17,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38854 states. [2019-12-27 05:21:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38854 states to 38854 states and 157748 transitions. [2019-12-27 05:21:17,980 INFO L78 Accepts]: Start accepts. Automaton has 38854 states and 157748 transitions. Word has length 7 [2019-12-27 05:21:17,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:17,981 INFO L462 AbstractCegarLoop]: Abstraction has 38854 states and 157748 transitions. [2019-12-27 05:21:17,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:21:17,982 INFO L276 IsEmpty]: Start isEmpty. Operand 38854 states and 157748 transitions. [2019-12-27 05:21:17,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:21:17,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:17,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:21:17,988 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:17,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:17,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1542231911, now seen corresponding path program 1 times [2019-12-27 05:21:17,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:17,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147937269] [2019-12-27 05:21:17,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:18,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:21:18,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147937269] [2019-12-27 05:21:18,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:18,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:21:18,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376613170] [2019-12-27 05:21:18,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:21:18,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:18,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:21:18,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:21:18,089 INFO L87 Difference]: Start difference. First operand 38854 states and 157748 transitions. Second operand 4 states. [2019-12-27 05:21:20,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:20,686 INFO L93 Difference]: Finished difference Result 61490 states and 240522 transitions. [2019-12-27 05:21:20,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:21:20,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 05:21:20,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:21,021 INFO L225 Difference]: With dead ends: 61490 [2019-12-27 05:21:21,022 INFO L226 Difference]: Without dead ends: 61462 [2019-12-27 05:21:21,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:21:21,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61462 states. [2019-12-27 05:21:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61462 to 58792. [2019-12-27 05:21:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58792 states. [2019-12-27 05:21:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58792 states to 58792 states and 231943 transitions. [2019-12-27 05:21:23,555 INFO L78 Accepts]: Start accepts. Automaton has 58792 states and 231943 transitions. Word has length 13 [2019-12-27 05:21:23,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:23,555 INFO L462 AbstractCegarLoop]: Abstraction has 58792 states and 231943 transitions. [2019-12-27 05:21:23,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:21:23,556 INFO L276 IsEmpty]: Start isEmpty. Operand 58792 states and 231943 transitions. [2019-12-27 05:21:23,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:21:23,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:23,563 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:21:23,563 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:23,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:23,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1747872827, now seen corresponding path program 1 times [2019-12-27 05:21:23,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:23,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480991401] [2019-12-27 05:21:23,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:23,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:21:23,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480991401] [2019-12-27 05:21:23,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:23,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:21:23,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639443902] [2019-12-27 05:21:23,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:21:23,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:23,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:21:23,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:21:23,677 INFO L87 Difference]: Start difference. First operand 58792 states and 231943 transitions. Second operand 4 states. [2019-12-27 05:21:26,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:26,500 INFO L93 Difference]: Finished difference Result 76000 states and 295555 transitions. [2019-12-27 05:21:26,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:21:26,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 05:21:26,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:26,794 INFO L225 Difference]: With dead ends: 76000 [2019-12-27 05:21:26,794 INFO L226 Difference]: Without dead ends: 75972 [2019-12-27 05:21:26,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:21:27,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75972 states. [2019-12-27 05:21:28,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75972 to 66902. [2019-12-27 05:21:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66902 states. [2019-12-27 05:21:29,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66902 states to 66902 states and 262800 transitions. [2019-12-27 05:21:29,072 INFO L78 Accepts]: Start accepts. Automaton has 66902 states and 262800 transitions. Word has length 16 [2019-12-27 05:21:29,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:29,072 INFO L462 AbstractCegarLoop]: Abstraction has 66902 states and 262800 transitions. [2019-12-27 05:21:29,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:21:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 66902 states and 262800 transitions. [2019-12-27 05:21:29,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 05:21:29,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:29,081 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:21:29,081 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:29,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:29,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1292040923, now seen corresponding path program 1 times [2019-12-27 05:21:29,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:29,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239656205] [2019-12-27 05:21:29,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:21:29,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239656205] [2019-12-27 05:21:29,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:29,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:21:29,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413395990] [2019-12-27 05:21:29,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:21:29,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:29,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:21:29,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:21:29,155 INFO L87 Difference]: Start difference. First operand 66902 states and 262800 transitions. Second operand 3 states. [2019-12-27 05:21:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:30,052 INFO L93 Difference]: Finished difference Result 62750 states and 246122 transitions. [2019-12-27 05:21:30,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:21:30,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 05:21:30,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:30,258 INFO L225 Difference]: With dead ends: 62750 [2019-12-27 05:21:30,258 INFO L226 Difference]: Without dead ends: 62582 [2019-12-27 05:21:30,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:21:30,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62582 states. [2019-12-27 05:21:32,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62582 to 62582. [2019-12-27 05:21:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62582 states. [2019-12-27 05:21:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62582 states to 62582 states and 245526 transitions. [2019-12-27 05:21:36,176 INFO L78 Accepts]: Start accepts. Automaton has 62582 states and 245526 transitions. Word has length 18 [2019-12-27 05:21:36,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:36,176 INFO L462 AbstractCegarLoop]: Abstraction has 62582 states and 245526 transitions. [2019-12-27 05:21:36,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:21:36,176 INFO L276 IsEmpty]: Start isEmpty. Operand 62582 states and 245526 transitions. [2019-12-27 05:21:36,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:21:36,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:36,198 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] [2019-12-27 05:21:36,198 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:36,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:36,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1307614695, now seen corresponding path program 1 times [2019-12-27 05:21:36,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:36,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928423527] [2019-12-27 05:21:36,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:36,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:21:36,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928423527] [2019-12-27 05:21:36,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:36,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:21:36,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120046403] [2019-12-27 05:21:36,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:21:36,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:36,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:21:36,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:21:36,288 INFO L87 Difference]: Start difference. First operand 62582 states and 245526 transitions. Second operand 5 states. [2019-12-27 05:21:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:37,231 INFO L93 Difference]: Finished difference Result 75196 states and 291047 transitions. [2019-12-27 05:21:37,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:21:37,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 05:21:37,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:37,410 INFO L225 Difference]: With dead ends: 75196 [2019-12-27 05:21:37,410 INFO L226 Difference]: Without dead ends: 75144 [2019-12-27 05:21:37,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:21:38,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75144 states. [2019-12-27 05:21:39,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75144 to 62270. [2019-12-27 05:21:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62270 states. [2019-12-27 05:21:39,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62270 states to 62270 states and 244452 transitions. [2019-12-27 05:21:39,720 INFO L78 Accepts]: Start accepts. Automaton has 62270 states and 244452 transitions. Word has length 22 [2019-12-27 05:21:39,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:39,720 INFO L462 AbstractCegarLoop]: Abstraction has 62270 states and 244452 transitions. [2019-12-27 05:21:39,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:21:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 62270 states and 244452 transitions. [2019-12-27 05:21:39,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 05:21:39,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:39,791 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] [2019-12-27 05:21:39,792 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:39,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:39,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1189986838, now seen corresponding path program 1 times [2019-12-27 05:21:39,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:39,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676917017] [2019-12-27 05:21:39,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:21:39,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676917017] [2019-12-27 05:21:39,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:39,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:21:39,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929087186] [2019-12-27 05:21:39,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:21:39,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:39,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:21:39,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:21:39,871 INFO L87 Difference]: Start difference. First operand 62270 states and 244452 transitions. Second operand 5 states. [2019-12-27 05:21:41,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:41,015 INFO L93 Difference]: Finished difference Result 94430 states and 375492 transitions. [2019-12-27 05:21:41,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:21:41,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-27 05:21:41,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:41,228 INFO L225 Difference]: With dead ends: 94430 [2019-12-27 05:21:41,228 INFO L226 Difference]: Without dead ends: 82542 [2019-12-27 05:21:41,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:21:41,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82542 states. [2019-12-27 05:21:45,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82542 to 82542. [2019-12-27 05:21:45,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82542 states. [2019-12-27 05:21:46,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82542 states to 82542 states and 329856 transitions. [2019-12-27 05:21:46,134 INFO L78 Accepts]: Start accepts. Automaton has 82542 states and 329856 transitions. Word has length 32 [2019-12-27 05:21:46,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:46,134 INFO L462 AbstractCegarLoop]: Abstraction has 82542 states and 329856 transitions. [2019-12-27 05:21:46,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:21:46,134 INFO L276 IsEmpty]: Start isEmpty. Operand 82542 states and 329856 transitions. [2019-12-27 05:21:46,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 05:21:46,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:46,231 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] [2019-12-27 05:21:46,231 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:46,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:46,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1971502230, now seen corresponding path program 2 times [2019-12-27 05:21:46,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:46,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966416544] [2019-12-27 05:21:46,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:21:46,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966416544] [2019-12-27 05:21:46,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:46,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:21:46,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447022582] [2019-12-27 05:21:46,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:21:46,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:46,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:21:46,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:21:46,293 INFO L87 Difference]: Start difference. First operand 82542 states and 329856 transitions. Second operand 3 states. [2019-12-27 05:21:47,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:47,188 INFO L93 Difference]: Finished difference Result 82490 states and 329676 transitions. [2019-12-27 05:21:47,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:21:47,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-27 05:21:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:47,386 INFO L225 Difference]: With dead ends: 82490 [2019-12-27 05:21:47,387 INFO L226 Difference]: Without dead ends: 82490 [2019-12-27 05:21:47,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:21:48,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82490 states. [2019-12-27 05:21:52,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82490 to 82490. [2019-12-27 05:21:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82490 states. [2019-12-27 05:21:52,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82490 states to 82490 states and 329676 transitions. [2019-12-27 05:21:52,634 INFO L78 Accepts]: Start accepts. Automaton has 82490 states and 329676 transitions. Word has length 32 [2019-12-27 05:21:52,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:52,634 INFO L462 AbstractCegarLoop]: Abstraction has 82490 states and 329676 transitions. [2019-12-27 05:21:52,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:21:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 82490 states and 329676 transitions. [2019-12-27 05:21:53,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:21:53,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:53,347 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] [2019-12-27 05:21:53,347 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:53,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:53,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1739657011, now seen corresponding path program 1 times [2019-12-27 05:21:53,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:53,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454130012] [2019-12-27 05:21:53,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:21:53,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454130012] [2019-12-27 05:21:53,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:53,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:21:53,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765969962] [2019-12-27 05:21:53,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:21:53,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:53,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:21:53,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:21:53,456 INFO L87 Difference]: Start difference. First operand 82490 states and 329676 transitions. Second operand 3 states. [2019-12-27 05:21:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:53,844 INFO L93 Difference]: Finished difference Result 82490 states and 325052 transitions. [2019-12-27 05:21:53,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:21:53,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 05:21:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:54,068 INFO L225 Difference]: With dead ends: 82490 [2019-12-27 05:21:54,068 INFO L226 Difference]: Without dead ends: 82490 [2019-12-27 05:21:54,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:21:54,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82490 states. [2019-12-27 05:21:56,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82490 to 82170. [2019-12-27 05:21:56,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82170 states. [2019-12-27 05:21:56,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82170 states to 82170 states and 323964 transitions. [2019-12-27 05:21:56,648 INFO L78 Accepts]: Start accepts. Automaton has 82170 states and 323964 transitions. Word has length 33 [2019-12-27 05:21:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:56,648 INFO L462 AbstractCegarLoop]: Abstraction has 82170 states and 323964 transitions. [2019-12-27 05:21:56,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:21:56,649 INFO L276 IsEmpty]: Start isEmpty. Operand 82170 states and 323964 transitions. [2019-12-27 05:21:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 05:21:56,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:56,743 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] [2019-12-27 05:21:56,743 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:56,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:56,743 INFO L82 PathProgramCache]: Analyzing trace with hash -485153628, now seen corresponding path program 1 times [2019-12-27 05:21:56,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:56,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522851705] [2019-12-27 05:21:56,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:56,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:21:56,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522851705] [2019-12-27 05:21:56,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:56,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:21:56,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605691663] [2019-12-27 05:21:56,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:21:56,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:56,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:21:56,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:21:56,834 INFO L87 Difference]: Start difference. First operand 82170 states and 323964 transitions. Second operand 7 states. [2019-12-27 05:22:01,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:01,051 INFO L93 Difference]: Finished difference Result 170674 states and 668780 transitions. [2019-12-27 05:22:01,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 05:22:01,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 05:22:01,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:01,450 INFO L225 Difference]: With dead ends: 170674 [2019-12-27 05:22:01,450 INFO L226 Difference]: Without dead ends: 155982 [2019-12-27 05:22:01,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-27 05:22:02,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155982 states. [2019-12-27 05:22:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155982 to 102172. [2019-12-27 05:22:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102172 states. [2019-12-27 05:22:05,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102172 states to 102172 states and 401969 transitions. [2019-12-27 05:22:05,564 INFO L78 Accepts]: Start accepts. Automaton has 102172 states and 401969 transitions. Word has length 34 [2019-12-27 05:22:05,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:05,564 INFO L462 AbstractCegarLoop]: Abstraction has 102172 states and 401969 transitions. [2019-12-27 05:22:05,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:22:05,564 INFO L276 IsEmpty]: Start isEmpty. Operand 102172 states and 401969 transitions. [2019-12-27 05:22:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 05:22:05,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:05,682 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] [2019-12-27 05:22:05,682 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:05,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:05,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1010363922, now seen corresponding path program 2 times [2019-12-27 05:22:05,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:05,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613393347] [2019-12-27 05:22:05,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:05,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:22:05,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613393347] [2019-12-27 05:22:05,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:05,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:22:05,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261045176] [2019-12-27 05:22:05,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:22:05,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:05,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:22:05,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:22:05,835 INFO L87 Difference]: Start difference. First operand 102172 states and 401969 transitions. Second operand 8 states. [2019-12-27 05:22:11,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:11,799 INFO L93 Difference]: Finished difference Result 199498 states and 786186 transitions. [2019-12-27 05:22:11,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 05:22:11,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 05:22:11,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:12,330 INFO L225 Difference]: With dead ends: 199498 [2019-12-27 05:22:12,331 INFO L226 Difference]: Without dead ends: 189762 [2019-12-27 05:22:12,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-12-27 05:22:13,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189762 states. [2019-12-27 05:22:15,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189762 to 102742. [2019-12-27 05:22:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102742 states. [2019-12-27 05:22:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102742 states to 102742 states and 404528 transitions. [2019-12-27 05:22:16,516 INFO L78 Accepts]: Start accepts. Automaton has 102742 states and 404528 transitions. Word has length 34 [2019-12-27 05:22:16,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:16,516 INFO L462 AbstractCegarLoop]: Abstraction has 102742 states and 404528 transitions. [2019-12-27 05:22:16,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:22:16,516 INFO L276 IsEmpty]: Start isEmpty. Operand 102742 states and 404528 transitions. [2019-12-27 05:22:16,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 05:22:16,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:16,639 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] [2019-12-27 05:22:16,639 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:16,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:16,639 INFO L82 PathProgramCache]: Analyzing trace with hash -475014818, now seen corresponding path program 3 times [2019-12-27 05:22:16,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:16,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46965358] [2019-12-27 05:22:16,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:22:16,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46965358] [2019-12-27 05:22:16,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:16,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:22:16,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825971734] [2019-12-27 05:22:16,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:22:16,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:16,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:22:16,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:22:16,726 INFO L87 Difference]: Start difference. First operand 102742 states and 404528 transitions. Second operand 7 states. [2019-12-27 05:22:18,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:18,268 INFO L93 Difference]: Finished difference Result 176982 states and 695954 transitions. [2019-12-27 05:22:18,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 05:22:18,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 05:22:18,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:23,110 INFO L225 Difference]: With dead ends: 176982 [2019-12-27 05:22:23,111 INFO L226 Difference]: Without dead ends: 167712 [2019-12-27 05:22:23,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-27 05:22:24,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167712 states. [2019-12-27 05:22:26,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167712 to 102196. [2019-12-27 05:22:26,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102196 states. [2019-12-27 05:22:27,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102196 states to 102196 states and 401977 transitions. [2019-12-27 05:22:27,004 INFO L78 Accepts]: Start accepts. Automaton has 102196 states and 401977 transitions. Word has length 34 [2019-12-27 05:22:27,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:27,004 INFO L462 AbstractCegarLoop]: Abstraction has 102196 states and 401977 transitions. [2019-12-27 05:22:27,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:22:27,005 INFO L276 IsEmpty]: Start isEmpty. Operand 102196 states and 401977 transitions. [2019-12-27 05:22:27,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 05:22:27,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:27,144 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] [2019-12-27 05:22:27,144 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:27,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:27,144 INFO L82 PathProgramCache]: Analyzing trace with hash 578018651, now seen corresponding path program 1 times [2019-12-27 05:22:27,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:27,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215122869] [2019-12-27 05:22:27,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:22:27,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215122869] [2019-12-27 05:22:27,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:27,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:22:27,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685004160] [2019-12-27 05:22:27,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:22:27,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:27,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:22:27,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:22:27,209 INFO L87 Difference]: Start difference. First operand 102196 states and 401977 transitions. Second operand 4 states. [2019-12-27 05:22:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:27,627 INFO L93 Difference]: Finished difference Result 60940 states and 210053 transitions. [2019-12-27 05:22:27,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:22:27,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-27 05:22:27,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:27,795 INFO L225 Difference]: With dead ends: 60940 [2019-12-27 05:22:27,796 INFO L226 Difference]: Without dead ends: 55332 [2019-12-27 05:22:27,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:22:28,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55332 states. [2019-12-27 05:22:28,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55332 to 55332. [2019-12-27 05:22:28,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55332 states. [2019-12-27 05:22:29,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55332 states to 55332 states and 190134 transitions. [2019-12-27 05:22:29,880 INFO L78 Accepts]: Start accepts. Automaton has 55332 states and 190134 transitions. Word has length 35 [2019-12-27 05:22:29,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:29,881 INFO L462 AbstractCegarLoop]: Abstraction has 55332 states and 190134 transitions. [2019-12-27 05:22:29,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:22:29,881 INFO L276 IsEmpty]: Start isEmpty. Operand 55332 states and 190134 transitions. [2019-12-27 05:22:29,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 05:22:29,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:29,941 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] [2019-12-27 05:22:29,941 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:29,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:29,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1129783466, now seen corresponding path program 1 times [2019-12-27 05:22:29,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:29,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076453088] [2019-12-27 05:22:29,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:29,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:22:30,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076453088] [2019-12-27 05:22:30,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:30,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:22:30,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596003424] [2019-12-27 05:22:30,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:22:30,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:30,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:22:30,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:22:30,001 INFO L87 Difference]: Start difference. First operand 55332 states and 190134 transitions. Second operand 4 states. [2019-12-27 05:22:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:30,557 INFO L93 Difference]: Finished difference Result 104407 states and 359030 transitions. [2019-12-27 05:22:30,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:22:30,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-27 05:22:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:30,686 INFO L225 Difference]: With dead ends: 104407 [2019-12-27 05:22:30,686 INFO L226 Difference]: Without dead ends: 55384 [2019-12-27 05:22:30,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:22:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55384 states. [2019-12-27 05:22:32,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55384 to 55332. [2019-12-27 05:22:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55332 states. [2019-12-27 05:22:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55332 states to 55332 states and 186039 transitions. [2019-12-27 05:22:32,418 INFO L78 Accepts]: Start accepts. Automaton has 55332 states and 186039 transitions. Word has length 36 [2019-12-27 05:22:32,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:32,418 INFO L462 AbstractCegarLoop]: Abstraction has 55332 states and 186039 transitions. [2019-12-27 05:22:32,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:22:32,418 INFO L276 IsEmpty]: Start isEmpty. Operand 55332 states and 186039 transitions. [2019-12-27 05:22:32,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 05:22:32,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:32,476 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] [2019-12-27 05:22:32,476 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:32,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:32,476 INFO L82 PathProgramCache]: Analyzing trace with hash -140155408, now seen corresponding path program 2 times [2019-12-27 05:22:32,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:32,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362505874] [2019-12-27 05:22:32,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:22:32,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362505874] [2019-12-27 05:22:32,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:32,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:22:32,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418620954] [2019-12-27 05:22:32,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:22:32,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:32,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:22:32,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:22:32,545 INFO L87 Difference]: Start difference. First operand 55332 states and 186039 transitions. Second operand 5 states. [2019-12-27 05:22:32,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:32,635 INFO L93 Difference]: Finished difference Result 10026 states and 28045 transitions. [2019-12-27 05:22:32,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:22:32,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-27 05:22:32,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:32,650 INFO L225 Difference]: With dead ends: 10026 [2019-12-27 05:22:32,650 INFO L226 Difference]: Without dead ends: 7104 [2019-12-27 05:22:32,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:22:32,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2019-12-27 05:22:32,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 7080. [2019-12-27 05:22:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7080 states. [2019-12-27 05:22:32,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7080 states to 7080 states and 17831 transitions. [2019-12-27 05:22:32,801 INFO L78 Accepts]: Start accepts. Automaton has 7080 states and 17831 transitions. Word has length 36 [2019-12-27 05:22:32,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:32,802 INFO L462 AbstractCegarLoop]: Abstraction has 7080 states and 17831 transitions. [2019-12-27 05:22:32,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:22:32,802 INFO L276 IsEmpty]: Start isEmpty. Operand 7080 states and 17831 transitions. [2019-12-27 05:22:32,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 05:22:32,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:32,814 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, 1, 1] [2019-12-27 05:22:32,814 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:32,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:32,815 INFO L82 PathProgramCache]: Analyzing trace with hash -944953888, now seen corresponding path program 1 times [2019-12-27 05:22:32,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:32,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702982902] [2019-12-27 05:22:32,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:22:32,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702982902] [2019-12-27 05:22:32,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:32,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:22:32,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112179763] [2019-12-27 05:22:32,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:22:32,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:32,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:22:32,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:22:32,926 INFO L87 Difference]: Start difference. First operand 7080 states and 17831 transitions. Second operand 6 states. [2019-12-27 05:22:33,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:33,007 INFO L93 Difference]: Finished difference Result 5823 states and 14964 transitions. [2019-12-27 05:22:33,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:22:33,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-27 05:22:33,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:33,013 INFO L225 Difference]: With dead ends: 5823 [2019-12-27 05:22:33,013 INFO L226 Difference]: Without dead ends: 2946 [2019-12-27 05:22:33,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:22:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2019-12-27 05:22:33,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2922. [2019-12-27 05:22:33,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2922 states. [2019-12-27 05:22:33,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 7467 transitions. [2019-12-27 05:22:33,061 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 7467 transitions. Word has length 47 [2019-12-27 05:22:33,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:33,062 INFO L462 AbstractCegarLoop]: Abstraction has 2922 states and 7467 transitions. [2019-12-27 05:22:33,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:22:33,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 7467 transitions. [2019-12-27 05:22:33,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 05:22:33,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:33,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:33,066 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:33,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:33,066 INFO L82 PathProgramCache]: Analyzing trace with hash 682868541, now seen corresponding path program 1 times [2019-12-27 05:22:33,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:33,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991489005] [2019-12-27 05:22:33,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:22:33,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991489005] [2019-12-27 05:22:33,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:33,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:22:33,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712750860] [2019-12-27 05:22:33,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:22:33,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:33,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:22:33,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:22:33,141 INFO L87 Difference]: Start difference. First operand 2922 states and 7467 transitions. Second operand 6 states. [2019-12-27 05:22:33,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:33,306 INFO L93 Difference]: Finished difference Result 5039 states and 12757 transitions. [2019-12-27 05:22:33,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:22:33,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-27 05:22:33,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:33,313 INFO L225 Difference]: With dead ends: 5039 [2019-12-27 05:22:33,313 INFO L226 Difference]: Without dead ends: 4524 [2019-12-27 05:22:33,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:22:33,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4524 states. [2019-12-27 05:22:33,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4524 to 3350. [2019-12-27 05:22:33,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3350 states. [2019-12-27 05:22:33,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 8536 transitions. [2019-12-27 05:22:33,352 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 8536 transitions. Word has length 62 [2019-12-27 05:22:33,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:33,352 INFO L462 AbstractCegarLoop]: Abstraction has 3350 states and 8536 transitions. [2019-12-27 05:22:33,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:22:33,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 8536 transitions. [2019-12-27 05:22:33,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 05:22:33,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:33,356 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:33,356 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:33,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:33,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1657443581, now seen corresponding path program 2 times [2019-12-27 05:22:33,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:33,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473544] [2019-12-27 05:22:33,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:22:33,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473544] [2019-12-27 05:22:33,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:33,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:22:33,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317687527] [2019-12-27 05:22:33,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:22:33,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:33,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:22:33,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:22:33,422 INFO L87 Difference]: Start difference. First operand 3350 states and 8536 transitions. Second operand 4 states. [2019-12-27 05:22:33,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:33,446 INFO L93 Difference]: Finished difference Result 3713 states and 9361 transitions. [2019-12-27 05:22:33,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:22:33,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-27 05:22:33,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:33,447 INFO L225 Difference]: With dead ends: 3713 [2019-12-27 05:22:33,447 INFO L226 Difference]: Without dead ends: 414 [2019-12-27 05:22:33,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:22:33,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-12-27 05:22:33,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2019-12-27 05:22:33,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-12-27 05:22:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 898 transitions. [2019-12-27 05:22:33,453 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 898 transitions. Word has length 62 [2019-12-27 05:22:33,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:33,453 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 898 transitions. [2019-12-27 05:22:33,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:22:33,454 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 898 transitions. [2019-12-27 05:22:33,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 05:22:33,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:33,455 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:33,455 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:33,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:33,455 INFO L82 PathProgramCache]: Analyzing trace with hash 183287320, now seen corresponding path program 1 times [2019-12-27 05:22:33,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:33,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424769041] [2019-12-27 05:22:33,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:33,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:22:33,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424769041] [2019-12-27 05:22:33,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:33,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:22:33,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956027202] [2019-12-27 05:22:33,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:22:33,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:33,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:22:33,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:22:33,538 INFO L87 Difference]: Start difference. First operand 414 states and 898 transitions. Second operand 8 states. [2019-12-27 05:22:33,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:33,731 INFO L93 Difference]: Finished difference Result 890 states and 1901 transitions. [2019-12-27 05:22:33,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:22:33,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 05:22:33,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:33,733 INFO L225 Difference]: With dead ends: 890 [2019-12-27 05:22:33,733 INFO L226 Difference]: Without dead ends: 647 [2019-12-27 05:22:33,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:22:33,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-12-27 05:22:33,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 501. [2019-12-27 05:22:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-12-27 05:22:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1054 transitions. [2019-12-27 05:22:33,740 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 1054 transitions. Word has length 63 [2019-12-27 05:22:33,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:33,741 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 1054 transitions. [2019-12-27 05:22:33,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:22:33,741 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 1054 transitions. [2019-12-27 05:22:33,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 05:22:33,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:33,742 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:33,742 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:33,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:33,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1420483866, now seen corresponding path program 2 times [2019-12-27 05:22:33,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:33,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392027368] [2019-12-27 05:22:33,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:22:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:22:33,917 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:22:33,917 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:22:33,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t272~0.base_23| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t272~0.base_23|) |v_ULTIMATE.start_main_~#t272~0.offset_18| 0)) |v_#memory_int_19|) (= v_~z$w_buff0_used~0_138 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~a~0_9) (= 0 v_~z$r_buff1_thd3~0_41) (= 0 v_~weak$$choice0~0_8) (= v_~main$tmp_guard1~0_16 0) (= v_~z$r_buff0_thd3~0_79 0) (= v_~z$r_buff0_thd1~0_10 0) (= 0 v_~z$r_buff1_thd2~0_32) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~__unbuffered_p1_EBX~0_14 0) (= v_~z~0_28 0) (= v_~z$r_buff1_thd1~0_8 0) (= 0 |v_ULTIMATE.start_main_~#t272~0.offset_18|) (= v_~z$read_delayed~0_8 0) (= 0 v_~__unbuffered_cnt~0_21) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$r_buff0_thd0~0_21 0) (= v_~x~0_10 0) (= 0 v_~z$flush_delayed~0_17) (= v_~z$r_buff0_thd2~0_58 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t272~0.base_23| 1)) (= 0 v_~__unbuffered_p2_EAX~0_15) (= (select .cse0 |v_ULTIMATE.start_main_~#t272~0.base_23|) 0) (= 0 v_~weak$$choice2~0_33) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t272~0.base_23|) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 v_~z$r_buff1_thd0~0_26) (= 0 v_~z$w_buff1_used~0_74) (= 0 v_~__unbuffered_p0_EAX~0_17) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t272~0.base_23| 4)) (= |v_#NULL.offset_5| 0) (= 0 v_~y~0_8) (= 0 v_~z$w_buff1~0_33) (= v_~z$mem_tmp~0_12 0) (= 0 v_~z$w_buff0~0_39) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_32, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t273~0.base=|v_ULTIMATE.start_main_~#t273~0.base_19|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_23|, ULTIMATE.start_main_~#t273~0.offset=|v_ULTIMATE.start_main_~#t273~0.offset_15|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_12|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ULTIMATE.start_main_~#t272~0.base=|v_ULTIMATE.start_main_~#t272~0.base_23|, ~z$flush_delayed~0=v_~z$flush_delayed~0_17, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_24|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_10|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t274~0.offset=|v_ULTIMATE.start_main_~#t274~0.offset_15|, ULTIMATE.start_main_~#t274~0.base=|v_ULTIMATE.start_main_~#t274~0.base_18|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_26, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_58, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_138, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_41, ULTIMATE.start_main_~#t272~0.offset=|v_ULTIMATE.start_main_~#t272~0.offset_18|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_10|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t273~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t273~0.offset, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t272~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t274~0.offset, ULTIMATE.start_main_~#t274~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t272~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:22:33,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L840-1-->L842: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t273~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t273~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t273~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t273~0.base_11| 0)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t273~0.base_11| 4) |v_#length_17|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t273~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t273~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t273~0.base_11|) |v_ULTIMATE.start_main_~#t273~0.offset_10| 1)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t273~0.offset=|v_ULTIMATE.start_main_~#t273~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t273~0.base=|v_ULTIMATE.start_main_~#t273~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t273~0.offset, #length, ULTIMATE.start_main_~#t273~0.base] because there is no mapped edge [2019-12-27 05:22:33,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L842-1-->L844: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t274~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t274~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t274~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t274~0.base_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t274~0.base_9| 1) |v_#valid_27|) (= 0 |v_ULTIMATE.start_main_~#t274~0.offset_8|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t274~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t274~0.base_9|) |v_ULTIMATE.start_main_~#t274~0.offset_8| 2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t274~0.base=|v_ULTIMATE.start_main_~#t274~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t274~0.offset=|v_ULTIMATE.start_main_~#t274~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t274~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t274~0.offset] because there is no mapped edge [2019-12-27 05:22:33,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] P2ENTRY-->L4-3: Formula: (and (= (mod v_~z$w_buff1_used~0_58 256) 0) (= 1 v_~z$w_buff0~0_25) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~z$w_buff0_used~0_108 v_~z$w_buff1_used~0_58) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7) (= v_~z$w_buff0_used~0_107 1) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_~z$w_buff0~0_26 v_~z$w_buff1~0_23)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_108, ~z$w_buff0~0=v_~z$w_buff0~0_26, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~z$w_buff0~0=v_~z$w_buff0~0_25, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_58, ~z$w_buff1~0=v_~z$w_buff1~0_23, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 05:22:33,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1924368991 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1924368991 256) 0))) (or (and (= ~z$w_buff1~0_In1924368991 |P2Thread1of1ForFork0_#t~ite28_Out1924368991|) (or .cse0 .cse1)) (and (not .cse1) (= ~z$w_buff0~0_In1924368991 |P2Thread1of1ForFork0_#t~ite28_Out1924368991|) (not .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1924368991, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1924368991, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1924368991, ~z$w_buff1~0=~z$w_buff1~0_In1924368991} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1924368991|, ~z$w_buff0~0=~z$w_buff0~0_In1924368991, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1924368991, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1924368991, ~z$w_buff1~0=~z$w_buff1~0_In1924368991} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 05:22:33,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L802-4-->L803: Formula: (= v_~z~0_19 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, ~z~0=v_~z~0_19, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, ~z~0, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 05:22:33,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L807-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff0_thd3~0_47) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 05:22:33,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-358688375 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-358688375| ~z$mem_tmp~0_In-358688375) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite48_Out-358688375| ~z~0_In-358688375) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-358688375, ~z$flush_delayed~0=~z$flush_delayed~0_In-358688375, ~z~0=~z~0_In-358688375} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-358688375|, ~z$mem_tmp~0=~z$mem_tmp~0_In-358688375, ~z$flush_delayed~0=~z$flush_delayed~0_In-358688375, ~z~0=~z~0_In-358688375} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-27 05:22:33,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 1 v_~a~0_5) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_5) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_5} OutVars{~a~0=v_~a~0_5, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_5, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 05:22:33,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1547620109 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1547620109 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite51_Out1547620109| ~z$w_buff0_used~0_In1547620109) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out1547620109| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1547620109, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1547620109} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1547620109, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1547620109, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1547620109|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-27 05:22:33,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L819-->L819-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In117783820 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In117783820 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In117783820 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In117783820 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite52_Out117783820|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In117783820 |P2Thread1of1ForFork0_#t~ite52_Out117783820|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In117783820, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In117783820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In117783820, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In117783820} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In117783820, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In117783820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In117783820, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out117783820|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In117783820} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-27 05:22:33,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L820-->L821: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1780449320 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1780449320 256)))) (or (and (= ~z$r_buff0_thd3~0_In-1780449320 ~z$r_buff0_thd3~0_Out-1780449320) (or .cse0 .cse1)) (and (= 0 ~z$r_buff0_thd3~0_Out-1780449320) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1780449320, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1780449320} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1780449320, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1780449320, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1780449320|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-27 05:22:33,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L821-->L821-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-941503622 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-941503622 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-941503622 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-941503622 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-941503622 |P2Thread1of1ForFork0_#t~ite54_Out-941503622|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-941503622|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-941503622, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-941503622, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-941503622, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-941503622} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-941503622, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-941503622|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-941503622, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-941503622, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-941503622} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 05:22:33,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_35 |v_P2Thread1of1ForFork0_#t~ite54_8|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_35, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 05:22:33,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In2072751572 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out2072751572| ~z$mem_tmp~0_In2072751572) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out2072751572| ~z~0_In2072751572)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In2072751572, ~z$flush_delayed~0=~z$flush_delayed~0_In2072751572, ~z~0=~z~0_In2072751572} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In2072751572, ~z$flush_delayed~0=~z$flush_delayed~0_In2072751572, ~z~0=~z~0_In2072751572, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out2072751572|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 05:22:33,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L773-2-->P1EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= |v_P1Thread1of1ForFork2_#t~ite25_8| v_~z~0_24) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_24, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 05:22:33,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] L848-->L850-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_96 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_96, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_96, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 05:22:33,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L850-2-->L850-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In49849097 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In49849097 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out49849097| |ULTIMATE.start_main_#t~ite58_Out49849097|))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out49849097| ~z$w_buff1~0_In49849097) (not .cse0) (not .cse1) .cse2) (and (= ~z~0_In49849097 |ULTIMATE.start_main_#t~ite58_Out49849097|) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In49849097, ~z$w_buff1_used~0=~z$w_buff1_used~0_In49849097, ~z$w_buff1~0=~z$w_buff1~0_In49849097, ~z~0=~z~0_In49849097} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In49849097, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out49849097|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In49849097, ~z$w_buff1~0=~z$w_buff1~0_In49849097, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out49849097|, ~z~0=~z~0_In49849097} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 05:22:33,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1867486756 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1867486756 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out1867486756| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1867486756 |ULTIMATE.start_main_#t~ite60_Out1867486756|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1867486756, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1867486756} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1867486756|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1867486756, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1867486756} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 05:22:33,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L852-->L852-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2110208408 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-2110208408 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2110208408 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2110208408 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-2110208408 |ULTIMATE.start_main_#t~ite61_Out-2110208408|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite61_Out-2110208408|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2110208408, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2110208408, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2110208408, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2110208408} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2110208408, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-2110208408|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2110208408, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2110208408, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2110208408} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 05:22:33,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1494201904 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1494201904 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite62_Out1494201904| 0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In1494201904 |ULTIMATE.start_main_#t~ite62_Out1494201904|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1494201904, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1494201904} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1494201904|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1494201904, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1494201904} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 05:22:33,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-681886150 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-681886150 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-681886150 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-681886150 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-681886150| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite63_Out-681886150| ~z$r_buff1_thd0~0_In-681886150) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-681886150, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-681886150, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-681886150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-681886150} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-681886150|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-681886150, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-681886150, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-681886150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-681886150} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 05:22:33,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1011] [1011] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_10 256)) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start_main_#t~ite63_15| v_~z$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p0_EAX~0_11) (= 1 v_~__unbuffered_p1_EAX~0_9) (= v_~__unbuffered_p2_EAX~0_9 1)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_14|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:22:34,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:22:34 BasicIcfg [2019-12-27 05:22:34,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:22:34,111 INFO L168 Benchmark]: Toolchain (without parser) took 91397.55 ms. Allocated memory was 145.8 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 100.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 05:22:34,118 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 05:22:34,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.13 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 156.2 MB in the end (delta: -55.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:22:34,125 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.50 ms. Allocated memory is still 203.4 MB. Free memory was 156.2 MB in the beginning and 152.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 05:22:34,126 INFO L168 Benchmark]: Boogie Preprocessor took 48.19 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 150.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 05:22:34,127 INFO L168 Benchmark]: RCFGBuilder took 867.48 ms. Allocated memory is still 203.4 MB. Free memory was 150.2 MB in the beginning and 94.8 MB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 7.1 GB. [2019-12-27 05:22:34,127 INFO L168 Benchmark]: TraceAbstraction took 89659.26 ms. Allocated memory was 203.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 94.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 05:22:34,138 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.15 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 739.13 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 156.2 MB in the end (delta: -55.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.50 ms. Allocated memory is still 203.4 MB. Free memory was 156.2 MB in the beginning and 152.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.19 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 150.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 867.48 ms. Allocated memory is still 203.4 MB. Free memory was 150.2 MB in the beginning and 94.8 MB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89659.26 ms. Allocated memory was 203.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 94.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 197 ProgramPointsBefore, 106 ProgramPointsAfterwards, 243 TransitionsBefore, 126 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 30 ChoiceCompositions, 8928 VarBasedMoverChecksPositive, 249 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 134090 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t272, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] FCALL, FORK 0 pthread_create(&t273, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] FCALL, FORK 0 pthread_create(&t274, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L792] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L793] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L794] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L795] 3 z$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L851] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L852] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L853] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 89.2s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 32.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4057 SDtfs, 5806 SDslu, 8726 SDs, 0 SdLazy, 2484 SolverSat, 138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102742occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 45.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 232700 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 679 NumberOfCodeBlocks, 679 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 598 ConstructedInterpolants, 0 QuantifiedInterpolants, 72288 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...