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-00a8621 [2018-09-30 10:27:55,652 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:27:55,654 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:27:55,669 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:27:55,669 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:27:55,670 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:27:55,672 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:27:55,673 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:27:55,675 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:27:55,676 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:27:55,677 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:27:55,677 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:27:55,678 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:27:55,679 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:27:55,680 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:27:55,681 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:27:55,682 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:27:55,683 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:27:55,685 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:27:55,689 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:27:55,690 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:27:55,691 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:27:55,697 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:27:55,698 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:27:55,698 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:27:55,699 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:27:55,700 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:27:55,700 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:27:55,701 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:27:55,702 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:27:55,702 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:27:55,703 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:27:55,703 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:27:55,703 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:27:55,704 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:27:55,705 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:27:55,705 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-30 10:27:55,720 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:27:55,720 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:27:55,721 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:27:55,721 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:27:55,722 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:27:55,722 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:27:55,722 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:27:55,722 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:27:55,722 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:27:55,723 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:27:55,723 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:27:55,723 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:27:55,723 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:27:55,723 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:27:55,723 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:27:55,724 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:27:55,724 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:27:55,724 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:27:55,724 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:27:55,724 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:27:55,725 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:27:55,725 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:27:55,725 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:27:55,725 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:27:55,725 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:27:55,726 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:27:55,726 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:27:55,726 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:27:55,726 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:27:55,726 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:27:55,774 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:27:55,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:27:55,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:27:55,792 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:27:55,793 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:27:55,794 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-30 10:27:55,794 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-30 10:27:55,895 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:27:55,899 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:27:55,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:27:55,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:27:55,900 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:27:55,922 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 30.09 10:27:55" (1/1) ... [2018-09-30 10:27:55,943 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 30.09 10:27:55" (1/1) ... [2018-09-30 10:27:55,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:27:55,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:27:55,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:27:55,963 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:27:55,975 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 30.09 10:27:55" (1/1) ... [2018-09-30 10:27:55,975 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 30.09 10:27:55" (1/1) ... [2018-09-30 10:27:55,987 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 30.09 10:27:55" (1/1) ... [2018-09-30 10:27:55,987 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 30.09 10:27:55" (1/1) ... [2018-09-30 10:27:56,008 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 30.09 10:27:55" (1/1) ... [2018-09-30 10:27:56,016 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 30.09 10:27:55" (1/1) ... [2018-09-30 10:27:56,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 30.09 10:27:55" (1/1) ... [2018-09-30 10:27:56,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:27:56,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:27:56,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:27:56,035 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:27:56,036 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 30.09 10:27:55" (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-30 10:27:56,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:27:56,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:27:56,869 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:27:56,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 30.09 10:27:56 BoogieIcfgContainer [2018-09-30 10:27:56,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:27:56,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:27:56,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:27:56,874 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:27:56,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 30.09 10:27:55" (1/2) ... [2018-09-30 10:27:56,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e8925f 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 30.09 10:27:56, skipping insertion in model container [2018-09-30 10:27:56,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 30.09 10:27:56" (2/2) ... [2018-09-30 10:27:56,878 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-30 10:27:56,887 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:27:56,896 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:27:56,945 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:27:56,945 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:27:56,946 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:27:56,946 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:27:56,946 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:27:56,946 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:27:56,946 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:27:56,946 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:27:56,947 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:27:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-30 10:27:56,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:27:56,969 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:56,970 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-30 10:27:56,971 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:56,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:56,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-09-30 10:27:56,979 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:56,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:57,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:57,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:57,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:57,293 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-30 10:27:57,296 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:57,297 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:57,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:57,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:57,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:57,315 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-09-30 10:27:57,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:57,386 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-09-30 10:27:57,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:57,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 10:27:57,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:57,399 INFO L225 Difference]: With dead ends: 57 [2018-09-30 10:27:57,400 INFO L226 Difference]: Without dead ends: 37 [2018-09-30 10:27:57,404 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-30 10:27:57,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-30 10:27:57,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-09-30 10:27:57,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-30 10:27:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-09-30 10:27:57,450 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-09-30 10:27:57,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:57,450 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-09-30 10:27:57,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:57,451 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-09-30 10:27:57,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:27:57,451 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:57,452 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-30 10:27:57,452 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:57,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:57,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-09-30 10:27:57,453 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:57,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:57,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:57,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:57,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:57,594 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-30 10:27:57,595 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:57,595 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:57,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:57,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:57,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:57,598 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-09-30 10:27:57,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:57,648 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-09-30 10:27:57,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:57,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 10:27:57,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:57,650 INFO L225 Difference]: With dead ends: 103 [2018-09-30 10:27:57,651 INFO L226 Difference]: Without dead ends: 69 [2018-09-30 10:27:57,652 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-30 10:27:57,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-30 10:27:57,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-30 10:27:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-30 10:27:57,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-09-30 10:27:57,681 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-09-30 10:27:57,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:57,682 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-09-30 10:27:57,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-09-30 10:27:57,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:27:57,683 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:57,683 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-30 10:27:57,684 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:57,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:57,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-09-30 10:27:57,684 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:57,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:57,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:57,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:57,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:57,863 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-30 10:27:57,863 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:57,863 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:27:57,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:27:57,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:27:57,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:27:57,865 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-09-30 10:27:58,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:58,023 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-09-30 10:27:58,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:27:58,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-09-30 10:27:58,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:58,028 INFO L225 Difference]: With dead ends: 141 [2018-09-30 10:27:58,029 INFO L226 Difference]: Without dead ends: 139 [2018-09-30 10:27:58,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:27:58,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-30 10:27:58,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-09-30 10:27:58,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-30 10:27:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-09-30 10:27:58,056 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-09-30 10:27:58,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:58,056 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-09-30 10:27:58,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:27:58,057 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-09-30 10:27:58,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:27:58,058 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:58,058 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-30 10:27:58,058 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:58,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:58,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-09-30 10:27:58,061 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:58,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:58,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:58,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:58,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:58,147 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-30 10:27:58,147 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:58,147 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:58,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:58,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:58,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:58,149 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-09-30 10:27:58,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:58,247 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-09-30 10:27:58,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:58,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 10:27:58,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:58,249 INFO L225 Difference]: With dead ends: 183 [2018-09-30 10:27:58,250 INFO L226 Difference]: Without dead ends: 109 [2018-09-30 10:27:58,251 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-30 10:27:58,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-30 10:27:58,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-30 10:27:58,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-30 10:27:58,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-09-30 10:27:58,299 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-09-30 10:27:58,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:58,299 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-09-30 10:27:58,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:58,300 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-09-30 10:27:58,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 10:27:58,304 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:58,304 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-30 10:27:58,304 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:58,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:58,305 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-09-30 10:27:58,305 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:58,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:58,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:58,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:58,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:58,412 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-30 10:27:58,412 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:58,412 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:27:58,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:58,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:58,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:58,414 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-09-30 10:27:58,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:58,491 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-09-30 10:27:58,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:58,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 10:27:58,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:58,494 INFO L225 Difference]: With dead ends: 321 [2018-09-30 10:27:58,494 INFO L226 Difference]: Without dead ends: 215 [2018-09-30 10:27:58,495 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-30 10:27:58,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-30 10:27:58,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-09-30 10:27:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-30 10:27:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-09-30 10:27:58,538 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-09-30 10:27:58,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:58,539 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-09-30 10:27:58,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:58,539 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-09-30 10:27:58,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 10:27:58,541 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:58,541 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-30 10:27:58,542 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:58,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:58,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-09-30 10:27:58,542 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:58,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:58,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:58,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:58,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:58,640 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-30 10:27:58,640 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:58,640 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:27:58,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:58,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:58,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:58,642 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-09-30 10:27:58,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:58,796 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-09-30 10:27:58,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:58,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 10:27:58,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:58,806 INFO L225 Difference]: With dead ends: 633 [2018-09-30 10:27:58,806 INFO L226 Difference]: Without dead ends: 423 [2018-09-30 10:27:58,808 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-30 10:27:58,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-30 10:27:58,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-09-30 10:27:58,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-30 10:27:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-09-30 10:27:58,957 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-09-30 10:27:58,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:58,957 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-09-30 10:27:58,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:58,958 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-09-30 10:27:58,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 10:27:58,962 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:58,962 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-30 10:27:58,966 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:58,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:58,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-09-30 10:27:58,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:58,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:58,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:58,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:58,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:59,163 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-30 10:27:59,163 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:59,164 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:27:59,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:59,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:59,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:59,165 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-09-30 10:27:59,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:59,371 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-09-30 10:27:59,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:59,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 10:27:59,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:59,377 INFO L225 Difference]: With dead ends: 1257 [2018-09-30 10:27:59,377 INFO L226 Difference]: Without dead ends: 839 [2018-09-30 10:27:59,379 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-30 10:27:59,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-09-30 10:27:59,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-09-30 10:27:59,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-09-30 10:27:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-09-30 10:27:59,518 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-09-30 10:27:59,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:59,519 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-09-30 10:27:59,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:59,519 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-09-30 10:27:59,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 10:27:59,522 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:59,522 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-30 10:27:59,523 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:59,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:59,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-09-30 10:27:59,523 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:59,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:59,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:59,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:59,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:59,676 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-30 10:27:59,677 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:59,677 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:27:59,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:59,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:59,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:59,678 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-09-30 10:27:59,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:59,995 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-09-30 10:27:59,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:59,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 10:27:59,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:00,006 INFO L225 Difference]: With dead ends: 2505 [2018-09-30 10:28:00,006 INFO L226 Difference]: Without dead ends: 1671 [2018-09-30 10:28:00,008 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-30 10:28:00,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-30 10:28:00,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-09-30 10:28:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-09-30 10:28:00,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-09-30 10:28:00,272 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-09-30 10:28:00,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:00,273 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-09-30 10:28:00,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:00,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-09-30 10:28:00,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 10:28:00,277 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:00,277 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-30 10:28:00,277 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:00,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:00,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-09-30 10:28:00,278 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:00,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:00,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:00,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:00,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:00,461 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-30 10:28:00,646 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-30 10:28:00,647 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:28:00,647 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-30 10:28:00,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:00,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:28:01,084 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-30 10:28:01,117 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:28:01,117 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-30 10:28:01,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:28:01,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:28:01,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:28:01,119 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-09-30 10:28:01,384 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-30 10:28:01,751 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:28:02,421 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:28:02,835 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-30 10:28:04,841 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-30 10:28:05,090 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-30 10:28:05,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:05,346 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-09-30 10:28:05,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:28:05,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-09-30 10:28:05,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:05,363 INFO L225 Difference]: With dead ends: 4801 [2018-09-30 10:28:05,363 INFO L226 Difference]: Without dead ends: 3135 [2018-09-30 10:28:05,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-30 10:28:05,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-09-30 10:28:05,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-09-30 10:28:05,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-09-30 10:28:05,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-09-30 10:28:05,778 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-09-30 10:28:05,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:05,779 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-09-30 10:28:05,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:28:05,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-09-30 10:28:05,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 10:28:05,785 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:05,785 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-30 10:28:05,786 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:05,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:05,786 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-09-30 10:28:05,786 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:05,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:05,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:05,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:05,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:05,970 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-30 10:28:05,971 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:05,971 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:05,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:05,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:05,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:05,972 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-09-30 10:28:06,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:06,588 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-09-30 10:28:06,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:06,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-30 10:28:06,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:06,599 INFO L225 Difference]: With dead ends: 4873 [2018-09-30 10:28:06,599 INFO L226 Difference]: Without dead ends: 2215 [2018-09-30 10:28:06,603 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-30 10:28:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-09-30 10:28:06,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-09-30 10:28:06,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-09-30 10:28:06,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-09-30 10:28:06,907 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-09-30 10:28:06,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:06,907 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-09-30 10:28:06,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:06,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-09-30 10:28:06,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 10:28:06,910 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:06,911 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-30 10:28:06,911 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:06,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:06,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-09-30 10:28:06,911 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:06,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:06,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:06,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:28:06,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:06,993 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-30 10:28:06,993 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:06,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:06,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:06,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:06,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:06,995 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-09-30 10:28:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:07,035 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-09-30 10:28:07,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:07,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-30 10:28:07,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:07,036 INFO L225 Difference]: With dead ends: 1799 [2018-09-30 10:28:07,036 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:28:07,038 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-30 10:28:07,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:28:07,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:28:07,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:28:07,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:28:07,039 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-09-30 10:28:07,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:07,040 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:28:07,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:07,040 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:28:07,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:28:07,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:28:07,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,163 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-09-30 10:28:07,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,411 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-30 10:28:07,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,985 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-30 10:28:08,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:08,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:09,286 WARN L178 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-30 10:28:09,949 WARN L178 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:28:10,124 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:28:10,353 WARN L178 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:28:10,711 WARN L178 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-30 10:28:10,848 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:28:10,974 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-30 10:28:11,196 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:28:11,330 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:28:11,509 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:28:11,690 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-30 10:28:11,796 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-09-30 10:28:11,952 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:28:11,956 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-30 10:28:11,956 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-30 10:28:11,956 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-30 10:28:11,956 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-30 10:28:11,956 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-09-30 10:28:11,957 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-09-30 10:28:11,957 INFO L422 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-09-30 10:28:11,957 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-30 10:28:11,957 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-30 10:28:11,957 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-30 10:28:11,957 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-30 10:28:11,957 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-09-30 10:28:11,958 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-30 10:28:11,958 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-30 10:28:11,958 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-30 10:28:11,959 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-30 10:28:11,959 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-30 10:28:11,959 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-30 10:28:11,959 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-09-30 10:28:11,959 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-30 10:28:11,960 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-30 10:28:11,973 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,974 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,977 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,977 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,979 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,979 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,981 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,981 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,983 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,983 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,985 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,985 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,986 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,987 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,989 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,989 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,991 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,991 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,992 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,992 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,995 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,996 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,997 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,997 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,999 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:11,999 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,000 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,001 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,002 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,003 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,004 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,004 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,006 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,007 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,008 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,009 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,010 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,010 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,012 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,012 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,014 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 30.09 10:28:12 BoogieIcfgContainer [2018-09-30 10:28:12,014 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:28:12,015 INFO L168 Benchmark]: Toolchain (without parser) took 16119.12 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 146.3 MB). Free memory was 1.5 GB in the beginning and 922.5 MB in the end (delta: 554.7 MB). Peak memory consumption was 701.0 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:12,017 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 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-30 10:28:12,017 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.89 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-30 10:28:12,018 INFO L168 Benchmark]: Boogie Preprocessor took 71.99 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-30 10:28:12,018 INFO L168 Benchmark]: RCFGBuilder took 835.45 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-30 10:28:12,019 INFO L168 Benchmark]: TraceAbstraction took 15143.17 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 146.3 MB). Free memory was 1.4 GB in the beginning and 922.5 MB in the end (delta: 512.4 MB). Peak memory consumption was 658.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:12,023 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.18 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 61.89 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 71.99 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 835.45 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 15143.17 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 146.3 MB). Free memory was 1.4 GB in the beginning and 922.5 MB in the end (delta: 512.4 MB). Peak memory consumption was 658.7 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-30 10:28:12,034 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,035 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,036 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-30 10:28:12,037 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,037 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,038 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,038 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-30 10:28:12,039 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,039 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,040 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,041 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-30 10:28:12,042 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,042 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,043 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,043 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-30 10:28:12,044 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,044 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,045 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,045 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-30 10:28:12,047 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,047 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,048 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,048 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-30 10:28:12,049 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,050 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,050 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,050 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-30 10:28:12,052 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,052 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,053 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,053 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-30 10:28:12,054 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,054 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,055 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,055 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-30 10:28:12,056 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,057 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,057 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:28:12,058 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, 15.0s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 4.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 396 ConstructedInterpolants, 12 QuantifiedInterpolants, 49682 SizeOfPredicates, 1 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 270/288 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-28-12-064.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-30_10-28-12-064.csv Received shutdown request...