/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:32:16,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:32:16,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:32:16,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:32:16,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:32:16,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:32:16,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:32:16,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:32:16,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:32:16,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:32:16,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:32:16,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:32:16,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:32:16,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:32:16,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:32:16,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:32:16,211 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:32:16,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:32:16,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:32:16,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:32:16,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:32:16,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:32:16,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:32:16,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:32:16,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:32:16,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:32:16,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:32:16,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:32:16,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:32:16,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:32:16,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:32:16,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:32:16,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:32:16,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:32:16,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:32:16,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:32:16,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:32:16,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:32:16,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:32:16,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:32:16,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:32:16,251 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 15:32:16,270 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:32:16,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:32:16,271 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:32:16,272 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:32:16,272 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:32:16,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:32:16,272 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:32:16,272 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:32:16,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:32:16,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:32:16,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:32:16,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:32:16,273 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:32:16,273 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:32:16,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:32:16,274 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:32:16,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:32:16,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:32:16,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:32:16,275 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:32:16,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:32:16,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:32:16,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:32:16,275 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:32:16,276 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:32:16,276 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:32:16,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:32:16,276 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:32:16,276 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:32:16,277 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:32:16,277 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:32:16,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:32:16,554 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:32:16,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:32:16,559 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:32:16,560 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:32:16,561 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt.i [2019-12-27 15:32:16,625 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c974750fc/0e5e9916020747c680f70f75116ff066/FLAG925a34177 [2019-12-27 15:32:17,097 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:32:17,098 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.opt.i [2019-12-27 15:32:17,111 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c974750fc/0e5e9916020747c680f70f75116ff066/FLAG925a34177 [2019-12-27 15:32:17,434 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c974750fc/0e5e9916020747c680f70f75116ff066 [2019-12-27 15:32:17,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:32:17,443 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:32:17,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:32:17,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:32:17,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:32:17,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:32:17" (1/1) ... [2019-12-27 15:32:17,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f1d1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:17, skipping insertion in model container [2019-12-27 15:32:17,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:32:17" (1/1) ... [2019-12-27 15:32:17,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:32:17,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:32:18,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:32:18,107 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:32:18,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:32:18,270 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:32:18,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:18 WrapperNode [2019-12-27 15:32:18,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:32:18,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:32:18,271 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:32:18,271 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:32:18,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:18" (1/1) ... [2019-12-27 15:32:18,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:18" (1/1) ... [2019-12-27 15:32:18,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:32:18,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:32:18,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:32:18,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:32:18,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:18" (1/1) ... [2019-12-27 15:32:18,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:18" (1/1) ... [2019-12-27 15:32:18,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:18" (1/1) ... [2019-12-27 15:32:18,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:18" (1/1) ... [2019-12-27 15:32:18,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:18" (1/1) ... [2019-12-27 15:32:18,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:18" (1/1) ... [2019-12-27 15:32:18,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:18" (1/1) ... [2019-12-27 15:32:18,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:32:18,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:32:18,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:32:18,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:32:18,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:18" (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 15:32:18,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:32:18,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:32:18,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:32:18,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:32:18,492 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:32:18,493 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:32:18,493 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:32:18,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:32:18,494 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 15:32:18,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 15:32:18,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:32:18,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:32:18,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:32:18,497 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 15:32:19,451 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:32:19,451 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:32:19,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:32:19 BoogieIcfgContainer [2019-12-27 15:32:19,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:32:19,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:32:19,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:32:19,457 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:32:19,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:32:17" (1/3) ... [2019-12-27 15:32:19,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c061ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:32:19, skipping insertion in model container [2019-12-27 15:32:19,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:18" (2/3) ... [2019-12-27 15:32:19,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c061ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:32:19, skipping insertion in model container [2019-12-27 15:32:19,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:32:19" (3/3) ... [2019-12-27 15:32:19,460 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_power.opt.i [2019-12-27 15:32:19,486 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:32:19,486 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:32:19,494 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:32:19,495 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:32:19,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,537 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,537 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,540 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,540 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,561 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,561 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,561 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,561 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,562 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,588 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,589 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,591 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,597 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,597 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,602 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,604 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:19,620 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 15:32:19,641 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:32:19,641 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:32:19,641 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:32:19,641 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:32:19,641 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:32:19,641 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:32:19,642 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:32:19,642 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:32:19,660 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 242 transitions [2019-12-27 15:32:19,662 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-27 15:32:19,776 INFO L132 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-27 15:32:19,776 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:32:19,802 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 563 event pairs. 0/181 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 15:32:19,853 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-27 15:32:19,936 INFO L132 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-27 15:32:19,937 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:32:19,954 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 563 event pairs. 0/181 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 15:32:19,998 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-27 15:32:19,999 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:32:26,177 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 15:32:26,302 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 15:32:26,455 INFO L206 etLargeBlockEncoding]: Checked pairs total: 123368 [2019-12-27 15:32:26,455 INFO L214 etLargeBlockEncoding]: Total number of compositions: 129 [2019-12-27 15:32:26,458 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 127 transitions [2019-12-27 15:32:29,419 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42030 states. [2019-12-27 15:32:29,421 INFO L276 IsEmpty]: Start isEmpty. Operand 42030 states. [2019-12-27 15:32:29,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 15:32:29,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:29,428 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:32:29,429 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 15:32:29,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:29,435 INFO L82 PathProgramCache]: Analyzing trace with hash -668359293, now seen corresponding path program 1 times [2019-12-27 15:32:29,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:29,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286403565] [2019-12-27 15:32:29,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:29,704 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 15:32:29,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286403565] [2019-12-27 15:32:29,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:29,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:32:29,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1794254497] [2019-12-27 15:32:29,708 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:29,713 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:29,728 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 15:32:29,728 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:29,732 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:29,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:32:29,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:29,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:32:29,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:32:29,751 INFO L87 Difference]: Start difference. First operand 42030 states. Second operand 3 states. [2019-12-27 15:32:31,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:31,166 INFO L93 Difference]: Finished difference Result 41734 states and 171976 transitions. [2019-12-27 15:32:31,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:32:31,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 15:32:31,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:31,564 INFO L225 Difference]: With dead ends: 41734 [2019-12-27 15:32:31,564 INFO L226 Difference]: Without dead ends: 38878 [2019-12-27 15:32:31,566 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 15:32:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38878 states. [2019-12-27 15:32:33,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38878 to 38878. [2019-12-27 15:32:33,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38878 states. [2019-12-27 15:32:33,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38878 states to 38878 states and 160088 transitions. [2019-12-27 15:32:33,894 INFO L78 Accepts]: Start accepts. Automaton has 38878 states and 160088 transitions. Word has length 7 [2019-12-27 15:32:33,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:33,895 INFO L462 AbstractCegarLoop]: Abstraction has 38878 states and 160088 transitions. [2019-12-27 15:32:33,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:32:33,895 INFO L276 IsEmpty]: Start isEmpty. Operand 38878 states and 160088 transitions. [2019-12-27 15:32:33,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 15:32:33,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:33,903 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:32:33,905 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 15:32:33,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:33,905 INFO L82 PathProgramCache]: Analyzing trace with hash 298788116, now seen corresponding path program 1 times [2019-12-27 15:32:33,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:33,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386124622] [2019-12-27 15:32:33,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:33,999 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 15:32:33,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386124622] [2019-12-27 15:32:33,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:33,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:32:34,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1714145940] [2019-12-27 15:32:34,000 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:34,001 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:34,004 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 15:32:34,005 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:34,005 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:34,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:32:34,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:34,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:32:34,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:32:34,007 INFO L87 Difference]: Start difference. First operand 38878 states and 160088 transitions. Second operand 3 states. [2019-12-27 15:32:35,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:35,841 INFO L93 Difference]: Finished difference Result 21899 states and 79018 transitions. [2019-12-27 15:32:35,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:32:35,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 15:32:35,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:35,939 INFO L225 Difference]: With dead ends: 21899 [2019-12-27 15:32:35,939 INFO L226 Difference]: Without dead ends: 21899 [2019-12-27 15:32:35,940 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 15:32:36,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21899 states. [2019-12-27 15:32:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21899 to 21899. [2019-12-27 15:32:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21899 states. [2019-12-27 15:32:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21899 states to 21899 states and 79018 transitions. [2019-12-27 15:32:36,812 INFO L78 Accepts]: Start accepts. Automaton has 21899 states and 79018 transitions. Word has length 13 [2019-12-27 15:32:36,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:36,812 INFO L462 AbstractCegarLoop]: Abstraction has 21899 states and 79018 transitions. [2019-12-27 15:32:36,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:32:36,812 INFO L276 IsEmpty]: Start isEmpty. Operand 21899 states and 79018 transitions. [2019-12-27 15:32:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 15:32:36,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:36,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:32:36,818 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 15:32:36,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:36,818 INFO L82 PathProgramCache]: Analyzing trace with hash 521500695, now seen corresponding path program 1 times [2019-12-27 15:32:36,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:36,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888955778] [2019-12-27 15:32:36,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:36,893 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 15:32:36,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888955778] [2019-12-27 15:32:36,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:36,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:32:36,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1400690689] [2019-12-27 15:32:36,894 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:36,895 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:36,898 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 15:32:36,898 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:36,899 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:36,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:32:36,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:36,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:32:36,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:32:36,900 INFO L87 Difference]: Start difference. First operand 21899 states and 79018 transitions. Second operand 4 states. [2019-12-27 15:32:36,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:36,947 INFO L93 Difference]: Finished difference Result 4006 states and 11798 transitions. [2019-12-27 15:32:36,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:32:36,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 15:32:36,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:36,966 INFO L225 Difference]: With dead ends: 4006 [2019-12-27 15:32:36,966 INFO L226 Difference]: Without dead ends: 4006 [2019-12-27 15:32:36,967 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 15:32:36,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4006 states. [2019-12-27 15:32:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4006 to 4006. [2019-12-27 15:32:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4006 states. [2019-12-27 15:32:37,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4006 states to 4006 states and 11798 transitions. [2019-12-27 15:32:37,054 INFO L78 Accepts]: Start accepts. Automaton has 4006 states and 11798 transitions. Word has length 14 [2019-12-27 15:32:37,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:37,054 INFO L462 AbstractCegarLoop]: Abstraction has 4006 states and 11798 transitions. [2019-12-27 15:32:37,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:32:37,054 INFO L276 IsEmpty]: Start isEmpty. Operand 4006 states and 11798 transitions. [2019-12-27 15:32:37,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:32:37,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:37,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:32:37,056 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 15:32:37,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:37,057 INFO L82 PathProgramCache]: Analyzing trace with hash -46103865, now seen corresponding path program 1 times [2019-12-27 15:32:37,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:37,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114627209] [2019-12-27 15:32:37,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:37,146 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 15:32:37,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114627209] [2019-12-27 15:32:37,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:37,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:32:37,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [470797411] [2019-12-27 15:32:37,148 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:37,150 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:37,153 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 15:32:37,154 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:37,191 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:32:37,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:32:37,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:37,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:32:37,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:32:37,193 INFO L87 Difference]: Start difference. First operand 4006 states and 11798 transitions. Second operand 5 states. [2019-12-27 15:32:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:37,530 INFO L93 Difference]: Finished difference Result 5505 states and 15747 transitions. [2019-12-27 15:32:37,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:32:37,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 15:32:37,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:37,544 INFO L225 Difference]: With dead ends: 5505 [2019-12-27 15:32:37,544 INFO L226 Difference]: Without dead ends: 5505 [2019-12-27 15:32:37,545 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 15:32:37,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5505 states. [2019-12-27 15:32:37,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5505 to 5409. [2019-12-27 15:32:37,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5409 states. [2019-12-27 15:32:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5409 states to 5409 states and 15570 transitions. [2019-12-27 15:32:37,674 INFO L78 Accepts]: Start accepts. Automaton has 5409 states and 15570 transitions. Word has length 16 [2019-12-27 15:32:37,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:37,674 INFO L462 AbstractCegarLoop]: Abstraction has 5409 states and 15570 transitions. [2019-12-27 15:32:37,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:32:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 5409 states and 15570 transitions. [2019-12-27 15:32:37,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 15:32:37,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:37,683 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 15:32:37,684 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 15:32:37,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:37,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1141295517, now seen corresponding path program 1 times [2019-12-27 15:32:37,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:37,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565796366] [2019-12-27 15:32:37,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:37,754 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 15:32:37,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565796366] [2019-12-27 15:32:37,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:37,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:32:37,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [386618908] [2019-12-27 15:32:37,756 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:37,761 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:37,777 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 107 transitions. [2019-12-27 15:32:37,777 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:37,797 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:32:37,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:32:37,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:37,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:32:37,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:32:37,798 INFO L87 Difference]: Start difference. First operand 5409 states and 15570 transitions. Second operand 6 states. [2019-12-27 15:32:37,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:37,843 INFO L93 Difference]: Finished difference Result 4207 states and 12669 transitions. [2019-12-27 15:32:37,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:32:37,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 15:32:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:37,853 INFO L225 Difference]: With dead ends: 4207 [2019-12-27 15:32:37,853 INFO L226 Difference]: Without dead ends: 4207 [2019-12-27 15:32:37,854 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 15:32:37,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4207 states. [2019-12-27 15:32:37,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4207 to 4151. [2019-12-27 15:32:37,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4151 states. [2019-12-27 15:32:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4151 states to 4151 states and 12543 transitions. [2019-12-27 15:32:37,945 INFO L78 Accepts]: Start accepts. Automaton has 4151 states and 12543 transitions. Word has length 31 [2019-12-27 15:32:37,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:37,945 INFO L462 AbstractCegarLoop]: Abstraction has 4151 states and 12543 transitions. [2019-12-27 15:32:37,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:32:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 4151 states and 12543 transitions. [2019-12-27 15:32:37,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 15:32:37,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:37,958 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 15:32:37,958 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 15:32:37,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:37,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1866651201, now seen corresponding path program 1 times [2019-12-27 15:32:37,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:37,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603906743] [2019-12-27 15:32:37,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:38,079 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 15:32:38,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603906743] [2019-12-27 15:32:38,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:38,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:32:38,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1391811027] [2019-12-27 15:32:38,082 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:38,102 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:38,269 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 83 transitions. [2019-12-27 15:32:38,269 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:38,270 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:38,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:32:38,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:38,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:32:38,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:32:38,271 INFO L87 Difference]: Start difference. First operand 4151 states and 12543 transitions. Second operand 4 states. [2019-12-27 15:32:38,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:38,305 INFO L93 Difference]: Finished difference Result 4675 states and 13726 transitions. [2019-12-27 15:32:38,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:32:38,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-27 15:32:38,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:38,311 INFO L225 Difference]: With dead ends: 4675 [2019-12-27 15:32:38,311 INFO L226 Difference]: Without dead ends: 2595 [2019-12-27 15:32:38,311 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 15:32:38,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2019-12-27 15:32:38,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 2595. [2019-12-27 15:32:38,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2595 states. [2019-12-27 15:32:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 6927 transitions. [2019-12-27 15:32:38,363 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 6927 transitions. Word has length 61 [2019-12-27 15:32:38,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:38,365 INFO L462 AbstractCegarLoop]: Abstraction has 2595 states and 6927 transitions. [2019-12-27 15:32:38,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:32:38,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 6927 transitions. [2019-12-27 15:32:38,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 15:32:38,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:38,372 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 15:32:38,373 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 15:32:38,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:38,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1443330155, now seen corresponding path program 2 times [2019-12-27 15:32:38,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:38,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364367683] [2019-12-27 15:32:38,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:38,506 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 15:32:38,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364367683] [2019-12-27 15:32:38,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:38,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:32:38,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [454316782] [2019-12-27 15:32:38,510 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:38,529 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:38,584 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 91 transitions. [2019-12-27 15:32:38,584 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:38,586 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:38,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:32:38,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:38,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:32:38,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:32:38,587 INFO L87 Difference]: Start difference. First operand 2595 states and 6927 transitions. Second operand 4 states. [2019-12-27 15:32:38,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:38,618 INFO L93 Difference]: Finished difference Result 2969 states and 7797 transitions. [2019-12-27 15:32:38,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:32:38,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-27 15:32:38,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:38,619 INFO L225 Difference]: With dead ends: 2969 [2019-12-27 15:32:38,620 INFO L226 Difference]: Without dead ends: 435 [2019-12-27 15:32:38,620 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 15:32:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-12-27 15:32:38,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2019-12-27 15:32:38,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-12-27 15:32:38,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 965 transitions. [2019-12-27 15:32:38,627 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 965 transitions. Word has length 61 [2019-12-27 15:32:38,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:38,627 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 965 transitions. [2019-12-27 15:32:38,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:32:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 965 transitions. [2019-12-27 15:32:38,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 15:32:38,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:38,629 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 15:32:38,629 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 15:32:38,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:38,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1456003003, now seen corresponding path program 3 times [2019-12-27 15:32:38,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:38,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165420218] [2019-12-27 15:32:38,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:38,737 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 15:32:38,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165420218] [2019-12-27 15:32:38,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:38,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:32:38,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2098954920] [2019-12-27 15:32:38,739 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:38,758 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:38,802 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 91 transitions. [2019-12-27 15:32:38,802 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:38,803 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:38,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:32:38,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:38,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:32:38,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:32:38,804 INFO L87 Difference]: Start difference. First operand 435 states and 965 transitions. Second operand 5 states. [2019-12-27 15:32:38,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:38,872 INFO L93 Difference]: Finished difference Result 857 states and 1916 transitions. [2019-12-27 15:32:38,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:32:38,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-12-27 15:32:38,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:38,875 INFO L225 Difference]: With dead ends: 857 [2019-12-27 15:32:38,875 INFO L226 Difference]: Without dead ends: 434 [2019-12-27 15:32:38,875 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 15:32:38,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-12-27 15:32:38,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2019-12-27 15:32:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-12-27 15:32:38,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 963 transitions. [2019-12-27 15:32:38,882 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 963 transitions. Word has length 61 [2019-12-27 15:32:38,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:38,882 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 963 transitions. [2019-12-27 15:32:38,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:32:38,882 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 963 transitions. [2019-12-27 15:32:38,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 15:32:38,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:38,884 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 15:32:38,884 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 15:32:38,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:38,885 INFO L82 PathProgramCache]: Analyzing trace with hash -2002987985, now seen corresponding path program 1 times [2019-12-27 15:32:38,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:38,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139989884] [2019-12-27 15:32:38,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:38,986 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 15:32:38,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139989884] [2019-12-27 15:32:38,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:38,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:32:38,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1226257521] [2019-12-27 15:32:38,988 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:39,008 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:39,066 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 92 transitions. [2019-12-27 15:32:39,067 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:39,167 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 15:32:39,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:32:39,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:39,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:32:39,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:32:39,169 INFO L87 Difference]: Start difference. First operand 434 states and 963 transitions. Second operand 6 states. [2019-12-27 15:32:39,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:39,938 INFO L93 Difference]: Finished difference Result 1331 states and 2817 transitions. [2019-12-27 15:32:39,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:32:39,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-27 15:32:39,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:39,942 INFO L225 Difference]: With dead ends: 1331 [2019-12-27 15:32:39,942 INFO L226 Difference]: Without dead ends: 1331 [2019-12-27 15:32:39,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:32:39,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2019-12-27 15:32:39,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 883. [2019-12-27 15:32:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-12-27 15:32:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1907 transitions. [2019-12-27 15:32:39,958 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1907 transitions. Word has length 62 [2019-12-27 15:32:39,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:39,958 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1907 transitions. [2019-12-27 15:32:39,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:32:39,958 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1907 transitions. [2019-12-27 15:32:39,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 15:32:39,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:39,960 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 15:32:39,961 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 15:32:39,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:39,961 INFO L82 PathProgramCache]: Analyzing trace with hash 429224045, now seen corresponding path program 2 times [2019-12-27 15:32:39,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:39,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593150668] [2019-12-27 15:32:39,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:40,068 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 15:32:40,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593150668] [2019-12-27 15:32:40,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:40,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:32:40,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [247275891] [2019-12-27 15:32:40,069 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:40,106 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:40,202 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 102 transitions. [2019-12-27 15:32:40,202 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:40,245 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:32:40,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:32:40,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:40,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:32:40,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:32:40,246 INFO L87 Difference]: Start difference. First operand 883 states and 1907 transitions. Second operand 10 states. [2019-12-27 15:32:41,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:41,270 INFO L93 Difference]: Finished difference Result 3198 states and 6840 transitions. [2019-12-27 15:32:41,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 15:32:41,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-12-27 15:32:41,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:41,274 INFO L225 Difference]: With dead ends: 3198 [2019-12-27 15:32:41,274 INFO L226 Difference]: Without dead ends: 1826 [2019-12-27 15:32:41,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=933, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 15:32:41,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2019-12-27 15:32:41,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1160. [2019-12-27 15:32:41,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-12-27 15:32:41,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 2461 transitions. [2019-12-27 15:32:41,295 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 2461 transitions. Word has length 62 [2019-12-27 15:32:41,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:41,295 INFO L462 AbstractCegarLoop]: Abstraction has 1160 states and 2461 transitions. [2019-12-27 15:32:41,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:32:41,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 2461 transitions. [2019-12-27 15:32:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 15:32:41,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:41,298 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 15:32:41,298 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 15:32:41,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:41,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1498557581, now seen corresponding path program 3 times [2019-12-27 15:32:41,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:41,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843608526] [2019-12-27 15:32:41,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:41,544 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 15:32:41,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843608526] [2019-12-27 15:32:41,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:41,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 15:32:41,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [289746811] [2019-12-27 15:32:41,545 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:41,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:41,701 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 82 transitions. [2019-12-27 15:32:41,701 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:41,723 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:32:41,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:32:41,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:41,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:32:41,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:32:41,724 INFO L87 Difference]: Start difference. First operand 1160 states and 2461 transitions. Second operand 11 states. [2019-12-27 15:32:43,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:43,064 INFO L93 Difference]: Finished difference Result 3123 states and 6416 transitions. [2019-12-27 15:32:43,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 15:32:43,065 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-12-27 15:32:43,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:43,070 INFO L225 Difference]: With dead ends: 3123 [2019-12-27 15:32:43,070 INFO L226 Difference]: Without dead ends: 3106 [2019-12-27 15:32:43,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2019-12-27 15:32:43,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2019-12-27 15:32:43,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 1354. [2019-12-27 15:32:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1354 states. [2019-12-27 15:32:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 2898 transitions. [2019-12-27 15:32:43,099 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 2898 transitions. Word has length 62 [2019-12-27 15:32:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:43,100 INFO L462 AbstractCegarLoop]: Abstraction has 1354 states and 2898 transitions. [2019-12-27 15:32:43,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:32:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 2898 transitions. [2019-12-27 15:32:43,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 15:32:43,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:43,103 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 15:32:43,103 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 15:32:43,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:43,104 INFO L82 PathProgramCache]: Analyzing trace with hash -124190557, now seen corresponding path program 4 times [2019-12-27 15:32:43,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:43,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105352945] [2019-12-27 15:32:43,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:43,189 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 15:32:43,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105352945] [2019-12-27 15:32:43,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:43,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:32:43,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1233986620] [2019-12-27 15:32:43,191 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:43,208 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:43,306 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 173 transitions. [2019-12-27 15:32:43,306 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:43,389 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 15:32:43,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:32:43,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:43,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:32:43,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:32:43,390 INFO L87 Difference]: Start difference. First operand 1354 states and 2898 transitions. Second operand 7 states. [2019-12-27 15:32:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:44,070 INFO L93 Difference]: Finished difference Result 2421 states and 5158 transitions. [2019-12-27 15:32:44,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:32:44,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-27 15:32:44,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:44,075 INFO L225 Difference]: With dead ends: 2421 [2019-12-27 15:32:44,075 INFO L226 Difference]: Without dead ends: 2421 [2019-12-27 15:32:44,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:32:44,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2019-12-27 15:32:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 1585. [2019-12-27 15:32:44,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2019-12-27 15:32:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 3475 transitions. [2019-12-27 15:32:44,107 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 3475 transitions. Word has length 62 [2019-12-27 15:32:44,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:44,107 INFO L462 AbstractCegarLoop]: Abstraction has 1585 states and 3475 transitions. [2019-12-27 15:32:44,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:32:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 3475 transitions. [2019-12-27 15:32:44,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 15:32:44,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:44,111 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 15:32:44,111 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 15:32:44,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:44,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1967740323, now seen corresponding path program 5 times [2019-12-27 15:32:44,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:44,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415128129] [2019-12-27 15:32:44,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:44,223 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 15:32:44,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415128129] [2019-12-27 15:32:44,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:44,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:32:44,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [445586669] [2019-12-27 15:32:44,224 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:44,241 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:44,309 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 110 transitions. [2019-12-27 15:32:44,309 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:44,310 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:44,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:32:44,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:44,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:32:44,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:32:44,311 INFO L87 Difference]: Start difference. First operand 1585 states and 3475 transitions. Second operand 3 states. [2019-12-27 15:32:44,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:44,323 INFO L93 Difference]: Finished difference Result 1585 states and 3474 transitions. [2019-12-27 15:32:44,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:32:44,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-27 15:32:44,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:44,326 INFO L225 Difference]: With dead ends: 1585 [2019-12-27 15:32:44,326 INFO L226 Difference]: Without dead ends: 1585 [2019-12-27 15:32:44,327 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 15:32:44,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-12-27 15:32:44,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1500. [2019-12-27 15:32:44,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1500 states. [2019-12-27 15:32:44,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 3339 transitions. [2019-12-27 15:32:44,342 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 3339 transitions. Word has length 62 [2019-12-27 15:32:44,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:44,343 INFO L462 AbstractCegarLoop]: Abstraction has 1500 states and 3339 transitions. [2019-12-27 15:32:44,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:32:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 3339 transitions. [2019-12-27 15:32:44,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 15:32:44,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:44,346 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 15:32:44,346 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 15:32:44,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:44,346 INFO L82 PathProgramCache]: Analyzing trace with hash 799739627, now seen corresponding path program 1 times [2019-12-27 15:32:44,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:44,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246934549] [2019-12-27 15:32:44,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:32:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:32:44,477 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:32:44,477 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:32:44,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_106| 0 0))) (and (= v_~y$flush_delayed~0_334 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t65~0.base_69| 4) |v_#length_21|) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t65~0.base_69|)) (= v_~y$r_buff0_thd0~0_211 0) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff0_used~0_972 0) (= v_~y$w_buff1~0_277 0) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_59 0) (= 0 v_~y$r_buff0_thd2~0_408) (= v_~y$r_buff1_thd0~0_314 0) (= v_~y$w_buff1_used~0_548 0) (= 0 |v_ULTIMATE.start_main_~#t65~0.offset_41|) (< 0 |v_#StackHeapBarrier_16|) (= v_~y$r_buff1_thd1~0_221 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t65~0.base_69| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t65~0.base_69|) |v_ULTIMATE.start_main_~#t65~0.offset_41| 0)) |v_#memory_int_19|) (= v_~__unbuffered_cnt~0_149 0) (= v_~y$r_buff0_thd1~0_150 0) (= v_~y$mem_tmp~0_266 0) (= 0 v_~__unbuffered_p0_EAX~0_59) (= v_~y~0_368 0) (= v_~main$tmp_guard0~0_20 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t65~0.base_69|) (= 0 v_~y$r_buff0_thd3~0_638) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_#NULL.base_7|) (= 0 v_~weak$$choice0~0_253) (= v_~z~0_27 0) (= 0 v_~y$w_buff0~0_388) (= 0 v_~__unbuffered_p2_EAX~0_67) (= 0 v_~y$r_buff1_thd3~0_405) (= 0 v_~y$r_buff1_thd2~0_395) (= v_~__unbuffered_p1_EBX~0_68 0) (= v_~weak$$choice2~0_330 0) (= 0 v_~__unbuffered_p1_EAX~0_81) (= |v_#valid_104| (store .cse0 |v_ULTIMATE.start_main_~#t65~0.base_69| 1)) (= v_~__unbuffered_p2_EBX~0_61 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_~#t65~0.offset=|v_ULTIMATE.start_main_~#t65~0.offset_41|, #NULL.offset=|v_#NULL.offset_7|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_266, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_59, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_405, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_81, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_150, ~y$flush_delayed~0=v_~y$flush_delayed~0_334, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_67, ULTIMATE.start_main_~#t67~0.offset=|v_ULTIMATE.start_main_~#t67~0.offset_14|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_54|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_117|, ~weak$$choice0~0=v_~weak$$choice0~0_253, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t65~0.base=|v_ULTIMATE.start_main_~#t65~0.base_69|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_40|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t66~0.offset=|v_ULTIMATE.start_main_~#t66~0.offset_41|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_408, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_314, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t66~0.base=|v_ULTIMATE.start_main_~#t66~0.base_70|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_972, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_221, ~y$w_buff0~0=v_~y$w_buff0~0_388, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_638, ~y~0=v_~y~0_368, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_68, ULTIMATE.start_main_~#t67~0.base=|v_ULTIMATE.start_main_~#t67~0.base_43|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_74|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_395, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_478|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_43|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_211, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_330, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t65~0.offset, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t67~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_~#t65~0.base, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t66~0.offset, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t66~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t67~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 15:32:44,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L835-1-->L837: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t66~0.base_12| 4)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t66~0.base_12|) 0) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t66~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t66~0.base_12|) |v_ULTIMATE.start_main_~#t66~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t66~0.base_12|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t66~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t66~0.offset_10|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t66~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t66~0.base=|v_ULTIMATE.start_main_~#t66~0.base_12|, ULTIMATE.start_main_~#t66~0.offset=|v_ULTIMATE.start_main_~#t66~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t66~0.base, ULTIMATE.start_main_~#t66~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 15:32:44,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L837-1-->L839: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t67~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t67~0.base_11|) |v_ULTIMATE.start_main_~#t67~0.offset_9| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t67~0.base_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t67~0.base_11| 4) |v_#length_13|) (not (= |v_ULTIMATE.start_main_~#t67~0.base_11| 0)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t67~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t67~0.offset_9| 0) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t67~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t67~0.offset=|v_ULTIMATE.start_main_~#t67~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t67~0.base=|v_ULTIMATE.start_main_~#t67~0.base_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t67~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t67~0.base, #length] because there is no mapped edge [2019-12-27 15:32:44,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_65 v_~y$w_buff0_used~0_118) (= 1 v_~y$w_buff0~0_43) (= (mod v_~y$w_buff1_used~0_65 256) 0) (= |v_P2Thread1of1ForFork0_#in~arg.offset_16| v_P2Thread1of1ForFork0_~arg.offset_16) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_18 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_16|) (= |v_P2Thread1of1ForFork0_#in~arg.base_16| v_P2Thread1of1ForFork0_~arg.base_16) (= v_~y$w_buff0_used~0_117 1) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_16|) (= v_~y$w_buff0~0_44 v_~y$w_buff1~0_29)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_44, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_16, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_43, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_16, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_18, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 15:32:44,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-967450189 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-967450189 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out-967450189| ~y$w_buff1~0_In-967450189) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-967450189| ~y$w_buff0~0_In-967450189) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-967450189, ~y$w_buff1~0=~y$w_buff1~0_In-967450189, ~y$w_buff0~0=~y$w_buff0~0_In-967450189, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-967450189} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-967450189|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-967450189, ~y$w_buff1~0=~y$w_buff1~0_In-967450189, ~y$w_buff0~0=~y$w_buff0~0_In-967450189, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-967450189} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 15:32:44,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [912] [912] L797-4-->L798: Formula: (= v_~y~0_64 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, ~y~0=v_~y~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-27 15:32:44,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L802-->L803: Formula: (and (= v_~y$r_buff0_thd3~0_173 v_~y$r_buff0_thd3~0_172) (not (= 0 (mod v_~weak$$choice2~0_74 256)))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ~weak$$choice2~0=v_~weak$$choice2~0_74} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_10|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_12|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_172, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_13|, ~weak$$choice2~0=v_~weak$$choice2~0_74} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 15:32:44,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In952742519 256)))) (or (and (= ~y~0_In952742519 |P2Thread1of1ForFork0_#t~ite48_Out952742519|) .cse0) (and (not .cse0) (= ~y$mem_tmp~0_In952742519 |P2Thread1of1ForFork0_#t~ite48_Out952742519|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In952742519, ~y$flush_delayed~0=~y$flush_delayed~0_In952742519, ~y~0=~y~0_In952742519} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out952742519|, ~y$mem_tmp~0=~y$mem_tmp~0_In952742519, ~y$flush_delayed~0=~y$flush_delayed~0_In952742519, ~y~0=~y~0_In952742519} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-27 15:32:44,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= v_~z~0_15 1) (= v_P0Thread1of1ForFork1_~arg.offset_11 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_11) (= v_~x~0_38 v_~__unbuffered_p0_EAX~0_22)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~z~0=v_~z~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_11} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 15:32:44,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1993164847 256) 0))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-1993164847 |P1Thread1of1ForFork2_#t~ite25_Out-1993164847|)) (and (= ~y~0_In-1993164847 |P1Thread1of1ForFork2_#t~ite25_Out-1993164847|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1993164847, ~y$flush_delayed~0=~y$flush_delayed~0_In-1993164847, ~y~0=~y~0_In-1993164847} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1993164847, ~y$flush_delayed~0=~y$flush_delayed~0_In-1993164847, ~y~0=~y~0_In-1993164847, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1993164847|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 15:32:44,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L768-2-->P1EXIT: Formula: (and (= v_~y~0_266 |v_P1Thread1of1ForFork2_#t~ite25_116|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_136 (+ v_~__unbuffered_cnt~0_137 1)) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= v_~y$flush_delayed~0_286 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_116|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_286, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_136, ~y~0=v_~y~0_266, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_115|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 15:32:44,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-520324290 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-520324290 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite51_Out-520324290| ~y$w_buff0_used~0_In-520324290) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite51_Out-520324290| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-520324290, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-520324290} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-520324290, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-520324290, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-520324290|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-27 15:32:44,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1076195090 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1076195090 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1076195090 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1076195090 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out1076195090|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork0_#t~ite52_Out1076195090| ~y$w_buff1_used~0_In1076195090) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1076195090, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1076195090, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1076195090, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1076195090} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1076195090, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1076195090, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1076195090, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1076195090|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1076195090} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-27 15:32:44,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L815-->L816: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-397370648 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-397370648 256)))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out-397370648 0)) (and (= ~y$r_buff0_thd3~0_Out-397370648 ~y$r_buff0_thd3~0_In-397370648) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-397370648, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-397370648} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-397370648, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-397370648, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-397370648|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-27 15:32:44,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-1450148814 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1450148814 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1450148814 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-1450148814 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-1450148814|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-1450148814 |P2Thread1of1ForFork0_#t~ite54_Out-1450148814|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1450148814, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1450148814, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1450148814, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1450148814} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1450148814, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1450148814, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-1450148814|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1450148814, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1450148814} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 15:32:44,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_178 |v_P2Thread1of1ForFork0_#t~ite54_32|) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_178, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 15:32:44,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L839-1-->L845: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_58)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 15:32:44,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L845-2-->L845-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite58_Out1984002206| |ULTIMATE.start_main_#t~ite59_Out1984002206|)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1984002206 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1984002206 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite58_Out1984002206| ~y~0_In1984002206) (or .cse1 .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite58_Out1984002206| ~y$w_buff1~0_In1984002206) (not .cse1) (not .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1984002206, ~y~0=~y~0_In1984002206, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1984002206, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1984002206} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1984002206, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1984002206|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1984002206|, ~y~0=~y~0_In1984002206, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1984002206, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1984002206} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 15:32:44,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In208829561 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In208829561 256) 0))) (or (and (= ~y$w_buff0_used~0_In208829561 |ULTIMATE.start_main_#t~ite60_Out208829561|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite60_Out208829561| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In208829561, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In208829561} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out208829561|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In208829561, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In208829561} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 15:32:44,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L847-->L847-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1013706469 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1013706469 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1013706469 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1013706469 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out1013706469| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out1013706469| ~y$w_buff1_used~0_In1013706469)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1013706469, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1013706469, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1013706469, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1013706469} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1013706469|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1013706469, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1013706469, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1013706469, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1013706469} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 15:32:44,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1643401737 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1643401737 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out1643401737| ~y$r_buff0_thd0~0_In1643401737)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite62_Out1643401737| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1643401737, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1643401737} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1643401737|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1643401737, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1643401737} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 15:32:44,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L849-->L849-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1192994953 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1192994953 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1192994953 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1192994953 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out1192994953| ~y$r_buff1_thd0~0_In1192994953) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite63_Out1192994953|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1192994953, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1192994953, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1192994953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1192994953} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1192994953|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1192994953, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1192994953, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1192994953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1192994953} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 15:32:44,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= v_~main$tmp_guard1~0_20 0) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~__unbuffered_p1_EBX~0_25 0) (= v_~y$r_buff1_thd0~0_245 |v_ULTIMATE.start_main_#t~ite63_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~__unbuffered_p2_EBX~0_24 0)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_245, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 15:32:44,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:32:44 BasicIcfg [2019-12-27 15:32:44,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:32:44,639 INFO L168 Benchmark]: Toolchain (without parser) took 27196.81 ms. Allocated memory was 146.8 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 102.1 MB in the beginning and 660.5 MB in the end (delta: -558.5 MB). Peak memory consumption was 483.3 MB. Max. memory is 7.1 GB. [2019-12-27 15:32:44,641 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 146.8 MB. Free memory is still 121.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 15:32:44,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.79 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 101.7 MB in the beginning and 157.5 MB in the end (delta: -55.8 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2019-12-27 15:32:44,642 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.19 ms. Allocated memory is still 204.5 MB. Free memory was 157.5 MB in the beginning and 153.7 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. [2019-12-27 15:32:44,643 INFO L168 Benchmark]: Boogie Preprocessor took 41.18 ms. Allocated memory is still 204.5 MB. Free memory was 153.7 MB in the beginning and 151.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 15:32:44,644 INFO L168 Benchmark]: RCFGBuilder took 1064.48 ms. Allocated memory is still 204.5 MB. Free memory was 150.9 MB in the beginning and 95.9 MB in the end (delta: 55.0 MB). Peak memory consumption was 55.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:32:44,649 INFO L168 Benchmark]: TraceAbstraction took 25184.31 ms. Allocated memory was 204.5 MB in the beginning and 1.2 GB in the end (delta: 984.1 MB). Free memory was 95.9 MB in the beginning and 660.5 MB in the end (delta: -564.6 MB). Peak memory consumption was 419.4 MB. Max. memory is 7.1 GB. [2019-12-27 15:32:44,655 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.17 ms. Allocated memory is still 146.8 MB. Free memory is still 121.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 826.79 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 101.7 MB in the beginning and 157.5 MB in the end (delta: -55.8 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.19 ms. Allocated memory is still 204.5 MB. Free memory was 157.5 MB in the beginning and 153.7 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.18 ms. Allocated memory is still 204.5 MB. Free memory was 153.7 MB in the beginning and 151.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1064.48 ms. Allocated memory is still 204.5 MB. Free memory was 150.9 MB in the beginning and 95.9 MB in the end (delta: 55.0 MB). Peak memory consumption was 55.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25184.31 ms. Allocated memory was 204.5 MB in the beginning and 1.2 GB in the end (delta: 984.1 MB). Free memory was 95.9 MB in the beginning and 660.5 MB in the end (delta: -564.6 MB). Peak memory consumption was 419.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.7s, 196 ProgramPointsBefore, 105 ProgramPointsAfterwards, 242 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9301 VarBasedMoverChecksPositive, 327 VarBasedMoverChecksNegative, 92 SemBasedMoverChecksPositive, 328 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 0 MoverChecksTotal, 123368 CheckedPairsTotal, 129 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t65, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t66, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t67, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L790] 3 y$r_buff0_thd3 = (_Bool)1 [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 y$flush_delayed = weak$$choice2 [L796] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L799] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L800] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L801] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 3 y = y$flush_delayed ? y$mem_tmp : y [L806] 3 y$flush_delayed = (_Bool)0 [L809] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L750] 2 x = 1 [L753] 2 __unbuffered_p1_EAX = x [L756] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 2 y$flush_delayed = weak$$choice2 [L759] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L761] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L763] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L764] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L766] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L845] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L847] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L848] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 187 locations, 2 error locations. Result: UNSAFE, OverallTime: 24.8s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2306 SDtfs, 3020 SDslu, 5412 SDs, 0 SdLazy, 3024 SolverSat, 240 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42030occurred 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: 3.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 3939 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 637 NumberOfCodeBlocks, 637 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 561 ConstructedInterpolants, 0 QuantifiedInterpolants, 88085 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...