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.1.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:48:20,540 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:48:20,542 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:48:20,554 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:48:20,554 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:48:20,555 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:48:20,556 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:48:20,558 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:48:20,559 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:48:20,560 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:48:20,561 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:48:20,561 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:48:20,562 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:48:20,565 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:48:20,566 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:48:20,567 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:48:20,568 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:48:20,571 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:48:20,576 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:48:20,581 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:48:20,582 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:48:20,583 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:48:20,590 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:48:20,590 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:48:20,590 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:48:20,591 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:48:20,595 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:48:20,596 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:48:20,597 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:48:20,598 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:48:20,598 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:48:20,599 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:48:20,599 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:48:20,599 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:48:20,600 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:48:20,601 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:48:20,601 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:20,615 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:48:20,615 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:48:20,616 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:48:20,616 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:48:20,617 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:48:20,617 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:48:20,617 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:48:20,617 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:48:20,618 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:48:20,618 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:48:20,618 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:48:20,618 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:48:20,618 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:48:20,619 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:48:20,619 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:48:20,619 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:48:20,619 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:48:20,619 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:48:20,620 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:48:20,620 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:48:20,620 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:48:20,620 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:48:20,620 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:48:20,621 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:48:20,621 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:48:20,621 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:48:20,621 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:48:20,621 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:48:20,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:48:20,622 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:48:20,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:48:20,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:48:20,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:48:20,685 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:48:20,686 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:48:20,686 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.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-02 11:48:20,687 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl' [2018-10-02 11:48:20,759 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:48:20,762 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:48:20,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:48:20,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:48:20,763 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:48:20,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:20" (1/1) ... [2018-10-02 11:48:20,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:20" (1/1) ... [2018-10-02 11:48:20,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:48:20,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:48:20,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:48:20,810 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:48:20,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:20" (1/1) ... [2018-10-02 11:48:20,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:20" (1/1) ... [2018-10-02 11:48:20,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:20" (1/1) ... [2018-10-02 11:48:20,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:20" (1/1) ... [2018-10-02 11:48:20,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:20" (1/1) ... [2018-10-02 11:48:20,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:20" (1/1) ... [2018-10-02 11:48:20,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:20" (1/1) ... [2018-10-02 11:48:20,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:48:20,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:48:20,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:48:20,848 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:48:20,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:20" (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:20,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 11:48:20,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 11:48:21,718 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 11:48:21,718 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:48:21 BoogieIcfgContainer [2018-10-02 11:48:21,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:48:21,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:48:21,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:48:21,723 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:48:21,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:20" (1/2) ... [2018-10-02 11:48:21,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae06288 and model type pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:48:21, skipping insertion in model container [2018-10-02 11:48:21,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:48:21" (2/2) ... [2018-10-02 11:48:21,726 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-02 11:48:21,736 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:48:21,749 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 11:48:21,799 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:48:21,800 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:48:21,800 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:48:21,800 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:48:21,800 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:48:21,801 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:48:21,801 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:48:21,801 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:48:21,801 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:48:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-02 11:48:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:48:21,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:21,829 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:21,830 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:21,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:21,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-10-02 11:48:21,838 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:21,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:21,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:21,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:21,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:22,086 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:22,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:22,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:22,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:22,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:22,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:22,107 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-02 11:48:22,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:22,159 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-10-02 11:48:22,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:22,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-02 11:48:22,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:22,173 INFO L225 Difference]: With dead ends: 57 [2018-10-02 11:48:22,173 INFO L226 Difference]: Without dead ends: 37 [2018-10-02 11:48:22,177 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:22,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-02 11:48:22,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-02 11:48:22,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-02 11:48:22,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-02 11:48:22,223 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-10-02 11:48:22,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:22,223 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-02 11:48:22,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:22,223 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-02 11:48:22,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:48:22,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:22,224 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:22,225 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:22,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:22,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-10-02 11:48:22,225 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:22,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:22,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:22,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:22,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:22,394 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:22,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:22,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:22,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:22,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:22,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:22,401 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-02 11:48:22,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:22,439 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-10-02 11:48:22,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:22,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-02 11:48:22,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:22,442 INFO L225 Difference]: With dead ends: 103 [2018-10-02 11:48:22,442 INFO L226 Difference]: Without dead ends: 69 [2018-10-02 11:48:22,443 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:22,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-02 11:48:22,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-02 11:48:22,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-02 11:48:22,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-10-02 11:48:22,464 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-10-02 11:48:22,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:22,464 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-10-02 11:48:22,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:22,465 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-10-02 11:48:22,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:48:22,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:22,466 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:22,466 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:22,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:22,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-10-02 11:48:22,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:22,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:22,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:22,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:22,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:22,659 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:22,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:22,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:48:22,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:48:22,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:48:22,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:48:22,661 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-10-02 11:48:22,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:22,898 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-10-02 11:48:22,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:48:22,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-02 11:48:22,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:22,903 INFO L225 Difference]: With dead ends: 141 [2018-10-02 11:48:22,903 INFO L226 Difference]: Without dead ends: 139 [2018-10-02 11:48:22,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:48:22,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-02 11:48:22,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-10-02 11:48:22,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-02 11:48:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-10-02 11:48:22,930 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-10-02 11:48:22,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:22,930 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-10-02 11:48:22,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:48:22,931 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-10-02 11:48:22,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:48:22,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:22,932 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:22,934 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:22,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:22,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-10-02 11:48:22,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:22,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:22,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:22,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:22,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:23,057 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:23,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:23,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:23,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:23,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:23,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:23,060 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-10-02 11:48:23,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:23,177 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-10-02 11:48:23,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:23,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-02 11:48:23,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:23,181 INFO L225 Difference]: With dead ends: 183 [2018-10-02 11:48:23,181 INFO L226 Difference]: Without dead ends: 109 [2018-10-02 11:48:23,182 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:23,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-02 11:48:23,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-10-02 11:48:23,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-02 11:48:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-10-02 11:48:23,229 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-10-02 11:48:23,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:23,229 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-10-02 11:48:23,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:23,233 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-10-02 11:48:23,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 11:48:23,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:23,235 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:23,235 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:23,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:23,237 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-10-02 11:48:23,237 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:23,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:23,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:23,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:23,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:23,406 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:23,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:23,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:23,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:23,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:23,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:23,408 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-10-02 11:48:23,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:23,505 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-10-02 11:48:23,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:23,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-02 11:48:23,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:23,508 INFO L225 Difference]: With dead ends: 321 [2018-10-02 11:48:23,508 INFO L226 Difference]: Without dead ends: 215 [2018-10-02 11:48:23,510 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:23,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-02 11:48:23,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-02 11:48:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-02 11:48:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-10-02 11:48:23,559 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-10-02 11:48:23,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:23,559 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-10-02 11:48:23,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-10-02 11:48:23,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 11:48:23,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:23,562 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:23,564 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:23,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:23,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-10-02 11:48:23,565 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:23,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:23,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:23,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:23,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:23,786 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:23,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:23,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:23,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:23,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:23,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:23,790 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-10-02 11:48:23,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:23,929 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-10-02 11:48:23,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:23,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-02 11:48:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:23,933 INFO L225 Difference]: With dead ends: 633 [2018-10-02 11:48:23,933 INFO L226 Difference]: Without dead ends: 423 [2018-10-02 11:48:23,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:23,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-02 11:48:24,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-10-02 11:48:24,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-02 11:48:24,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-10-02 11:48:24,016 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-10-02 11:48:24,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:24,017 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-10-02 11:48:24,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:24,017 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-10-02 11:48:24,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 11:48:24,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:24,021 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:24,022 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:24,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:24,022 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-10-02 11:48:24,025 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:24,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:24,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:24,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:24,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:24,179 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:24,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:24,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:24,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:24,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:24,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:24,181 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-10-02 11:48:24,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:24,380 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-10-02 11:48:24,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:24,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-02 11:48:24,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:24,386 INFO L225 Difference]: With dead ends: 1257 [2018-10-02 11:48:24,386 INFO L226 Difference]: Without dead ends: 839 [2018-10-02 11:48:24,388 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:24,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-10-02 11:48:24,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-10-02 11:48:24,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-10-02 11:48:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-10-02 11:48:24,520 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-10-02 11:48:24,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:24,521 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-10-02 11:48:24,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:24,521 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-10-02 11:48:24,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 11:48:24,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:24,528 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:24,528 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:24,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:24,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-10-02 11:48:24,530 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:24,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:24,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:24,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:24,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:24,692 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:24,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:24,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:24,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:24,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:24,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:24,694 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-10-02 11:48:25,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:25,016 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-10-02 11:48:25,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:25,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-02 11:48:25,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:25,026 INFO L225 Difference]: With dead ends: 2505 [2018-10-02 11:48:25,027 INFO L226 Difference]: Without dead ends: 1671 [2018-10-02 11:48:25,029 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,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-02 11:48:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-10-02 11:48:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-10-02 11:48:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-10-02 11:48:25,295 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-10-02 11:48:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:25,295 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-10-02 11:48:25,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:25,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-10-02 11:48:25,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 11:48:25,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:25,300 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:25,303 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:25,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:25,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-10-02 11:48:25,304 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:25,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:25,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:25,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:25,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:25,633 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:25,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:48:25,634 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:25,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:25,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:48:25,985 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:26,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:48:26,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-02 11:48:26,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:48:26,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:48:26,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:48:26,054 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-10-02 11:48:26,286 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-02 11:48:26,634 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-02 11:48:27,263 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-02 11:48:27,733 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-02 11:48:29,786 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-02 11:48:30,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:30,150 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-10-02 11:48:30,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 11:48:30,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-02 11:48:30,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:30,169 INFO L225 Difference]: With dead ends: 4801 [2018-10-02 11:48:30,169 INFO L226 Difference]: Without dead ends: 3135 [2018-10-02 11:48:30,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:48:30,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-10-02 11:48:30,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-10-02 11:48:30,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-10-02 11:48:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-10-02 11:48:30,548 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-10-02 11:48:30,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:30,549 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-10-02 11:48:30,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:48:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-10-02 11:48:30,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-02 11:48:30,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:30,554 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:30,554 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:30,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:30,555 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-10-02 11:48:30,555 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:30,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:30,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:30,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:30,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:30,725 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:30,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:30,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:30,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:30,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:30,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:30,727 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-10-02 11:48:31,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:31,256 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-10-02 11:48:31,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:31,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-02 11:48:31,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:31,267 INFO L225 Difference]: With dead ends: 4873 [2018-10-02 11:48:31,267 INFO L226 Difference]: Without dead ends: 2215 [2018-10-02 11:48:31,270 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:31,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-10-02 11:48:31,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-10-02 11:48:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-10-02 11:48:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-10-02 11:48:31,597 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-10-02 11:48:31,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:31,598 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-10-02 11:48:31,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:31,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-10-02 11:48:31,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-02 11:48:31,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:31,601 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:31,601 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:31,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:31,601 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-10-02 11:48:31,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:31,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:31,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:31,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:48:31,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:31,682 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:31,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:31,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:31,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:31,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:31,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:31,684 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-10-02 11:48:31,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:31,720 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-10-02 11:48:31,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:31,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-02 11:48:31,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:31,721 INFO L225 Difference]: With dead ends: 1799 [2018-10-02 11:48:31,721 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 11:48:31,723 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:31,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 11:48:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 11:48:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 11:48:31,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 11:48:31,724 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-10-02 11:48:31,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:31,725 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 11:48:31,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:31,725 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 11:48:31,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 11:48:31,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 11:48:31,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,851 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-10-02 11:48:31,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:31,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,084 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-02 11:48:32,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,673 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-02 11:48:32,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:32,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:48:33,968 WARN L178 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-02 11:48:34,533 WARN L178 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 11:48:34,739 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 11:48:34,957 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 11:48:35,398 WARN L178 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-02 11:48:35,522 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 11:48:35,878 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 11:48:36,043 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 11:48:36,216 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 11:48:36,391 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-02 11:48:36,508 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-10-02 11:48:36,656 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 11:48:36,658 INFO L421 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-10-02 11:48:36,659 INFO L421 ceAbstractionStarter]: At program point L539(lines 364 539) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-02 11:48:36,659 INFO L421 ceAbstractionStarter]: At program point L436(lines 436 446) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-02 11:48:36,659 INFO L421 ceAbstractionStarter]: At program point L416(lines 416 426) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-10-02 11:48:36,660 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-10-02 11:48:36,660 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-10-02 11:48:36,660 INFO L421 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-10-02 11:48:36,660 INFO L421 ceAbstractionStarter]: At program point L371(lines 371 383) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-02 11:48:36,660 INFO L421 ceAbstractionStarter]: At program point L491(lines 485 492) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-02 11:48:36,660 INFO L421 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-02 11:48:36,660 INFO L421 ceAbstractionStarter]: At program point L388(lines 382 389) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-02 11:48:36,661 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-10-02 11:48:36,661 INFO L421 ceAbstractionStarter]: At program point L471(lines 464 472) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-02 11:48:36,661 INFO L421 ceAbstractionStarter]: At program point L393(lines 393 403) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-02 11:48:36,661 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-10-02 11:48:36,662 INFO L421 ceAbstractionStarter]: At program point L451(lines 445 452) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-02 11:48:36,662 INFO L421 ceAbstractionStarter]: At program point L509(lines 509 516) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-10-02 11:48:36,662 INFO L421 ceAbstractionStarter]: At program point L476(lines 476 486) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-02 11:48:36,662 INFO L421 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-02 11:48:36,663 INFO L421 ceAbstractionStarter]: At program point L431(lines 425 432) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-02 11:48:36,663 INFO L421 ceAbstractionStarter]: At program point L456(lines 456 465) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-02 11:48:36,676 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,677 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,679 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,680 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,682 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,682 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,684 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,684 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,686 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,686 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,688 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,688 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,690 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,690 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,692 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,693 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,694 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,695 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,696 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,697 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,700 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,700 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,702 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,702 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,704 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,705 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,706 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,707 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,709 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,709 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,711 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,711 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,713 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,714 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,715 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,716 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,717 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,717 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,719 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,719 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,721 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:48:36 BoogieIcfgContainer [2018-10-02 11:48:36,721 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:48:36,722 INFO L168 Benchmark]: Toolchain (without parser) took 15962.62 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 171.4 MB). Free memory was 1.5 GB in the beginning and 956.3 MB in the end (delta: 507.7 MB). Peak memory consumption was 679.2 MB. Max. memory is 7.1 GB. [2018-10-02 11:48:36,724 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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:36,724 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.11 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:36,725 INFO L168 Benchmark]: Boogie Preprocessor took 37.66 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:36,725 INFO L168 Benchmark]: RCFGBuilder took 870.92 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-02 11:48:36,726 INFO L168 Benchmark]: TraceAbstraction took 15001.79 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 171.4 MB). Free memory was 1.4 GB in the beginning and 956.3 MB in the end (delta: 465.4 MB). Peak memory consumption was 636.9 MB. Max. memory is 7.1 GB. [2018-10-02 11:48:36,730 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.19 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 46.11 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 37.66 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 870.92 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15001.79 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 171.4 MB). Free memory was 1.4 GB in the beginning and 956.3 MB in the end (delta: 465.4 MB). Peak memory consumption was 636.9 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_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 541]: 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: 382]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 445]: Loop Invariant [2018-10-02 11:48:36,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,752 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,752 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant [2018-10-02 11:48:36,754 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,755 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,756 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,756 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 485]: Loop Invariant [2018-10-02 11:48:36,757 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,757 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,758 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,758 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 416]: Loop Invariant [2018-10-02 11:48:36,759 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,760 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,761 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,761 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 436]: Loop Invariant [2018-10-02 11:48:36,762 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,762 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,765 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,765 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 456]: Loop Invariant [2018-10-02 11:48:36,767 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,774 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,775 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,775 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 509]: Loop Invariant [2018-10-02 11:48:36,777 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,778 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,779 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,779 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 476]: Loop Invariant [2018-10-02 11:48:36,780 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,781 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,781 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,782 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 364]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 402]: Loop Invariant [2018-10-02 11:48:36,784 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,784 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,785 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,785 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 425]: Loop Invariant [2018-10-02 11:48:36,786 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,786 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,787 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 11:48:36,787 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 14.8s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 5.9s AutomataDifference, 0.0s DeadEndRemovalTime, 4.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.4s 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.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 396 ConstructedInterpolants, 12 QuantifiedInterpolants, 49682 SizeOfPredicates, 1 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 270/288 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.1.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-48-36-795.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-48-36-795.csv Received shutdown request...