/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi010_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:04:56,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:04:56,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:04:56,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:04:56,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:04:56,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:04:56,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:04:56,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:04:56,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:04:56,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:04:56,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:04:56,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:04:56,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:04:56,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:04:56,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:04:56,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:04:56,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:04:56,369 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:04:56,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:04:56,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:04:56,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:04:56,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:04:56,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:04:56,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:04:56,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:04:56,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:04:56,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:04:56,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:04:56,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:04:56,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:04:56,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:04:56,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:04:56,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:04:56,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:04:56,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:04:56,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:04:56,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:04:56,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:04:56,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:04:56,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:04:56,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:04:56,390 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:04:56,404 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:04:56,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:04:56,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:04:56,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:04:56,406 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:04:56,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:04:56,406 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:04:56,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:04:56,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:04:56,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:04:56,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:04:56,407 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:04:56,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:04:56,408 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:04:56,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:04:56,408 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:04:56,408 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:04:56,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:04:56,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:04:56,409 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:04:56,409 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:04:56,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:04:56,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:04:56,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:04:56,410 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:04:56,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:04:56,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:04:56,410 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:04:56,411 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:04:56,411 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:04:56,411 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:04:56,411 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:04:56,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:04:56,698 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:04:56,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:04:56,704 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:04:56,705 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:04:56,706 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi010_rmo.oepc.i [2019-12-27 22:04:56,784 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2240e3fee/56279d88ecd74f3d87b3bf6691d3f206/FLAGa9ad35419 [2019-12-27 22:04:57,356 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:04:57,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi010_rmo.oepc.i [2019-12-27 22:04:57,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2240e3fee/56279d88ecd74f3d87b3bf6691d3f206/FLAGa9ad35419 [2019-12-27 22:04:57,620 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2240e3fee/56279d88ecd74f3d87b3bf6691d3f206 [2019-12-27 22:04:57,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:04:57,632 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:04:57,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:04:57,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:04:57,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:04:57,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:04:57" (1/1) ... [2019-12-27 22:04:57,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164a4878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:57, skipping insertion in model container [2019-12-27 22:04:57,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:04:57" (1/1) ... [2019-12-27 22:04:57,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:04:57,721 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:04:58,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:04:58,303 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:04:58,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:04:58,447 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:04:58,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:58 WrapperNode [2019-12-27 22:04:58,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:04:58,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:04:58,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:04:58,449 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:04:58,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:58" (1/1) ... [2019-12-27 22:04:58,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:58" (1/1) ... [2019-12-27 22:04:58,522 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:04:58,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:04:58,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:04:58,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:04:58,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:58" (1/1) ... [2019-12-27 22:04:58,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:58" (1/1) ... [2019-12-27 22:04:58,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:58" (1/1) ... [2019-12-27 22:04:58,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:58" (1/1) ... [2019-12-27 22:04:58,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:58" (1/1) ... [2019-12-27 22:04:58,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:58" (1/1) ... [2019-12-27 22:04:58,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:58" (1/1) ... [2019-12-27 22:04:58,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:04:58,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:04:58,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:04:58,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:04:58,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:58" (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 22:04:58,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:04:58,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:04:58,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:04:58,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:04:58,649 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:04:58,649 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:04:58,650 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:04:58,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:04:58,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:04:58,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:04:58,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:04:58,652 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 22:04:59,460 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:04:59,460 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:04:59,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:04:59 BoogieIcfgContainer [2019-12-27 22:04:59,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:04:59,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:04:59,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:04:59,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:04:59,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:04:57" (1/3) ... [2019-12-27 22:04:59,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230d9508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:04:59, skipping insertion in model container [2019-12-27 22:04:59,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:58" (2/3) ... [2019-12-27 22:04:59,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230d9508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:04:59, skipping insertion in model container [2019-12-27 22:04:59,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:04:59" (3/3) ... [2019-12-27 22:04:59,471 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi010_rmo.oepc.i [2019-12-27 22:04:59,482 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:04:59,482 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:04:59,490 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:04:59,491 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:04:59,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,549 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,549 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,570 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,570 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,571 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,571 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,571 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,598 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,600 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,607 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,608 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,610 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:59,627 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 22:04:59,643 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:04:59,643 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:04:59,644 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:04:59,644 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:04:59,644 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:04:59,644 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:04:59,644 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:04:59,644 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:04:59,662 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 227 transitions [2019-12-27 22:04:59,664 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-27 22:04:59,791 INFO L132 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-27 22:04:59,792 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:04:59,815 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 552 event pairs. 0/167 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 22:04:59,845 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-27 22:04:59,918 INFO L132 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-27 22:04:59,919 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:04:59,927 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 552 event pairs. 0/167 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 22:04:59,954 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-27 22:04:59,955 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:05:03,181 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 22:05:03,318 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 22:05:03,422 INFO L206 etLargeBlockEncoding]: Checked pairs total: 128953 [2019-12-27 22:05:03,423 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 22:05:03,426 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 130 transitions [2019-12-27 22:05:04,980 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25606 states. [2019-12-27 22:05:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 25606 states. [2019-12-27 22:05:04,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 22:05:04,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:04,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 22:05:04,989 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:04,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:04,994 INFO L82 PathProgramCache]: Analyzing trace with hash 955833670, now seen corresponding path program 1 times [2019-12-27 22:05:05,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:05,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265976832] [2019-12-27 22:05:05,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:05,287 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 22:05:05,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265976832] [2019-12-27 22:05:05,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:05,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:05:05,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [3755749] [2019-12-27 22:05:05,290 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:05,298 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:05,308 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 22:05:05,309 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:05,313 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:05:05,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:05:05,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:05,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:05:05,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:05:05,328 INFO L87 Difference]: Start difference. First operand 25606 states. Second operand 3 states. [2019-12-27 22:05:06,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:06,579 INFO L93 Difference]: Finished difference Result 25281 states and 91100 transitions. [2019-12-27 22:05:06,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:05:06,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 22:05:06,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:06,763 INFO L225 Difference]: With dead ends: 25281 [2019-12-27 22:05:06,763 INFO L226 Difference]: Without dead ends: 23653 [2019-12-27 22:05:06,765 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 22:05:07,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23653 states. [2019-12-27 22:05:07,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23653 to 23653. [2019-12-27 22:05:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23653 states. [2019-12-27 22:05:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23653 states to 23653 states and 85170 transitions. [2019-12-27 22:05:08,202 INFO L78 Accepts]: Start accepts. Automaton has 23653 states and 85170 transitions. Word has length 5 [2019-12-27 22:05:08,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:08,203 INFO L462 AbstractCegarLoop]: Abstraction has 23653 states and 85170 transitions. [2019-12-27 22:05:08,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:05:08,203 INFO L276 IsEmpty]: Start isEmpty. Operand 23653 states and 85170 transitions. [2019-12-27 22:05:08,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:05:08,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:08,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:05:08,208 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:08,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:08,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2053033798, now seen corresponding path program 1 times [2019-12-27 22:05:08,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:08,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446367932] [2019-12-27 22:05:08,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:08,350 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 22:05:08,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446367932] [2019-12-27 22:05:08,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:08,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:05:08,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [882229513] [2019-12-27 22:05:08,351 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:08,357 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:08,363 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:05:08,367 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:08,367 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:05:08,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:05:08,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:08,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:05:08,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:05:08,370 INFO L87 Difference]: Start difference. First operand 23653 states and 85170 transitions. Second operand 4 states. [2019-12-27 22:05:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:08,508 INFO L93 Difference]: Finished difference Result 4452 states and 12944 transitions. [2019-12-27 22:05:08,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:05:08,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:05:08,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:08,519 INFO L225 Difference]: With dead ends: 4452 [2019-12-27 22:05:08,519 INFO L226 Difference]: Without dead ends: 2843 [2019-12-27 22:05:08,521 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 22:05:08,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2019-12-27 22:05:08,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2843. [2019-12-27 22:05:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2843 states. [2019-12-27 22:05:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2843 states and 7163 transitions. [2019-12-27 22:05:08,610 INFO L78 Accepts]: Start accepts. Automaton has 2843 states and 7163 transitions. Word has length 11 [2019-12-27 22:05:08,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:08,611 INFO L462 AbstractCegarLoop]: Abstraction has 2843 states and 7163 transitions. [2019-12-27 22:05:08,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:05:08,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2843 states and 7163 transitions. [2019-12-27 22:05:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:05:08,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:08,617 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:05:08,618 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:08,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:08,618 INFO L82 PathProgramCache]: Analyzing trace with hash -892525895, now seen corresponding path program 1 times [2019-12-27 22:05:08,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:08,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913686561] [2019-12-27 22:05:08,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:08,744 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 22:05:08,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913686561] [2019-12-27 22:05:08,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:08,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:05:08,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [20125127] [2019-12-27 22:05:08,746 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:08,748 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:08,753 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:05:08,754 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:08,798 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:05:08,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:05:08,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:08,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:05:08,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:05:08,799 INFO L87 Difference]: Start difference. First operand 2843 states and 7163 transitions. Second operand 5 states. [2019-12-27 22:05:09,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:09,169 INFO L93 Difference]: Finished difference Result 3810 states and 9316 transitions. [2019-12-27 22:05:09,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:05:09,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:05:09,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:09,180 INFO L225 Difference]: With dead ends: 3810 [2019-12-27 22:05:09,180 INFO L226 Difference]: Without dead ends: 3782 [2019-12-27 22:05:09,181 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 22:05:09,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3782 states. [2019-12-27 22:05:09,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3782 to 3674. [2019-12-27 22:05:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3674 states. [2019-12-27 22:05:09,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3674 states to 3674 states and 9057 transitions. [2019-12-27 22:05:09,268 INFO L78 Accepts]: Start accepts. Automaton has 3674 states and 9057 transitions. Word has length 14 [2019-12-27 22:05:09,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:09,268 INFO L462 AbstractCegarLoop]: Abstraction has 3674 states and 9057 transitions. [2019-12-27 22:05:09,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:05:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3674 states and 9057 transitions. [2019-12-27 22:05:09,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 22:05:09,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:09,273 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] [2019-12-27 22:05:09,273 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:09,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:09,273 INFO L82 PathProgramCache]: Analyzing trace with hash 774115384, now seen corresponding path program 1 times [2019-12-27 22:05:09,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:09,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828686794] [2019-12-27 22:05:09,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:09,416 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 22:05:09,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828686794] [2019-12-27 22:05:09,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:09,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:05:09,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1578863810] [2019-12-27 22:05:09,418 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:09,422 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:09,434 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 96 transitions. [2019-12-27 22:05:09,435 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:09,455 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:05:09,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:05:09,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:09,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:05:09,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:05:09,456 INFO L87 Difference]: Start difference. First operand 3674 states and 9057 transitions. Second operand 6 states. [2019-12-27 22:05:09,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:09,953 INFO L93 Difference]: Finished difference Result 4181 states and 10083 transitions. [2019-12-27 22:05:09,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:05:09,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 22:05:09,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:09,965 INFO L225 Difference]: With dead ends: 4181 [2019-12-27 22:05:09,965 INFO L226 Difference]: Without dead ends: 4180 [2019-12-27 22:05:09,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:05:10,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4180 states. [2019-12-27 22:05:10,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4180 to 3919. [2019-12-27 22:05:10,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3919 states. [2019-12-27 22:05:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 9579 transitions. [2019-12-27 22:05:10,147 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 9579 transitions. Word has length 28 [2019-12-27 22:05:10,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:10,148 INFO L462 AbstractCegarLoop]: Abstraction has 3919 states and 9579 transitions. [2019-12-27 22:05:10,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:05:10,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 9579 transitions. [2019-12-27 22:05:10,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 22:05:10,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:10,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:05:10,155 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:10,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:10,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1850113030, now seen corresponding path program 1 times [2019-12-27 22:05:10,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:10,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535553974] [2019-12-27 22:05:10,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:10,220 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 22:05:10,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535553974] [2019-12-27 22:05:10,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:10,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:05:10,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [309588446] [2019-12-27 22:05:10,222 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:10,228 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:10,239 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 39 transitions. [2019-12-27 22:05:10,240 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:10,240 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:05:10,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:05:10,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:10,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:05:10,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:05:10,242 INFO L87 Difference]: Start difference. First operand 3919 states and 9579 transitions. Second operand 3 states. [2019-12-27 22:05:10,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:10,261 INFO L93 Difference]: Finished difference Result 3861 states and 9444 transitions. [2019-12-27 22:05:10,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:05:10,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 22:05:10,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:10,278 INFO L225 Difference]: With dead ends: 3861 [2019-12-27 22:05:10,278 INFO L226 Difference]: Without dead ends: 3861 [2019-12-27 22:05:10,279 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 22:05:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2019-12-27 22:05:10,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 3861. [2019-12-27 22:05:10,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3861 states. [2019-12-27 22:05:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3861 states to 3861 states and 9444 transitions. [2019-12-27 22:05:10,362 INFO L78 Accepts]: Start accepts. Automaton has 3861 states and 9444 transitions. Word has length 33 [2019-12-27 22:05:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:10,362 INFO L462 AbstractCegarLoop]: Abstraction has 3861 states and 9444 transitions. [2019-12-27 22:05:10,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:05:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3861 states and 9444 transitions. [2019-12-27 22:05:10,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 22:05:10,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:10,375 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] [2019-12-27 22:05:10,375 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:10,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:10,375 INFO L82 PathProgramCache]: Analyzing trace with hash -691824666, now seen corresponding path program 1 times [2019-12-27 22:05:10,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:10,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117710649] [2019-12-27 22:05:10,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:10,508 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 22:05:10,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117710649] [2019-12-27 22:05:10,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:10,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:05:10,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1129866884] [2019-12-27 22:05:10,510 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:10,520 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:10,532 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 41 transitions. [2019-12-27 22:05:10,532 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:10,533 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:05:10,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:05:10,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:10,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:05:10,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:05:10,534 INFO L87 Difference]: Start difference. First operand 3861 states and 9444 transitions. Second operand 5 states. [2019-12-27 22:05:10,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:10,664 INFO L93 Difference]: Finished difference Result 6343 states and 15732 transitions. [2019-12-27 22:05:10,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:05:10,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 22:05:10,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:10,676 INFO L225 Difference]: With dead ends: 6343 [2019-12-27 22:05:10,676 INFO L226 Difference]: Without dead ends: 4968 [2019-12-27 22:05:10,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:05:10,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4968 states. [2019-12-27 22:05:10,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4968 to 4968. [2019-12-27 22:05:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4968 states. [2019-12-27 22:05:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4968 states to 4968 states and 12444 transitions. [2019-12-27 22:05:10,784 INFO L78 Accepts]: Start accepts. Automaton has 4968 states and 12444 transitions. Word has length 41 [2019-12-27 22:05:10,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:10,785 INFO L462 AbstractCegarLoop]: Abstraction has 4968 states and 12444 transitions. [2019-12-27 22:05:10,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:05:10,785 INFO L276 IsEmpty]: Start isEmpty. Operand 4968 states and 12444 transitions. [2019-12-27 22:05:10,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 22:05:10,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:10,798 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] [2019-12-27 22:05:10,798 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:10,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:10,799 INFO L82 PathProgramCache]: Analyzing trace with hash -266606394, now seen corresponding path program 1 times [2019-12-27 22:05:10,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:10,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471104596] [2019-12-27 22:05:10,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:05:10,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471104596] [2019-12-27 22:05:10,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:10,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:05:10,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1036660917] [2019-12-27 22:05:10,892 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:10,901 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:11,012 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 42 transitions. [2019-12-27 22:05:11,013 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:11,013 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:05:11,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:05:11,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:11,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:05:11,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:05:11,015 INFO L87 Difference]: Start difference. First operand 4968 states and 12444 transitions. Second operand 5 states. [2019-12-27 22:05:11,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:11,494 INFO L93 Difference]: Finished difference Result 5658 states and 13918 transitions. [2019-12-27 22:05:11,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:05:11,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 22:05:11,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:11,504 INFO L225 Difference]: With dead ends: 5658 [2019-12-27 22:05:11,504 INFO L226 Difference]: Without dead ends: 5658 [2019-12-27 22:05:11,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:05:11,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5658 states. [2019-12-27 22:05:11,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5658 to 5434. [2019-12-27 22:05:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5434 states. [2019-12-27 22:05:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5434 states to 5434 states and 13484 transitions. [2019-12-27 22:05:11,615 INFO L78 Accepts]: Start accepts. Automaton has 5434 states and 13484 transitions. Word has length 42 [2019-12-27 22:05:11,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:11,616 INFO L462 AbstractCegarLoop]: Abstraction has 5434 states and 13484 transitions. [2019-12-27 22:05:11,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:05:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 5434 states and 13484 transitions. [2019-12-27 22:05:11,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 22:05:11,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:11,630 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] [2019-12-27 22:05:11,630 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:11,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:11,631 INFO L82 PathProgramCache]: Analyzing trace with hash 760738031, now seen corresponding path program 1 times [2019-12-27 22:05:11,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:11,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727873114] [2019-12-27 22:05:11,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:11,720 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 22:05:11,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727873114] [2019-12-27 22:05:11,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:11,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:05:11,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [800881479] [2019-12-27 22:05:11,722 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:11,731 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:11,745 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 43 transitions. [2019-12-27 22:05:11,746 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:11,746 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:05:11,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:05:11,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:11,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:05:11,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:05:11,747 INFO L87 Difference]: Start difference. First operand 5434 states and 13484 transitions. Second operand 5 states. [2019-12-27 22:05:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:11,798 INFO L93 Difference]: Finished difference Result 3862 states and 9674 transitions. [2019-12-27 22:05:11,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:05:11,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 22:05:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:11,805 INFO L225 Difference]: With dead ends: 3862 [2019-12-27 22:05:11,805 INFO L226 Difference]: Without dead ends: 3634 [2019-12-27 22:05:11,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:05:11,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3634 states. [2019-12-27 22:05:11,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3634 to 3516. [2019-12-27 22:05:11,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3516 states. [2019-12-27 22:05:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3516 states to 3516 states and 8953 transitions. [2019-12-27 22:05:11,871 INFO L78 Accepts]: Start accepts. Automaton has 3516 states and 8953 transitions. Word has length 43 [2019-12-27 22:05:11,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:11,872 INFO L462 AbstractCegarLoop]: Abstraction has 3516 states and 8953 transitions. [2019-12-27 22:05:11,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:05:11,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3516 states and 8953 transitions. [2019-12-27 22:05:11,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 22:05:11,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:11,882 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] [2019-12-27 22:05:11,882 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:11,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:11,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1794138896, now seen corresponding path program 1 times [2019-12-27 22:05:11,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:11,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162316860] [2019-12-27 22:05:11,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:11,977 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 22:05:11,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162316860] [2019-12-27 22:05:11,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:11,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:05:11,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [166683997] [2019-12-27 22:05:11,980 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:12,001 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:12,075 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 113 transitions. [2019-12-27 22:05:12,076 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:12,077 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:05:12,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:05:12,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:12,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:05:12,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:05:12,079 INFO L87 Difference]: Start difference. First operand 3516 states and 8953 transitions. Second operand 4 states. [2019-12-27 22:05:12,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:12,114 INFO L93 Difference]: Finished difference Result 4231 states and 10537 transitions. [2019-12-27 22:05:12,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:05:12,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-27 22:05:12,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:12,117 INFO L225 Difference]: With dead ends: 4231 [2019-12-27 22:05:12,117 INFO L226 Difference]: Without dead ends: 773 [2019-12-27 22:05:12,117 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 22:05:12,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-12-27 22:05:12,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773. [2019-12-27 22:05:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-27 22:05:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1673 transitions. [2019-12-27 22:05:12,134 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1673 transitions. Word has length 58 [2019-12-27 22:05:12,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:12,134 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1673 transitions. [2019-12-27 22:05:12,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:05:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1673 transitions. [2019-12-27 22:05:12,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 22:05:12,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:12,138 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] [2019-12-27 22:05:12,138 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:12,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:12,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1305106490, now seen corresponding path program 1 times [2019-12-27 22:05:12,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:12,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900541108] [2019-12-27 22:05:12,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:12,280 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 22:05:12,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900541108] [2019-12-27 22:05:12,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:12,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:05:12,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [745517203] [2019-12-27 22:05:12,281 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:12,373 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:12,434 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 93 states and 119 transitions. [2019-12-27 22:05:12,434 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:12,495 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 22:05:12,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:05:12,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:12,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:05:12,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:05:12,496 INFO L87 Difference]: Start difference. First operand 773 states and 1673 transitions. Second operand 10 states. [2019-12-27 22:05:13,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:13,739 INFO L93 Difference]: Finished difference Result 6028 states and 12919 transitions. [2019-12-27 22:05:13,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 22:05:13,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-27 22:05:13,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:13,746 INFO L225 Difference]: With dead ends: 6028 [2019-12-27 22:05:13,746 INFO L226 Difference]: Without dead ends: 3594 [2019-12-27 22:05:13,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=296, Invalid=1264, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 22:05:13,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2019-12-27 22:05:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 1427. [2019-12-27 22:05:13,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1427 states. [2019-12-27 22:05:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 3089 transitions. [2019-12-27 22:05:13,787 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 3089 transitions. Word has length 59 [2019-12-27 22:05:13,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:13,789 INFO L462 AbstractCegarLoop]: Abstraction has 1427 states and 3089 transitions. [2019-12-27 22:05:13,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:05:13,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 3089 transitions. [2019-12-27 22:05:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 22:05:13,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:13,793 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] [2019-12-27 22:05:13,793 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:13,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:13,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1508828504, now seen corresponding path program 2 times [2019-12-27 22:05:13,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:13,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868375112] [2019-12-27 22:05:13,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:14,019 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 22:05:14,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868375112] [2019-12-27 22:05:14,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:14,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:05:14,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1022322615] [2019-12-27 22:05:14,021 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:14,047 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:14,163 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 89 transitions. [2019-12-27 22:05:14,163 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:14,186 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:05:14,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:05:14,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:14,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:05:14,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:05:14,187 INFO L87 Difference]: Start difference. First operand 1427 states and 3089 transitions. Second operand 11 states. [2019-12-27 22:05:15,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:15,530 INFO L93 Difference]: Finished difference Result 3924 states and 8223 transitions. [2019-12-27 22:05:15,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 22:05:15,531 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-27 22:05:15,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:15,536 INFO L225 Difference]: With dead ends: 3924 [2019-12-27 22:05:15,536 INFO L226 Difference]: Without dead ends: 3908 [2019-12-27 22:05:15,537 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 22:05:15,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3908 states. [2019-12-27 22:05:15,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3908 to 1734. [2019-12-27 22:05:15,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1734 states. [2019-12-27 22:05:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 3792 transitions. [2019-12-27 22:05:15,580 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 3792 transitions. Word has length 59 [2019-12-27 22:05:15,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:15,580 INFO L462 AbstractCegarLoop]: Abstraction has 1734 states and 3792 transitions. [2019-12-27 22:05:15,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:05:15,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 3792 transitions. [2019-12-27 22:05:15,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 22:05:15,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:15,587 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] [2019-12-27 22:05:15,587 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:15,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:15,588 INFO L82 PathProgramCache]: Analyzing trace with hash -279189162, now seen corresponding path program 3 times [2019-12-27 22:05:15,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:15,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309059255] [2019-12-27 22:05:15,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:15,665 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 22:05:15,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309059255] [2019-12-27 22:05:15,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:15,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:05:15,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1179470726] [2019-12-27 22:05:15,666 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:15,683 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:15,767 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 117 states and 168 transitions. [2019-12-27 22:05:15,767 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:15,836 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 22:05:15,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:05:15,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:15,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:05:15,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:05:15,837 INFO L87 Difference]: Start difference. First operand 1734 states and 3792 transitions. Second operand 7 states. [2019-12-27 22:05:16,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:16,598 INFO L93 Difference]: Finished difference Result 3070 states and 6664 transitions. [2019-12-27 22:05:16,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:05:16,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-27 22:05:16,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:16,601 INFO L225 Difference]: With dead ends: 3070 [2019-12-27 22:05:16,601 INFO L226 Difference]: Without dead ends: 3070 [2019-12-27 22:05:16,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 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 22:05:16,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3070 states. [2019-12-27 22:05:16,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3070 to 1951. [2019-12-27 22:05:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1951 states. [2019-12-27 22:05:16,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 4375 transitions. [2019-12-27 22:05:16,636 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 4375 transitions. Word has length 59 [2019-12-27 22:05:16,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:16,637 INFO L462 AbstractCegarLoop]: Abstraction has 1951 states and 4375 transitions. [2019-12-27 22:05:16,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:05:16,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 4375 transitions. [2019-12-27 22:05:16,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 22:05:16,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:16,644 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] [2019-12-27 22:05:16,644 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:16,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:16,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1505791602, now seen corresponding path program 4 times [2019-12-27 22:05:16,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:16,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234332214] [2019-12-27 22:05:16,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:16,777 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 22:05:16,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234332214] [2019-12-27 22:05:16,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:16,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:05:16,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [232980128] [2019-12-27 22:05:16,779 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:16,795 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:16,865 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 127 transitions. [2019-12-27 22:05:16,865 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:16,866 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:05:16,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:05:16,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:16,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:05:16,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:05:16,867 INFO L87 Difference]: Start difference. First operand 1951 states and 4375 transitions. Second operand 3 states. [2019-12-27 22:05:16,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:16,885 INFO L93 Difference]: Finished difference Result 1950 states and 4373 transitions. [2019-12-27 22:05:16,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:05:16,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 22:05:16,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:16,888 INFO L225 Difference]: With dead ends: 1950 [2019-12-27 22:05:16,888 INFO L226 Difference]: Without dead ends: 1950 [2019-12-27 22:05:16,889 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 22:05:16,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-12-27 22:05:16,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1850. [2019-12-27 22:05:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2019-12-27 22:05:16,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 4211 transitions. [2019-12-27 22:05:16,919 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 4211 transitions. Word has length 59 [2019-12-27 22:05:16,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:16,919 INFO L462 AbstractCegarLoop]: Abstraction has 1850 states and 4211 transitions. [2019-12-27 22:05:16,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:05:16,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 4211 transitions. [2019-12-27 22:05:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 22:05:16,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:16,924 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] [2019-12-27 22:05:16,924 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:16,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:16,924 INFO L82 PathProgramCache]: Analyzing trace with hash -195440625, now seen corresponding path program 1 times [2019-12-27 22:05:16,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:16,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855177798] [2019-12-27 22:05:16,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:05:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:05:17,057 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:05:17,057 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:05:17,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_43| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~weak$$choice0~0_10) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~__unbuffered_p0_EAX~0_13) (= v_~y$w_buff0_used~0_132 0) (= 0 v_~y$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_cnt~0_15) (= v_~y$r_buff0_thd2~0_77 0) (= 0 v_~y$flush_delayed~0_15) (= (select .cse0 |v_ULTIMATE.start_main_~#t1769~0.base_17|) 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd2~0_39) (= v_~y$r_buff0_thd0~0_22 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1769~0.base_17|) (< 0 |v_#StackHeapBarrier_14|) (= v_~y~0_27 0) (= v_~y$w_buff1_used~0_68 0) (= 0 |v_#NULL.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1769~0.base_17| 1) |v_#valid_41|) (= 0 v_~y$w_buff1~0_35) (= 0 v_~weak$$choice2~0_35) (= v_~main$tmp_guard1~0_14 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1769~0.base_17| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1769~0.base_17|) |v_ULTIMATE.start_main_~#t1769~0.offset_14| 0)) |v_#memory_int_17|) (= v_~y$mem_tmp~0_12 0) (= |v_#NULL.offset_4| 0) (= 0 v_~y$r_buff1_thd1~0_27) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (= 0 |v_ULTIMATE.start_main_~#t1769~0.offset_14|) (= v_~__unbuffered_p1_EBX~0_12 0) (= 0 v_~y$w_buff0~0_36) (= v_~y$r_buff0_thd1~0_54 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1769~0.base_17| 4)) (= 0 v_~x~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1770~0.offset=|v_ULTIMATE.start_main_~#t1770~0.offset_15|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_132, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_27, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ULTIMATE.start_main_~#t1769~0.base=|v_ULTIMATE.start_main_~#t1769~0.base_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_36, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, #length=|v_#length_17|, ULTIMATE.start_main_~#t1770~0.base=|v_ULTIMATE.start_main_~#t1770~0.base_17|, ~y~0=v_~y~0_27, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_13|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_12|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_19|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_39, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_10|, ~y$w_buff1~0=v_~y$w_buff1~0_35, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_41|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_77, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_~#t1769~0.offset=|v_ULTIMATE.start_main_~#t1769~0.offset_14|, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ~x~0=v_~x~0_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1770~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1769~0.base, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1770~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1769~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:05:17,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L810-1-->L812: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1770~0.base_11| 0)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1770~0.base_11|)) (= |v_ULTIMATE.start_main_~#t1770~0.offset_10| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1770~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1770~0.base_11| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1770~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1770~0.base_11|) |v_ULTIMATE.start_main_~#t1770~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1770~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1770~0.offset=|v_ULTIMATE.start_main_~#t1770~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1770~0.base=|v_ULTIMATE.start_main_~#t1770~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1770~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1770~0.base] because there is no mapped edge [2019-12-27 22:05:17,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= 1 v_~y$w_buff0_used~0_96) (= 1 v_~y$w_buff0~0_21) (= v_~y$w_buff1_used~0_53 v_~y$w_buff0_used~0_97) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= v_~y$w_buff0~0_22 v_~y$w_buff1~0_19) (= (mod v_~y$w_buff1_used~0_53 256) 0)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff0~0=v_~y$w_buff0~0_22, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_19, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~y$w_buff0~0=v_~y$w_buff0~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_53} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:05:17,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] L772-2-->L772-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1320567132 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-1320567132| |P1Thread1of1ForFork1_#t~ite28_Out-1320567132|)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1320567132 256) 0))) (or (and (= ~y$w_buff1~0_In-1320567132 |P1Thread1of1ForFork1_#t~ite28_Out-1320567132|) .cse0 (or .cse1 .cse2)) (and (not .cse1) .cse0 (= ~y$w_buff0~0_In-1320567132 |P1Thread1of1ForFork1_#t~ite28_Out-1320567132|) (not .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1320567132, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1320567132, ~y$w_buff0~0=~y$w_buff0~0_In-1320567132, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1320567132} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1320567132|, ~y$w_buff1~0=~y$w_buff1~0_In-1320567132, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1320567132, ~y$w_buff0~0=~y$w_buff0~0_In-1320567132, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1320567132, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1320567132|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 22:05:17,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L777-->L778: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_29 256))) (= v_~y$r_buff0_thd2~0_64 v_~y$r_buff0_thd2~0_63)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_63, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 22:05:17,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1208789802 256)))) (or (and .cse0 (= ~y~0_In-1208789802 |P1Thread1of1ForFork1_#t~ite48_Out-1208789802|)) (and (= ~y$mem_tmp~0_In-1208789802 |P1Thread1of1ForFork1_#t~ite48_Out-1208789802|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1208789802, ~y$flush_delayed~0=~y$flush_delayed~0_In-1208789802, ~y~0=~y~0_In-1208789802} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1208789802, ~y$flush_delayed~0=~y$flush_delayed~0_In-1208789802, ~y~0=~y~0_In-1208789802, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-1208789802|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-27 22:05:17,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-64965901 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out-64965901| ~y$mem_tmp~0_In-64965901)) (and (= |P0Thread1of1ForFork0_#t~ite25_Out-64965901| ~y~0_In-64965901) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-64965901, ~y$flush_delayed~0=~y$flush_delayed~0_In-64965901, ~y~0=~y~0_In-64965901} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-64965901, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-64965901|, ~y$flush_delayed~0=~y$flush_delayed~0_In-64965901, ~y~0=~y~0_In-64965901} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-27 22:05:17,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1107927604 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1107927604 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite51_Out-1107927604| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite51_Out-1107927604| ~y$w_buff0_used~0_In-1107927604)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1107927604, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1107927604} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1107927604, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-1107927604|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1107927604} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-27 22:05:17,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In2048054123 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In2048054123 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In2048054123 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2048054123 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite52_Out2048054123|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite52_Out2048054123| ~y$w_buff1_used~0_In2048054123) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2048054123, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2048054123, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2048054123, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2048054123} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2048054123, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2048054123, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out2048054123|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2048054123, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2048054123} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-27 22:05:17,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L790-->L791: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1813341338 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1813341338 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd2~0_Out-1813341338 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_Out-1813341338 ~y$r_buff0_thd2~0_In-1813341338)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1813341338, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1813341338} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-1813341338|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1813341338, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1813341338} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 22:05:17,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L744-2-->P0EXIT: Formula: (and (= 0 v_~y$flush_delayed~0_12) (= v_~y~0_23 |v_P0Thread1of1ForFork0_#t~ite25_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~y~0=v_~y~0_23} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 22:05:17,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L791-->L791-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1145714209 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1145714209 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1145714209 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1145714209 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite54_Out-1145714209| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite54_Out-1145714209| ~y$r_buff1_thd2~0_In-1145714209) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1145714209, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1145714209, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1145714209, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1145714209} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1145714209, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1145714209, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1145714209, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1145714209|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1145714209} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 22:05:17,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L791-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_35 |v_P1Thread1of1ForFork1_#t~ite54_8|) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_35, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 22:05:17,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L816-->L818-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= 0 (mod v_~y$w_buff0_used~0_109 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_109, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_109, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 22:05:17,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L818-2-->L818-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-66981437 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-66981437 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite57_Out-66981437| ~y~0_In-66981437)) (and (= |ULTIMATE.start_main_#t~ite57_Out-66981437| ~y$w_buff1~0_In-66981437) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-66981437, ~y~0=~y~0_In-66981437, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-66981437, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-66981437} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-66981437, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-66981437|, ~y~0=~y~0_In-66981437, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-66981437, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-66981437} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-27 22:05:17,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L818-4-->L819: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite57_8|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_8|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_8|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_7|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-27 22:05:17,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1492479893 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1492479893 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite59_Out-1492479893|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1492479893 |ULTIMATE.start_main_#t~ite59_Out-1492479893|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1492479893, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1492479893} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1492479893, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1492479893, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1492479893|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 22:05:17,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L820-->L820-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-324736450 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-324736450 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-324736450 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-324736450 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite60_Out-324736450| 0)) (and (= ~y$w_buff1_used~0_In-324736450 |ULTIMATE.start_main_#t~ite60_Out-324736450|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-324736450, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-324736450, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-324736450, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-324736450} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-324736450|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-324736450, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-324736450, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-324736450, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-324736450} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 22:05:17,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-381487775 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-381487775 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite61_Out-381487775|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-381487775 |ULTIMATE.start_main_#t~ite61_Out-381487775|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-381487775, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-381487775} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-381487775|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-381487775, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-381487775} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 22:05:17,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In437128873 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In437128873 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In437128873 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In437128873 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite62_Out437128873| ~y$r_buff1_thd0~0_In437128873)) (and (= |ULTIMATE.start_main_#t~ite62_Out437128873| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In437128873, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In437128873, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In437128873, ~y$w_buff1_used~0=~y$w_buff1_used~0_In437128873} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out437128873|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In437128873, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In437128873, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In437128873, ~y$w_buff1_used~0=~y$w_buff1_used~0_In437128873} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 22:05:17,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite62_11| v_~y$r_buff1_thd0~0_14) (= v_~main$tmp_guard1~0_8 0) (= 0 v_~__unbuffered_p1_EBX~0_7)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, 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 22:05:17,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:05:17 BasicIcfg [2019-12-27 22:05:17,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:05:17,200 INFO L168 Benchmark]: Toolchain (without parser) took 19568.12 ms. Allocated memory was 146.3 MB in the beginning and 749.2 MB in the end (delta: 602.9 MB). Free memory was 101.1 MB in the beginning and 343.7 MB in the end (delta: -242.5 MB). Peak memory consumption was 360.4 MB. Max. memory is 7.1 GB. [2019-12-27 22:05:17,200 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 22:05:17,201 INFO L168 Benchmark]: CACSL2BoogieTranslator took 815.25 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 100.7 MB in the beginning and 157.2 MB in the end (delta: -56.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:05:17,202 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.56 ms. Allocated memory is still 204.5 MB. Free memory was 157.2 MB in the beginning and 154.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 22:05:17,203 INFO L168 Benchmark]: Boogie Preprocessor took 38.78 ms. Allocated memory is still 204.5 MB. Free memory was 154.4 MB in the beginning and 152.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 22:05:17,203 INFO L168 Benchmark]: RCFGBuilder took 899.47 ms. Allocated memory is still 204.5 MB. Free memory was 152.5 MB in the beginning and 99.3 MB in the end (delta: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 7.1 GB. [2019-12-27 22:05:17,204 INFO L168 Benchmark]: TraceAbstraction took 17734.55 ms. Allocated memory was 204.5 MB in the beginning and 749.2 MB in the end (delta: 544.7 MB). Free memory was 99.3 MB in the beginning and 343.7 MB in the end (delta: -244.3 MB). Peak memory consumption was 300.4 MB. Max. memory is 7.1 GB. [2019-12-27 22:05:17,208 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.22 ms. Allocated memory is still 146.3 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 815.25 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 100.7 MB in the beginning and 157.2 MB in the end (delta: -56.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.56 ms. Allocated memory is still 204.5 MB. Free memory was 157.2 MB in the beginning and 154.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.78 ms. Allocated memory is still 204.5 MB. Free memory was 154.4 MB in the beginning and 152.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 899.47 ms. Allocated memory is still 204.5 MB. Free memory was 152.5 MB in the beginning and 99.3 MB in the end (delta: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17734.55 ms. Allocated memory was 204.5 MB in the beginning and 749.2 MB in the end (delta: 544.7 MB). Free memory was 99.3 MB in the beginning and 343.7 MB in the end (delta: -244.3 MB). Peak memory consumption was 300.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 178 ProgramPointsBefore, 105 ProgramPointsAfterwards, 227 TransitionsBefore, 130 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 27 ChoiceCompositions, 9370 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 128953 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1769, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L812] FCALL, FORK 0 pthread_create(&t1770, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L762] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L763] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L764] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = (_Bool)1 [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=3, x=0, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L772] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=3, x=0, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L772] 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) [L773] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L773] 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)) [L774] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L774] 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)) [L775] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L775] 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)) [L776] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L776] 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)) [L778] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L778] 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)) [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 [L784] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=3, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L727] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L741] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L742] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 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 [L821] 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 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2466 SDtfs, 4074 SDslu, 5605 SDs, 0 SdLazy, 3246 SolverSat, 280 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 36 SyntacticMatches, 11 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25606occurred 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: 2.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 6271 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 571 NumberOfCodeBlocks, 571 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 498 ConstructedInterpolants, 0 QuantifiedInterpolants, 71390 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...