/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix001_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:37:27,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:37:27,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:37:27,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:37:27,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:37:27,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:37:27,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:37:27,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:37:27,684 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:37:27,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:37:27,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:37:27,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:37:27,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:37:27,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:37:27,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:37:27,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:37:27,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:37:27,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:37:27,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:37:27,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:37:27,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:37:27,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:37:27,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:37:27,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:37:27,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:37:27,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:37:27,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:37:27,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:37:27,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:37:27,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:37:27,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:37:27,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:37:27,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:37:27,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:37:27,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:37:27,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:37:27,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:37:27,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:37:27,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:37:27,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:37:27,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:37:27,724 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-MCR.epf [2019-12-27 19:37:27,738 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:37:27,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:37:27,739 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:37:27,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:37:27,740 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:37:27,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:37:27,740 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:37:27,740 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:37:27,740 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:37:27,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:37:27,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:37:27,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:37:27,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:37:27,741 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:37:27,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:37:27,742 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:37:27,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:37:27,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:37:27,742 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:37:27,743 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:37:27,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:37:27,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:37:27,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:37:27,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:37:27,744 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:37:27,744 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:37:27,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:37:27,744 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:37:27,744 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:37:27,745 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:37:27,745 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:37:27,745 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:37:28,013 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:37:28,031 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:37:28,034 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:37:28,036 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:37:28,039 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:37:28,040 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001_rmo.opt.i [2019-12-27 19:37:28,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d90912b/a321c45324294098ae159e3bf6f01f23/FLAG3666b4f41 [2019-12-27 19:37:28,737 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:37:28,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001_rmo.opt.i [2019-12-27 19:37:28,764 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d90912b/a321c45324294098ae159e3bf6f01f23/FLAG3666b4f41 [2019-12-27 19:37:29,022 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d90912b/a321c45324294098ae159e3bf6f01f23 [2019-12-27 19:37:29,030 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:37:29,032 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:37:29,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:37:29,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:37:29,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:37:29,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:37:29" (1/1) ... [2019-12-27 19:37:29,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5be7c6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:29, skipping insertion in model container [2019-12-27 19:37:29,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:37:29" (1/1) ... [2019-12-27 19:37:29,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:37:29,110 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:37:29,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:37:29,669 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:37:29,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:37:29,829 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:37:29,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:29 WrapperNode [2019-12-27 19:37:29,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:37:29,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:37:29,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:37:29,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:37:29,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:29" (1/1) ... [2019-12-27 19:37:29,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:29" (1/1) ... [2019-12-27 19:37:29,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:37:29,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:37:29,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:37:29,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:37:29,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:29" (1/1) ... [2019-12-27 19:37:29,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:29" (1/1) ... [2019-12-27 19:37:29,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:29" (1/1) ... [2019-12-27 19:37:29,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:29" (1/1) ... [2019-12-27 19:37:29,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:29" (1/1) ... [2019-12-27 19:37:29,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:29" (1/1) ... [2019-12-27 19:37:29,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:29" (1/1) ... [2019-12-27 19:37:29,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:37:29,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:37:29,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:37:29,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:37:29,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:29" (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 19:37:30,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:37:30,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 19:37:30,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:37:30,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:37:30,022 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 19:37:30,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 19:37:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 19:37:30,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 19:37:30,024 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 19:37:30,025 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 19:37:30,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 19:37:30,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:37:30,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:37:30,028 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 19:37:30,908 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:37:30,908 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 19:37:30,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:37:30 BoogieIcfgContainer [2019-12-27 19:37:30,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:37:30,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:37:30,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:37:30,918 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:37:30,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:37:29" (1/3) ... [2019-12-27 19:37:30,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5378dd05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:37:30, skipping insertion in model container [2019-12-27 19:37:30,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:29" (2/3) ... [2019-12-27 19:37:30,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5378dd05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:37:30, skipping insertion in model container [2019-12-27 19:37:30,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:37:30" (3/3) ... [2019-12-27 19:37:30,925 INFO L109 eAbstractionObserver]: Analyzing ICFG mix001_rmo.opt.i [2019-12-27 19:37:30,935 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:37:30,936 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:37:30,952 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 19:37:30,953 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:37:31,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,028 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,028 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,031 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,031 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,051 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,051 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,052 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,052 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,052 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,085 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,085 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,087 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,093 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,094 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,101 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,104 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:37:31,119 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 19:37:31,143 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:37:31,143 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:37:31,143 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:37:31,143 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:37:31,143 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:37:31,143 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:37:31,144 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:37:31,144 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:37:31,162 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-27 19:37:31,163 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-27 19:37:31,276 INFO L132 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-27 19:37:31,276 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:37:31,293 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 561 event pairs. 0/182 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 19:37:31,322 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-27 19:37:31,385 INFO L132 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-27 19:37:31,385 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:37:31,397 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 561 event pairs. 0/182 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 19:37:31,429 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-27 19:37:31,431 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:37:35,681 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 19:37:35,818 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 19:37:35,847 INFO L206 etLargeBlockEncoding]: Checked pairs total: 134958 [2019-12-27 19:37:35,847 INFO L214 etLargeBlockEncoding]: Total number of compositions: 125 [2019-12-27 19:37:35,851 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 127 transitions [2019-12-27 19:37:39,584 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 43566 states. [2019-12-27 19:37:39,586 INFO L276 IsEmpty]: Start isEmpty. Operand 43566 states. [2019-12-27 19:37:39,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 19:37:39,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:37:39,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:37:39,595 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 19:37:39,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:37:39,600 INFO L82 PathProgramCache]: Analyzing trace with hash -616580539, now seen corresponding path program 1 times [2019-12-27 19:37:39,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:37:39,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243277414] [2019-12-27 19:37:39,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:37:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:37:39,891 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 19:37:39,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243277414] [2019-12-27 19:37:39,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:37:39,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:37:39,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [547002681] [2019-12-27 19:37:39,897 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:37:39,901 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:37:39,916 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 19:37:39,916 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:37:39,921 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:37:39,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:37:39,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:37:39,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:37:39,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:37:39,939 INFO L87 Difference]: Start difference. First operand 43566 states. Second operand 3 states. [2019-12-27 19:37:41,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:37:41,012 INFO L93 Difference]: Finished difference Result 43014 states and 174370 transitions. [2019-12-27 19:37:41,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:37:41,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 19:37:41,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:37:41,402 INFO L225 Difference]: With dead ends: 43014 [2019-12-27 19:37:41,403 INFO L226 Difference]: Without dead ends: 40044 [2019-12-27 19:37:41,404 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 19:37:42,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40044 states. [2019-12-27 19:37:44,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40044 to 40044. [2019-12-27 19:37:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40044 states. [2019-12-27 19:37:45,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40044 states to 40044 states and 162217 transitions. [2019-12-27 19:37:45,116 INFO L78 Accepts]: Start accepts. Automaton has 40044 states and 162217 transitions. Word has length 7 [2019-12-27 19:37:45,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:37:45,118 INFO L462 AbstractCegarLoop]: Abstraction has 40044 states and 162217 transitions. [2019-12-27 19:37:45,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:37:45,120 INFO L276 IsEmpty]: Start isEmpty. Operand 40044 states and 162217 transitions. [2019-12-27 19:37:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:37:45,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:37:45,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:37:45,136 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 19:37:45,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:37:45,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1408183665, now seen corresponding path program 1 times [2019-12-27 19:37:45,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:37:45,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489717864] [2019-12-27 19:37:45,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:37:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:37:45,277 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 19:37:45,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489717864] [2019-12-27 19:37:45,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:37:45,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:37:45,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [166540768] [2019-12-27 19:37:45,278 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:37:45,280 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:37:45,284 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:37:45,284 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:37:45,284 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:37:45,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:37:45,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:37:45,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:37:45,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:37:45,287 INFO L87 Difference]: Start difference. First operand 40044 states and 162217 transitions. Second operand 4 states. [2019-12-27 19:37:47,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:37:47,853 INFO L93 Difference]: Finished difference Result 63338 states and 247308 transitions. [2019-12-27 19:37:47,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:37:47,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 19:37:47,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:37:48,195 INFO L225 Difference]: With dead ends: 63338 [2019-12-27 19:37:48,195 INFO L226 Difference]: Without dead ends: 63310 [2019-12-27 19:37:48,196 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 19:37:48,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63310 states. [2019-12-27 19:37:50,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63310 to 60640. [2019-12-27 19:37:50,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60640 states. [2019-12-27 19:37:50,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60640 states to 60640 states and 238729 transitions. [2019-12-27 19:37:50,634 INFO L78 Accepts]: Start accepts. Automaton has 60640 states and 238729 transitions. Word has length 13 [2019-12-27 19:37:50,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:37:50,634 INFO L462 AbstractCegarLoop]: Abstraction has 60640 states and 238729 transitions. [2019-12-27 19:37:50,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:37:50,635 INFO L276 IsEmpty]: Start isEmpty. Operand 60640 states and 238729 transitions. [2019-12-27 19:37:50,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:37:50,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:37:50,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:37:50,640 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 19:37:50,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:37:50,640 INFO L82 PathProgramCache]: Analyzing trace with hash -903300069, now seen corresponding path program 1 times [2019-12-27 19:37:50,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:37:50,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139396210] [2019-12-27 19:37:50,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:37:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:37:50,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 19:37:50,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139396210] [2019-12-27 19:37:50,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:37:50,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:37:50,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1403239769] [2019-12-27 19:37:50,725 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:37:50,728 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:37:50,732 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 19:37:50,732 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:37:50,768 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:37:50,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:37:50,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:37:50,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:37:50,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:37:50,769 INFO L87 Difference]: Start difference. First operand 60640 states and 238729 transitions. Second operand 5 states. [2019-12-27 19:37:53,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:37:53,712 INFO L93 Difference]: Finished difference Result 77848 states and 302341 transitions. [2019-12-27 19:37:53,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:37:53,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 19:37:53,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:37:54,043 INFO L225 Difference]: With dead ends: 77848 [2019-12-27 19:37:54,043 INFO L226 Difference]: Without dead ends: 77820 [2019-12-27 19:37:54,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:37:54,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77820 states. [2019-12-27 19:37:56,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77820 to 68750. [2019-12-27 19:37:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68750 states. [2019-12-27 19:37:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68750 states to 68750 states and 269586 transitions. [2019-12-27 19:37:56,389 INFO L78 Accepts]: Start accepts. Automaton has 68750 states and 269586 transitions. Word has length 16 [2019-12-27 19:37:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:37:56,389 INFO L462 AbstractCegarLoop]: Abstraction has 68750 states and 269586 transitions. [2019-12-27 19:37:56,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:37:56,389 INFO L276 IsEmpty]: Start isEmpty. Operand 68750 states and 269586 transitions. [2019-12-27 19:37:56,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:37:56,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:37:56,399 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 19:37:56,399 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 19:37:56,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:37:56,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1875943098, now seen corresponding path program 1 times [2019-12-27 19:37:56,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:37:56,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044879570] [2019-12-27 19:37:56,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:37:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:37:56,463 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 19:37:56,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044879570] [2019-12-27 19:37:56,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:37:56,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:37:56,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [320833988] [2019-12-27 19:37:56,464 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:37:56,469 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:37:56,472 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 18 transitions. [2019-12-27 19:37:56,473 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:37:56,473 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:37:56,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:37:56,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:37:56,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:37:56,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:37:56,475 INFO L87 Difference]: Start difference. First operand 68750 states and 269586 transitions. Second operand 3 states. [2019-12-27 19:37:57,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:37:57,460 INFO L93 Difference]: Finished difference Result 65858 states and 256753 transitions. [2019-12-27 19:37:57,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:37:57,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 19:37:57,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:37:57,638 INFO L225 Difference]: With dead ends: 65858 [2019-12-27 19:37:57,638 INFO L226 Difference]: Without dead ends: 65858 [2019-12-27 19:37:57,639 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 19:37:58,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65858 states. [2019-12-27 19:37:59,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65858 to 65858. [2019-12-27 19:37:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65858 states. [2019-12-27 19:38:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65858 states to 65858 states and 256753 transitions. [2019-12-27 19:38:03,720 INFO L78 Accepts]: Start accepts. Automaton has 65858 states and 256753 transitions. Word has length 18 [2019-12-27 19:38:03,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:38:03,720 INFO L462 AbstractCegarLoop]: Abstraction has 65858 states and 256753 transitions. [2019-12-27 19:38:03,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:38:03,721 INFO L276 IsEmpty]: Start isEmpty. Operand 65858 states and 256753 transitions. [2019-12-27 19:38:03,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:38:03,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:38:03,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:38:03,730 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 19:38:03,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:38:03,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1842577503, now seen corresponding path program 1 times [2019-12-27 19:38:03,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:38:03,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841925893] [2019-12-27 19:38:03,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:38:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:38:03,798 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 19:38:03,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841925893] [2019-12-27 19:38:03,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:38:03,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:38:03,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [171709259] [2019-12-27 19:38:03,799 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:38:03,801 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:38:03,804 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 27 transitions. [2019-12-27 19:38:03,804 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:38:03,805 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:38:03,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:38:03,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:38:03,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:38:03,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:38:03,806 INFO L87 Difference]: Start difference. First operand 65858 states and 256753 transitions. Second operand 3 states. [2019-12-27 19:38:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:38:04,124 INFO L93 Difference]: Finished difference Result 63720 states and 249248 transitions. [2019-12-27 19:38:04,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:38:04,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-27 19:38:04,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:38:04,267 INFO L225 Difference]: With dead ends: 63720 [2019-12-27 19:38:04,267 INFO L226 Difference]: Without dead ends: 63552 [2019-12-27 19:38:04,268 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 19:38:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63552 states. [2019-12-27 19:38:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63552 to 63552. [2019-12-27 19:38:06,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63552 states. [2019-12-27 19:38:06,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63552 states to 63552 states and 248652 transitions. [2019-12-27 19:38:06,701 INFO L78 Accepts]: Start accepts. Automaton has 63552 states and 248652 transitions. Word has length 19 [2019-12-27 19:38:06,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:38:06,701 INFO L462 AbstractCegarLoop]: Abstraction has 63552 states and 248652 transitions. [2019-12-27 19:38:06,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:38:06,701 INFO L276 IsEmpty]: Start isEmpty. Operand 63552 states and 248652 transitions. [2019-12-27 19:38:06,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:38:06,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:38:06,720 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 19:38:06,720 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 19:38:06,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:38:06,720 INFO L82 PathProgramCache]: Analyzing trace with hash -813341911, now seen corresponding path program 1 times [2019-12-27 19:38:06,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:38:06,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992654232] [2019-12-27 19:38:06,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:38:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:38:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:38:06,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992654232] [2019-12-27 19:38:06,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:38:06,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:38:06,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [564126959] [2019-12-27 19:38:06,800 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:38:06,803 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:38:06,811 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 72 transitions. [2019-12-27 19:38:06,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:38:06,812 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:38:06,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:38:06,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:38:06,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:38:06,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:38:06,813 INFO L87 Difference]: Start difference. First operand 63552 states and 248652 transitions. Second operand 5 states. [2019-12-27 19:38:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:38:07,761 INFO L93 Difference]: Finished difference Result 75918 states and 293174 transitions. [2019-12-27 19:38:07,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:38:07,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 19:38:07,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:38:07,958 INFO L225 Difference]: With dead ends: 75918 [2019-12-27 19:38:07,958 INFO L226 Difference]: Without dead ends: 75866 [2019-12-27 19:38:07,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 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 19:38:09,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75866 states. [2019-12-27 19:38:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75866 to 63240. [2019-12-27 19:38:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63240 states. [2019-12-27 19:38:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63240 states to 63240 states and 247578 transitions. [2019-12-27 19:38:13,654 INFO L78 Accepts]: Start accepts. Automaton has 63240 states and 247578 transitions. Word has length 22 [2019-12-27 19:38:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:38:13,655 INFO L462 AbstractCegarLoop]: Abstraction has 63240 states and 247578 transitions. [2019-12-27 19:38:13,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:38:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 63240 states and 247578 transitions. [2019-12-27 19:38:13,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 19:38:13,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:38:13,731 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 19:38:13,731 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 19:38:13,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:38:13,731 INFO L82 PathProgramCache]: Analyzing trace with hash 905995009, now seen corresponding path program 1 times [2019-12-27 19:38:13,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:38:13,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554174151] [2019-12-27 19:38:13,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:38:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:38:13,811 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 19:38:13,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554174151] [2019-12-27 19:38:13,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:38:13,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:38:13,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1368767102] [2019-12-27 19:38:13,813 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:38:13,820 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:38:13,841 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 132 transitions. [2019-12-27 19:38:13,841 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:38:13,894 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:38:13,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:38:13,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:38:13,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:38:13,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:38:13,895 INFO L87 Difference]: Start difference. First operand 63240 states and 247578 transitions. Second operand 8 states. [2019-12-27 19:38:16,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:38:16,277 INFO L93 Difference]: Finished difference Result 143092 states and 559760 transitions. [2019-12-27 19:38:16,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 19:38:16,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 19:38:16,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:38:16,610 INFO L225 Difference]: With dead ends: 143092 [2019-12-27 19:38:16,610 INFO L226 Difference]: Without dead ends: 121792 [2019-12-27 19:38:16,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:38:17,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121792 states. [2019-12-27 19:38:22,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121792 to 92036. [2019-12-27 19:38:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92036 states. [2019-12-27 19:38:22,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92036 states to 92036 states and 365860 transitions. [2019-12-27 19:38:22,803 INFO L78 Accepts]: Start accepts. Automaton has 92036 states and 365860 transitions. Word has length 33 [2019-12-27 19:38:22,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:38:22,803 INFO L462 AbstractCegarLoop]: Abstraction has 92036 states and 365860 transitions. [2019-12-27 19:38:22,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:38:22,804 INFO L276 IsEmpty]: Start isEmpty. Operand 92036 states and 365860 transitions. [2019-12-27 19:38:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 19:38:22,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:38:22,931 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 19:38:22,931 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 19:38:22,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:38:22,931 INFO L82 PathProgramCache]: Analyzing trace with hash 830115435, now seen corresponding path program 2 times [2019-12-27 19:38:22,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:38:22,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457275505] [2019-12-27 19:38:22,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:38:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:38:22,989 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 19:38:22,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457275505] [2019-12-27 19:38:22,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:38:22,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:38:22,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [337999023] [2019-12-27 19:38:22,990 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:38:22,996 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:38:23,016 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 140 transitions. [2019-12-27 19:38:23,017 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:38:23,018 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:38:23,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:38:23,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:38:23,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:38:23,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:38:23,019 INFO L87 Difference]: Start difference. First operand 92036 states and 365860 transitions. Second operand 3 states. [2019-12-27 19:38:23,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:38:23,461 INFO L93 Difference]: Finished difference Result 92010 states and 365783 transitions. [2019-12-27 19:38:23,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:38:23,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 19:38:23,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:38:23,699 INFO L225 Difference]: With dead ends: 92010 [2019-12-27 19:38:23,699 INFO L226 Difference]: Without dead ends: 92010 [2019-12-27 19:38:23,699 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 19:38:24,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92010 states. [2019-12-27 19:38:26,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92010 to 92010. [2019-12-27 19:38:26,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92010 states. [2019-12-27 19:38:32,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92010 states to 92010 states and 365783 transitions. [2019-12-27 19:38:32,473 INFO L78 Accepts]: Start accepts. Automaton has 92010 states and 365783 transitions. Word has length 33 [2019-12-27 19:38:32,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:38:32,473 INFO L462 AbstractCegarLoop]: Abstraction has 92010 states and 365783 transitions. [2019-12-27 19:38:32,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:38:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 92010 states and 365783 transitions. [2019-12-27 19:38:32,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 19:38:32,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:38:32,609 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 19:38:32,609 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 19:38:32,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:38:32,609 INFO L82 PathProgramCache]: Analyzing trace with hash -893352396, now seen corresponding path program 1 times [2019-12-27 19:38:32,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:38:32,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646668914] [2019-12-27 19:38:32,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:38:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:38:32,710 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 19:38:32,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646668914] [2019-12-27 19:38:32,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:38:32,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:38:32,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [630374464] [2019-12-27 19:38:32,712 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:38:32,718 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:38:32,741 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 160 transitions. [2019-12-27 19:38:32,742 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:38:32,745 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:38:32,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:38:32,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:38:32,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:38:32,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:38:32,746 INFO L87 Difference]: Start difference. First operand 92010 states and 365783 transitions. Second operand 3 states. [2019-12-27 19:38:33,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:38:33,173 INFO L93 Difference]: Finished difference Result 92010 states and 361019 transitions. [2019-12-27 19:38:33,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:38:33,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-27 19:38:33,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:38:33,398 INFO L225 Difference]: With dead ends: 92010 [2019-12-27 19:38:33,398 INFO L226 Difference]: Without dead ends: 92010 [2019-12-27 19:38:33,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 19:38:34,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92010 states. [2019-12-27 19:38:35,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92010 to 91690. [2019-12-27 19:38:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91690 states. [2019-12-27 19:38:35,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91690 states to 91690 states and 359931 transitions. [2019-12-27 19:38:35,951 INFO L78 Accepts]: Start accepts. Automaton has 91690 states and 359931 transitions. Word has length 34 [2019-12-27 19:38:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:38:35,951 INFO L462 AbstractCegarLoop]: Abstraction has 91690 states and 359931 transitions. [2019-12-27 19:38:35,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:38:35,952 INFO L276 IsEmpty]: Start isEmpty. Operand 91690 states and 359931 transitions. [2019-12-27 19:38:36,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 19:38:36,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:38:36,072 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 19:38:36,072 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 19:38:36,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:38:36,073 INFO L82 PathProgramCache]: Analyzing trace with hash 641538334, now seen corresponding path program 1 times [2019-12-27 19:38:36,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:38:36,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010998077] [2019-12-27 19:38:36,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:38:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:38:36,201 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 19:38:36,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010998077] [2019-12-27 19:38:36,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:38:36,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:38:36,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [199948789] [2019-12-27 19:38:36,203 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:38:36,213 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:38:36,240 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 128 transitions. [2019-12-27 19:38:36,240 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:38:36,278 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:38:36,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:38:36,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:38:36,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:38:36,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:38:36,280 INFO L87 Difference]: Start difference. First operand 91690 states and 359931 transitions. Second operand 7 states. [2019-12-27 19:38:38,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:38:38,975 INFO L93 Difference]: Finished difference Result 290417 states and 1137602 transitions. [2019-12-27 19:38:38,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 19:38:38,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-27 19:38:38,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:38:39,658 INFO L225 Difference]: With dead ends: 290417 [2019-12-27 19:38:39,658 INFO L226 Difference]: Without dead ends: 247923 [2019-12-27 19:38:39,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:38:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247923 states. [2019-12-27 19:38:50,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247923 to 135952. [2019-12-27 19:38:50,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135952 states. [2019-12-27 19:38:51,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135952 states to 135952 states and 538298 transitions. [2019-12-27 19:38:51,649 INFO L78 Accepts]: Start accepts. Automaton has 135952 states and 538298 transitions. Word has length 35 [2019-12-27 19:38:51,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:38:51,649 INFO L462 AbstractCegarLoop]: Abstraction has 135952 states and 538298 transitions. [2019-12-27 19:38:51,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:38:51,649 INFO L276 IsEmpty]: Start isEmpty. Operand 135952 states and 538298 transitions. [2019-12-27 19:38:51,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 19:38:51,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:38:51,869 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 19:38:51,869 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 19:38:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:38:51,869 INFO L82 PathProgramCache]: Analyzing trace with hash -886308380, now seen corresponding path program 2 times [2019-12-27 19:38:51,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:38:51,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030502603] [2019-12-27 19:38:51,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:38:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:38:51,942 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 19:38:51,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030502603] [2019-12-27 19:38:51,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:38:51,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:38:51,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1223033659] [2019-12-27 19:38:51,943 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:38:51,950 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:38:51,979 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 138 transitions. [2019-12-27 19:38:51,979 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:38:51,982 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:38:51,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:38:51,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:38:51,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:38:51,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:38:51,983 INFO L87 Difference]: Start difference. First operand 135952 states and 538298 transitions. Second operand 5 states. [2019-12-27 19:38:52,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:38:52,162 INFO L93 Difference]: Finished difference Result 17768 states and 60868 transitions. [2019-12-27 19:38:52,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:38:52,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-27 19:38:52,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:38:52,194 INFO L225 Difference]: With dead ends: 17768 [2019-12-27 19:38:52,194 INFO L226 Difference]: Without dead ends: 9894 [2019-12-27 19:38:52,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 19:38:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9894 states. [2019-12-27 19:38:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9894 to 9894. [2019-12-27 19:38:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9894 states. [2019-12-27 19:38:52,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9894 states to 9894 states and 28902 transitions. [2019-12-27 19:38:52,422 INFO L78 Accepts]: Start accepts. Automaton has 9894 states and 28902 transitions. Word has length 35 [2019-12-27 19:38:52,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:38:52,422 INFO L462 AbstractCegarLoop]: Abstraction has 9894 states and 28902 transitions. [2019-12-27 19:38:52,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:38:52,422 INFO L276 IsEmpty]: Start isEmpty. Operand 9894 states and 28902 transitions. [2019-12-27 19:38:52,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 19:38:52,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:38:52,437 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 19:38:52,437 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 19:38:52,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:38:52,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1591197695, now seen corresponding path program 1 times [2019-12-27 19:38:52,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:38:52,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159265544] [2019-12-27 19:38:52,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:38:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:38:52,519 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 19:38:52,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159265544] [2019-12-27 19:38:52,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:38:52,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:38:52,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [974228713] [2019-12-27 19:38:52,520 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:38:52,531 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:38:52,560 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 72 transitions. [2019-12-27 19:38:52,560 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:38:52,561 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:38:52,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:38:52,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:38:52,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:38:52,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:38:52,562 INFO L87 Difference]: Start difference. First operand 9894 states and 28902 transitions. Second operand 4 states. [2019-12-27 19:38:52,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:38:52,615 INFO L93 Difference]: Finished difference Result 10898 states and 31170 transitions. [2019-12-27 19:38:52,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:38:52,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-27 19:38:52,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:38:52,629 INFO L225 Difference]: With dead ends: 10898 [2019-12-27 19:38:52,629 INFO L226 Difference]: Without dead ends: 9905 [2019-12-27 19:38:52,630 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 19:38:52,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9905 states. [2019-12-27 19:38:52,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9905 to 9887. [2019-12-27 19:38:52,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9887 states. [2019-12-27 19:38:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9887 states to 9887 states and 28817 transitions. [2019-12-27 19:38:52,758 INFO L78 Accepts]: Start accepts. Automaton has 9887 states and 28817 transitions. Word has length 47 [2019-12-27 19:38:52,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:38:52,758 INFO L462 AbstractCegarLoop]: Abstraction has 9887 states and 28817 transitions. [2019-12-27 19:38:52,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:38:52,758 INFO L276 IsEmpty]: Start isEmpty. Operand 9887 states and 28817 transitions. [2019-12-27 19:38:52,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 19:38:52,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:38:52,769 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 19:38:52,769 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 19:38:52,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:38:52,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1988438419, now seen corresponding path program 2 times [2019-12-27 19:38:52,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:38:52,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079034900] [2019-12-27 19:38:52,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:38:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:38:52,830 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 19:38:52,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079034900] [2019-12-27 19:38:52,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:38:52,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:38:52,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [537461851] [2019-12-27 19:38:52,831 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:38:52,843 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:38:52,872 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 72 transitions. [2019-12-27 19:38:52,872 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:38:52,883 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:38:52,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:38:52,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:38:52,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:38:52,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:38:52,884 INFO L87 Difference]: Start difference. First operand 9887 states and 28817 transitions. Second operand 5 states. [2019-12-27 19:38:53,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:38:53,235 INFO L93 Difference]: Finished difference Result 21991 states and 61964 transitions. [2019-12-27 19:38:53,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:38:53,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-27 19:38:53,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:38:53,249 INFO L225 Difference]: With dead ends: 21991 [2019-12-27 19:38:53,249 INFO L226 Difference]: Without dead ends: 9478 [2019-12-27 19:38:53,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:38:53,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9478 states. [2019-12-27 19:38:53,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9478 to 5805. [2019-12-27 19:38:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5805 states. [2019-12-27 19:38:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5805 states to 5805 states and 14340 transitions. [2019-12-27 19:38:53,331 INFO L78 Accepts]: Start accepts. Automaton has 5805 states and 14340 transitions. Word has length 47 [2019-12-27 19:38:53,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:38:53,331 INFO L462 AbstractCegarLoop]: Abstraction has 5805 states and 14340 transitions. [2019-12-27 19:38:53,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:38:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 5805 states and 14340 transitions. [2019-12-27 19:38:53,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 19:38:53,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:38:53,336 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 19:38:53,337 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 19:38:53,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:38:53,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1930278651, now seen corresponding path program 3 times [2019-12-27 19:38:53,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:38:53,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010945284] [2019-12-27 19:38:53,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:38:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:38:53,428 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 19:38:53,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010945284] [2019-12-27 19:38:53,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:38:53,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:38:53,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [299194524] [2019-12-27 19:38:53,430 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:38:53,441 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:38:53,474 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 83 transitions. [2019-12-27 19:38:53,475 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:38:53,491 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:38:53,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:38:53,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:38:53,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:38:53,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:38:53,492 INFO L87 Difference]: Start difference. First operand 5805 states and 14340 transitions. Second operand 7 states. [2019-12-27 19:38:53,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:38:53,718 INFO L93 Difference]: Finished difference Result 4338 states and 10950 transitions. [2019-12-27 19:38:53,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:38:53,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-27 19:38:53,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:38:53,720 INFO L225 Difference]: With dead ends: 4338 [2019-12-27 19:38:53,720 INFO L226 Difference]: Without dead ends: 438 [2019-12-27 19:38:53,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:38:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-27 19:38:53,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 432. [2019-12-27 19:38:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-12-27 19:38:53,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 927 transitions. [2019-12-27 19:38:53,726 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 927 transitions. Word has length 47 [2019-12-27 19:38:53,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:38:53,726 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 927 transitions. [2019-12-27 19:38:53,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:38:53,726 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 927 transitions. [2019-12-27 19:38:53,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 19:38:53,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:38:53,727 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 19:38:53,727 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 19:38:53,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:38:53,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1123212478, now seen corresponding path program 1 times [2019-12-27 19:38:53,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:38:53,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492103256] [2019-12-27 19:38:53,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:38:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:38:53,824 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 19:38:53,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492103256] [2019-12-27 19:38:53,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:38:53,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:38:53,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1095221146] [2019-12-27 19:38:53,826 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:38:53,845 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:38:54,705 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 157 transitions. [2019-12-27 19:38:54,705 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:38:54,740 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 19:38:54,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:38:54,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:38:54,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:38:54,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:38:54,741 INFO L87 Difference]: Start difference. First operand 432 states and 927 transitions. Second operand 8 states. [2019-12-27 19:38:54,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:38:54,954 INFO L93 Difference]: Finished difference Result 926 states and 1962 transitions. [2019-12-27 19:38:54,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 19:38:54,954 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 19:38:54,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:38:54,956 INFO L225 Difference]: With dead ends: 926 [2019-12-27 19:38:54,956 INFO L226 Difference]: Without dead ends: 683 [2019-12-27 19:38:54,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:38:54,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-12-27 19:38:54,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 519. [2019-12-27 19:38:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-12-27 19:38:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1081 transitions. [2019-12-27 19:38:54,964 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 1081 transitions. Word has length 63 [2019-12-27 19:38:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:38:54,965 INFO L462 AbstractCegarLoop]: Abstraction has 519 states and 1081 transitions. [2019-12-27 19:38:54,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:38:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1081 transitions. [2019-12-27 19:38:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 19:38:54,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:38:54,967 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 19:38:54,967 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 19:38:54,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:38:54,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1377954014, now seen corresponding path program 2 times [2019-12-27 19:38:54,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:38:54,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144529068] [2019-12-27 19:38:54,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:38:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:38:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:38:55,202 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:38:55,202 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:38:55,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_58| 0 0))) (and (= v_~y$w_buff1_used~0_73 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= v_~main$tmp_guard1~0_18 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$r_buff1_thd2~0_31) (= v_~__unbuffered_p1_EBX~0_14 0) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard0~0_12 0) (= v_~y~0_30 0) (= v_~y$r_buff0_thd1~0_9 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= 0 v_~weak$$choice2~0_34) (= v_~x~0_10 0) (= 0 v_~y$w_buff1~0_31) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$mem_tmp~0_11 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#valid_56| (store .cse0 |v_ULTIMATE.start_main_~#t29~0.base_24| 1)) (= v_~y$r_buff1_thd1~0_9 0) (= v_~y$r_buff0_thd3~0_76 0) (= 0 v_~y$flush_delayed~0_18) (= 0 v_~__unbuffered_cnt~0_19) (= (select .cse0 |v_ULTIMATE.start_main_~#t29~0.base_24|) 0) (= 0 v_~y$w_buff0~0_37) (= v_~y$r_buff0_thd0~0_21 0) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~y$r_buff0_thd2~0_55 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t29~0.base_24| 4)) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 v_~z~0_9) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~y$w_buff0_used~0_133 0) (= v_~__unbuffered_p0_EBX~0_16 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t29~0.base_24| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t29~0.base_24|) |v_ULTIMATE.start_main_~#t29~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~y$r_buff1_thd3~0_39) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t29~0.base_24|) (= 0 |v_ULTIMATE.start_main_~#t29~0.offset_19|) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_~#t31~0.base=|v_ULTIMATE.start_main_~#t31~0.base_19|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_18, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_16, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_13|, ULTIMATE.start_main_~#t30~0.offset=|v_ULTIMATE.start_main_~#t30~0.offset_16|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_25|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_11|, ~y$w_buff1~0=v_~y$w_buff1~0_31, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t29~0.base=|v_ULTIMATE.start_main_~#t29~0.base_24|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ULTIMATE.start_main_~#t30~0.base=|v_ULTIMATE.start_main_~#t30~0.base_20|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t29~0.offset=|v_ULTIMATE.start_main_~#t29~0.offset_19|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_133, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ULTIMATE.start_main_~#t31~0.offset=|v_ULTIMATE.start_main_~#t31~0.offset_16|, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_76, ~y~0=v_~y~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_11|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_31, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_73} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t31~0.base, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t30~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t29~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t30~0.base, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t29~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t31~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 19:38:55,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L840-1-->L842: Formula: (and (not (= |v_ULTIMATE.start_main_~#t30~0.base_11| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t30~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t30~0.base_11|) |v_ULTIMATE.start_main_~#t30~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t30~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t30~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t30~0.base_11|) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t30~0.base_11| 1) |v_#valid_32|) (= |v_ULTIMATE.start_main_~#t30~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t30~0.offset=|v_ULTIMATE.start_main_~#t30~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_~#t30~0.base=|v_ULTIMATE.start_main_~#t30~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t30~0.offset, #length, ULTIMATE.start_main_~#t30~0.base] because there is no mapped edge [2019-12-27 19:38:55,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L842-1-->L844: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t31~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t31~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t31~0.base_11|) |v_ULTIMATE.start_main_~#t31~0.offset_10| 2)) |v_#memory_int_13|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t31~0.base_11|) 0) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t31~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t31~0.base_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t31~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t31~0.offset_10| 0)) 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_~#t31~0.base=|v_ULTIMATE.start_main_~#t31~0.base_11|, ULTIMATE.start_main_~#t31~0.offset=|v_ULTIMATE.start_main_~#t31~0.offset_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t31~0.base, ULTIMATE.start_main_~#t31~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-27 19:38:55,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] P2ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_57 256) 0) (= v_~y$w_buff0~0_26 v_~y$w_buff1~0_21) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7) (= 1 v_~y$w_buff0~0_25) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_~y$w_buff0_used~0_104 1) (= v_~y$w_buff1_used~0_57 v_~y$w_buff0_used~0_105)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff0~0=v_~y$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|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_21, ~y$w_buff0~0=v_~y$w_buff0~0_25, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 19:38:55,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L802-2-->L802-4: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1758869492 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1758869492 256)))) (or (and (= ~y$w_buff1~0_In-1758869492 |P2Thread1of1ForFork0_#t~ite28_Out-1758869492|) (or .cse0 .cse1)) (and (not .cse1) (= ~y$w_buff0~0_In-1758869492 |P2Thread1of1ForFork0_#t~ite28_Out-1758869492|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758869492, ~y$w_buff1~0=~y$w_buff1~0_In-1758869492, ~y$w_buff0~0=~y$w_buff0~0_In-1758869492, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1758869492} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1758869492|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758869492, ~y$w_buff1~0=~y$w_buff1~0_In-1758869492, ~y$w_buff0~0=~y$w_buff0~0_In-1758869492, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1758869492} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 19:38:55,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L802-4-->L803: Formula: (= v_~y~0_18 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-27 19:38:55,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L807-->L808: Formula: (and (= v_~y$r_buff0_thd3~0_46 v_~y$r_buff0_thd3~0_45) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_46, ~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|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 19:38:55,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1276646497 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out1276646497| ~y~0_In1276646497)) (and (= |P2Thread1of1ForFork0_#t~ite48_Out1276646497| ~y$mem_tmp~0_In1276646497) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1276646497, ~y$flush_delayed~0=~y$flush_delayed~0_In1276646497, ~y~0=~y~0_In1276646497} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out1276646497|, ~y$mem_tmp~0=~y$mem_tmp~0_In1276646497, ~y$flush_delayed~0=~y$flush_delayed~0_In1276646497, ~y~0=~y~0_In1276646497} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-27 19:38:55,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_4 |v_P0Thread1of1ForFork1_#in~arg.base_4|) (= v_P0Thread1of1ForFork1_~arg.offset_4 |v_P0Thread1of1ForFork1_#in~arg.offset_4|) (= 1 v_~z~0_5) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~__unbuffered_p0_EBX~0_7 v_~x~0_5) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_p0_EAX~0_7 v_~z~0_5)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, ~x~0=v_~x~0_5} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z~0=v_~z~0_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, ~x~0=v_~x~0_5, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 19:38:55,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1876555204 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1876555204 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite51_Out-1876555204| 0)) (and (= |P2Thread1of1ForFork0_#t~ite51_Out-1876555204| ~y$w_buff0_used~0_In-1876555204) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1876555204, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1876555204} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1876555204, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1876555204, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-1876555204|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-27 19:38:55,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2133262801 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-2133262801 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-2133262801 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2133262801 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite52_Out-2133262801|)) (and (= |P2Thread1of1ForFork0_#t~ite52_Out-2133262801| ~y$w_buff1_used~0_In-2133262801) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2133262801, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2133262801, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2133262801, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2133262801} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2133262801, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2133262801, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2133262801, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-2133262801|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2133262801} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-27 19:38:55,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1156063330 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1156063330 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out1156063330 ~y$r_buff0_thd3~0_In1156063330) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd3~0_Out1156063330 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1156063330, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1156063330} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1156063330, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1156063330, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out1156063330|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-27 19:38:55,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1208740812 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1208740812 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1208740812 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1208740812 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out1208740812| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite54_Out1208740812| ~y$r_buff1_thd3~0_In1208740812)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1208740812, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1208740812, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1208740812, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1208740812} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1208740812, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1208740812, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1208740812|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1208740812, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1208740812} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 19:38:55,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~y$r_buff1_thd3~0_33 |v_P2Thread1of1ForFork0_#t~ite54_8|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_33, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 19:38:55,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-289987436 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-289987436| ~y$mem_tmp~0_In-289987436) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out-289987436| ~y~0_In-289987436)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-289987436, ~y$flush_delayed~0=~y$flush_delayed~0_In-289987436, ~y~0=~y~0_In-289987436} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-289987436, ~y$flush_delayed~0=~y$flush_delayed~0_In-289987436, ~y~0=~y~0_In-289987436, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-289987436|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 19:38:55,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L773-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite25_8| v_~y~0_25) (= 0 v_~y$flush_delayed~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_25, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 19:38:55,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] L848-->L850-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= 0 (mod v_~y$w_buff0_used~0_93 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 19:38:55,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L850-2-->L850-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite58_Out-755860337| |ULTIMATE.start_main_#t~ite59_Out-755860337|)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-755860337 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-755860337 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite58_Out-755860337| ~y~0_In-755860337)) (and .cse2 (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite58_Out-755860337| ~y$w_buff1~0_In-755860337)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-755860337, ~y~0=~y~0_In-755860337, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-755860337, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-755860337} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-755860337, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-755860337|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-755860337|, ~y~0=~y~0_In-755860337, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-755860337, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-755860337} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 19:38:55,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1712302210 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1712302210 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out-1712302210|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1712302210 |ULTIMATE.start_main_#t~ite60_Out-1712302210|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1712302210, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1712302210} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1712302210|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1712302210, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1712302210} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 19:38:55,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1565613760 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1565613760 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1565613760 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1565613760 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1565613760 |ULTIMATE.start_main_#t~ite61_Out1565613760|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite61_Out1565613760|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1565613760, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1565613760, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1565613760, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1565613760} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1565613760|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1565613760, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1565613760, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1565613760, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1565613760} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 19:38:55,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2133986072 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2133986072 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-2133986072| ~y$r_buff0_thd0~0_In-2133986072) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite62_Out-2133986072| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2133986072, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2133986072} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-2133986072|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2133986072, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2133986072} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 19:38:55,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-537460051 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-537460051 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-537460051 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-537460051 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite63_Out-537460051| ~y$r_buff1_thd0~0_In-537460051)) (and (= 0 |ULTIMATE.start_main_#t~ite63_Out-537460051|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-537460051, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-537460051, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-537460051, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-537460051} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-537460051|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-537460051, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-537460051, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-537460051, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-537460051} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 19:38:55,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p1_EAX~0_6) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EBX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_~__unbuffered_p0_EAX~0_8 1) (= 0 v_~__unbuffered_p1_EBX~0_7) (= v_~__unbuffered_p2_EBX~0_7 0) (= |v_ULTIMATE.start_main_#t~ite63_11| v_~y$r_buff1_thd0~0_17)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 19:38:55,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:38:55 BasicIcfg [2019-12-27 19:38:55,356 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:38:55,359 INFO L168 Benchmark]: Toolchain (without parser) took 86326.24 ms. Allocated memory was 143.7 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 101.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 19:38:55,359 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 143.7 MB. Free memory is still 121.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 19:38:55,363 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.91 ms. Allocated memory was 143.7 MB in the beginning and 202.9 MB in the end (delta: 59.2 MB). Free memory was 101.1 MB in the beginning and 155.0 MB in the end (delta: -53.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:38:55,364 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.30 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 152.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 19:38:55,364 INFO L168 Benchmark]: Boogie Preprocessor took 40.08 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 150.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 19:38:55,365 INFO L168 Benchmark]: RCFGBuilder took 976.01 ms. Allocated memory is still 202.9 MB. Free memory was 149.2 MB in the beginning and 94.6 MB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 7.1 GB. [2019-12-27 19:38:55,368 INFO L168 Benchmark]: TraceAbstraction took 84445.23 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 93.7 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 19:38:55,373 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.18 ms. Allocated memory is still 143.7 MB. Free memory is still 121.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.91 ms. Allocated memory was 143.7 MB in the beginning and 202.9 MB in the end (delta: 59.2 MB). Free memory was 101.1 MB in the beginning and 155.0 MB in the end (delta: -53.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.30 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 152.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.08 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 150.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 976.01 ms. Allocated memory is still 202.9 MB. Free memory was 149.2 MB in the beginning and 94.6 MB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 84445.23 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 93.7 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.7 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, 107 ProgramPointsAfterwards, 243 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 49 ConcurrentYvCompositions, 30 ChoiceCompositions, 9080 VarBasedMoverChecksPositive, 248 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 134958 CheckedPairsTotal, 125 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(&t29, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t30, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t31, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 y$flush_delayed = weak$$choice2 [L801] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L804] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L805] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L808] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] 3 y = y$flush_delayed ? y$mem_tmp : y [L811] 3 y$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L755] 2 x = 1 [L758] 2 __unbuffered_p1_EAX = x [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L817] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L818] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L819] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L851] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L852] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L853] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 84.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3169 SDtfs, 5016 SDslu, 5807 SDs, 0 SdLazy, 2425 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135952occurred 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: 52.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 170274 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 532 NumberOfCodeBlocks, 532 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 454 ConstructedInterpolants, 0 QuantifiedInterpolants, 47932 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...