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.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:21:47,141 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:21:47,144 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:21:47,162 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:21:47,162 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:21:47,164 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:21:47,165 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:21:47,168 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:21:47,170 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:21:47,173 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:21:47,176 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:21:47,176 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:21:47,177 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:21:47,178 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:21:47,182 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:21:47,183 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:21:47,184 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:21:47,193 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:21:47,196 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:21:47,203 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:21:47,206 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:21:47,207 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:21:47,211 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:21:47,211 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:21:47,211 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:21:47,212 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:21:47,213 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:21:47,215 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:21:47,216 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:21:47,219 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:21:47,221 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:21:47,222 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:21:47,222 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:21:47,223 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:21:47,226 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:21:47,227 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:21:47,227 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 09:21:47,255 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:21:47,255 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:21:47,256 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:21:47,256 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:21:47,257 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:21:47,257 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:21:47,257 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:21:47,257 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:21:47,260 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:21:47,260 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:21:47,260 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:21:47,261 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:21:47,261 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:21:47,261 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:21:47,261 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:21:47,261 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:21:47,262 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:21:47,262 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:21:47,262 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:21:47,262 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:21:47,262 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:21:47,263 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:21:47,264 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:21:47,264 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:21:47,264 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:21:47,264 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:21:47,265 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:21:47,265 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:21:47,265 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:21:47,265 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:21:47,309 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:21:47,324 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:21:47,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:21:47,334 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:21:47,334 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:21:47,335 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl [2018-10-04 09:21:47,335 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl' [2018-10-04 09:21:47,438 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:21:47,440 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:21:47,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:21:47,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:21:47,441 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:21:47,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:47" (1/1) ... [2018-10-04 09:21:47,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:47" (1/1) ... [2018-10-04 09:21:47,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:21:47,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:21:47,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:21:47,491 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:21:47,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:47" (1/1) ... [2018-10-04 09:21:47,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:47" (1/1) ... [2018-10-04 09:21:47,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:47" (1/1) ... [2018-10-04 09:21:47,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:47" (1/1) ... [2018-10-04 09:21:47,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:47" (1/1) ... [2018-10-04 09:21:47,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:47" (1/1) ... [2018-10-04 09:21:47,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:47" (1/1) ... [2018-10-04 09:21:47,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:21:47,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:21:47,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:21:47,535 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:21:47,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:47" (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-04 09:21:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:21:47,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:21:48,260 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:21:48,260 INFO L202 PluginConnector]: Adding new model pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:21:48 BoogieIcfgContainer [2018-10-04 09:21:48,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:21:48,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:21:48,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:21:48,265 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:21:48,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:47" (1/2) ... [2018-10-04 09:21:48,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc668a4 and model type pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:21:48, skipping insertion in model container [2018-10-04 09:21:48,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:21:48" (2/2) ... [2018-10-04 09:21:48,268 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl [2018-10-04 09:21:48,278 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:21:48,287 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:21:48,338 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:21:48,339 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:21:48,339 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:21:48,339 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:21:48,340 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:21:48,340 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:21:48,340 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:21:48,340 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:21:48,340 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:21:48,355 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-04 09:21:48,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:21:48,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:48,363 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:48,365 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:48,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:48,371 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-10-04 09:21:48,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:48,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:48,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:48,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:48,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:48,592 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-04 09:21:48,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:48,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:48,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:48,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:48,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:48,617 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-10-04 09:21:48,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:48,693 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-10-04 09:21:48,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:48,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 09:21:48,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:48,707 INFO L225 Difference]: With dead ends: 48 [2018-10-04 09:21:48,708 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 09:21:48,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 09:21:48,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-10-04 09:21:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 09:21:48,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-10-04 09:21:48,754 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-10-04 09:21:48,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:48,754 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-10-04 09:21:48,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:48,755 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-10-04 09:21:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:21:48,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:48,756 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:48,756 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:48,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:48,756 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-10-04 09:21:48,757 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:48,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:48,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:48,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:48,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:48,920 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-04 09:21:48,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:48,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:48,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:48,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:48,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:48,923 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-10-04 09:21:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:48,961 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-10-04 09:21:48,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:48,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 09:21:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:48,963 INFO L225 Difference]: With dead ends: 85 [2018-10-04 09:21:48,963 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:21:48,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:48,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:21:48,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-10-04 09:21:48,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 09:21:48,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-10-04 09:21:48,982 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-10-04 09:21:48,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:48,983 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-10-04 09:21:48,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:48,983 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-10-04 09:21:48,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:21:48,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:48,984 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:48,985 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:48,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:48,985 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-10-04 09:21:48,985 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:48,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:48,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:48,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:48,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:49,099 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-04 09:21:49,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:49,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:49,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:49,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:49,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:49,101 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-10-04 09:21:49,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:49,173 INFO L93 Difference]: Finished difference Result 163 states and 232 transitions. [2018-10-04 09:21:49,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:49,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 09:21:49,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:49,178 INFO L225 Difference]: With dead ends: 163 [2018-10-04 09:21:49,178 INFO L226 Difference]: Without dead ends: 109 [2018-10-04 09:21:49,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:49,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-04 09:21:49,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-10-04 09:21:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-04 09:21:49,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2018-10-04 09:21:49,221 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 15 [2018-10-04 09:21:49,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:49,224 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2018-10-04 09:21:49,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2018-10-04 09:21:49,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:21:49,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:49,226 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:49,226 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:49,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:49,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1002430271, now seen corresponding path program 1 times [2018-10-04 09:21:49,229 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:49,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:49,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:49,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:49,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:49,378 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-04 09:21:49,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:49,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:49,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:49,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:49,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:49,382 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand 3 states. [2018-10-04 09:21:49,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:49,550 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2018-10-04 09:21:49,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:49,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 09:21:49,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:49,553 INFO L225 Difference]: With dead ends: 269 [2018-10-04 09:21:49,553 INFO L226 Difference]: Without dead ends: 163 [2018-10-04 09:21:49,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:49,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-04 09:21:49,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-10-04 09:21:49,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-04 09:21:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2018-10-04 09:21:49,584 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 15 [2018-10-04 09:21:49,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:49,584 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2018-10-04 09:21:49,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2018-10-04 09:21:49,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:21:49,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:49,586 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:49,586 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:49,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:49,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1000583229, now seen corresponding path program 1 times [2018-10-04 09:21:49,587 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:49,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:49,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:49,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:49,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:49,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-04 09:21:49,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:49,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:21:49,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:21:49,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:21:49,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:21:49,766 INFO L87 Difference]: Start difference. First operand 161 states and 220 transitions. Second operand 4 states. [2018-10-04 09:21:49,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:49,980 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2018-10-04 09:21:49,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:21:49,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-04 09:21:49,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:49,990 INFO L225 Difference]: With dead ends: 293 [2018-10-04 09:21:49,990 INFO L226 Difference]: Without dead ends: 291 [2018-10-04 09:21:49,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:21:49,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-04 09:21:50,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2018-10-04 09:21:50,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-04 09:21:50,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-10-04 09:21:50,061 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 15 [2018-10-04 09:21:50,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:50,061 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-10-04 09:21:50,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:21:50,062 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-10-04 09:21:50,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 09:21:50,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:50,063 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:50,065 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:50,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:50,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1080825333, now seen corresponding path program 1 times [2018-10-04 09:21:50,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:50,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:50,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:50,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:50,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:50,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:50,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:21:50,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:50,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:50,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:50,232 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-10-04 09:21:50,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:50,347 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-10-04 09:21:50,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:50,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-04 09:21:50,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:50,350 INFO L225 Difference]: With dead ends: 525 [2018-10-04 09:21:50,350 INFO L226 Difference]: Without dead ends: 351 [2018-10-04 09:21:50,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:50,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-04 09:21:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-10-04 09:21:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-04 09:21:50,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-10-04 09:21:50,413 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-10-04 09:21:50,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:50,414 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-10-04 09:21:50,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:50,414 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-10-04 09:21:50,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 09:21:50,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:50,417 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:50,417 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:50,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:50,418 INFO L82 PathProgramCache]: Analyzing trace with hash 379760755, now seen corresponding path program 1 times [2018-10-04 09:21:50,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:50,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:50,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:50,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:50,743 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 3 [2018-10-04 09:21:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 09:21:50,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:21:50,747 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-04 09:21:50,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:50,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:21:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 09:21:51,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:21:51,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 09:21:51,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:21:51,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:21:51,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:21:51,051 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 4 states. [2018-10-04 09:21:51,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:51,354 INFO L93 Difference]: Finished difference Result 799 states and 1041 transitions. [2018-10-04 09:21:51,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:21:51,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-10-04 09:21:51,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:51,360 INFO L225 Difference]: With dead ends: 799 [2018-10-04 09:21:51,361 INFO L226 Difference]: Without dead ends: 557 [2018-10-04 09:21:51,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:21:51,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-10-04 09:21:51,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2018-10-04 09:21:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-10-04 09:21:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 688 transitions. [2018-10-04 09:21:51,484 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 688 transitions. Word has length 28 [2018-10-04 09:21:51,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:51,486 INFO L480 AbstractCegarLoop]: Abstraction has 557 states and 688 transitions. [2018-10-04 09:21:51,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:21:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 688 transitions. [2018-10-04 09:21:51,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 09:21:51,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:51,501 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 09:21:51,501 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:51,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:51,502 INFO L82 PathProgramCache]: Analyzing trace with hash 415408239, now seen corresponding path program 2 times [2018-10-04 09:21:51,502 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:51,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:51,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:51,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:51,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:51,777 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-04 09:21:52,017 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-10-04 09:21:52,345 WARN L178 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-10-04 09:21:52,368 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 43 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-04 09:21:52,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:21:52,368 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:21:52,384 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:21:52,512 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:21:52,512 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:21:52,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:21:52,728 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-04 09:21:53,094 WARN L178 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-10-04 09:21:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-04 09:21:53,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:21:53,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-04 09:21:53,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:21:53,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:21:53,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:21:53,400 INFO L87 Difference]: Start difference. First operand 557 states and 688 transitions. Second operand 8 states. [2018-10-04 09:21:53,772 WARN L178 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-04 09:21:54,618 WARN L178 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-10-04 09:21:55,254 WARN L178 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-10-04 09:21:55,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:55,588 INFO L93 Difference]: Finished difference Result 623 states and 764 transitions. [2018-10-04 09:21:55,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:21:55,591 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-10-04 09:21:55,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:55,592 INFO L225 Difference]: With dead ends: 623 [2018-10-04 09:21:55,592 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:21:55,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-10-04 09:21:55,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:21:55,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:21:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:21:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:21:55,595 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-10-04 09:21:55,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:55,595 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:21:55,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:21:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:21:55,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:21:55,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:21:55,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:55,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:55,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:55,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:55,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:55,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:56,100 WARN L178 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-04 09:21:56,240 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-04 09:21:56,368 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-10-04 09:21:56,587 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-10-04 09:21:56,794 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-10-04 09:21:57,088 WARN L178 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-10-04 09:21:57,259 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-10-04 09:21:57,427 WARN L178 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-04 09:21:57,536 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-04 09:21:57,698 INFO L421 ceAbstractionStarter]: At program point L300(lines 300 311) the Hoare annotation is: (let ((.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse4 (<= ~send1 127)) (.cse5 (<= ~send4 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~mode4 (* 256 (div ~mode4 256))) .cse7) (and (<= ULTIMATE.start_assert_~arg 1) .cse1 .cse2 (<= ~mode2 1) .cse3 .cse6 (<= 1 ULTIMATE.start_check_~tmp~83) .cse7 (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse4 .cse5 (<= 1 ULTIMATE.start_assert_~arg)))) [2018-10-04 09:21:57,698 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 376) no Hoare annotation was computed. [2018-10-04 09:21:57,698 INFO L421 ceAbstractionStarter]: At program point L317(lines 310 318) the Hoare annotation is: (let ((.cse5 (<= ~r1 0)) (.cse0 (<= 0 ~send1)) (.cse1 (<= 0 ~send4)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse7 (<= ~send1 127)) (.cse8 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~r1))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 (<= ~mode2 1) .cse2 .cse3 (<= 1 ULTIMATE.start_check_~tmp~83) (= ~mode4 (* 256 (div ~mode4 256))) .cse4 (not (= ~p1_old ~nomsg)) .cse5 (<= 1 ~mode2) (exists ((v_prenex_2 Int)) (let ((.cse6 (mod v_prenex_2 256))) (and (<= .cse6 127) (= ~p4_old .cse6) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse7 .cse8 (<= 1 ULTIMATE.start_assert_~arg)) (and .cse5 .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 (exists ((v_prenex_2 Int)) (let ((.cse9 (mod v_prenex_2 256))) (and (<= .cse9 127) (<= v_prenex_2 127) (<= 0 v_prenex_2) (= ~p4_new .cse9)))) .cse4))) [2018-10-04 09:21:57,698 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 376) no Hoare annotation was computed. [2018-10-04 09:21:57,698 INFO L421 ceAbstractionStarter]: At program point L251(lines 243 252) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_assert_~arg 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse6 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse8 (<= 0 ~r1)) (.cse10 (<= ~r1 0)) (.cse14 (<= 1 ULTIMATE.start_assert_~arg)) (.cse9 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse11 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse12 (<= ~send1 127)) (.cse13 (<= ~send4 127)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (= ~mode4 (* 256 (div ~mode4 256))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse10 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse4 .cse12 .cse13 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 (exists ((v_prenex_2 Int)) (let ((.cse15 (mod v_prenex_2 256))) (and (<= .cse15 127) (= ~p4_old .cse15) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse12 .cse13 .cse14) (and .cse9 .cse1 (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse11 .cse3 (<= ~r1 1) .cse12 .cse13 .cse5 .cse7))) [2018-10-04 09:21:57,699 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 375) no Hoare annotation was computed. [2018-10-04 09:21:57,699 INFO L421 ceAbstractionStarter]: At program point L367(lines 367 374) the Hoare annotation is: false [2018-10-04 09:21:57,699 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 376) no Hoare annotation was computed. [2018-10-04 09:21:57,699 INFO L421 ceAbstractionStarter]: At program point L256(lines 256 266) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_assert_~arg 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse6 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse8 (<= 0 ~r1)) (.cse10 (<= ~r1 0)) (.cse14 (<= 1 ULTIMATE.start_assert_~arg)) (.cse9 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse11 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse12 (<= ~send1 127)) (.cse13 (<= ~send4 127)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (= ~mode4 (* 256 (div ~mode4 256))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse10 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse4 .cse12 .cse13 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 (exists ((v_prenex_2 Int)) (let ((.cse15 (mod v_prenex_2 256))) (and (<= .cse15 127) (= ~p4_old .cse15) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse12 .cse13 .cse14) (and .cse9 .cse1 (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse11 .cse3 (<= ~r1 1) .cse12 .cse13 .cse5 .cse7))) [2018-10-04 09:21:57,699 INFO L421 ceAbstractionStarter]: At program point L351(lines 346 352) the Hoare annotation is: (let ((.cse2 (<= 0 ~send1)) (.cse3 (<= 0 ~send4)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse9 (<= 0 ~r1)) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ~r1 0)) (.cse5 (<= ~send1 127)) (.cse6 (<= ~send4 127))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((v_prenex_2 Int)) (let ((.cse4 (mod v_prenex_2 256))) (and (<= .cse4 127) (= ~p4_old .cse4) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse5 .cse6 .cse7 .cse8 .cse9) (and (<= ULTIMATE.start_assert_~arg 1) .cse2 .cse3 (<= ~mode2 1) .cse7 .cse8 (= ~mode4 (* 256 (div ~mode4 256))) .cse9 .cse0 .cse1 (<= 1 ~mode2) .cse5 .cse6 (<= 1 ULTIMATE.start_assert_~arg)))) [2018-10-04 09:21:57,699 INFO L421 ceAbstractionStarter]: At program point L273(lines 265 274) the Hoare annotation is: (let ((.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse4 (<= ~send1 127)) (.cse5 (<= ~send4 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~mode4 (* 256 (div ~mode4 256))) .cse7) (and (<= ULTIMATE.start_assert_~arg 1) .cse1 .cse2 (<= ~mode2 1) .cse3 .cse6 (<= 1 ULTIMATE.start_check_~tmp~83) .cse7 (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse4 .cse5 (<= 1 ULTIMATE.start_assert_~arg)))) [2018-10-04 09:21:57,700 INFO L421 ceAbstractionStarter]: At program point L331(lines 331 337) the Hoare annotation is: (let ((.cse4 (not (= ~p1_old ~nomsg))) (.cse5 (<= ~r1 0)) (.cse0 (<= 0 ~send1)) (.cse1 (<= 0 ~send4)) (.cse6 (<= ~send1 127)) (.cse7 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~r1))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 (<= ~mode2 1) .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse3 .cse4 .cse5 (<= 1 ~mode2) .cse6 .cse7 (<= 1 ULTIMATE.start_assert_~arg)) (and .cse4 .cse5 .cse0 .cse1 (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse6 .cse7 .cse2 .cse3))) [2018-10-04 09:21:57,700 INFO L421 ceAbstractionStarter]: At program point L278(lines 278 288) the Hoare annotation is: (let ((.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse4 (<= ~send1 127)) (.cse5 (<= ~send4 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~mode4 (* 256 (div ~mode4 256))) .cse7) (and (<= ULTIMATE.start_assert_~arg 1) .cse1 .cse2 (<= ~mode2 1) .cse3 .cse6 (<= 1 ULTIMATE.start_check_~tmp~83) .cse7 (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse4 .cse5 (<= 1 ULTIMATE.start_assert_~arg)))) [2018-10-04 09:21:57,700 INFO L421 ceAbstractionStarter]: At program point L373(lines 226 373) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_assert_~arg 1)) (.cse10 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse0 (not (= ~p1_old ~nomsg))) (.cse9 (<= 1 ULTIMATE.start_assert_~arg)) (.cse2 (<= ~r1 0)) (.cse3 (<= 0 ~send1)) (.cse4 (<= 0 ~send4)) (.cse6 (<= ~send1 127)) (.cse7 (<= ~send4 127)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse12 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse11 (<= 0 ~r1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_prenex_2 Int)) (let ((.cse5 (mod v_prenex_2 256))) (and (<= .cse5 127) (= ~p4_old .cse5) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse3 .cse4 (<= ~mode2 1) .cse8 .cse10 .cse12 .cse11 .cse0 .cse2 (<= 1 ~mode2) .cse6 .cse7 .cse9) (and .cse2 .cse3 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse4 .cse6 .cse7 .cse8 .cse12 .cse11))) [2018-10-04 09:21:57,700 INFO L421 ceAbstractionStarter]: At program point L340(lines 336 347) the Hoare annotation is: (let ((.cse4 (not (= ~p1_old ~nomsg))) (.cse5 (<= ~r1 0)) (.cse0 (<= 0 ~send1)) (.cse1 (<= 0 ~send4)) (.cse6 (<= ~send1 127)) (.cse7 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~r1))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 (<= ~mode2 1) .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse3 .cse4 .cse5 (<= 1 ~mode2) .cse6 .cse7 (<= 1 ULTIMATE.start_assert_~arg)) (and .cse4 .cse5 .cse0 .cse1 (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse6 .cse7 .cse2 .cse3))) [2018-10-04 09:21:57,700 INFO L421 ceAbstractionStarter]: At program point L233(lines 233 244) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_assert_~arg 1)) (.cse10 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse0 (not (= ~p1_old ~nomsg))) (.cse9 (<= 1 ULTIMATE.start_assert_~arg)) (.cse2 (<= ~r1 0)) (.cse3 (<= 0 ~send1)) (.cse4 (<= 0 ~send4)) (.cse6 (<= ~send1 127)) (.cse7 (<= ~send4 127)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse12 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse11 (<= 0 ~r1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_prenex_2 Int)) (let ((.cse5 (mod v_prenex_2 256))) (and (<= .cse5 127) (= ~p4_old .cse5) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse3 .cse4 (<= ~mode2 1) .cse8 .cse10 .cse12 .cse11 .cse0 .cse2 (<= 1 ~mode2) .cse6 .cse7 .cse9) (and .cse2 .cse3 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse4 .cse6 .cse7 .cse8 .cse12 .cse11))) [2018-10-04 09:21:57,701 INFO L421 ceAbstractionStarter]: At program point L361(lines 361 368) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_assert_~arg 1)) (.cse3 (<= 0 ~send1)) (.cse4 (<= 0 ~send4)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse10 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse11 (<= 0 ~r1)) (.cse0 (not (= ~p1_old ~nomsg))) (.cse2 (<= ~r1 0)) (.cse6 (<= ~send1 127)) (.cse7 (<= ~send4 127)) (.cse9 (<= 1 ULTIMATE.start_assert_~arg))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_prenex_2 Int)) (let ((.cse5 (mod v_prenex_2 256))) (and (<= .cse5 127) (= ~p4_old .cse5) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse3 .cse4 (<= ~mode2 1) .cse8 .cse10 (= ~mode4 (* 256 (div ~mode4 256))) .cse11 .cse0 .cse2 (<= 1 ~mode2) .cse6 .cse7 .cse9))) [2018-10-04 09:21:57,701 INFO L421 ceAbstractionStarter]: At program point L295(lines 287 296) the Hoare annotation is: (let ((.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse4 (<= ~send1 127)) (.cse5 (<= ~send4 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~mode4 (* 256 (div ~mode4 256))) .cse7) (and (<= ULTIMATE.start_assert_~arg 1) .cse1 .cse2 (<= ~mode2 1) .cse3 .cse6 (<= 1 ULTIMATE.start_check_~tmp~83) .cse7 (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse4 .cse5 (<= 1 ULTIMATE.start_assert_~arg)))) [2018-10-04 09:21:57,710 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,711 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,711 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,711 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,719 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,720 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,720 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,720 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,723 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,723 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,723 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,723 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,726 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,726 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,727 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,727 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,729 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,729 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,730 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,730 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,732 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,732 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,732 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,733 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,734 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,735 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,735 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,735 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,740 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,741 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,741 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,741 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,743 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,743 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,744 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,744 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,747 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,747 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,747 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,747 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,750 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,750 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,757 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,761 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,761 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,762 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,762 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,764 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,765 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,765 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,765 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,766 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,773 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,773 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,773 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,775 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,775 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,775 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,775 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,776 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,777 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,777 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,777 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,778 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,778 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,779 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,779 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,780 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,780 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,780 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,781 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,782 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,782 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,782 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,783 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,784 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,784 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,784 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,785 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,786 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,786 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,786 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,787 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,787 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,788 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,788 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,788 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,789 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,790 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,790 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,790 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,790 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,790 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,791 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,791 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,792 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,792 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,793 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,793 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,793 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,793 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,793 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,794 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,795 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,795 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,795 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,795 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,796 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,797 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,797 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,797 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,799 INFO L202 PluginConnector]: Adding new model pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:21:57 BoogieIcfgContainer [2018-10-04 09:21:57,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:21:57,800 INFO L168 Benchmark]: Toolchain (without parser) took 10361.24 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 30.9 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 60.3 MB). Peak memory consumption was 490.7 MB. Max. memory is 7.1 GB. [2018-10-04 09:21:57,802 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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-04 09:21:57,802 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.34 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-04 09:21:57,803 INFO L168 Benchmark]: Boogie Preprocessor took 43.38 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-04 09:21:57,803 INFO L168 Benchmark]: RCFGBuilder took 725.88 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-04 09:21:57,804 INFO L168 Benchmark]: TraceAbstraction took 9538.28 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 30.9 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 28.6 MB). Peak memory consumption was 459.0 MB. Max. memory is 7.1 GB. [2018-10-04 09:21:57,808 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.20 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 49.34 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 43.38 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 725.88 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 9538.28 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 30.9 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 28.6 MB). Peak memory consumption was 459.0 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_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 375]: 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: 243]: Loop Invariant [2018-10-04 09:21:57,825 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,825 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,825 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,825 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,826 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,826 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,827 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,827 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) || (((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1)) || ((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg)) || ((((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && ~r1 <= 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 265]: Loop Invariant [2018-10-04 09:21:57,828 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,828 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,828 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,828 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,829 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,829 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,830 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,830 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) || ((((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 287]: Loop Invariant [2018-10-04 09:21:57,831 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,831 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,831 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,831 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,832 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,832 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,832 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,833 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((~r1 <= 0 && 0 <= ~send1) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) || ((((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 331]: Loop Invariant [2018-10-04 09:21:57,833 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,834 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,834 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,834 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,835 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,835 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,835 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,835 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) || ((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send1) && 0 <= ~send4) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) - InvariantResult [Line: 226]: Loop Invariant [2018-10-04 09:21:57,836 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,836 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,837 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,837 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,838 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,838 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,838 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,838 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && ~r1 <= 0) && 0 <= ~send1) && 0 <= ~send4) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 1 <= check_~tmp~83) && 0 <= ~r1) || (((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg)) || (((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) - InvariantResult [Line: 233]: Loop Invariant [2018-10-04 09:21:57,839 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,839 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,840 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,840 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,841 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,841 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,841 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,841 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && ~r1 <= 0) && 0 <= ~send1) && 0 <= ~send4) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 1 <= check_~tmp~83) && 0 <= ~r1) || (((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg)) || (((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) - InvariantResult [Line: 346]: Loop Invariant [2018-10-04 09:21:57,842 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,842 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,842 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,843 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,843 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,844 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,844 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,844 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send1) && 0 <= ~send4) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) || (((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 336]: Loop Invariant [2018-10-04 09:21:57,845 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,845 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,845 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,845 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,846 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,846 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,847 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,847 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) || ((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send1) && 0 <= ~send4) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) - InvariantResult [Line: 361]: Loop Invariant [2018-10-04 09:21:57,848 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,848 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,848 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,848 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,849 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,849 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,849 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,849 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && ~r1 <= 0) && 0 <= ~send1) && 0 <= ~send4) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 1 <= check_~tmp~83) && 0 <= ~r1) || (((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 256]: Loop Invariant [2018-10-04 09:21:57,850 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,851 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,851 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,851 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,852 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,852 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,852 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,852 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) || (((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1)) || ((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg)) || ((((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && ~r1 <= 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 278]: Loop Invariant [2018-10-04 09:21:57,853 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,853 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,854 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,854 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,854 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,855 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,855 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,855 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) || ((((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 310]: Loop Invariant [2018-10-04 09:21:57,856 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,856 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,856 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,856 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,857 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,857 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,857 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,857 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,858 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,858 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,858 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,858 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,859 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,859 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,859 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,859 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) || ((((((((~r1 <= 0 && 0 <= ~send1) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && v_prenex_2 <= 127) && 0 <= v_prenex_2) && ~p4_new == v_prenex_2 % 256)) && 0 <= ~r1) - InvariantResult [Line: 300]: Loop Invariant [2018-10-04 09:21:57,860 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,860 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,860 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,860 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,861 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,861 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,861 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 09:21:57,862 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((~r1 <= 0 && 0 <= ~send1) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) || ((((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 9.3s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 2.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 215 SDtfs, 167 SDslu, 174 SDs, 0 SdLazy, 120 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=557occurred 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.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 124 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 82 NumberOfFragments, 1636 HoareAnnotationTreeSize, 14 FomulaSimplifications, 2787 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 257 ConstructedInterpolants, 7 QuantifiedInterpolants, 35099 SizeOfPredicates, 5 NumberOfNonLiveVariables, 676 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 173/195 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.4.ufo.BOUNDED-8.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-21-57-868.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-21-57-868.csv Received shutdown request...