java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:55:48,251 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:55:48,253 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:55:48,266 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:55:48,266 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:55:48,267 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:55:48,269 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:55:48,271 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:55:48,272 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:55:48,273 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:55:48,274 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:55:48,274 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:55:48,275 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:55:48,276 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:55:48,277 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:55:48,278 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:55:48,279 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:55:48,281 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:55:48,283 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:55:48,284 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:55:48,286 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:55:48,287 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:55:48,289 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:55:48,290 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:55:48,290 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:55:48,291 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:55:48,292 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:55:48,293 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:55:48,294 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:55:48,295 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:55:48,295 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:55:48,296 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:55:48,296 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:55:48,296 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:55:48,297 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:55:48,298 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:55:48,298 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:55:48,315 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:55:48,316 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:55:48,316 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:55:48,316 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:55:48,317 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:55:48,317 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:55:48,317 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:55:48,318 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:55:48,318 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:55:48,318 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:55:48,318 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:55:48,318 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:55:48,319 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:55:48,319 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:55:48,319 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:55:48,319 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:55:48,319 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:55:48,320 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:55:48,320 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:55:48,320 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:55:48,320 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:55:48,320 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:55:48,321 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:55:48,321 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:55:48,321 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:55:48,321 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:55:48,321 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:55:48,322 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:55:48,322 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:55:48,322 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:55:48,322 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:55:48,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:55:48,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:55:48,387 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:55:48,388 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:55:48,389 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:55:48,390 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl [2018-10-01 00:55:48,390 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl' [2018-10-01 00:55:48,469 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:55:48,473 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:55:48,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:55:48,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:55:48,474 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:55:48,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:48" (1/1) ... [2018-10-01 00:55:48,521 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:48" (1/1) ... [2018-10-01 00:55:48,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:55:48,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:55:48,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:55:48,532 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:55:48,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:48" (1/1) ... [2018-10-01 00:55:48,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:48" (1/1) ... [2018-10-01 00:55:48,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:48" (1/1) ... [2018-10-01 00:55:48,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:48" (1/1) ... [2018-10-01 00:55:48,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:48" (1/1) ... [2018-10-01 00:55:48,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:48" (1/1) ... [2018-10-01 00:55:48,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:48" (1/1) ... [2018-10-01 00:55:48,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:55:48,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:55:48,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:55:48,593 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:55:48,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:48" (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 [2018-10-01 00:55:48,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:55:48,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:55:49,347 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:55:49,348 INFO L202 PluginConnector]: Adding new model pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:55:49 BoogieIcfgContainer [2018-10-01 00:55:49,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:55:49,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:55:49,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:55:49,353 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:55:49,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:48" (1/2) ... [2018-10-01 00:55:49,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e489cf and model type pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:55:49, skipping insertion in model container [2018-10-01 00:55:49,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:55:49" (2/2) ... [2018-10-01 00:55:49,356 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl [2018-10-01 00:55:49,367 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:55:49,375 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:55:49,427 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:55:49,428 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:55:49,428 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:55:49,428 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:55:49,428 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:55:49,428 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:55:49,429 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:55:49,429 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:55:49,429 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:55:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-10-01 00:55:49,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:55:49,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:49,454 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:49,455 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:49,461 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:49,462 INFO L82 PathProgramCache]: Analyzing trace with hash -61215035, now seen corresponding path program 1 times [2018-10-01 00:55:49,464 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:49,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:49,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:49,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:49,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:49,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:49,738 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:49,739 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:49,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:49,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:49,755 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:49,757 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-10-01 00:55:49,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:49,867 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-10-01 00:55:49,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:49,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-01 00:55:49,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:49,891 INFO L225 Difference]: With dead ends: 54 [2018-10-01 00:55:49,891 INFO L226 Difference]: Without dead ends: 35 [2018-10-01 00:55:49,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:49,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-01 00:55:49,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-10-01 00:55:49,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-01 00:55:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-10-01 00:55:49,942 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2018-10-01 00:55:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:49,943 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2018-10-01 00:55:49,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:49,943 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2018-10-01 00:55:49,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:55:49,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:49,944 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:49,944 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:49,944 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:49,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1341078713, now seen corresponding path program 1 times [2018-10-01 00:55:49,945 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:49,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:49,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:49,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:49,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:50,070 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:50,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:50,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:50,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:50,072 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:50,073 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states. [2018-10-01 00:55:50,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:50,173 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2018-10-01 00:55:50,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:50,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-01 00:55:50,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:50,176 INFO L225 Difference]: With dead ends: 97 [2018-10-01 00:55:50,177 INFO L226 Difference]: Without dead ends: 65 [2018-10-01 00:55:50,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:50,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-01 00:55:50,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-10-01 00:55:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-01 00:55:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2018-10-01 00:55:50,207 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17 [2018-10-01 00:55:50,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:50,208 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2018-10-01 00:55:50,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:50,208 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2018-10-01 00:55:50,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:55:50,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:50,215 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:50,216 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:50,216 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:50,216 INFO L82 PathProgramCache]: Analyzing trace with hash -754272699, now seen corresponding path program 1 times [2018-10-01 00:55:50,217 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:50,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:50,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:50,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:50,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:50,403 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:50,403 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:50,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:50,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:50,404 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:50,405 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 3 states. [2018-10-01 00:55:50,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:50,541 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2018-10-01 00:55:50,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:50,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-01 00:55:50,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:50,548 INFO L225 Difference]: With dead ends: 187 [2018-10-01 00:55:50,548 INFO L226 Difference]: Without dead ends: 125 [2018-10-01 00:55:50,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:50,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-01 00:55:50,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-10-01 00:55:50,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-01 00:55:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2018-10-01 00:55:50,610 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 17 [2018-10-01 00:55:50,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:50,612 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2018-10-01 00:55:50,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:50,612 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2018-10-01 00:55:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:55:50,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:50,613 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:50,614 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:50,614 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:50,615 INFO L82 PathProgramCache]: Analyzing trace with hash -53208121, now seen corresponding path program 1 times [2018-10-01 00:55:50,615 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:50,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:50,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:50,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:50,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:50,763 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:50,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:50,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:50,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:50,766 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:50,766 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand 3 states. [2018-10-01 00:55:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:50,915 INFO L93 Difference]: Finished difference Result 367 states and 520 transitions. [2018-10-01 00:55:50,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:50,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-01 00:55:50,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:50,920 INFO L225 Difference]: With dead ends: 367 [2018-10-01 00:55:50,920 INFO L226 Difference]: Without dead ends: 245 [2018-10-01 00:55:50,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:50,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-01 00:55:50,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-10-01 00:55:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-01 00:55:50,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2018-10-01 00:55:50,965 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 17 [2018-10-01 00:55:50,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:50,966 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2018-10-01 00:55:50,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:50,966 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2018-10-01 00:55:50,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:55:50,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:50,967 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:50,968 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:50,968 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:50,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1721799241, now seen corresponding path program 1 times [2018-10-01 00:55:50,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:50,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:50,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:50,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:50,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:51,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:51,086 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:51,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:55:51,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:55:51,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:55:51,087 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:51,088 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand 4 states. [2018-10-01 00:55:51,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:51,807 INFO L93 Difference]: Finished difference Result 517 states and 707 transitions. [2018-10-01 00:55:51,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:55:51,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-01 00:55:51,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:51,811 INFO L225 Difference]: With dead ends: 517 [2018-10-01 00:55:51,812 INFO L226 Difference]: Without dead ends: 515 [2018-10-01 00:55:51,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:51,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-10-01 00:55:51,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275. [2018-10-01 00:55:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-01 00:55:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2018-10-01 00:55:51,907 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 17 [2018-10-01 00:55:51,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:51,908 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2018-10-01 00:55:51,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:55:51,908 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2018-10-01 00:55:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:55:51,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:51,909 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:51,910 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:51,910 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:51,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1721858823, now seen corresponding path program 1 times [2018-10-01 00:55:51,910 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:51,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:51,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:51,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:51,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:52,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:52,064 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:52,064 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:55:52,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:55:52,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:55:52,066 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:52,066 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand 4 states. [2018-10-01 00:55:53,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:53,020 INFO L93 Difference]: Finished difference Result 879 states and 1193 transitions. [2018-10-01 00:55:53,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:55:53,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-01 00:55:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:53,028 INFO L225 Difference]: With dead ends: 879 [2018-10-01 00:55:53,028 INFO L226 Difference]: Without dead ends: 605 [2018-10-01 00:55:53,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-10-01 00:55:53,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2018-10-01 00:55:53,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-10-01 00:55:53,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 776 transitions. [2018-10-01 00:55:53,143 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 776 transitions. Word has length 17 [2018-10-01 00:55:53,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:53,143 INFO L480 AbstractCegarLoop]: Abstraction has 605 states and 776 transitions. [2018-10-01 00:55:53,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:55:53,143 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 776 transitions. [2018-10-01 00:55:53,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-01 00:55:53,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:53,155 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-01 00:55:53,155 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:53,155 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:53,155 INFO L82 PathProgramCache]: Analyzing trace with hash 868944887, now seen corresponding path program 1 times [2018-10-01 00:55:53,156 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:53,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:53,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:53,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:53,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-01 00:55:53,348 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:53,348 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:55:53,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:53,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:53,349 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:53,349 INFO L87 Difference]: Start difference. First operand 605 states and 776 transitions. Second operand 3 states. [2018-10-01 00:55:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:53,775 INFO L93 Difference]: Finished difference Result 1809 states and 2322 transitions. [2018-10-01 00:55:53,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:53,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-10-01 00:55:53,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:53,783 INFO L225 Difference]: With dead ends: 1809 [2018-10-01 00:55:53,783 INFO L226 Difference]: Without dead ends: 1207 [2018-10-01 00:55:53,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-10-01 00:55:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1205. [2018-10-01 00:55:53,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-10-01 00:55:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1508 transitions. [2018-10-01 00:55:53,992 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1508 transitions. Word has length 62 [2018-10-01 00:55:53,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:53,992 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1508 transitions. [2018-10-01 00:55:53,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:53,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1508 transitions. [2018-10-01 00:55:53,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-01 00:55:53,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:53,998 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-01 00:55:53,999 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:53,999 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:53,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2034253683, now seen corresponding path program 1 times [2018-10-01 00:55:53,999 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:54,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:54,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:54,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:54,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:54,401 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 53 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-01 00:55:54,402 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:55:54,402 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:55:54,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:54,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:55:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-01 00:55:55,726 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:55:55,726 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-01 00:55:55,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:55:55,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:55:55,727 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:55,727 INFO L87 Difference]: Start difference. First operand 1205 states and 1508 transitions. Second operand 8 states. [2018-10-01 00:56:02,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:02,203 INFO L93 Difference]: Finished difference Result 2024 states and 2520 transitions. [2018-10-01 00:56:02,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:56:02,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-10-01 00:56:02,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:02,208 INFO L225 Difference]: With dead ends: 2024 [2018-10-01 00:56:02,209 INFO L226 Difference]: Without dead ends: 565 [2018-10-01 00:56:02,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time [2018-10-01 00:56:02,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-10-01 00:56:02,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 378. [2018-10-01 00:56:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-10-01 00:56:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 442 transitions. [2018-10-01 00:56:02,371 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 442 transitions. Word has length 62 [2018-10-01 00:56:02,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:02,371 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 442 transitions. [2018-10-01 00:56:02,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:56:02,371 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 442 transitions. [2018-10-01 00:56:02,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-01 00:56:02,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:02,375 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-01 00:56:02,375 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:02,375 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:02,375 INFO L82 PathProgramCache]: Analyzing trace with hash -552343681, now seen corresponding path program 2 times [2018-10-01 00:56:02,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:02,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:02,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:02,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:02,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-01 00:56:02,506 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:02,506 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:02,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:02,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:02,507 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:02,507 INFO L87 Difference]: Start difference. First operand 378 states and 442 transitions. Second operand 3 states. [2018-10-01 00:56:02,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:02,519 INFO L93 Difference]: Finished difference Result 384 states and 448 transitions. [2018-10-01 00:56:02,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:02,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-10-01 00:56:02,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:02,519 INFO L225 Difference]: With dead ends: 384 [2018-10-01 00:56:02,520 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:56:02,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:02,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:56:02,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:56:02,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:56:02,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:56:02,521 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2018-10-01 00:56:02,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:02,522 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:56:02,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:02,522 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:56:02,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:56:02,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:56:02,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:02,972 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 138 [2018-10-01 00:56:03,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:03,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:03,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:03,584 WARN L178 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 138 [2018-10-01 00:56:05,380 WARN L178 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2018-10-01 00:56:05,823 WARN L178 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2018-10-01 00:56:06,397 WARN L178 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 52 [2018-10-01 00:56:06,856 WARN L178 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 46 [2018-10-01 00:56:08,026 WARN L178 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 128 DAG size of output: 58 [2018-10-01 00:56:08,313 WARN L178 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 51 [2018-10-01 00:56:08,648 WARN L178 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2018-10-01 00:56:08,966 WARN L178 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2018-10-01 00:56:09,215 WARN L178 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 41 [2018-10-01 00:56:09,539 WARN L178 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 46 [2018-10-01 00:56:09,872 WARN L178 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 51 [2018-10-01 00:56:10,389 WARN L178 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2018-10-01 00:56:12,532 WARN L178 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 128 DAG size of output: 58 [2018-10-01 00:56:12,770 WARN L178 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 41 [2018-10-01 00:56:13,049 WARN L178 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 45 [2018-10-01 00:56:13,053 INFO L422 ceAbstractionStarter]: At program point L440(lines 272 440) the Hoare annotation is: (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse6 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse7 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (<= ~send5 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse4 .cse5) (and .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 .cse4 .cse5))) [2018-10-01 00:56:13,053 INFO L422 ceAbstractionStarter]: At program point L279(lines 279 290) the Hoare annotation is: (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse6 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse7 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (<= ~send5 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse4 .cse5) (and .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 .cse4 .cse5))) [2018-10-01 00:56:13,053 INFO L422 ceAbstractionStarter]: At program point L341(lines 333 342) the Hoare annotation is: (let ((.cse5 (* 256 (div ~r1 256)))) (let ((.cse8 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse9 (<= 1 ~mode4)) (.cse10 (<= ~mode4 1)) (.cse13 (exists ((v_prenex_1 Int)) (let ((.cse14 (mod v_prenex_1 256))) (and (= .cse14 ~p5_old) (<= .cse14 127) (<= v_prenex_1 127) (<= 0 v_prenex_1))))) (.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse2 (<= 0 ~send5)) (.cse12 (<= ~r1 (+ .cse5 4))) (.cse11 (not (= ~p3_old ~nomsg))) (.cse3 (not (= ~p3_new ~nomsg))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3)) (.cse7 (<= ~send5 127))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~r1 .cse5) .cse6 .cse7) (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse0 .cse8 .cse1 .cse9 .cse2 .cse10 .cse11 .cse4 .cse6 .cse7) (and .cse1 .cse2 .cse12 .cse11 .cse3 .cse4 .cse13 .cse6 .cse7) (and .cse1 .cse9 .cse8 .cse2 .cse10 .cse11 .cse4 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse12 .cse11 .cse3 .cse4 .cse6 .cse7)))) [2018-10-01 00:56:13,054 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 442) no Hoare annotation was computed. [2018-10-01 00:56:13,054 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 81 443) no Hoare annotation was computed. [2018-10-01 00:56:13,054 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 81 443) no Hoare annotation was computed. [2018-10-01 00:56:13,054 INFO L422 ceAbstractionStarter]: At program point L346(lines 346 356) the Hoare annotation is: (let ((.cse5 (* 256 (div ~r1 256)))) (let ((.cse8 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse9 (<= 1 ~mode4)) (.cse10 (<= ~mode4 1)) (.cse13 (exists ((v_prenex_1 Int)) (let ((.cse14 (mod v_prenex_1 256))) (and (= .cse14 ~p5_old) (<= .cse14 127) (<= v_prenex_1 127) (<= 0 v_prenex_1))))) (.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse2 (<= 0 ~send5)) (.cse12 (<= ~r1 (+ .cse5 4))) (.cse11 (not (= ~p3_old ~nomsg))) (.cse3 (not (= ~p3_new ~nomsg))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3)) (.cse7 (<= ~send5 127))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~r1 .cse5) .cse6 .cse7) (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse0 .cse8 .cse1 .cse9 .cse2 .cse10 .cse11 .cse4 .cse6 .cse7) (and .cse1 .cse2 .cse12 .cse11 .cse3 .cse4 .cse13 .cse6 .cse7) (and .cse1 .cse9 .cse8 .cse2 .cse10 .cse11 .cse4 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse12 .cse11 .cse3 .cse4 .cse6 .cse7)))) [2018-10-01 00:56:13,054 INFO L422 ceAbstractionStarter]: At program point L437(lines 437 441) the Hoare annotation is: false [2018-10-01 00:56:13,055 INFO L422 ceAbstractionStarter]: At program point L363(lines 355 364) the Hoare annotation is: (let ((.cse12 (* 256 (div ~r1 256)))) (let ((.cse7 (<= ~r1 (+ .cse12 4))) (.cse9 (not (= ~p3_old ~nomsg))) (.cse5 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse6 (<= 0 ~send5)) (.cse8 (<= ~mode4 1)) (.cse2 (not (= ~p3_new ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse10 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (= .cse11 ~p5_old) (<= .cse11 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse10) (and .cse5 .cse0 .cse1 .cse6 .cse8 .cse2 .cse3 (<= ~r1 .cse12) .cse4 .cse10)))) [2018-10-01 00:56:13,055 INFO L422 ceAbstractionStarter]: At program point L297(lines 289 298) the Hoare annotation is: (let ((.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_old ~nomsg))) (.cse9 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse0 (<= ~send3 127)) (.cse2 (<= 0 ~send5)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~send3)) (.cse8 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (= .cse6 ~p5_old) (<= .cse6 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode2 (* 256 (div ~mode2 256))) .cse5 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse7 .cse8))) [2018-10-01 00:56:13,055 INFO L422 ceAbstractionStarter]: At program point L421(lines 416 422) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3)) (.cse4 (<= 0 ~send5)) (.cse5 (<= ~r1 (+ (* 256 (div ~r1 256)) 4))) (.cse6 (<= 1 ULTIMATE.start_check_~tmp~108)) (.cse7 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse10 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ~mode5 (* 256 (div ~mode5 256))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10))) [2018-10-01 00:56:13,055 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 81 443) no Hoare annotation was computed. [2018-10-01 00:56:13,055 INFO L422 ceAbstractionStarter]: At program point L401(lines 401 407) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse3 (<= ~r1 (+ (* 256 (div ~r1 256)) 4))) (.cse4 (<= ~mode4 1)) (.cse5 (not (= ~p3_old ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~send3)) (.cse8 (<= ~send5 127))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse7 .cse8))) [2018-10-01 00:56:13,056 INFO L422 ceAbstractionStarter]: At program point L368(lines 368 378) the Hoare annotation is: (let ((.cse12 (* 256 (div ~r1 256)))) (let ((.cse7 (<= ~r1 (+ .cse12 4))) (.cse9 (not (= ~p3_old ~nomsg))) (.cse5 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse6 (<= 0 ~send5)) (.cse8 (<= ~mode4 1)) (.cse2 (not (= ~p3_new ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse10 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (= .cse11 ~p5_old) (<= .cse11 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse10) (and .cse5 .cse0 .cse1 .cse6 .cse8 .cse2 .cse3 (<= ~r1 .cse12) .cse4 .cse10)))) [2018-10-01 00:56:13,056 INFO L422 ceAbstractionStarter]: At program point L302(lines 302 313) the Hoare annotation is: (let ((.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_old ~nomsg))) (.cse9 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse0 (<= ~send3 127)) (.cse2 (<= 0 ~send5)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~send3)) (.cse8 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (= .cse6 ~p5_old) (<= .cse6 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode2 (* 256 (div ~mode2 256))) .cse5 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse7 .cse8))) [2018-10-01 00:56:13,056 INFO L422 ceAbstractionStarter]: At program point L385(lines 377 386) the Hoare annotation is: (let ((.cse10 (* 256 (div ~r1 256))) (.cse11 (+ ~nomsg 1))) (let ((.cse5 (and (= .cse11 0) (exists ((v_prenex_1 Int)) (let ((.cse13 (mod v_prenex_1 256))) (and (= ~p5_new .cse13) (<= .cse13 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))))) (.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse7 (not (= ~p3_new ~nomsg))) (.cse8 (<= 0 ~send3)) (.cse2 (<= 0 ~send5)) (.cse3 (<= ~r1 (+ .cse10 4))) (.cse4 (<= ~mode4 1)) (.cse6 (not (= ~p3_old ~nomsg))) (.cse9 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 (<= ~r1 .cse10) .cse8 .cse9) (and .cse0 .cse1 .cse7 (= 0 .cse11) .cse8 (= ~mode5 (* 256 (div ~mode5 256))) .cse2 .cse3 .cse4 .cse6 (exists ((v_prenex_1 Int)) (let ((.cse12 (mod v_prenex_1 256))) (and (= .cse12 ~p5_old) (<= .cse12 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse9)))) [2018-10-01 00:56:13,056 INFO L422 ceAbstractionStarter]: At program point L319(lines 312 320) the Hoare annotation is: (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse6 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse7 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (<= ~send5 127))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse4 .cse5) (and .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 .cse4 .cse5))) [2018-10-01 00:56:13,057 INFO L422 ceAbstractionStarter]: At program point L410(lines 406 417) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse3 (<= ~r1 (+ (* 256 (div ~r1 256)) 4))) (.cse4 (<= ~mode4 1)) (.cse5 (not (= ~p3_old ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~send3)) (.cse8 (<= ~send5 127))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse7 .cse8))) [2018-10-01 00:56:13,057 INFO L422 ceAbstractionStarter]: At program point L431(lines 431 438) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (= ULTIMATE.start_assert_~arg 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (<= 0 ~send5)) (.cse6 (<= ~r1 (+ (* 256 (div ~r1 256)) 4))) (.cse7 (<= 1 ULTIMATE.start_check_~tmp~108)) (.cse8 (<= ~mode4 1)) (.cse9 (not (= ~p3_old ~nomsg))) (.cse10 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~mode5 (* 256 (div ~mode5 256))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (= .cse11 ~p5_old) (<= .cse11 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse10))) [2018-10-01 00:56:13,057 INFO L422 ceAbstractionStarter]: At program point L324(lines 324 334) the Hoare annotation is: (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse6 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse7 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (<= ~send5 127))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse4 .cse5) (and .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 .cse4 .cse5))) [2018-10-01 00:56:13,066 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,068 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,069 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,069 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,076 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,076 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,085 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,097 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,097 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,097 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,099 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,099 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,099 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,119 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,125 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,125 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,125 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,126 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,126 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,127 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,127 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,127 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,128 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,128 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,128 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,134 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,135 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,135 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,136 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,136 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,136 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,137 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,137 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,144 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,144 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,144 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,144 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,147 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,147 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,148 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,148 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,149 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,149 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,150 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,150 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,157 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,157 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,158 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,158 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,159 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,159 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,163 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,163 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,164 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,165 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,165 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,165 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,166 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,170 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,170 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,170 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,171 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,172 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,172 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,172 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,173 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,173 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,174 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,174 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,175 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,175 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,175 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,177 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,177 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,177 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,177 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,179 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,179 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,179 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,179 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,180 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,180 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,181 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,181 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,182 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,182 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,183 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,183 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,184 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,184 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,185 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,185 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,187 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,188 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,188 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,188 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,188 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,189 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,189 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,189 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,189 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,190 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,190 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,190 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,193 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,193 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,193 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,193 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,194 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,194 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,194 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,195 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,195 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,195 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,196 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,196 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,197 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,197 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,198 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,198 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,198 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,198 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,199 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,200 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,200 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,200 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,201 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,201 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,201 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,202 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,204 INFO L202 PluginConnector]: Adding new model pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:56:13 BoogieIcfgContainer [2018-10-01 00:56:13,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:56:13,205 INFO L168 Benchmark]: Toolchain (without parser) took 24735.52 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 125.3 MB). Free memory was 1.5 GB in the beginning and 963.5 MB in the end (delta: 500.6 MB). Peak memory consumption was 636.3 MB. Max. memory is 7.1 GB. [2018-10-01 00:56:13,206 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:56:13,207 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:56:13,208 INFO L168 Benchmark]: Boogie Preprocessor took 60.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:56:13,208 INFO L168 Benchmark]: RCFGBuilder took 755.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-01 00:56:13,209 INFO L168 Benchmark]: TraceAbstraction took 23854.46 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 125.3 MB). Free memory was 1.4 GB in the beginning and 963.5 MB in the end (delta: 468.9 MB). Peak memory consumption was 604.6 MB. Max. memory is 7.1 GB. [2018-10-01 00:56:13,214 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 755.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23854.46 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 125.3 MB). Free memory was 1.4 GB in the beginning and 963.5 MB in the end (delta: 468.9 MB). Peak memory consumption was 604.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 442]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 324]: Loop Invariant [2018-10-01 00:56:13,235 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,236 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,236 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,236 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,240 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,240 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,240 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,240 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 <= ~send5) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 272]: Loop Invariant [2018-10-01 00:56:13,241 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,242 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,242 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,242 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,243 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,243 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,243 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,244 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 377]: Loop Invariant [2018-10-01 00:56:13,245 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,245 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,246 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,246 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,246 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,248 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,248 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,248 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,249 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,249 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,249 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,249 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,251 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,251 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,251 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,254 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,256 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,257 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,257 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,257 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,258 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,258 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,258 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,258 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && ~nomsg + 1 == 0 && (exists v_prenex_1 : int :: ((~p5_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && ~nomsg + 1 == 0 && (exists v_prenex_1 : int :: ((~p5_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((((~send3 <= 127 && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~send5 <= 127) - InvariantResult [Line: 355]: Loop Invariant [2018-10-01 00:56:13,259 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,260 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,260 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,260 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,261 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,261 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,261 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,262 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((~send3 <= 127 && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || ((((((((((~send3 <= 127 && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~send5 <= 127)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 333]: Loop Invariant [2018-10-01 00:56:13,263 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,263 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,264 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,264 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,264 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,264 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,265 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,265 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,265 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,265 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,266 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,266 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,267 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,268 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,268 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,268 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,269 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,269 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,269 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,269 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,270 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,270 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,270 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,270 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 0 <= ~send5) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~send5 <= 127) && ~mode4 == 256 * (~mode4 / 256)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127)) || ((((((((~send3 <= 127 && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~send3 <= 127 && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 437]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 289]: Loop Invariant [2018-10-01 00:56:13,272 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,272 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,272 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,272 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,273 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,274 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,274 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,274 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 312]: Loop Invariant [2018-10-01 00:56:13,275 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,275 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,275 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,276 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,276 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,277 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,277 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,277 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 <= ~send5) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 279]: Loop Invariant [2018-10-01 00:56:13,278 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,278 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,279 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,279 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,280 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,280 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,280 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,280 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 401]: Loop Invariant [2018-10-01 00:56:13,281 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,281 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,282 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,282 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,282 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,283 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,283 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,283 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) || (((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 368]: Loop Invariant [2018-10-01 00:56:13,284 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,284 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,285 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,285 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,285 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,286 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,286 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,286 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((~send3 <= 127 && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || ((((((((((~send3 <= 127 && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~send5 <= 127)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 302]: Loop Invariant [2018-10-01 00:56:13,287 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,287 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,288 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,288 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,289 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,289 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,289 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,289 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 416]: Loop Invariant [2018-10-01 00:56:13,290 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,290 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,291 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,291 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,291 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,292 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,292 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,292 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((~send3 <= 127 && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 1 <= check_~tmp~108) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~send5 <= 127) || ((((((((((~send3 <= 127 && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 1 <= check_~tmp~108) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 346]: Loop Invariant [2018-10-01 00:56:13,294 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,294 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,294 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,294 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,295 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,295 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,295 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,295 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,296 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,296 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,296 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,296 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,298 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,298 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,298 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,298 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,299 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,299 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,299 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,299 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,300 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,300 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,300 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,300 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 0 <= ~send5) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~send5 <= 127) && ~mode4 == 256 * (~mode4 / 256)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127)) || ((((((((~send3 <= 127 && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~send3 <= 127 && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 406]: Loop Invariant [2018-10-01 00:56:13,301 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,301 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,302 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,302 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,302 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,303 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,303 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,303 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) || (((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 431]: Loop Invariant [2018-10-01 00:56:13,304 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,304 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,304 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,304 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,305 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,305 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,305 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:56:13,306 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((~send3 <= 127 && 1 <= ~mode4) && assert_~arg == 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 1 <= check_~tmp~108) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || (((((((((((~send3 <= 127 && 1 <= ~mode4) && assert_~arg == 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 1 <= check_~tmp~108) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~send5 <= 127) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 23.6s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 9.1s AutomataDifference, 0.0s DeadEndRemovalTime, 10.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 283 SDtfs, 273 SDslu, 241 SDs, 0 SdLazy, 194 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1205occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 437 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 281 NumberOfFragments, 2358 HoareAnnotationTreeSize, 16 FomulaSimplifications, 9830 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 32504 FormulaSimplificationTreeSizeReductionInter, 9.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 365 NumberOfCodeBlocks, 365 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 355 ConstructedInterpolants, 7 QuantifiedInterpolants, 130688 SizeOfPredicates, 4 NumberOfNonLiveVariables, 489 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 410/420 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-56-13-312.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-56-13-312.csv Received shutdown request...