/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/mix002_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:40:32,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:40:32,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:40:32,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:40:32,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:40:32,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:40:32,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:40:32,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:40:32,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:40:32,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:40:32,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:40:32,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:40:32,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:40:32,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:40:32,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:40:32,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:40:32,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:40:32,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:40:32,108 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:40:32,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:40:32,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:40:32,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:40:32,119 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:40:32,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:40:32,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:40:32,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:40:32,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:40:32,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:40:32,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:40:32,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:40:32,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:40:32,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:40:32,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:40:32,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:40:32,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:40:32,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:40:32,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:40:32,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:40:32,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:40:32,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:40:32,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:40:32,142 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:40:32,173 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:40:32,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:40:32,175 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:40:32,175 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:40:32,175 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:40:32,176 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:40:32,176 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:40:32,176 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:40:32,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:40:32,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:40:32,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:40:32,177 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:40:32,177 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:40:32,177 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:40:32,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:40:32,177 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:40:32,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:40:32,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:40:32,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:40:32,178 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:40:32,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:40:32,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:40:32,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:40:32,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:40:32,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:40:32,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:40:32,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:40:32,180 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:40:32,180 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:40:32,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:40:32,180 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:40:32,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:40:32,464 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:40:32,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:40:32,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:40:32,487 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:40:32,488 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:40:32,489 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_tso.opt.i [2019-12-27 19:40:32,568 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19389fa0b/cc0cfd5bc9694e30848b891daec50054/FLAG0e28ee228 [2019-12-27 19:40:33,122 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:40:33,123 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_tso.opt.i [2019-12-27 19:40:33,141 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19389fa0b/cc0cfd5bc9694e30848b891daec50054/FLAG0e28ee228 [2019-12-27 19:40:33,451 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19389fa0b/cc0cfd5bc9694e30848b891daec50054 [2019-12-27 19:40:33,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:40:33,461 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:40:33,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:40:33,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:40:33,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:40:33,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:40:33" (1/1) ... [2019-12-27 19:40:33,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76182f5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:33, skipping insertion in model container [2019-12-27 19:40:33,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:40:33" (1/1) ... [2019-12-27 19:40:33,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:40:33,534 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:40:34,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:40:34,124 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:40:34,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:40:34,295 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:40:34,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:34 WrapperNode [2019-12-27 19:40:34,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:40:34,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:40:34,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:40:34,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:40:34,305 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:40:34" (1/1) ... [2019-12-27 19:40:34,328 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:40:34" (1/1) ... [2019-12-27 19:40:34,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:40:34,368 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:40:34,368 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:40:34,368 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:40:34,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:34" (1/1) ... [2019-12-27 19:40:34,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:34" (1/1) ... [2019-12-27 19:40:34,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:34" (1/1) ... [2019-12-27 19:40:34,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:34" (1/1) ... [2019-12-27 19:40:34,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:34" (1/1) ... [2019-12-27 19:40:34,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:34" (1/1) ... [2019-12-27 19:40:34,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:34" (1/1) ... [2019-12-27 19:40:34,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:40:34,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:40:34,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:40:34,416 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:40:34,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:34" (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:40:34,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:40:34,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 19:40:34,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:40:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:40:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 19:40:34,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 19:40:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 19:40:34,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 19:40:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 19:40:34,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 19:40:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 19:40:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:40:34,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:40:34,480 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:40:35,317 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:40:35,318 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 19:40:35,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:40:35 BoogieIcfgContainer [2019-12-27 19:40:35,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:40:35,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:40:35,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:40:35,327 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:40:35,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:40:33" (1/3) ... [2019-12-27 19:40:35,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2597c098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:40:35, skipping insertion in model container [2019-12-27 19:40:35,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:40:34" (2/3) ... [2019-12-27 19:40:35,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2597c098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:40:35, skipping insertion in model container [2019-12-27 19:40:35,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:40:35" (3/3) ... [2019-12-27 19:40:35,333 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_tso.opt.i [2019-12-27 19:40:35,343 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:40:35,343 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:40:35,350 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 19:40:35,351 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:40:35,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,418 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,418 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,423 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,423 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,449 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,450 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,450 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,450 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,450 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,478 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,478 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,482 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,487 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,488 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,491 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,494 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:40:35,508 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 19:40:35,529 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:40:35,529 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:40:35,529 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:40:35,529 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:40:35,530 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:40:35,530 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:40:35,530 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:40:35,530 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:40:35,549 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 244 transitions [2019-12-27 19:40:35,551 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 198 places, 244 transitions [2019-12-27 19:40:35,689 INFO L132 PetriNetUnfolder]: 56/241 cut-off events. [2019-12-27 19:40:35,689 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:40:35,708 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 241 events. 56/241 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 557 event pairs. 0/183 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 19:40:35,741 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 198 places, 244 transitions [2019-12-27 19:40:35,805 INFO L132 PetriNetUnfolder]: 56/241 cut-off events. [2019-12-27 19:40:35,806 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:40:35,817 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 241 events. 56/241 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 557 event pairs. 0/183 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 19:40:35,853 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-27 19:40:35,854 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:40:37,937 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-27 19:40:39,469 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 19:40:39,581 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 19:40:39,960 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 19:40:40,098 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 19:40:40,135 INFO L206 etLargeBlockEncoding]: Checked pairs total: 148343 [2019-12-27 19:40:40,136 INFO L214 etLargeBlockEncoding]: Total number of compositions: 128 [2019-12-27 19:40:40,138 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 132 transitions [2019-12-27 19:40:44,128 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 46206 states. [2019-12-27 19:40:44,129 INFO L276 IsEmpty]: Start isEmpty. Operand 46206 states. [2019-12-27 19:40:44,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 19:40:44,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:44,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:40:44,137 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:40:44,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:44,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1202810663, now seen corresponding path program 1 times [2019-12-27 19:40:44,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:44,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689965890] [2019-12-27 19:40:44,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:44,413 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:40:44,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689965890] [2019-12-27 19:40:44,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:44,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:40:44,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [776577688] [2019-12-27 19:40:44,417 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:44,421 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:44,435 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 19:40:44,436 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:44,440 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:40:44,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:40:44,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:44,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:40:44,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:40:44,453 INFO L87 Difference]: Start difference. First operand 46206 states. Second operand 3 states. [2019-12-27 19:40:45,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:45,494 INFO L93 Difference]: Finished difference Result 45710 states and 188088 transitions. [2019-12-27 19:40:45,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:40:45,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 19:40:45,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:45,853 INFO L225 Difference]: With dead ends: 45710 [2019-12-27 19:40:45,853 INFO L226 Difference]: Without dead ends: 42560 [2019-12-27 19:40:45,861 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:40:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42560 states. [2019-12-27 19:40:49,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42560 to 42560. [2019-12-27 19:40:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42560 states. [2019-12-27 19:40:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42560 states to 42560 states and 175003 transitions. [2019-12-27 19:40:49,671 INFO L78 Accepts]: Start accepts. Automaton has 42560 states and 175003 transitions. Word has length 7 [2019-12-27 19:40:49,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:49,677 INFO L462 AbstractCegarLoop]: Abstraction has 42560 states and 175003 transitions. [2019-12-27 19:40:49,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:40:49,677 INFO L276 IsEmpty]: Start isEmpty. Operand 42560 states and 175003 transitions. [2019-12-27 19:40:49,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:40:49,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:49,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:40:49,693 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:40:49,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:49,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1610470630, now seen corresponding path program 1 times [2019-12-27 19:40:49,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:49,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776463601] [2019-12-27 19:40:49,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:49,825 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:40:49,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776463601] [2019-12-27 19:40:49,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:49,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:40:49,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1839766945] [2019-12-27 19:40:49,826 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:49,828 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:49,834 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:40:49,834 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:49,834 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:40:49,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:40:49,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:49,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:40:49,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:40:49,836 INFO L87 Difference]: Start difference. First operand 42560 states and 175003 transitions. Second operand 3 states. [2019-12-27 19:40:50,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:50,271 INFO L93 Difference]: Finished difference Result 23924 states and 86199 transitions. [2019-12-27 19:40:50,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:40:50,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 19:40:50,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:50,414 INFO L225 Difference]: With dead ends: 23924 [2019-12-27 19:40:50,414 INFO L226 Difference]: Without dead ends: 23924 [2019-12-27 19:40:50,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:40:52,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23924 states. [2019-12-27 19:40:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23924 to 23924. [2019-12-27 19:40:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23924 states. [2019-12-27 19:40:52,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23924 states to 23924 states and 86199 transitions. [2019-12-27 19:40:52,940 INFO L78 Accepts]: Start accepts. Automaton has 23924 states and 86199 transitions. Word has length 13 [2019-12-27 19:40:52,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:52,941 INFO L462 AbstractCegarLoop]: Abstraction has 23924 states and 86199 transitions. [2019-12-27 19:40:52,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:40:52,941 INFO L276 IsEmpty]: Start isEmpty. Operand 23924 states and 86199 transitions. [2019-12-27 19:40:52,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 19:40:52,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:52,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:40:52,944 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:40:52,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:52,944 INFO L82 PathProgramCache]: Analyzing trace with hash -151988212, now seen corresponding path program 1 times [2019-12-27 19:40:52,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:52,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881781547] [2019-12-27 19:40:52,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:53,023 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:40:53,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881781547] [2019-12-27 19:40:53,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:53,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:40:53,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [437193722] [2019-12-27 19:40:53,025 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:53,027 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:53,028 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 19:40:53,029 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:53,030 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:40:53,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:40:53,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:53,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:40:53,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:40:53,031 INFO L87 Difference]: Start difference. First operand 23924 states and 86199 transitions. Second operand 4 states. [2019-12-27 19:40:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:53,083 INFO L93 Difference]: Finished difference Result 4326 states and 12742 transitions. [2019-12-27 19:40:53,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:40:53,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 19:40:53,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:53,094 INFO L225 Difference]: With dead ends: 4326 [2019-12-27 19:40:53,094 INFO L226 Difference]: Without dead ends: 4326 [2019-12-27 19:40:53,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:40:53,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4326 states. [2019-12-27 19:40:53,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4326 to 4326. [2019-12-27 19:40:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4326 states. [2019-12-27 19:40:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4326 states to 4326 states and 12742 transitions. [2019-12-27 19:40:53,181 INFO L78 Accepts]: Start accepts. Automaton has 4326 states and 12742 transitions. Word has length 14 [2019-12-27 19:40:53,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:53,181 INFO L462 AbstractCegarLoop]: Abstraction has 4326 states and 12742 transitions. [2019-12-27 19:40:53,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:40:53,181 INFO L276 IsEmpty]: Start isEmpty. Operand 4326 states and 12742 transitions. [2019-12-27 19:40:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:40:53,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:53,183 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:40:53,183 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:40:53,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:53,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1922776673, now seen corresponding path program 1 times [2019-12-27 19:40:53,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:53,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929273977] [2019-12-27 19:40:53,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:53,495 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2019-12-27 19:40:53,505 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:40:53,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929273977] [2019-12-27 19:40:53,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:53,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:40:53,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [225304677] [2019-12-27 19:40:53,506 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:53,508 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:53,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 19:40:53,512 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:53,556 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:40:53,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:40:53,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:53,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:40:53,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:40:53,558 INFO L87 Difference]: Start difference. First operand 4326 states and 12742 transitions. Second operand 5 states. [2019-12-27 19:40:53,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:53,938 INFO L93 Difference]: Finished difference Result 5923 states and 16978 transitions. [2019-12-27 19:40:53,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:40:53,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 19:40:53,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:53,952 INFO L225 Difference]: With dead ends: 5923 [2019-12-27 19:40:53,952 INFO L226 Difference]: Without dead ends: 5923 [2019-12-27 19:40:53,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:40:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5923 states. [2019-12-27 19:40:54,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5923 to 5831. [2019-12-27 19:40:54,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5831 states. [2019-12-27 19:40:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5831 states to 5831 states and 16809 transitions. [2019-12-27 19:40:54,079 INFO L78 Accepts]: Start accepts. Automaton has 5831 states and 16809 transitions. Word has length 16 [2019-12-27 19:40:54,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:54,079 INFO L462 AbstractCegarLoop]: Abstraction has 5831 states and 16809 transitions. [2019-12-27 19:40:54,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:40:54,080 INFO L276 IsEmpty]: Start isEmpty. Operand 5831 states and 16809 transitions. [2019-12-27 19:40:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:40:54,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:54,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:40:54,082 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:40:54,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:54,083 INFO L82 PathProgramCache]: Analyzing trace with hash 523493894, now seen corresponding path program 1 times [2019-12-27 19:40:54,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:54,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456108724] [2019-12-27 19:40:54,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:54,119 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:40:54,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456108724] [2019-12-27 19:40:54,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:54,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:40:54,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1630282051] [2019-12-27 19:40:54,120 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:54,122 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:54,127 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 57 transitions. [2019-12-27 19:40:54,127 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:54,162 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:40:54,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:40:54,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:54,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:40:54,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:40:54,163 INFO L87 Difference]: Start difference. First operand 5831 states and 16809 transitions. Second operand 5 states. [2019-12-27 19:40:54,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:54,329 INFO L93 Difference]: Finished difference Result 10093 states and 27430 transitions. [2019-12-27 19:40:54,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:40:54,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 19:40:54,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:54,349 INFO L225 Difference]: With dead ends: 10093 [2019-12-27 19:40:54,349 INFO L226 Difference]: Without dead ends: 10093 [2019-12-27 19:40:54,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:40:54,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2019-12-27 19:40:54,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 9136. [2019-12-27 19:40:54,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9136 states. [2019-12-27 19:40:54,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9136 states to 9136 states and 25278 transitions. [2019-12-27 19:40:54,544 INFO L78 Accepts]: Start accepts. Automaton has 9136 states and 25278 transitions. Word has length 17 [2019-12-27 19:40:54,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:54,544 INFO L462 AbstractCegarLoop]: Abstraction has 9136 states and 25278 transitions. [2019-12-27 19:40:54,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:40:54,545 INFO L276 IsEmpty]: Start isEmpty. Operand 9136 states and 25278 transitions. [2019-12-27 19:40:54,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:40:54,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:54,548 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:40:54,548 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:40:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:54,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1573148105, now seen corresponding path program 1 times [2019-12-27 19:40:54,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:54,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798385756] [2019-12-27 19:40:54,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:54,616 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:40:54,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798385756] [2019-12-27 19:40:54,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:54,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:40:54,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1635176313] [2019-12-27 19:40:54,618 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:54,621 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:54,627 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 67 transitions. [2019-12-27 19:40:54,627 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:54,658 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:40:54,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:40:54,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:54,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:40:54,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:40:54,660 INFO L87 Difference]: Start difference. First operand 9136 states and 25278 transitions. Second operand 5 states. [2019-12-27 19:40:55,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:55,054 INFO L93 Difference]: Finished difference Result 11373 states and 30922 transitions. [2019-12-27 19:40:55,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:40:55,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 19:40:55,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:55,072 INFO L225 Difference]: With dead ends: 11373 [2019-12-27 19:40:55,073 INFO L226 Difference]: Without dead ends: 11373 [2019-12-27 19:40:55,073 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:40:55,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11373 states. [2019-12-27 19:40:55,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11373 to 9116. [2019-12-27 19:40:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9116 states. [2019-12-27 19:40:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9116 states to 9116 states and 25226 transitions. [2019-12-27 19:40:55,257 INFO L78 Accepts]: Start accepts. Automaton has 9116 states and 25226 transitions. Word has length 19 [2019-12-27 19:40:55,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:55,258 INFO L462 AbstractCegarLoop]: Abstraction has 9116 states and 25226 transitions. [2019-12-27 19:40:55,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:40:55,258 INFO L276 IsEmpty]: Start isEmpty. Operand 9116 states and 25226 transitions. [2019-12-27 19:40:55,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 19:40:55,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:55,270 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] [2019-12-27 19:40:55,270 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:40:55,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:55,271 INFO L82 PathProgramCache]: Analyzing trace with hash 208716797, now seen corresponding path program 1 times [2019-12-27 19:40:55,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:55,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432894742] [2019-12-27 19:40:55,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:55,355 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:40:55,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432894742] [2019-12-27 19:40:55,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:55,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:40:55,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2082583921] [2019-12-27 19:40:55,356 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:55,523 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:55,538 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 107 transitions. [2019-12-27 19:40:55,538 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:55,558 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:40:55,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:40:55,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:55,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:40:55,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:40:55,561 INFO L87 Difference]: Start difference. First operand 9116 states and 25226 transitions. Second operand 6 states. [2019-12-27 19:40:55,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:55,615 INFO L93 Difference]: Finished difference Result 7151 states and 20553 transitions. [2019-12-27 19:40:55,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:40:55,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 19:40:55,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:55,629 INFO L225 Difference]: With dead ends: 7151 [2019-12-27 19:40:55,629 INFO L226 Difference]: Without dead ends: 7151 [2019-12-27 19:40:55,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:40:55,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7151 states. [2019-12-27 19:40:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7151 to 6845. [2019-12-27 19:40:55,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6845 states. [2019-12-27 19:40:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6845 states to 6845 states and 19826 transitions. [2019-12-27 19:40:55,762 INFO L78 Accepts]: Start accepts. Automaton has 6845 states and 19826 transitions. Word has length 31 [2019-12-27 19:40:55,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:55,762 INFO L462 AbstractCegarLoop]: Abstraction has 6845 states and 19826 transitions. [2019-12-27 19:40:55,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:40:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand 6845 states and 19826 transitions. [2019-12-27 19:40:55,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 19:40:55,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:55,782 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] [2019-12-27 19:40:55,782 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:40:55,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:55,782 INFO L82 PathProgramCache]: Analyzing trace with hash -801869056, now seen corresponding path program 1 times [2019-12-27 19:40:55,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:55,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598967087] [2019-12-27 19:40:55,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:55,943 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:40:55,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598967087] [2019-12-27 19:40:55,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:55,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:40:55,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1148701471] [2019-12-27 19:40:55,944 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:55,964 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:56,064 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 236 transitions. [2019-12-27 19:40:56,064 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:56,077 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:40:56,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:40:56,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:56,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:40:56,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:40:56,079 INFO L87 Difference]: Start difference. First operand 6845 states and 19826 transitions. Second operand 8 states. [2019-12-27 19:40:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:56,579 INFO L93 Difference]: Finished difference Result 13849 states and 39636 transitions. [2019-12-27 19:40:56,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 19:40:56,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2019-12-27 19:40:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:56,607 INFO L225 Difference]: With dead ends: 13849 [2019-12-27 19:40:56,608 INFO L226 Difference]: Without dead ends: 12278 [2019-12-27 19:40:56,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:40:56,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12278 states. [2019-12-27 19:40:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12278 to 9859. [2019-12-27 19:40:56,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9859 states. [2019-12-27 19:40:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9859 states to 9859 states and 29123 transitions. [2019-12-27 19:40:57,022 INFO L78 Accepts]: Start accepts. Automaton has 9859 states and 29123 transitions. Word has length 61 [2019-12-27 19:40:57,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:57,022 INFO L462 AbstractCegarLoop]: Abstraction has 9859 states and 29123 transitions. [2019-12-27 19:40:57,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:40:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 9859 states and 29123 transitions. [2019-12-27 19:40:57,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 19:40:57,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:57,046 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] [2019-12-27 19:40:57,046 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:40:57,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:57,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1176294350, now seen corresponding path program 2 times [2019-12-27 19:40:57,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:57,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232610857] [2019-12-27 19:40:57,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:57,128 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:40:57,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232610857] [2019-12-27 19:40:57,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:57,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:40:57,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [117596485] [2019-12-27 19:40:57,129 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:57,147 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:57,218 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 172 transitions. [2019-12-27 19:40:57,218 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:57,219 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:40:57,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:40:57,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:57,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:40:57,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:40:57,219 INFO L87 Difference]: Start difference. First operand 9859 states and 29123 transitions. Second operand 4 states. [2019-12-27 19:40:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:57,264 INFO L93 Difference]: Finished difference Result 10877 states and 31406 transitions. [2019-12-27 19:40:57,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:40:57,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-27 19:40:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:57,272 INFO L225 Difference]: With dead ends: 10877 [2019-12-27 19:40:57,272 INFO L226 Difference]: Without dead ends: 5943 [2019-12-27 19:40:57,273 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:40:57,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5943 states. [2019-12-27 19:40:57,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5943 to 5943. [2019-12-27 19:40:57,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5943 states. [2019-12-27 19:40:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5943 states to 5943 states and 15384 transitions. [2019-12-27 19:40:57,342 INFO L78 Accepts]: Start accepts. Automaton has 5943 states and 15384 transitions. Word has length 61 [2019-12-27 19:40:57,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:57,342 INFO L462 AbstractCegarLoop]: Abstraction has 5943 states and 15384 transitions. [2019-12-27 19:40:57,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:40:57,342 INFO L276 IsEmpty]: Start isEmpty. Operand 5943 states and 15384 transitions. [2019-12-27 19:40:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 19:40:57,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:57,351 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] [2019-12-27 19:40:57,351 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:40:57,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:57,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1378302414, now seen corresponding path program 3 times [2019-12-27 19:40:57,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:57,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027145918] [2019-12-27 19:40:57,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:57,434 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:40:57,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027145918] [2019-12-27 19:40:57,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:57,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:40:57,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [431892183] [2019-12-27 19:40:57,435 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:57,453 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:57,590 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 210 transitions. [2019-12-27 19:40:57,590 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:57,621 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:40:57,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:40:57,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:57,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:40:57,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:40:57,623 INFO L87 Difference]: Start difference. First operand 5943 states and 15384 transitions. Second operand 6 states. [2019-12-27 19:40:58,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:58,154 INFO L93 Difference]: Finished difference Result 10698 states and 27969 transitions. [2019-12-27 19:40:58,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:40:58,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-27 19:40:58,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:58,156 INFO L225 Difference]: With dead ends: 10698 [2019-12-27 19:40:58,156 INFO L226 Difference]: Without dead ends: 961 [2019-12-27 19:40:58,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:40:58,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-12-27 19:40:58,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 613. [2019-12-27 19:40:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-12-27 19:40:58,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1304 transitions. [2019-12-27 19:40:58,168 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1304 transitions. Word has length 61 [2019-12-27 19:40:58,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:58,168 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 1304 transitions. [2019-12-27 19:40:58,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:40:58,169 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1304 transitions. [2019-12-27 19:40:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 19:40:58,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:58,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:58,171 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:40:58,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:58,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1969994972, now seen corresponding path program 4 times [2019-12-27 19:40:58,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:58,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239048948] [2019-12-27 19:40:58,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:58,278 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:40:58,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239048948] [2019-12-27 19:40:58,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:58,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:40:58,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [441819565] [2019-12-27 19:40:58,280 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:58,297 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:58,359 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 121 transitions. [2019-12-27 19:40:58,359 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:58,360 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:40:58,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:40:58,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:58,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:40:58,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:40:58,361 INFO L87 Difference]: Start difference. First operand 613 states and 1304 transitions. Second operand 8 states. [2019-12-27 19:40:58,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:58,604 INFO L93 Difference]: Finished difference Result 1124 states and 2364 transitions. [2019-12-27 19:40:58,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 19:40:58,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2019-12-27 19:40:58,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:58,606 INFO L225 Difference]: With dead ends: 1124 [2019-12-27 19:40:58,606 INFO L226 Difference]: Without dead ends: 793 [2019-12-27 19:40:58,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:40:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2019-12-27 19:40:58,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 637. [2019-12-27 19:40:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-12-27 19:40:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1349 transitions. [2019-12-27 19:40:58,615 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1349 transitions. Word has length 61 [2019-12-27 19:40:58,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:58,615 INFO L462 AbstractCegarLoop]: Abstraction has 637 states and 1349 transitions. [2019-12-27 19:40:58,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:40:58,615 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1349 transitions. [2019-12-27 19:40:58,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 19:40:58,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:58,616 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] [2019-12-27 19:40:58,616 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:40:58,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:58,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1316321662, now seen corresponding path program 5 times [2019-12-27 19:40:58,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:58,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055961299] [2019-12-27 19:40:58,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:58,693 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:40:58,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055961299] [2019-12-27 19:40:58,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:58,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:40:58,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [352007713] [2019-12-27 19:40:58,694 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:58,712 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:58,784 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 144 transitions. [2019-12-27 19:40:58,784 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:58,784 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:40:58,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:40:58,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:58,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:40:58,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:40:58,785 INFO L87 Difference]: Start difference. First operand 637 states and 1349 transitions. Second operand 5 states. [2019-12-27 19:40:58,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:58,848 INFO L93 Difference]: Finished difference Result 1263 states and 2686 transitions. [2019-12-27 19:40:58,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:40:58,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-12-27 19:40:58,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:58,849 INFO L225 Difference]: With dead ends: 1263 [2019-12-27 19:40:58,850 INFO L226 Difference]: Without dead ends: 637 [2019-12-27 19:40:58,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:40:58,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-12-27 19:40:58,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2019-12-27 19:40:58,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-12-27 19:40:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1348 transitions. [2019-12-27 19:40:58,859 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1348 transitions. Word has length 61 [2019-12-27 19:40:58,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:58,859 INFO L462 AbstractCegarLoop]: Abstraction has 637 states and 1348 transitions. [2019-12-27 19:40:58,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:40:58,859 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1348 transitions. [2019-12-27 19:40:58,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 19:40:58,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:58,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:40:58,861 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:40:58,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:58,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2124340515, now seen corresponding path program 1 times [2019-12-27 19:40:58,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:58,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876686489] [2019-12-27 19:40:58,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:59,044 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:40:59,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876686489] [2019-12-27 19:40:59,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:59,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:40:59,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1833011005] [2019-12-27 19:40:59,046 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:59,089 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:59,180 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 107 states and 145 transitions. [2019-12-27 19:40:59,181 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:59,182 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:40:59,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:40:59,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:59,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:40:59,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:40:59,188 INFO L87 Difference]: Start difference. First operand 637 states and 1348 transitions. Second operand 6 states. [2019-12-27 19:40:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:59,782 INFO L93 Difference]: Finished difference Result 1072 states and 2228 transitions. [2019-12-27 19:40:59,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:40:59,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-27 19:40:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:59,784 INFO L225 Difference]: With dead ends: 1072 [2019-12-27 19:40:59,785 INFO L226 Difference]: Without dead ends: 1054 [2019-12-27 19:40:59,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:40:59,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2019-12-27 19:40:59,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1010. [2019-12-27 19:40:59,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1010 states. [2019-12-27 19:40:59,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 2112 transitions. [2019-12-27 19:40:59,795 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 2112 transitions. Word has length 62 [2019-12-27 19:40:59,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:59,795 INFO L462 AbstractCegarLoop]: Abstraction has 1010 states and 2112 transitions. [2019-12-27 19:40:59,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:40:59,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 2112 transitions. [2019-12-27 19:40:59,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 19:40:59,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:59,796 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:40:59,797 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:40:59,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:59,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1003945207, now seen corresponding path program 2 times [2019-12-27 19:40:59,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:59,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497680336] [2019-12-27 19:40:59,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:59,864 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:40:59,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497680336] [2019-12-27 19:40:59,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:59,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:40:59,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [47805436] [2019-12-27 19:40:59,865 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:59,883 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:59,974 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 113 states and 147 transitions. [2019-12-27 19:40:59,974 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:59,975 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:40:59,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:40:59,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:59,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:40:59,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:40:59,976 INFO L87 Difference]: Start difference. First operand 1010 states and 2112 transitions. Second operand 3 states. [2019-12-27 19:40:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:59,987 INFO L93 Difference]: Finished difference Result 1010 states and 2111 transitions. [2019-12-27 19:40:59,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:40:59,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-27 19:40:59,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:59,989 INFO L225 Difference]: With dead ends: 1010 [2019-12-27 19:40:59,989 INFO L226 Difference]: Without dead ends: 1010 [2019-12-27 19:40:59,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:40:59,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2019-12-27 19:41:00,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 859. [2019-12-27 19:41:00,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-12-27 19:41:00,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1840 transitions. [2019-12-27 19:41:00,002 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1840 transitions. Word has length 62 [2019-12-27 19:41:00,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:00,002 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1840 transitions. [2019-12-27 19:41:00,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:41:00,002 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1840 transitions. [2019-12-27 19:41:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 19:41:00,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:00,004 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:41:00,004 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:41:00,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:00,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1784332474, now seen corresponding path program 1 times [2019-12-27 19:41:00,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:00,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251335059] [2019-12-27 19:41:00,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:41:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:41:00,226 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:41:00,227 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:41:00,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~z$r_buff1_thd3~0_40) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~__unbuffered_p1_EBX~0_17 0) (= v_~z$r_buff0_thd1~0_10 0) (= 0 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd0~0_20 0) (= v_~z$read_delayed_var~0.offset_6 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t59~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t59~0.base_24|) |v_ULTIMATE.start_main_~#t59~0.offset_19| 0)) |v_#memory_int_23|) (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t59~0.base_24|)) (= 0 v_~__unbuffered_cnt~0_21) (= v_~__unbuffered_p2_EBX~0_16 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t59~0.base_24| 4)) (= |v_ULTIMATE.start_main_~#t59~0.offset_19| 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~z$flush_delayed~0_19) (= 0 v_~weak$$choice2~0_36) (= v_~y~0_12 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t59~0.base_24| 1)) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_17) (= 0 |v_#NULL.base_4|) (= v_~z$r_buff0_thd2~0_59 0) (= 0 v_~weak$$choice0~0_11) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff1_thd0~0_26) (= v_~z$r_buff0_thd3~0_80 0) (= 0 v_~z$w_buff1~0_33) (= |v_#NULL.offset_4| 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t59~0.base_24|) (= v_~a~0_12 0) (= v_~z~0_30 0) (= 0 v_~z$w_buff1_used~0_69) (= v_~main$tmp_guard0~0_11 0) (= v_~z$w_buff0_used~0_133 0) (= v_~z$mem_tmp~0_14 0) (= 0 v_~z$r_buff1_thd2~0_30) (= 0 v_~z$w_buff0~0_35) (= v_~__unbuffered_p0_EBX~0_15 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_30, #NULL.offset=|v_#NULL.offset_4|, ~a~0=v_~a~0_12, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t61~0.base=|v_ULTIMATE.start_main_~#t61~0.base_20|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~z$mem_tmp~0=v_~z$mem_tmp~0_14, ULTIMATE.start_main_~#t60~0.offset=|v_ULTIMATE.start_main_~#t60~0.offset_17|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_15, ULTIMATE.start_main_~#t59~0.base=|v_ULTIMATE.start_main_~#t59~0.base_24|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_23|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_11|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_80, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_11, ULTIMATE.start_main_~#t60~0.base=|v_ULTIMATE.start_main_~#t60~0.base_22|, ULTIMATE.start_main_~#t59~0.offset=|v_ULTIMATE.start_main_~#t59~0.offset_19|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t61~0.offset=|v_ULTIMATE.start_main_~#t61~0.offset_16|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_26, ~y~0=v_~y~0_12, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_59, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_133, ~z$w_buff0~0=v_~z$w_buff0~0_35, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_40, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_11|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_30, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t61~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t60~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t59~0.base, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t60~0.base, ULTIMATE.start_main_~#t59~0.offset, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t61~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 19:41:00,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L845-1-->L847: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t60~0.base_10| 4)) (not (= |v_ULTIMATE.start_main_~#t60~0.base_10| 0)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t60~0.base_10|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t60~0.base_10| 1) |v_#valid_31|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t60~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t60~0.base_10|) |v_ULTIMATE.start_main_~#t60~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t60~0.offset_9|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t60~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t60~0.base=|v_ULTIMATE.start_main_~#t60~0.base_10|, ULTIMATE.start_main_~#t60~0.offset=|v_ULTIMATE.start_main_~#t60~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t60~0.base, ULTIMATE.start_main_~#t60~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 19:41:00,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L847-1-->L849: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t61~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t61~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t61~0.base_11| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t61~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t61~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t61~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t61~0.base_11|) |v_ULTIMATE.start_main_~#t61~0.offset_9| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t61~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t61~0.offset=|v_ULTIMATE.start_main_~#t61~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_4|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t61~0.base=|v_ULTIMATE.start_main_~#t61~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t61~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t61~0.base, #length] because there is no mapped edge [2019-12-27 19:41:00,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L807: Formula: (and (= v_~weak$$choice2~0_28 v_~z$flush_delayed~0_11) (= v_~z$r_buff0_thd0~0_14 v_~z$r_buff1_thd0~0_10) (= v_~weak$$choice0~0_4 |v_P2Thread1of1ForFork0_#t~nondet26_6|) (= v_~z$r_buff0_thd3~0_45 1) (= v_~z$r_buff0_thd3~0_46 v_~z$r_buff1_thd3~0_26) (= v_~weak$$choice2~0_28 |v_P2Thread1of1ForFork0_#t~nondet27_6|) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff0_thd2~0_36 v_~z$r_buff1_thd2~0_20) (= v_~z~0_18 v_~z$mem_tmp~0_7) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_6))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_6|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_46, ~z~0=v_~z~0_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_36, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_6|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_6} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_26, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_20, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_5|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~weak$$choice0~0=v_~weak$$choice0~0_4, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_10, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_45, ~z~0=v_~z~0_18, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_36} AuxVars[] AssignedVars[~z$mem_tmp~0, ~weak$$choice0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, P2Thread1of1ForFork0_#t~nondet27, ~z$r_buff0_thd3~0, ~z$flush_delayed~0, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-27 19:41:00,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L807-2-->L807-5: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-399702072 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-399702072 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite28_Out-399702072| |P2Thread1of1ForFork0_#t~ite29_Out-399702072|))) (or (and (not .cse0) (not .cse1) .cse2 (= |P2Thread1of1ForFork0_#t~ite28_Out-399702072| ~z$w_buff0~0_In-399702072)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out-399702072| ~z$w_buff1~0_In-399702072) .cse2))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-399702072, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-399702072, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-399702072, ~z$w_buff1~0=~z$w_buff1~0_In-399702072} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-399702072|, ~z$w_buff0~0=~z$w_buff0~0_In-399702072, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-399702072, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-399702072, ~z$w_buff1~0=~z$w_buff1~0_In-399702072, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-399702072|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 19:41:00,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L812-->L813: Formula: (and (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff0_thd3~0_61) (not (= 0 (mod v_~weak$$choice2~0_31 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_31} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_7|, ~weak$$choice2~0=v_~weak$$choice2~0_31} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 19:41:00,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In59765822 256)))) (or (and (= ~z~0_In59765822 |P2Thread1of1ForFork0_#t~ite48_Out59765822|) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In59765822 |P2Thread1of1ForFork0_#t~ite48_Out59765822|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In59765822, ~z$flush_delayed~0=~z$flush_delayed~0_In59765822, ~z~0=~z~0_In59765822} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out59765822|, ~z$mem_tmp~0=~z$mem_tmp~0_In59765822, ~z$flush_delayed~0=~z$flush_delayed~0_In59765822, ~z~0=~z~0_In59765822} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-27 19:41:00,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] P0ENTRY-->P0EXIT: Formula: (and (= 1 v_~x~0_6) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 1 v_~a~0_7) (= v_~__unbuffered_p0_EBX~0_8 v_~y~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_6) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_7} OutVars{~a~0=v_~a~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_7, ~x~0=v_~x~0_6, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 19:41:00,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2138177587 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-2138177587 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-2138177587|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2138177587 |P2Thread1of1ForFork0_#t~ite51_Out-2138177587|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2138177587, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2138177587} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2138177587, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2138177587, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-2138177587|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-27 19:41:00,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1904901920 256)))) (or (and (= ~z~0_In1904901920 |P1Thread1of1ForFork2_#t~ite25_Out1904901920|) .cse0) (and (= ~z$mem_tmp~0_In1904901920 |P1Thread1of1ForFork2_#t~ite25_Out1904901920|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1904901920, ~z$flush_delayed~0=~z$flush_delayed~0_In1904901920, ~z~0=~z~0_In1904901920} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1904901920, ~z$flush_delayed~0=~z$flush_delayed~0_In1904901920, ~z~0=~z~0_In1904901920, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1904901920|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 19:41:00,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite25_8| v_~z~0_25) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= 0 v_~z$flush_delayed~0_14) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ~z~0=v_~z~0_25, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 19:41:00,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1438837150 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-1438837150 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1438837150 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1438837150 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite52_Out-1438837150| ~z$w_buff1_used~0_In-1438837150) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out-1438837150|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1438837150, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1438837150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1438837150, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1438837150} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1438837150, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1438837150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1438837150, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1438837150|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1438837150} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-27 19:41:00,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L825-->L826: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1933873931 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1933873931 256)))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd3~0_Out1933873931 0)) (and (= ~z$r_buff0_thd3~0_Out1933873931 ~z$r_buff0_thd3~0_In1933873931) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1933873931, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1933873931} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1933873931, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out1933873931, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out1933873931|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-27 19:41:00,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L826-->L826-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1193505588 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1193505588 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1193505588 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1193505588 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite54_Out1193505588| ~z$r_buff1_thd3~0_In1193505588) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite54_Out1193505588| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1193505588, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1193505588, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1193505588, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1193505588} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1193505588, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1193505588|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1193505588, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1193505588, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1193505588} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 19:41:00,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L826-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~z$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{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 19:41:00,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L849-1-->L855: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 19:41:00,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L855-2-->L855-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-581445079 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-581445079 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite58_Out-581445079| |ULTIMATE.start_main_#t~ite59_Out-581445079|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite58_Out-581445079| ~z$w_buff1~0_In-581445079) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite58_Out-581445079| ~z~0_In-581445079) (or .cse2 .cse0) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-581445079, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-581445079, ~z$w_buff1~0=~z$w_buff1~0_In-581445079, ~z~0=~z~0_In-581445079} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-581445079, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-581445079|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-581445079, ~z$w_buff1~0=~z$w_buff1~0_In-581445079, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-581445079|, ~z~0=~z~0_In-581445079} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 19:41:00,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1739097389 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1739097389 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite60_Out1739097389| ~z$w_buff0_used~0_In1739097389)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite60_Out1739097389| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1739097389, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1739097389} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1739097389|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1739097389, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1739097389} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 19:41:00,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L857-->L857-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-2119576752 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-2119576752 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-2119576752 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2119576752 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-2119576752|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-2119576752 |ULTIMATE.start_main_#t~ite61_Out-2119576752|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2119576752, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2119576752, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2119576752, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2119576752} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2119576752, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-2119576752|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2119576752, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2119576752, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2119576752} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 19:41:00,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1049337171 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1049337171 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-1049337171| ~z$r_buff0_thd0~0_In-1049337171) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite62_Out-1049337171| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1049337171, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1049337171} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1049337171|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1049337171, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1049337171} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 19:41:00,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L859-->L859-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In1149669869 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In1149669869 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1149669869 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1149669869 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out1149669869| ~z$r_buff1_thd0~0_In1149669869) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite63_Out1149669869| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1149669869, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1149669869, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1149669869, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1149669869} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1149669869|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1149669869, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1149669869, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1149669869, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1149669869} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 19:41:00,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EBX~0_10 0) (= 1 v_~__unbuffered_p1_EAX~0_6) (= v_~main$tmp_guard1~0_9 0) (= |v_ULTIMATE.start_main_#t~ite63_12| v_~z$r_buff1_thd0~0_18) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 1 v_~__unbuffered_p0_EAX~0_10) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p2_EAX~0_9 1) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, 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, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 19:41:00,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:41:00 BasicIcfg [2019-12-27 19:41:00,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:41:00,446 INFO L168 Benchmark]: Toolchain (without parser) took 26985.59 ms. Allocated memory was 144.7 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 100.2 MB in the beginning and 692.7 MB in the end (delta: -592.5 MB). Peak memory consumption was 678.9 MB. Max. memory is 7.1 GB. [2019-12-27 19:41:00,447 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 19:41:00,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.42 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 99.8 MB in the beginning and 155.2 MB in the end (delta: -55.4 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:41:00,449 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.29 ms. Allocated memory is still 202.4 MB. Free memory was 155.2 MB in the beginning and 151.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 19:41:00,450 INFO L168 Benchmark]: Boogie Preprocessor took 47.54 ms. Allocated memory is still 202.4 MB. Free memory was 151.9 MB in the beginning and 149.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 19:41:00,451 INFO L168 Benchmark]: RCFGBuilder took 904.08 ms. Allocated memory is still 202.4 MB. Free memory was 149.3 MB in the beginning and 93.0 MB in the end (delta: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. [2019-12-27 19:41:00,451 INFO L168 Benchmark]: TraceAbstraction took 25123.37 ms. Allocated memory was 202.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 93.0 MB in the beginning and 692.7 MB in the end (delta: -599.6 MB). Peak memory consumption was 614.1 MB. Max. memory is 7.1 GB. [2019-12-27 19:41:00,455 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.23 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 833.42 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 99.8 MB in the beginning and 155.2 MB in the end (delta: -55.4 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.29 ms. Allocated memory is still 202.4 MB. Free memory was 155.2 MB in the beginning and 151.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.54 ms. Allocated memory is still 202.4 MB. Free memory was 151.9 MB in the beginning and 149.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 904.08 ms. Allocated memory is still 202.4 MB. Free memory was 149.3 MB in the beginning and 93.0 MB in the end (delta: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25123.37 ms. Allocated memory was 202.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 93.0 MB in the beginning and 692.7 MB in the end (delta: -599.6 MB). Peak memory consumption was 614.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 198 ProgramPointsBefore, 109 ProgramPointsAfterwards, 244 TransitionsBefore, 132 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 58 ConcurrentYvCompositions, 27 ChoiceCompositions, 9146 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 148343 CheckedPairsTotal, 128 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t59, ((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, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t60, ((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, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t61, ((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, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1 = z$w_buff0 [L792] 3 z$w_buff0 = 1 [L793] 3 z$w_buff1_used = z$w_buff0_used [L794] 3 z$w_buff0_used = (_Bool)1 [L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=0, y=0, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L808] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=0, y=0, z=1, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L809] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=0, y=0, z=1, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L810] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=0, y=0, z=1, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=0, y=0, z=1, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=0, y=0, z=1, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EAX = 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, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=0, y=0, z=1, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 3 z = z$flush_delayed ? z$mem_tmp : z [L816] 3 z$flush_delayed = (_Bool)0 [L819] 3 __unbuffered_p2_EBX = a 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, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 y = 1 [L763] 2 __unbuffered_p1_EAX = y [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 z$flush_delayed = weak$$choice2 [L769] 2 z$mem_tmp = z 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, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=8, x=1, y=1, z=0, z$flush_delayed=8, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=8, x=1, y=1, z=0, z$flush_delayed=8, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L823] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L770] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L771] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=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, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=8, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=8, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L772] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=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, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=8, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=8, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L773] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=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, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=8, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=8, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L774] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=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, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=8, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=8, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=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, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=8, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=8, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L776] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=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, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=8, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=8, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 __unbuffered_p1_EBX = z 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, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=8, x=1, y=1, z=0, z$flush_delayed=8, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) 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, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=8, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 189 locations, 2 error locations. Result: UNSAFE, OverallTime: 24.7s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2656 SDtfs, 2975 SDslu, 5881 SDs, 0 SdLazy, 1719 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46206occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 6730 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 532 ConstructedInterpolants, 0 QuantifiedInterpolants, 80490 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...