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-b2fde6a [2018-09-28 10:09:00,641 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-28 10:09:00,643 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-28 10:09:00,659 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-28 10:09:00,660 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-28 10:09:00,660 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-28 10:09:00,662 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-28 10:09:00,664 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-28 10:09:00,666 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-28 10:09:00,668 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-28 10:09:00,669 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-28 10:09:00,669 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-28 10:09:00,671 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-28 10:09:00,672 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-28 10:09:00,678 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-28 10:09:00,679 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-28 10:09:00,680 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-28 10:09:00,682 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-28 10:09:00,684 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-28 10:09:00,685 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-28 10:09:00,686 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-28 10:09:00,687 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-28 10:09:00,689 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-28 10:09:00,689 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-28 10:09:00,690 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-28 10:09:00,690 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-28 10:09:00,691 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-28 10:09:00,692 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-28 10:09:00,693 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-28 10:09:00,694 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-28 10:09:00,694 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-28 10:09:00,695 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-28 10:09:00,695 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-28 10:09:00,695 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-28 10:09:00,696 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-28 10:09:00,697 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-28 10:09:00,697 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-28 10:09:00,711 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-28 10:09:00,712 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-28 10:09:00,712 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-28 10:09:00,713 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-28 10:09:00,713 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-28 10:09:00,713 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-28 10:09:00,714 INFO L133 SettingsManager]: * Use SBE=true [2018-09-28 10:09:00,714 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-28 10:09:00,714 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-28 10:09:00,714 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-28 10:09:00,714 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-28 10:09:00,714 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-28 10:09:00,715 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-28 10:09:00,715 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-28 10:09:00,715 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-28 10:09:00,715 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-28 10:09:00,717 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-28 10:09:00,718 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-28 10:09:00,718 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-28 10:09:00,718 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-28 10:09:00,718 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-28 10:09:00,718 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-28 10:09:00,719 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-28 10:09:00,719 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-28 10:09:00,719 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-28 10:09:00,719 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-28 10:09:00,719 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-28 10:09:00,719 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-28 10:09:00,720 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-28 10:09:00,720 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-28 10:09:00,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-28 10:09:00,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-28 10:09:00,808 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-28 10:09:00,810 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-28 10:09:00,810 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-28 10:09:00,812 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-28 10:09:00,812 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-28 10:09:00,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-28 10:09:00,919 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-28 10:09:00,920 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-28 10:09:00,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-28 10:09:00,920 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-28 10:09:00,938 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 28.09 10:09:00" (1/1) ... [2018-09-28 10:09:00,957 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 28.09 10:09:00" (1/1) ... [2018-09-28 10:09:00,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-28 10:09:00,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-28 10:09:00,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-28 10:09:00,969 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-28 10:09:00,980 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 28.09 10:09:00" (1/1) ... [2018-09-28 10:09:00,980 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 28.09 10:09:00" (1/1) ... [2018-09-28 10:09:00,991 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 28.09 10:09:00" (1/1) ... [2018-09-28 10:09:00,992 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 28.09 10:09:00" (1/1) ... [2018-09-28 10:09:01,010 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 28.09 10:09:00" (1/1) ... [2018-09-28 10:09:01,018 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 28.09 10:09:00" (1/1) ... [2018-09-28 10:09:01,023 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 28.09 10:09:00" (1/1) ... [2018-09-28 10:09:01,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-28 10:09:01,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-28 10:09:01,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-28 10:09:01,028 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-28 10:09:01,029 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 28.09 10:09:00" (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-28 10:09:01,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-28 10:09:01,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-28 10:09:01,869 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-28 10:09:01,870 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 28.09 10:09:01 BoogieIcfgContainer [2018-09-28 10:09:01,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-28 10:09:01,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-28 10:09:01,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-28 10:09:01,875 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-28 10:09:01,875 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 28.09 10:09:00" (1/2) ... [2018-09-28 10:09:01,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e4a3ef 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 28.09 10:09:01, skipping insertion in model container [2018-09-28 10:09:01,876 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 28.09 10:09:01" (2/2) ... [2018-09-28 10:09:01,878 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-28 10:09:01,888 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-28 10:09:01,896 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-28 10:09:01,945 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-28 10:09:01,946 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-28 10:09:01,946 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-28 10:09:01,946 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-28 10:09:01,946 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-28 10:09:01,946 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-28 10:09:01,946 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-28 10:09:01,947 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-28 10:09:01,947 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-28 10:09:01,962 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-28 10:09:01,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-28 10:09:01,970 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:01,971 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-28 10:09:01,972 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:01,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:01,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-09-28 10:09:01,980 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:01,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:02,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:02,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:02,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:02,267 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-28 10:09:02,269 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:02,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:09:02,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:02,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:02,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:02,291 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-09-28 10:09:02,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:02,360 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-09-28 10:09:02,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:02,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-28 10:09:02,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:02,374 INFO L225 Difference]: With dead ends: 57 [2018-09-28 10:09:02,374 INFO L226 Difference]: Without dead ends: 37 [2018-09-28 10:09:02,378 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-28 10:09:02,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-28 10:09:02,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-09-28 10:09:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-28 10:09:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-09-28 10:09:02,426 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-09-28 10:09:02,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:02,426 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-09-28 10:09:02,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:02,427 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-09-28 10:09:02,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-28 10:09:02,427 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:02,428 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-28 10:09:02,428 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:02,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:02,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-09-28 10:09:02,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:02,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:02,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:02,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:02,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:02,616 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-28 10:09:02,616 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:02,616 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:09:02,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:02,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:02,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:02,619 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-09-28 10:09:02,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:02,671 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-09-28 10:09:02,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:02,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-28 10:09:02,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:02,674 INFO L225 Difference]: With dead ends: 103 [2018-09-28 10:09:02,675 INFO L226 Difference]: Without dead ends: 69 [2018-09-28 10:09:02,677 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-28 10:09:02,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-28 10:09:02,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-28 10:09:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-28 10:09:02,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-09-28 10:09:02,721 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-09-28 10:09:02,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:02,721 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-09-28 10:09:02,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:02,722 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-09-28 10:09:02,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-28 10:09:02,722 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:02,723 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-28 10:09:02,723 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:02,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:02,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-09-28 10:09:02,725 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:02,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:02,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:02,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:02,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:02,928 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-28 10:09:02,929 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:02,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-28 10:09:02,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-28 10:09:02,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-28 10:09:02,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-28 10:09:02,930 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-09-28 10:09:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:03,107 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-09-28 10:09:03,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-28 10:09:03,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-09-28 10:09:03,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:03,111 INFO L225 Difference]: With dead ends: 141 [2018-09-28 10:09:03,112 INFO L226 Difference]: Without dead ends: 139 [2018-09-28 10:09:03,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-28 10:09:03,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-28 10:09:03,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-09-28 10:09:03,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-28 10:09:03,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-09-28 10:09:03,137 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-09-28 10:09:03,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:03,137 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-09-28 10:09:03,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-28 10:09:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-09-28 10:09:03,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-28 10:09:03,139 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:03,139 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-28 10:09:03,139 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:03,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:03,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-09-28 10:09:03,140 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:03,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:03,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:03,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:03,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:03,243 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-28 10:09:03,243 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:03,244 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:09:03,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:03,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:03,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:03,245 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-09-28 10:09:03,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:03,337 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-09-28 10:09:03,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:03,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-28 10:09:03,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:03,340 INFO L225 Difference]: With dead ends: 183 [2018-09-28 10:09:03,340 INFO L226 Difference]: Without dead ends: 109 [2018-09-28 10:09:03,341 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-28 10:09:03,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-28 10:09:03,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-28 10:09:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-28 10:09:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-09-28 10:09:03,379 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-09-28 10:09:03,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:03,379 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-09-28 10:09:03,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:03,381 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-09-28 10:09:03,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-28 10:09:03,382 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:03,383 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-28 10:09:03,383 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:03,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:03,384 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-09-28 10:09:03,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:03,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:03,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:03,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:03,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:09:03,592 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:03,592 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:09:03,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:03,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:03,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:03,594 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-09-28 10:09:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:03,682 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-09-28 10:09:03,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:03,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-28 10:09:03,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:03,686 INFO L225 Difference]: With dead ends: 321 [2018-09-28 10:09:03,686 INFO L226 Difference]: Without dead ends: 215 [2018-09-28 10:09:03,689 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-28 10:09:03,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-28 10:09:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-09-28 10:09:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-28 10:09:03,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-09-28 10:09:03,747 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-09-28 10:09:03,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:03,747 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-09-28 10:09:03,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:03,747 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-09-28 10:09:03,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-28 10:09:03,749 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:03,749 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-28 10:09:03,750 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:03,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:03,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-09-28 10:09:03,751 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:03,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:03,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:03,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:03,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:03,830 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-28 10:09:03,830 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:03,830 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:09:03,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:03,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:03,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:03,832 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-09-28 10:09:03,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:03,958 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-09-28 10:09:03,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:03,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-28 10:09:03,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:03,962 INFO L225 Difference]: With dead ends: 633 [2018-09-28 10:09:03,962 INFO L226 Difference]: Without dead ends: 423 [2018-09-28 10:09:03,964 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-28 10:09:03,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-28 10:09:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-09-28 10:09:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-28 10:09:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-09-28 10:09:04,030 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-09-28 10:09:04,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:04,030 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-09-28 10:09:04,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-09-28 10:09:04,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-28 10:09:04,033 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:04,034 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-28 10:09:04,034 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:04,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:04,034 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-09-28 10:09:04,035 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:04,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:04,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:04,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:04,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:04,182 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-28 10:09:04,182 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:04,183 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:09:04,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:04,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:04,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:04,184 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-09-28 10:09:04,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:04,373 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-09-28 10:09:04,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:04,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-28 10:09:04,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:04,380 INFO L225 Difference]: With dead ends: 1257 [2018-09-28 10:09:04,380 INFO L226 Difference]: Without dead ends: 839 [2018-09-28 10:09:04,382 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-28 10:09:04,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-09-28 10:09:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-09-28 10:09:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-09-28 10:09:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-09-28 10:09:04,503 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-09-28 10:09:04,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:04,504 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-09-28 10:09:04,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:04,504 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-09-28 10:09:04,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-28 10:09:04,515 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:04,515 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-28 10:09:04,516 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:04,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:04,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-09-28 10:09:04,517 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:04,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:04,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:04,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:04,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:04,636 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-28 10:09:04,638 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:04,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:09:04,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:04,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:04,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:04,640 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-09-28 10:09:04,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:04,934 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-09-28 10:09:04,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:04,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-28 10:09:04,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:04,943 INFO L225 Difference]: With dead ends: 2505 [2018-09-28 10:09:04,943 INFO L226 Difference]: Without dead ends: 1671 [2018-09-28 10:09:04,945 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-28 10:09:04,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-28 10:09:05,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-09-28 10:09:05,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-09-28 10:09:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-09-28 10:09:05,191 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-09-28 10:09:05,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:05,192 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-09-28 10:09:05,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:05,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-09-28 10:09:05,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-28 10:09:05,195 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:05,196 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-28 10:09:05,196 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:05,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:05,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-09-28 10:09:05,197 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:05,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:05,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:05,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:05,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:05,455 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-28 10:09:05,455 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:09:05,456 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-28 10:09:05,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:05,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:09:05,927 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-28 10:09:05,985 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:09:05,985 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-28 10:09:05,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-28 10:09:05,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-28 10:09:05,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-28 10:09:05,987 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-09-28 10:09:06,224 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-28 10:09:06,784 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 10:09:07,228 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-28 10:09:07,659 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-28 10:09:09,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:09,610 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-09-28 10:09:09,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-28 10:09:09,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-09-28 10:09:09,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:09,624 INFO L225 Difference]: With dead ends: 4801 [2018-09-28 10:09:09,624 INFO L226 Difference]: Without dead ends: 3135 [2018-09-28 10:09:09,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-28 10:09:09,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-09-28 10:09:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-09-28 10:09:09,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-09-28 10:09:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-09-28 10:09:09,984 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-09-28 10:09:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:09,985 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-09-28 10:09:09,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-28 10:09:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-09-28 10:09:09,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-28 10:09:09,989 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:09,989 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-28 10:09:09,989 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:09,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:09,990 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-09-28 10:09:09,990 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:09,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:09,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:09,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:09,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:10,129 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-28 10:09:10,129 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:10,129 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:09:10,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:10,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:10,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:10,130 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-09-28 10:09:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:10,648 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-09-28 10:09:10,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:10,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-28 10:09:10,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:10,657 INFO L225 Difference]: With dead ends: 4873 [2018-09-28 10:09:10,658 INFO L226 Difference]: Without dead ends: 2215 [2018-09-28 10:09:10,661 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-28 10:09:10,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-09-28 10:09:10,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-09-28 10:09:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-09-28 10:09:10,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-09-28 10:09:10,962 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-09-28 10:09:10,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:10,962 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-09-28 10:09:10,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:10,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-09-28 10:09:10,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-28 10:09:10,965 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:10,965 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-28 10:09:10,965 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:10,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:10,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-09-28 10:09:10,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:10,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:10,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:10,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:09:10,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:11,031 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-28 10:09:11,031 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:11,031 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:09:11,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:11,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:11,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:11,032 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-09-28 10:09:11,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:11,071 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-09-28 10:09:11,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:11,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-28 10:09:11,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:11,072 INFO L225 Difference]: With dead ends: 1799 [2018-09-28 10:09:11,072 INFO L226 Difference]: Without dead ends: 0 [2018-09-28 10:09:11,074 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-28 10:09:11,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-28 10:09:11,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-28 10:09:11,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-28 10:09:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-28 10:09:11,075 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-09-28 10:09:11,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:11,076 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-28 10:09:11,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:11,076 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-28 10:09:11,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-28 10:09:11,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-28 10:09:11,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,232 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-09-28 10:09:11,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,509 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-28 10:09:11,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:11,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:12,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:13,120 WARN L178 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-28 10:09:13,452 WARN L178 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:09:14,206 WARN L178 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:09:14,418 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:09:14,752 WARN L178 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-28 10:09:14,959 WARN L178 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:09:15,076 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-28 10:09:15,185 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-09-28 10:09:15,314 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:09:15,439 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:09:15,578 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:09:15,734 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-28 10:09:16,030 WARN L178 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:09:16,034 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-28 10:09:16,035 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-28 10:09:16,035 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-28 10:09:16,035 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-28 10:09:16,035 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-09-28 10:09:16,035 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-09-28 10:09:16,036 INFO L422 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-09-28 10:09:16,036 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-28 10:09:16,036 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-28 10:09:16,036 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-28 10:09:16,036 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-28 10:09:16,037 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-09-28 10:09:16,037 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-28 10:09:16,037 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-28 10:09:16,037 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-28 10:09:16,038 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-09-28 10:09:16,038 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-28 10:09:16,038 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-28 10:09:16,038 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-28 10:09:16,039 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-28 10:09:16,039 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-28 10:09:16,056 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,057 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,061 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,062 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,065 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,066 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,069 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,073 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,073 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,075 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,075 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,082 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,097 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,097 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,099 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,101 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,101 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,103 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,103 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,104 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,104 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,106 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,109 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 28.09 10:09:16 BoogieIcfgContainer [2018-09-28 10:09:16,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-28 10:09:16,110 INFO L168 Benchmark]: Toolchain (without parser) took 15193.01 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 183.0 MB). Free memory was 1.5 GB in the beginning and 962.4 MB in the end (delta: 491.7 MB). Peak memory consumption was 674.7 MB. Max. memory is 7.1 GB. [2018-09-28 10:09:16,111 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 10:09:16,112 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.52 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-28 10:09:16,112 INFO L168 Benchmark]: Boogie Preprocessor took 58.81 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-28 10:09:16,113 INFO L168 Benchmark]: RCFGBuilder took 841.68 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-28 10:09:16,114 INFO L168 Benchmark]: TraceAbstraction took 14238.17 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 183.0 MB). Free memory was 1.4 GB in the beginning and 962.4 MB in the end (delta: 449.4 MB). Peak memory consumption was 632.4 MB. Max. memory is 7.1 GB. [2018-09-28 10:09:16,118 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.52 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 58.81 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 841.68 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 14238.17 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 183.0 MB). Free memory was 1.4 GB in the beginning and 962.4 MB in the end (delta: 449.4 MB). Peak memory consumption was 632.4 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-28 10:09:16,129 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,130 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,130 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,130 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-28 10:09:16,132 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,132 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,133 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,133 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-28 10:09:16,134 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,134 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,134 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,135 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-28 10:09:16,136 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,136 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,137 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,137 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-28 10:09:16,138 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,138 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,139 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,139 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-28 10:09:16,144 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,144 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,144 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,145 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-28 10:09:16,146 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,146 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,150 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,150 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-28 10:09:16,151 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,152 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,152 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,156 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-28 10:09:16,157 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,157 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,158 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,158 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-28 10:09:16,159 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,159 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,160 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:16,160 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.1s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 4.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.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-28_10-09-16-166.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-28_10-09-16-166.csv Received shutdown request...