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-d19836b [2018-09-26 21:25:30,595 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:25:30,597 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:25:30,609 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:25:30,609 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:25:30,610 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:25:30,611 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:25:30,613 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:25:30,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:25:30,616 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:25:30,617 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:25:30,617 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:25:30,618 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:25:30,619 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:25:30,620 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:25:30,621 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:25:30,622 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:25:30,624 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:25:30,629 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:25:30,633 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:25:30,634 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:25:30,637 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:25:30,639 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:25:30,640 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:25:30,640 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:25:30,642 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:25:30,643 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:25:30,646 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:25:30,647 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:25:30,652 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:25:30,652 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:25:30,653 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:25:30,653 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:25:30,653 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:25:30,654 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:25:30,657 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:25:30,657 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-09-26 21:25:30,682 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:25:30,682 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:25:30,684 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:25:30,684 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:25:30,685 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:25:30,685 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:25:30,685 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:25:30,688 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:25:30,689 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:25:30,689 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:25:30,689 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:25:30,689 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:25:30,689 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:25:30,689 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:25:30,690 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:25:30,690 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:25:30,690 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:25:30,690 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:25:30,692 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:25:30,692 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:25:30,692 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:25:30,692 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:25:30,692 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:25:30,693 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:25:30,693 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:25:30,693 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:25:30,693 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:25:30,693 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:25:30,694 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:25:30,694 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:25:30,750 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:25:30,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:25:30,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:25:30,774 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:25:30,775 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:25:30,776 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-09-26 21:25:30,776 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-09-26 21:25:30,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:25:30,881 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:25:30,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:25:30,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:25:30,882 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:25:30,902 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 26.09 09:25:30" (1/1) ... [2018-09-26 21:25:30,922 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 26.09 09:25:30" (1/1) ... [2018-09-26 21:25:30,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:25:30,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:25:30,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:25:30,938 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:25:30,949 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 26.09 09:25:30" (1/1) ... [2018-09-26 21:25:30,950 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 26.09 09:25:30" (1/1) ... [2018-09-26 21:25:30,960 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 26.09 09:25:30" (1/1) ... [2018-09-26 21:25:30,961 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 26.09 09:25:30" (1/1) ... [2018-09-26 21:25:30,982 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 26.09 09:25:30" (1/1) ... [2018-09-26 21:25:30,988 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 26.09 09:25:30" (1/1) ... [2018-09-26 21:25:30,990 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 26.09 09:25:30" (1/1) ... [2018-09-26 21:25:30,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:25:31,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:25:31,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:25:31,001 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:25:31,002 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 26.09 09:25:30" (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-09-26 21:25:31,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:25:31,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:25:31,775 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:25:31,776 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 26.09 09:25:31 BoogieIcfgContainer [2018-09-26 21:25:31,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:25:31,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:25:31,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:25:31,780 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:25:31,781 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 26.09 09:25:30" (1/2) ... [2018-09-26 21:25:31,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa56eee 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 26.09 09:25:31, skipping insertion in model container [2018-09-26 21:25:31,782 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 26.09 09:25:31" (2/2) ... [2018-09-26 21:25:31,784 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-26 21:25:31,793 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:25:31,801 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:25:31,849 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:25:31,850 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:25:31,850 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:25:31,850 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:25:31,851 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:25:31,851 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:25:31,851 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:25:31,851 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:25:31,851 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:25:31,867 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-26 21:25:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:25:31,873 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:31,874 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:31,875 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:31,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:31,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-09-26 21:25:31,883 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:31,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:31,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:31,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:31,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:32,138 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:32,138 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:32,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:32,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:32,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:32,159 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-09-26 21:25:32,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:32,227 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-09-26 21:25:32,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:32,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-26 21:25:32,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:32,243 INFO L225 Difference]: With dead ends: 57 [2018-09-26 21:25:32,243 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 21:25:32,247 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-09-26 21:25:32,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 21:25:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-09-26 21:25:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 21:25:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-09-26 21:25:32,314 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-09-26 21:25:32,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:32,314 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-09-26 21:25:32,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-09-26 21:25:32,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:25:32,316 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:32,316 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:32,316 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:32,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:32,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-09-26 21:25:32,317 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:32,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:32,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:32,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:32,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:32,460 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:32,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:32,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:32,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:32,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:32,463 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-09-26 21:25:32,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:32,507 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-09-26 21:25:32,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:32,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-26 21:25:32,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:32,510 INFO L225 Difference]: With dead ends: 103 [2018-09-26 21:25:32,510 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 21:25:32,511 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-09-26 21:25:32,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 21:25:32,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-26 21:25:32,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 21:25:32,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-09-26 21:25:32,531 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-09-26 21:25:32,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:32,531 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-09-26 21:25:32,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:32,531 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-09-26 21:25:32,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:25:32,532 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:32,532 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:32,533 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:32,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:32,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-09-26 21:25:32,533 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:32,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:32,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:32,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:32,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:32,705 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:32,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:25:32,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:25:32,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:25:32,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 21:25:32,707 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-09-26 21:25:32,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:32,858 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-09-26 21:25:32,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:25:32,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-09-26 21:25:32,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:32,863 INFO L225 Difference]: With dead ends: 141 [2018-09-26 21:25:32,863 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 21:25:32,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:25:32,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 21:25:32,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-09-26 21:25:32,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 21:25:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-09-26 21:25:32,892 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-09-26 21:25:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:32,893 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-09-26 21:25:32,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:25:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-09-26 21:25:32,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:25:32,894 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:32,898 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:32,898 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:32,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:32,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-09-26 21:25:32,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:32,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:32,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:32,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:32,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:33,038 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:33,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:33,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:33,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:33,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:33,041 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-09-26 21:25:33,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:33,130 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-09-26 21:25:33,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:33,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-26 21:25:33,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:33,132 INFO L225 Difference]: With dead ends: 183 [2018-09-26 21:25:33,132 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 21:25:33,133 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-09-26 21:25:33,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 21:25:33,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 21:25:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 21:25:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-09-26 21:25:33,165 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-09-26 21:25:33,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:33,166 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-09-26 21:25:33,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:33,166 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-09-26 21:25:33,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:25:33,169 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:33,169 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-09-26 21:25:33,169 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:33,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:33,170 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-09-26 21:25:33,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:33,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:33,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:33,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:33,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:33,367 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:33,367 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:33,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:33,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:33,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:33,369 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-09-26 21:25:33,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:33,459 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-09-26 21:25:33,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:33,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 21:25:33,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:33,463 INFO L225 Difference]: With dead ends: 321 [2018-09-26 21:25:33,463 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 21:25:33,464 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-09-26 21:25:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 21:25:33,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-09-26 21:25:33,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-26 21:25:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-09-26 21:25:33,523 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-09-26 21:25:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:33,524 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-09-26 21:25:33,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-09-26 21:25:33,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:25:33,526 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:33,528 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-09-26 21:25:33,528 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:33,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:33,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-09-26 21:25:33,529 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:33,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:33,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:33,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:33,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:33,715 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:33,715 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:33,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:33,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:33,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:33,717 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-09-26 21:25:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:33,840 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-09-26 21:25:33,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:33,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 21:25:33,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:33,844 INFO L225 Difference]: With dead ends: 633 [2018-09-26 21:25:33,844 INFO L226 Difference]: Without dead ends: 423 [2018-09-26 21:25:33,845 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-09-26 21:25:33,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-26 21:25:33,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-09-26 21:25:33,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-26 21:25:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-09-26 21:25:33,919 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-09-26 21:25:33,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:33,920 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-09-26 21:25:33,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:33,920 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-09-26 21:25:33,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:25:33,923 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:33,923 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-09-26 21:25:33,923 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:33,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:33,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-09-26 21:25:33,924 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:33,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:33,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:33,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:33,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:34,050 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:34,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:34,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:34,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:34,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:34,051 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-09-26 21:25:34,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:34,248 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-09-26 21:25:34,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:34,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 21:25:34,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:34,256 INFO L225 Difference]: With dead ends: 1257 [2018-09-26 21:25:34,256 INFO L226 Difference]: Without dead ends: 839 [2018-09-26 21:25:34,258 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-09-26 21:25:34,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-09-26 21:25:34,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-09-26 21:25:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-09-26 21:25:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-09-26 21:25:34,386 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-09-26 21:25:34,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:34,387 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-09-26 21:25:34,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-09-26 21:25:34,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:25:34,394 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:34,395 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-09-26 21:25:34,395 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:34,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:34,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-09-26 21:25:34,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:34,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:34,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:34,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:34,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:34,481 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:34,481 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:34,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:34,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:34,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:34,483 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-09-26 21:25:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:34,786 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-09-26 21:25:34,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:34,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 21:25:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:34,796 INFO L225 Difference]: With dead ends: 2505 [2018-09-26 21:25:34,796 INFO L226 Difference]: Without dead ends: 1671 [2018-09-26 21:25:34,798 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-09-26 21:25:34,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-26 21:25:35,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-09-26 21:25:35,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-09-26 21:25:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-09-26 21:25:35,032 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-09-26 21:25:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:35,032 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-09-26 21:25:35,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-09-26 21:25:35,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:25:35,036 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:35,036 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-09-26 21:25:35,036 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:35,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:35,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-09-26 21:25:35,040 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:35,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:35,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:35,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:35,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:35,243 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:35,244 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:25:35,244 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-09-26 21:25:35,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:35,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:25:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:25:35,809 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:25:35,810 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-26 21:25:35,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:25:35,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:25:35,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:25:35,811 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-09-26 21:25:36,048 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-26 21:25:36,375 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-26 21:25:37,256 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-26 21:25:39,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:39,551 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-09-26 21:25:39,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:25:39,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-09-26 21:25:39,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:39,566 INFO L225 Difference]: With dead ends: 4801 [2018-09-26 21:25:39,566 INFO L226 Difference]: Without dead ends: 3135 [2018-09-26 21:25:39,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-26 21:25:39,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-09-26 21:25:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-09-26 21:25:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-09-26 21:25:39,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-09-26 21:25:39,955 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-09-26 21:25:39,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:39,955 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-09-26 21:25:39,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:25:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-09-26 21:25:39,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 21:25:39,959 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:39,959 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-09-26 21:25:39,960 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:39,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:39,960 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-09-26 21:25:39,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:39,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:39,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:39,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:39,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-26 21:25:40,137 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:40,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:40,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:40,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:40,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:40,138 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-09-26 21:25:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:40,674 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-09-26 21:25:40,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:40,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-26 21:25:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:40,684 INFO L225 Difference]: With dead ends: 4873 [2018-09-26 21:25:40,684 INFO L226 Difference]: Without dead ends: 2215 [2018-09-26 21:25:40,688 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-09-26 21:25:40,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-09-26 21:25:41,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-09-26 21:25:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-09-26 21:25:41,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-09-26 21:25:41,051 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-09-26 21:25:41,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:41,051 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-09-26 21:25:41,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:41,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-09-26 21:25:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 21:25:41,056 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:41,057 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-09-26 21:25:41,057 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:41,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:41,058 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-09-26 21:25:41,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:41,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:41,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:41,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:25:41,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:41,140 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-26 21:25:41,140 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:41,140 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:41,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:41,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:41,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:41,141 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-09-26 21:25:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:41,169 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-09-26 21:25:41,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:41,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-26 21:25:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:41,170 INFO L225 Difference]: With dead ends: 1799 [2018-09-26 21:25:41,170 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:25:41,172 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-09-26 21:25:41,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:25:41,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:25:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:25:41,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:25:41,173 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-09-26 21:25:41,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:41,173 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:25:41,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:41,174 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:25:41,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:25:41,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:25:41,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,320 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-09-26 21:25:41,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,578 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-26 21:25:41,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:41,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,198 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-26 21:25:42,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,541 WARN L178 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-26 21:25:44,457 WARN L178 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:44,634 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:44,922 WARN L178 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:45,278 WARN L178 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-26 21:25:45,383 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:45,498 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-26 21:25:45,707 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:45,849 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:45,988 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:46,142 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-26 21:25:46,405 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:46,409 INFO L422 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-09-26 21:25:46,409 INFO L422 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-09-26 21:25:46,409 INFO L422 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-09-26 21:25:46,409 INFO L422 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-09-26 21:25:46,410 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-09-26 21:25:46,410 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-09-26 21:25:46,410 INFO L422 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-09-26 21:25:46,410 INFO L422 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-09-26 21:25:46,410 INFO L422 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-09-26 21:25:46,411 INFO L422 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-09-26 21:25:46,411 INFO L422 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-09-26 21:25:46,411 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-09-26 21:25:46,411 INFO L422 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-09-26 21:25:46,412 INFO L422 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-09-26 21:25:46,412 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-09-26 21:25:46,412 INFO L422 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-09-26 21:25:46,412 INFO L422 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-09-26 21:25:46,413 INFO L422 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-09-26 21:25:46,413 INFO L422 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-09-26 21:25:46,413 INFO L422 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-09-26 21:25:46,413 INFO L422 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-09-26 21:25:46,426 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,427 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,430 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,430 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,432 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,432 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,434 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,434 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,436 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,436 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,438 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,438 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,439 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,440 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,441 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,442 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,443 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,444 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,445 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,445 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,448 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,448 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,449 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,450 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,451 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,451 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,453 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,453 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,455 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,455 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,457 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,457 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,459 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,459 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,460 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,461 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,462 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,462 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,463 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,463 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,466 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 26.09 09:25:46 BoogieIcfgContainer [2018-09-26 21:25:46,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:25:46,467 INFO L168 Benchmark]: Toolchain (without parser) took 15588.16 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 197.7 MB). Free memory was 1.5 GB in the beginning and 982.1 MB in the end (delta: 490.9 MB). Peak memory consumption was 688.6 MB. Max. memory is 7.1 GB. [2018-09-26 21:25:46,468 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:25:46,469 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.47 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-09-26 21:25:46,469 INFO L168 Benchmark]: Boogie Preprocessor took 62.78 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-09-26 21:25:46,470 INFO L168 Benchmark]: RCFGBuilder took 775.37 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-09-26 21:25:46,471 INFO L168 Benchmark]: TraceAbstraction took 14688.73 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 197.7 MB). Free memory was 1.4 GB in the beginning and 982.1 MB in the end (delta: 448.7 MB). Peak memory consumption was 646.3 MB. Max. memory is 7.1 GB. [2018-09-26 21:25:46,475 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.47 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 62.78 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 775.37 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 14688.73 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 197.7 MB). Free memory was 1.4 GB in the beginning and 982.1 MB in the end (delta: 448.7 MB). Peak memory consumption was 646.3 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-09-26 21:25:46,486 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,487 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,487 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,488 WARN L389 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-09-26 21:25:46,489 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,489 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,490 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,490 WARN L389 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-09-26 21:25:46,491 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,491 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,492 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,492 WARN L389 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-09-26 21:25:46,493 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,493 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,494 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,494 WARN L389 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-09-26 21:25:46,495 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,495 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,496 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,496 WARN L389 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-09-26 21:25:46,498 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,498 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,499 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,499 WARN L389 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-09-26 21:25:46,500 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,500 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,501 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,501 WARN L389 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-09-26 21:25:46,502 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,502 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,503 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,503 WARN L389 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-09-26 21:25:46,505 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,505 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,506 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,506 WARN L389 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-09-26 21:25:46,507 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,507 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,507 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:46,508 WARN L389 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.5s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 5.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.0s 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.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 4.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s 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-09-26_21-25-46-514.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-09-26_21-25-46-514.csv Received shutdown request...