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-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:48:22,661 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:48:22,663 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:48:22,675 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:48:22,675 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:48:22,676 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:48:22,677 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:48:22,679 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:48:22,680 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:48:22,681 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:48:22,682 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:48:22,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:48:22,683 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:48:22,684 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:48:22,685 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:48:22,686 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:48:22,687 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:48:22,689 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:48:22,691 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:48:22,692 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:48:22,693 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:48:22,695 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:48:22,700 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:48:22,701 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:48:22,701 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:48:22,702 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:48:22,703 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:48:22,705 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:48:22,706 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:48:22,707 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:48:22,707 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:48:22,708 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:48:22,708 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:48:22,708 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:48:22,713 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:48:22,715 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:48:22,715 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-02 11:48:22,742 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:48:22,743 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:48:22,743 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:48:22,744 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:48:22,744 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:48:22,745 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:48:22,745 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:48:22,746 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:48:22,746 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:48:22,746 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:48:22,746 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:48:22,746 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:48:22,747 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:48:22,747 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:48:22,747 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:48:22,747 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:48:22,747 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:48:22,748 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:48:22,748 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:48:22,748 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:48:22,748 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:48:22,749 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:48:22,749 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:48:22,749 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:48:22,749 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:48:22,749 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:48:22,750 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:48:22,750 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:48:22,750 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:48:22,750 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:48:22,803 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:48:22,815 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:48:22,820 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:48:22,821 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:48:22,821 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:48:22,822 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl [2018-10-02 11:48:22,823 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl' [2018-10-02 11:48:22,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:48:22,910 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:48:22,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:48:22,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:48:22,911 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:48:22,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:22" (1/1) ... [2018-10-02 11:48:22,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:22" (1/1) ... [2018-10-02 11:48:22,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:48:22,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:48:22,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:48:22,971 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:48:22,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:22" (1/1) ... [2018-10-02 11:48:22,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:22" (1/1) ... [2018-10-02 11:48:22,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:22" (1/1) ... [2018-10-02 11:48:22,996 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:22" (1/1) ... [2018-10-02 11:48:23,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:22" (1/1) ... [2018-10-02 11:48:23,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:22" (1/1) ... [2018-10-02 11:48:23,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:22" (1/1) ... [2018-10-02 11:48:23,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:48:23,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:48:23,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:48:23,035 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:48:23,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:22" (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-02 11:48:23,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 11:48:23,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 11:48:23,919 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 11:48:23,919 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:48:23 BoogieIcfgContainer [2018-10-02 11:48:23,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:48:23,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:48:23,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:48:23,924 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:48:23,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:22" (1/2) ... [2018-10-02 11:48:23,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50eedbfe and model type pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:48:23, skipping insertion in model container [2018-10-02 11:48:23,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:48:23" (2/2) ... [2018-10-02 11:48:23,928 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl [2018-10-02 11:48:23,938 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:48:23,947 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 11:48:23,993 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:48:23,993 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:48:23,994 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:48:23,994 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:48:23,994 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:48:23,994 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:48:23,994 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:48:23,994 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:48:23,995 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:48:24,010 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-02 11:48:24,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:48:24,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:24,019 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:24,020 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:24,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:24,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-10-02 11:48:24,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:24,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:24,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:24,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:24,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:24,290 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-02 11:48:24,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:24,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:24,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:24,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:24,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:24,317 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-02 11:48:24,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:24,372 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-10-02 11:48:24,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:24,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-02 11:48:24,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:24,386 INFO L225 Difference]: With dead ends: 57 [2018-10-02 11:48:24,386 INFO L226 Difference]: Without dead ends: 37 [2018-10-02 11:48:24,390 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-02 11:48:24,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-02 11:48:24,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-02 11:48:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-02 11:48:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-02 11:48:24,439 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-10-02 11:48:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:24,439 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-02 11:48:24,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-02 11:48:24,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:48:24,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:24,441 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:24,441 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:24,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:24,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-10-02 11:48:24,442 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:24,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:24,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:24,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:24,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:24,637 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-02 11:48:24,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:24,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:24,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:24,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:24,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:24,640 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-02 11:48:24,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:24,680 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-10-02 11:48:24,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:24,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-02 11:48:24,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:24,682 INFO L225 Difference]: With dead ends: 103 [2018-10-02 11:48:24,682 INFO L226 Difference]: Without dead ends: 69 [2018-10-02 11:48:24,685 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-02 11:48:24,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-02 11:48:24,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-02 11:48:24,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-02 11:48:24,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-10-02 11:48:24,705 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-10-02 11:48:24,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:24,705 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-10-02 11:48:24,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:24,705 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-10-02 11:48:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:48:24,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:24,706 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:24,707 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:24,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:24,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-10-02 11:48:24,708 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:24,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:24,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:24,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:24,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:24,798 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-02 11:48:24,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:24,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:24,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:24,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:24,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:24,800 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 3 states. [2018-10-02 11:48:24,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:24,894 INFO L93 Difference]: Finished difference Result 199 states and 280 transitions. [2018-10-02 11:48:24,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:24,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-02 11:48:24,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:24,901 INFO L225 Difference]: With dead ends: 199 [2018-10-02 11:48:24,901 INFO L226 Difference]: Without dead ends: 133 [2018-10-02 11:48:24,907 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-02 11:48:24,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-02 11:48:24,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-10-02 11:48:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-02 11:48:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2018-10-02 11:48:24,954 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 18 [2018-10-02 11:48:24,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:24,955 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2018-10-02 11:48:24,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:24,955 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2018-10-02 11:48:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:48:24,956 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:24,956 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:24,957 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:24,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:24,957 INFO L82 PathProgramCache]: Analyzing trace with hash 823143127, now seen corresponding path program 1 times [2018-10-02 11:48:24,957 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:24,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:24,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:24,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:24,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:25,089 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-02 11:48:25,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:25,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:48:25,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:48:25,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:48:25,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:48:25,093 INFO L87 Difference]: Start difference. First operand 131 states and 182 transitions. Second operand 4 states. [2018-10-02 11:48:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:25,255 INFO L93 Difference]: Finished difference Result 277 states and 379 transitions. [2018-10-02 11:48:25,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:48:25,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-02 11:48:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:25,262 INFO L225 Difference]: With dead ends: 277 [2018-10-02 11:48:25,262 INFO L226 Difference]: Without dead ends: 275 [2018-10-02 11:48:25,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:48:25,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-02 11:48:25,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 147. [2018-10-02 11:48:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-02 11:48:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 198 transitions. [2018-10-02 11:48:25,318 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 198 transitions. Word has length 18 [2018-10-02 11:48:25,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:25,318 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 198 transitions. [2018-10-02 11:48:25,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:48:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 198 transitions. [2018-10-02 11:48:25,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:48:25,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:25,320 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:25,320 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:25,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:25,320 INFO L82 PathProgramCache]: Analyzing trace with hash 823202709, now seen corresponding path program 1 times [2018-10-02 11:48:25,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:25,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:25,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:25,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:25,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:25,413 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-02 11:48:25,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:25,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:25,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:25,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:25,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:25,415 INFO L87 Difference]: Start difference. First operand 147 states and 198 transitions. Second operand 3 states. [2018-10-02 11:48:25,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:25,519 INFO L93 Difference]: Finished difference Result 359 states and 485 transitions. [2018-10-02 11:48:25,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:25,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-02 11:48:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:25,527 INFO L225 Difference]: With dead ends: 359 [2018-10-02 11:48:25,527 INFO L226 Difference]: Without dead ends: 213 [2018-10-02 11:48:25,528 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-02 11:48:25,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-02 11:48:25,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-10-02 11:48:25,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-02 11:48:25,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-10-02 11:48:25,596 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 18 [2018-10-02 11:48:25,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:25,597 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-10-02 11:48:25,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:25,597 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-10-02 11:48:25,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 11:48:25,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:25,600 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:25,600 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:25,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:25,600 INFO L82 PathProgramCache]: Analyzing trace with hash 748385901, now seen corresponding path program 1 times [2018-10-02 11:48:25,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:25,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:25,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:25,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:25,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:25,720 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:48:25,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:25,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:25,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:25,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:25,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:25,722 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-10-02 11:48:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:25,834 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-10-02 11:48:25,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:25,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-02 11:48:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:25,838 INFO L225 Difference]: With dead ends: 633 [2018-10-02 11:48:25,838 INFO L226 Difference]: Without dead ends: 423 [2018-10-02 11:48:25,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02 11:48:25,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-02 11:48:25,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-10-02 11:48:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-02 11:48:25,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-10-02 11:48:25,908 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-10-02 11:48:25,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:25,909 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-10-02 11:48:25,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:25,909 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-10-02 11:48:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 11:48:25,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:25,912 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:25,912 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:25,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:25,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1759503151, now seen corresponding path program 1 times [2018-10-02 11:48:25,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:25,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:25,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:25,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:25,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:48:26,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:26,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:26,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:26,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:26,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:26,069 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-10-02 11:48:26,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:26,267 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-10-02 11:48:26,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:26,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-02 11:48:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:26,273 INFO L225 Difference]: With dead ends: 1257 [2018-10-02 11:48:26,273 INFO L226 Difference]: Without dead ends: 839 [2018-10-02 11:48:26,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02 11:48:26,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-10-02 11:48:26,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-10-02 11:48:26,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-10-02 11:48:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-10-02 11:48:26,412 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-10-02 11:48:26,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:26,412 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-10-02 11:48:26,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:26,412 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-10-02 11:48:26,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 11:48:26,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:26,415 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:26,416 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:26,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:26,416 INFO L82 PathProgramCache]: Analyzing trace with hash -2142437135, now seen corresponding path program 1 times [2018-10-02 11:48:26,416 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:26,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:26,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:26,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:26,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:48:26,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:26,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:26,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:26,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:26,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:26,593 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-10-02 11:48:26,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:26,929 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-10-02 11:48:26,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:26,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-02 11:48:26,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:26,939 INFO L225 Difference]: With dead ends: 2505 [2018-10-02 11:48:26,939 INFO L226 Difference]: Without dead ends: 1671 [2018-10-02 11:48:26,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02 11:48:26,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-02 11:48:27,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-10-02 11:48:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-10-02 11:48:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-10-02 11:48:27,189 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-10-02 11:48:27,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:27,190 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-10-02 11:48:27,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:27,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-10-02 11:48:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 11:48:27,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:27,193 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:27,193 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:27,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:27,194 INFO L82 PathProgramCache]: Analyzing trace with hash 2095271859, now seen corresponding path program 1 times [2018-10-02 11:48:27,194 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:27,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:27,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:27,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:27,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:27,382 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 11:48:27,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:48:27,383 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-02 11:48:27,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:27,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:48:27,734 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-02 11:48:28,114 WARN L178 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-10-02 11:48:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:48:28,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:48:28,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2018-10-02 11:48:28,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:48:28,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:48:28,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:48:28,412 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-10-02 11:48:28,643 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-02 11:48:28,968 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-02 11:48:29,453 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-02 11:48:31,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:31,697 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-10-02 11:48:31,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 11:48:31,698 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-02 11:48:31,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:31,713 INFO L225 Difference]: With dead ends: 4801 [2018-10-02 11:48:31,713 INFO L226 Difference]: Without dead ends: 3135 [2018-10-02 11:48:31,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:48:31,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-10-02 11:48:32,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-10-02 11:48:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-10-02 11:48:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-10-02 11:48:32,163 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-10-02 11:48:32,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:32,163 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-10-02 11:48:32,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:48:32,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-10-02 11:48:32,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-02 11:48:32,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:32,168 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-02 11:48:32,168 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:32,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:32,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1417215583, now seen corresponding path program 2 times [2018-10-02 11:48:32,169 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:32,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:32,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:32,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:32,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:32,332 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-02 11:48:32,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:32,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:32,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:32,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:32,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:32,334 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-10-02 11:48:32,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:32,848 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-10-02 11:48:32,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:32,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-02 11:48:32,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:32,858 INFO L225 Difference]: With dead ends: 4873 [2018-10-02 11:48:32,859 INFO L226 Difference]: Without dead ends: 2215 [2018-10-02 11:48:32,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02 11:48:32,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-10-02 11:48:33,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-10-02 11:48:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-10-02 11:48:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-10-02 11:48:33,184 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-10-02 11:48:33,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:33,184 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-10-02 11:48:33,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:33,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-10-02 11:48:33,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-02 11:48:33,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:33,187 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-02 11:48:33,188 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:33,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:33,188 INFO L82 PathProgramCache]: Analyzing trace with hash 79784675, now seen corresponding path program 3 times [2018-10-02 11:48:33,188 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:33,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:33,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:33,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:48:33,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-02 11:48:33,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:33,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:33,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:33,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:33,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:33,251 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-10-02 11:48:33,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:33,275 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-10-02 11:48:33,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:33,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-02 11:48:33,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:33,276 INFO L225 Difference]: With dead ends: 1799 [2018-10-02 11:48:33,276 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 11:48:33,279 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-02 11:48:33,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 11:48:33,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 11:48:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 11:48:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 11:48:33,280 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-10-02 11:48:33,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:33,280 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 11:48:33,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 11:48:33,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 11:48:33,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 11:48:33,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,716 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 43 [2018-10-02 11:48:33,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:34,419 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 43 [2018-10-02 11:48:35,158 WARN L178 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-10-02 11:48:36,506 WARN L178 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-10-02 11:48:36,948 WARN L178 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-10-02 11:48:37,319 WARN L178 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-10-02 11:48:37,669 WARN L178 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-10-02 11:48:37,951 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-10-02 11:48:38,385 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-10-02 11:48:38,389 INFO L421 ceAbstractionStarter]: At program point L415(lines 415 425) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (and .cse0 .cse1 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse3 ~p2_old))))) (<= ~mode3 1) (<= 1 ~mode3)) (and (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (= ~p2_new .cse4) (<= 0 v_prenex_1)))) .cse2))) [2018-10-02 11:48:38,389 INFO L421 ceAbstractionStarter]: At program point L535(lines 535 542) the Hoare annotation is: false [2018-10-02 11:48:38,389 INFO L421 ceAbstractionStarter]: At program point L490(lines 484 491) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-02 11:48:38,389 INFO L421 ceAbstractionStarter]: At program point L519(lines 514 520) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~156) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-10-02 11:48:38,390 INFO L421 ceAbstractionStarter]: At program point L387(lines 382 388) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (= ~mode2 (* 256 (div ~mode2 256))) (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= 0 ~r1))) (and (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 .cse2 (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse3 ~p2_old))))))) [2018-10-02 11:48:38,390 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 544) no Hoare annotation was computed. [2018-10-02 11:48:38,390 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 544) no Hoare annotation was computed. [2018-10-02 11:48:38,390 INFO L421 ceAbstractionStarter]: At program point L470(lines 464 471) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-02 11:48:38,390 INFO L421 ceAbstractionStarter]: At program point L392(lines 392 402) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (= ~mode2 (* 256 (div ~mode2 256))) (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= 0 ~r1))) (and (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 .cse2 (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse3 ~p2_old))))))) [2018-10-02 11:48:38,390 INFO L421 ceAbstractionStarter]: At program point L450(lines 444 451) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-02 11:48:38,391 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 544) no Hoare annotation was computed. [2018-10-02 11:48:38,391 INFO L421 ceAbstractionStarter]: At program point L541(lines 365 541) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= 0 ~r1)) (and (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 .cse2 (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse3 ~p2_old))))))) [2018-10-02 11:48:38,391 INFO L421 ceAbstractionStarter]: At program point L508(lines 508 515) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-10-02 11:48:38,391 INFO L421 ceAbstractionStarter]: At program point L475(lines 475 485) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-02 11:48:38,391 INFO L421 ceAbstractionStarter]: At program point L372(lines 372 383) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= 0 ~r1)) (and (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 .cse2 (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse3 ~p2_old))))))) [2018-10-02 11:48:38,392 INFO L421 ceAbstractionStarter]: At program point L529(lines 529 536) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~156) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-10-02 11:48:38,392 INFO L421 ceAbstractionStarter]: At program point L430(lines 424 431) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-02 11:48:38,392 INFO L421 ceAbstractionStarter]: At program point L455(lines 455 465) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-02 11:48:38,392 INFO L421 ceAbstractionStarter]: At program point L410(lines 401 411) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (and .cse0 .cse1 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse3 ~p2_old))))) (<= ~mode3 1) (<= 1 ~mode3)) (and (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (= ~p2_new .cse4) (<= 0 v_prenex_1)))) .cse2))) [2018-10-02 11:48:38,392 INFO L421 ceAbstractionStarter]: At program point L435(lines 435 445) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-02 11:48:38,392 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 543) no Hoare annotation was computed. [2018-10-02 11:48:38,400 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,400 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,401 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,401 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,411 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,412 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,412 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,412 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,418 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,418 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,418 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,419 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,422 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,422 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,422 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,423 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,424 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,425 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,425 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,425 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,433 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,434 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,434 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,434 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,436 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,436 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,440 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,441 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,442 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,442 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,445 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,445 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,446 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,446 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,447 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,447 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,451 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,451 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,451 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,452 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,455 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,456 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,456 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,456 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,457 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,457 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,457 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,457 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,459 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,459 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,459 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,464 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,464 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,464 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,465 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,465 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,466 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,466 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,466 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,471 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,472 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,472 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,472 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,476 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,477 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,477 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,477 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,477 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,478 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,478 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,482 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,482 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,483 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,483 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,484 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,484 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,485 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,485 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,485 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,485 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,486 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,487 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,487 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,487 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,488 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,488 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,488 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,489 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,489 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,490 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,490 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,490 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,491 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,491 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,491 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,492 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,492 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,492 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,493 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,493 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,493 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,494 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,494 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,494 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,495 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,495 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,495 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,496 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,496 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,497 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,497 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,497 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,498 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,498 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,498 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,498 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,499 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,499 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,499 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,500 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,500 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,500 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,501 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,501 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,501 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,502 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,502 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,502 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,503 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,503 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,504 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,504 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,504 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,504 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,505 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,505 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,506 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,506 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,506 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,506 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,507 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,507 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,507 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,507 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,510 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:48:38 BoogieIcfgContainer [2018-10-02 11:48:38,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:48:38,512 INFO L168 Benchmark]: Toolchain (without parser) took 15605.08 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 184.5 MB). Free memory was 1.5 GB in the beginning and 952.9 MB in the end (delta: 505.9 MB). Peak memory consumption was 690.5 MB. Max. memory is 7.1 GB. [2018-10-02 11:48:38,513 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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-02 11:48:38,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.12 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-02 11:48:38,515 INFO L168 Benchmark]: Boogie Preprocessor took 63.68 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-02 11:48:38,515 INFO L168 Benchmark]: RCFGBuilder took 885.24 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-10-02 11:48:38,516 INFO L168 Benchmark]: TraceAbstraction took 14589.79 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 184.5 MB). Free memory was 1.4 GB in the beginning and 952.9 MB in the end (delta: 453.1 MB). Peak memory consumption was 637.6 MB. Max. memory is 7.1 GB. [2018-10-02 11:48:38,520 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.21 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 59.12 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 63.68 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 885.24 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14589.79 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 184.5 MB). Free memory was 1.4 GB in the beginning and 952.9 MB in the end (delta: 453.1 MB). Peak memory consumption was 637.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: 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: 424]: Loop Invariant [2018-10-02 11:48:38,538 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,538 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,539 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,539 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,541 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,542 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,542 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,542 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 382]: Loop Invariant [2018-10-02 11:48:38,543 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,543 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,543 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,543 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,544 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,544 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,544 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,544 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (~mode2 == 256 * (~mode2 / 256) && (((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && 0 <= ~r1) || (((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old)) - InvariantResult [Line: 444]: Loop Invariant [2018-10-02 11:48:38,545 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,545 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,545 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,545 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,546 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,546 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,546 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,546 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant [2018-10-02 11:48:38,547 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,548 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,548 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,548 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,548 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,549 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,549 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,549 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 484]: Loop Invariant [2018-10-02 11:48:38,550 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,550 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,550 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,550 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,551 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,551 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,551 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,551 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 415]: Loop Invariant [2018-10-02 11:48:38,552 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,552 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,553 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,553 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,553 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,553 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,553 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,553 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,554 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,554 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,555 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,555 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,555 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,555 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,555 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,556 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((~send2 <= 127 && 0 <= ~send2) && ~nomsg + 1 == 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old)) && ~mode3 <= 1) && 1 <= ~mode3) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) - InvariantResult [Line: 372]: Loop Invariant [2018-10-02 11:48:38,556 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,557 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,557 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,557 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,558 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,558 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,558 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,558 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && ~nomsg + 1 == 0) && 0 <= ~r1) || (((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old)) - InvariantResult [Line: 435]: Loop Invariant [2018-10-02 11:48:38,559 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,559 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,559 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,559 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,560 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,560 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,560 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,561 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 392]: Loop Invariant [2018-10-02 11:48:38,561 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,562 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,562 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,562 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,563 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,563 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,563 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,563 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (~mode2 == 256 * (~mode2 / 256) && (((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && 0 <= ~r1) || (((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old)) - InvariantResult [Line: 365]: Loop Invariant [2018-10-02 11:48:38,564 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,564 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,564 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,565 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,565 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,566 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,566 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,566 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && ~nomsg + 1 == 0) && 0 <= ~r1) || (((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old)) - InvariantResult [Line: 455]: Loop Invariant [2018-10-02 11:48:38,566 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,567 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,567 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,567 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,568 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,568 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,568 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,568 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 514]: Loop Invariant [2018-10-02 11:48:38,569 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,569 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,569 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,570 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,570 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,570 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,570 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,571 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= check_~tmp~156 && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 508]: Loop Invariant [2018-10-02 11:48:38,571 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,571 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,572 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,572 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,572 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,573 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,573 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,573 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 529]: Loop Invariant [2018-10-02 11:48:38,574 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,574 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,574 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,574 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,575 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,575 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,575 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,575 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((assert_~arg == 1 && 1 <= check_~tmp~156) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 475]: Loop Invariant [2018-10-02 11:48:38,576 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,576 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,576 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,576 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,577 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,577 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,577 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,578 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 401]: Loop Invariant [2018-10-02 11:48:38,578 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,579 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,579 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,579 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,579 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,580 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,580 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,580 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,580 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,581 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,581 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,581 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,581 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,582 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,582 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:38,582 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((~send2 <= 127 && 0 <= ~send2) && ~nomsg + 1 == 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old)) && ~mode3 <= 1) && 1 <= ~mode3) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 14.4s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 5.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 370 SDtfs, 335 SDslu, 296 SDs, 0 SdLazy, 187 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, 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: 1.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1592 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 966 HoareAnnotationTreeSize, 17 FomulaSimplifications, 82925 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 630 FormulaSimplificationTreeSizeReductionInter, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 380 ConstructedInterpolants, 18 QuantifiedInterpolants, 54494 SizeOfPredicates, 4 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 254/272 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-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-48-38-590.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-48-38-590.csv Received shutdown request...