java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 19:14:26,118 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 19:14:26,120 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 19:14:26,133 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 19:14:26,133 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 19:14:26,134 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 19:14:26,136 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 19:14:26,138 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 19:14:26,139 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 19:14:26,140 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 19:14:26,141 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 19:14:26,142 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 19:14:26,143 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 19:14:26,144 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 19:14:26,145 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 19:14:26,146 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 19:14:26,147 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 19:14:26,149 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 19:14:26,151 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 19:14:26,153 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 19:14:26,154 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 19:14:26,155 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 19:14:26,158 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 19:14:26,158 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 19:14:26,158 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 19:14:26,159 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 19:14:26,160 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 19:14:26,161 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 19:14:26,162 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 19:14:26,163 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 19:14:26,163 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 19:14:26,164 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 19:14:26,164 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 19:14:26,165 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 19:14:26,166 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 19:14:26,166 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 19:14:26,167 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 19:14:26,181 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 19:14:26,182 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 19:14:26,183 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 19:14:26,183 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 19:14:26,183 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 19:14:26,183 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 19:14:26,184 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 19:14:26,184 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 19:14:26,184 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 19:14:26,184 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 19:14:26,184 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 19:14:26,185 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 19:14:26,185 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 19:14:26,185 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 19:14:26,186 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 19:14:26,186 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 19:14:26,186 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 19:14:26,186 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 19:14:26,187 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 19:14:26,187 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 19:14:26,187 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 19:14:26,187 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 19:14:26,187 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 19:14:26,188 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 19:14:26,188 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 19:14:26,188 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 19:14:26,188 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 19:14:26,188 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 19:14:26,189 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 19:14:26,189 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 19:14:26,189 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 19:14:26,189 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 19:14:26,190 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 19:14:26,190 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 19:14:26,190 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 19:14:26,190 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 19:14:26,190 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 19:14:26,191 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 19:14:26,191 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 19:14:26,191 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 19:14:26,223 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 19:14:26,236 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 19:14:26,240 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 19:14:26,242 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 19:14:26,243 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 19:14:26,243 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.5.2.ufo.BOUNDED-10.pals.c_11.bpl [2018-12-03 19:14:26,244 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl' [2018-12-03 19:14:26,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 19:14:26,334 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 19:14:26,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 19:14:26,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 19:14:26,336 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 19:14:26,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:26" (1/1) ... [2018-12-03 19:14:26,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:26" (1/1) ... [2018-12-03 19:14:26,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 19:14:26,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 19:14:26,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 19:14:26,395 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 19:14:26,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:26" (1/1) ... [2018-12-03 19:14:26,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:26" (1/1) ... [2018-12-03 19:14:26,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:26" (1/1) ... [2018-12-03 19:14:26,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:26" (1/1) ... [2018-12-03 19:14:26,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:26" (1/1) ... [2018-12-03 19:14:26,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:26" (1/1) ... [2018-12-03 19:14:26,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:26" (1/1) ... [2018-12-03 19:14:26,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 19:14:26,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 19:14:26,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 19:14:26,446 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 19:14:26,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:26" (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-12-03 19:14:26,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 19:14:26,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 19:14:27,251 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 19:14:27,251 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 19:14:27,252 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:14:27 BoogieIcfgContainer [2018-12-03 19:14:27,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 19:14:27,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 19:14:27,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 19:14:27,257 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 19:14:27,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:26" (1/2) ... [2018-12-03 19:14:27,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d781d77 and model type pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:14:27, skipping insertion in model container [2018-12-03 19:14:27,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:14:27" (2/2) ... [2018-12-03 19:14:27,260 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl [2018-12-03 19:14:27,271 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 19:14:27,278 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 19:14:27,294 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 19:14:27,327 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 19:14:27,327 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 19:14:27,327 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 19:14:27,328 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 19:14:27,328 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 19:14:27,328 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 19:14:27,328 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 19:14:27,328 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 19:14:27,341 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-12-03 19:14:27,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 19:14:27,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:14:27,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:14:27,351 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:14:27,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:14:27,357 INFO L82 PathProgramCache]: Analyzing trace with hash -417618601, now seen corresponding path program 1 times [2018-12-03 19:14:27,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:14:27,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:27,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:14:27,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:27,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:14:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:14:27,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:14:27,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:14:27,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:14:27,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:14:27,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:14:27,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:14:27,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:14:27,629 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-12-03 19:14:27,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:14:27,682 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-12-03 19:14:27,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:14:27,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 19:14:27,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:14:27,695 INFO L225 Difference]: With dead ends: 51 [2018-12-03 19:14:27,695 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 19:14:27,702 INFO L631 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-12-03 19:14:27,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 19:14:27,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-12-03 19:14:27,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 19:14:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-12-03 19:14:27,765 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-12-03 19:14:27,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:14:27,765 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-12-03 19:14:27,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:14:27,766 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-12-03 19:14:27,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 19:14:27,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:14:27,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:14:27,767 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:14:27,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:14:27,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735851, now seen corresponding path program 1 times [2018-12-03 19:14:27,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:14:27,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:27,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:14:27,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:27,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:14:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:14:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:14:27,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:14:27,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:14:27,950 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:14:27,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:14:27,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:14:27,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:14:27,959 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-12-03 19:14:28,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:14:28,039 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-12-03 19:14:28,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:14:28,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 19:14:28,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:14:28,044 INFO L225 Difference]: With dead ends: 91 [2018-12-03 19:14:28,044 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 19:14:28,047 INFO L631 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-12-03 19:14:28,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 19:14:28,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-12-03 19:14:28,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 19:14:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-12-03 19:14:28,087 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-12-03 19:14:28,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:14:28,088 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-12-03 19:14:28,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:14:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-12-03 19:14:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 19:14:28,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:14:28,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:14:28,090 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:14:28,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:14:28,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762861, now seen corresponding path program 1 times [2018-12-03 19:14:28,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:14:28,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:28,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:14:28,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:28,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:14:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:14:28,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:14:28,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:14:28,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:14:28,255 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:14:28,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:14:28,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:14:28,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:14:28,258 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-12-03 19:14:28,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:14:28,345 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-12-03 19:14:28,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:14:28,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 19:14:28,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:14:28,350 INFO L225 Difference]: With dead ends: 175 [2018-12-03 19:14:28,350 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 19:14:28,352 INFO L631 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-12-03 19:14:28,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 19:14:28,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-12-03 19:14:28,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 19:14:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-12-03 19:14:28,382 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-12-03 19:14:28,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:14:28,383 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-12-03 19:14:28,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:14:28,383 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-12-03 19:14:28,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 19:14:28,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:14:28,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:14:28,385 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:14:28,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:14:28,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1012416235, now seen corresponding path program 1 times [2018-12-03 19:14:28,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:14:28,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:28,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:14:28,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:28,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:14:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:14:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:14:28,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:14:28,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:14:28,534 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:14:28,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:14:28,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:14:28,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:14:28,536 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-12-03 19:14:28,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:14:28,624 INFO L93 Difference]: Finished difference Result 343 states and 472 transitions. [2018-12-03 19:14:28,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:14:28,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 19:14:28,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:14:28,631 INFO L225 Difference]: With dead ends: 343 [2018-12-03 19:14:28,631 INFO L226 Difference]: Without dead ends: 229 [2018-12-03 19:14:28,636 INFO L631 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-12-03 19:14:28,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-12-03 19:14:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-12-03 19:14:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-03 19:14:28,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2018-12-03 19:14:28,693 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 16 [2018-12-03 19:14:28,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:14:28,693 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2018-12-03 19:14:28,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:14:28,694 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2018-12-03 19:14:28,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 19:14:28,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:14:28,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:14:28,695 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:14:28,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:14:28,696 INFO L82 PathProgramCache]: Analyzing trace with hash -955157933, now seen corresponding path program 1 times [2018-12-03 19:14:28,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:14:28,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:28,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:14:28,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:28,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:14:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:14:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:14:28,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:14:28,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:14:28,789 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:14:28,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:14:28,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:14:28,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:14:28,791 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand 3 states. [2018-12-03 19:14:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:14:28,888 INFO L93 Difference]: Finished difference Result 569 states and 770 transitions. [2018-12-03 19:14:28,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:14:28,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 19:14:28,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:14:28,891 INFO L225 Difference]: With dead ends: 569 [2018-12-03 19:14:28,891 INFO L226 Difference]: Without dead ends: 343 [2018-12-03 19:14:28,893 INFO L631 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-12-03 19:14:28,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-12-03 19:14:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-12-03 19:14:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-12-03 19:14:28,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 456 transitions. [2018-12-03 19:14:28,969 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 456 transitions. Word has length 16 [2018-12-03 19:14:28,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:14:28,970 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 456 transitions. [2018-12-03 19:14:28,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:14:28,970 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 456 transitions. [2018-12-03 19:14:28,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 19:14:28,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:14:28,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:14:28,971 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:14:28,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:14:28,973 INFO L82 PathProgramCache]: Analyzing trace with hash -955217515, now seen corresponding path program 1 times [2018-12-03 19:14:28,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:14:28,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:28,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:14:28,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:28,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:14:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:14:29,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:14:29,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:14:29,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 19:14:29,211 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:14:29,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 19:14:29,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 19:14:29,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 19:14:29,213 INFO L87 Difference]: Start difference. First operand 341 states and 456 transitions. Second operand 4 states. [2018-12-03 19:14:29,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:14:29,460 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2018-12-03 19:14:29,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 19:14:29,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 19:14:29,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:14:29,465 INFO L225 Difference]: With dead ends: 610 [2018-12-03 19:14:29,465 INFO L226 Difference]: Without dead ends: 608 [2018-12-03 19:14:29,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 19:14:29,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-12-03 19:14:29,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 373. [2018-12-03 19:14:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-12-03 19:14:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-12-03 19:14:29,530 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 16 [2018-12-03 19:14:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:14:29,530 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-12-03 19:14:29,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 19:14:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-12-03 19:14:29,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 19:14:29,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:14:29,533 INFO L402 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] [2018-12-03 19:14:29,534 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:14:29,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:14:29,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1530501555, now seen corresponding path program 1 times [2018-12-03 19:14:29,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:14:29,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:29,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:14:29,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:29,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:14:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:14:29,715 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:14:29,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:14:29,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:14:29,716 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:14:29,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:14:29,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:14:29,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:14:29,718 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-12-03 19:14:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:14:29,933 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-12-03 19:14:29,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:14:29,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 19:14:29,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:14:29,939 INFO L225 Difference]: With dead ends: 1113 [2018-12-03 19:14:29,939 INFO L226 Difference]: Without dead ends: 743 [2018-12-03 19:14:29,941 INFO L631 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-12-03 19:14:29,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-12-03 19:14:30,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-12-03 19:14:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-12-03 19:14:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-12-03 19:14:30,086 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-12-03 19:14:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:14:30,086 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-12-03 19:14:30,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:14:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-12-03 19:14:30,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 19:14:30,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:14:30,094 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:14:30,094 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:14:30,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:14:30,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1272336117, now seen corresponding path program 1 times [2018-12-03 19:14:30,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:14:30,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:30,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:14:30,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:30,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:14:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:14:30,459 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 19:14:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:14:30,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:14:30,524 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:14:30,525 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-03 19:14:30,527 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50], [54], [56], [58] [2018-12-03 19:14:30,593 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 19:14:30,593 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 19:14:32,272 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 19:15:40,717 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 19:15:40,719 INFO L272 AbstractInterpreter]: Visited 23 different actions 549 times. Merged at 22 different actions 388 times. Widened at 19 different actions 223 times. Found 113 fixpoints after 15 different actions. Largest state had 0 variables. [2018-12-03 19:15:40,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:40,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 19:15:40,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:15:40,760 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-12-03 19:15:40,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:40,779 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:15:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:40,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:15:41,283 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 19:15:41,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:15:41,800 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-03 19:15:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 19:15:41,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:15:41,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2018-12-03 19:15:41,852 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:15:41,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 19:15:41,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 19:15:41,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 19:15:41,854 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 8 states. [2018-12-03 19:15:42,531 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 19:15:43,345 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 19:15:44,322 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 19:15:44,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:15:44,501 INFO L93 Difference]: Finished difference Result 1749 states and 2207 transitions. [2018-12-03 19:15:44,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 19:15:44,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-12-03 19:15:44,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:15:44,510 INFO L225 Difference]: With dead ends: 1749 [2018-12-03 19:15:44,510 INFO L226 Difference]: Without dead ends: 1011 [2018-12-03 19:15:44,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-12-03 19:15:44,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2018-12-03 19:15:44,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 647. [2018-12-03 19:15:44,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-12-03 19:15:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 783 transitions. [2018-12-03 19:15:44,652 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 783 transitions. Word has length 30 [2018-12-03 19:15:44,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:15:44,653 INFO L480 AbstractCegarLoop]: Abstraction has 647 states and 783 transitions. [2018-12-03 19:15:44,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 19:15:44,653 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 783 transitions. [2018-12-03 19:15:44,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 19:15:44,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:15:44,658 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 19:15:44,662 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:15:44,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:44,662 INFO L82 PathProgramCache]: Analyzing trace with hash 661288113, now seen corresponding path program 2 times [2018-12-03 19:15:44,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:15:44,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:44,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:44,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:44,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:15:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:44,979 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 19:15:44,984 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 19:15:44,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:15:44,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:15:44,985 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:15:44,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:15:44,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:15:44,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:15:44,986 INFO L87 Difference]: Start difference. First operand 647 states and 783 transitions. Second operand 3 states. [2018-12-03 19:15:45,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:15:45,042 INFO L93 Difference]: Finished difference Result 727 states and 879 transitions. [2018-12-03 19:15:45,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:15:45,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-03 19:15:45,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:15:45,043 INFO L225 Difference]: With dead ends: 727 [2018-12-03 19:15:45,043 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 19:15:45,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:15:45,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 19:15:45,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 19:15:45,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 19:15:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 19:15:45,046 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-12-03 19:15:45,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:15:45,046 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 19:15:45,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:15:45,046 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 19:15:45,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 19:15:45,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 19:15:45,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:45,925 WARN L180 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-03 19:15:46,084 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-12-03 19:15:46,276 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-03 19:15:46,496 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-12-03 19:15:46,673 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-03 19:15:46,780 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2018-12-03 19:15:47,060 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-12-03 19:15:47,204 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-03 19:15:47,412 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-12-03 19:15:47,549 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2018-12-03 19:15:47,702 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-03 19:15:47,956 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-12-03 19:15:47,961 INFO L444 ceAbstractionStarter]: At program point L316(lines 316 327) the Hoare annotation is: (let ((.cse1 (= ~r1 0)) (.cse2 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse0 (div ~mode5 256))) (or (and (= ~mode5 (* 256 .cse0)) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse1 (<= 1 ULTIMATE.start_check_~tmp~127) (<= 1 ~mode5) .cse2 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse3 (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p4_old ~nomsg)) .cse4 (<= .cse0 0)))) [2018-12-03 19:15:47,962 INFO L444 ceAbstractionStarter]: At program point L399(lines 399 409) the Hoare annotation is: (let ((.cse11 (div ~mode5 256))) (let ((.cse8 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse13 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse14 (<= ~r1 1)) (.cse2 (<= 1 ~mode5)) (.cse10 (<= .cse11 0)) (.cse0 (= ~r1 0)) (.cse1 (<= 1 ULTIMATE.start_check_~tmp~127)) (.cse12 (not (= ~p4_new ~nomsg))) (.cse3 (<= ~send4 127)) (.cse4 (<= (div ULTIMATE.start_assert_~arg 256) 0)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 1 ULTIMATE.start_assert_~arg)) (.cse7 (not (= ~p4_old ~nomsg))) (.cse9 (< 0 (+ (div ~send4 256) 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~mode5 (* 256 .cse11)) .cse0 .cse12 .cse3 .cse5 .cse9) (and .cse13 .cse14 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse13 .cse12 .cse14 .cse2 .cse3 .cse5 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9)))) [2018-12-03 19:15:47,962 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 466) no Hoare annotation was computed. [2018-12-03 19:15:47,962 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 466) no Hoare annotation was computed. [2018-12-03 19:15:47,962 INFO L444 ceAbstractionStarter]: At program point L441(lines 436 442) the Hoare annotation is: (and (= ~r1 0) (<= 1 ULTIMATE.start_check_~tmp~127) (<= 1 ~mode5) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (not (= ~p4_old ~nomsg)) (< 0 (+ (div ~send4 256) 1)) (<= (div ~mode5 256) 0)) [2018-12-03 19:15:47,966 INFO L444 ceAbstractionStarter]: At program point L371(lines 365 372) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 19:15:47,966 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 465) no Hoare annotation was computed. [2018-12-03 19:15:47,966 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 466) no Hoare annotation was computed. [2018-12-03 19:15:47,966 INFO L444 ceAbstractionStarter]: At program point L351(lines 345 352) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 19:15:47,967 INFO L444 ceAbstractionStarter]: At program point L376(lines 376 388) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 19:15:47,967 INFO L444 ceAbstractionStarter]: At program point L463(lines 463 464) the Hoare annotation is: false [2018-12-03 19:15:47,967 INFO L444 ceAbstractionStarter]: At program point L430(lines 430 437) the Hoare annotation is: (and (= ~r1 0) (<= 1 ~mode5) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (not (= ~p4_old ~nomsg)) (< 0 (+ (div ~send4 256) 1)) (<= (div ~mode5 256) 0)) [2018-12-03 19:15:47,967 INFO L444 ceAbstractionStarter]: At program point L331(lines 326 332) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 19:15:47,968 INFO L444 ceAbstractionStarter]: At program point L459(lines 309 459) the Hoare annotation is: (let ((.cse1 (= ~r1 0)) (.cse2 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse0 (div ~mode5 256))) (or (and (= ~mode5 (* 256 .cse0)) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse1 (<= 1 ULTIMATE.start_check_~tmp~127) (<= 1 ~mode5) .cse2 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse3 (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p4_old ~nomsg)) .cse4 (<= .cse0 0)))) [2018-12-03 19:15:47,968 INFO L444 ceAbstractionStarter]: At program point L356(lines 356 366) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 19:15:47,968 INFO L444 ceAbstractionStarter]: At program point L451(lines 451 460) the Hoare annotation is: (and (= ~r1 0) (<= 1 ULTIMATE.start_check_~tmp~127) (<= 1 ~mode5) (<= ~send4 127) (<= (div ULTIMATE.start_assert_~arg 256) 0) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p4_old ~nomsg)) (< 0 (+ (div ~send4 256) 1)) (<= (div ~mode5 256) 0)) [2018-12-03 19:15:47,968 INFO L444 ceAbstractionStarter]: At program point L414(lines 408 415) the Hoare annotation is: (and (= ~r1 0) (not (= ~p4_new ~nomsg)) (<= 1 ~mode5) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (< 0 (+ (div ~send4 256) 1)) (<= (div ~mode5 256) 0)) [2018-12-03 19:15:47,968 INFO L444 ceAbstractionStarter]: At program point L336(lines 336 346) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 19:15:47,969 INFO L444 ceAbstractionStarter]: At program point L394(lines 387 395) the Hoare annotation is: (let ((.cse11 (div ~mode5 256))) (let ((.cse8 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse13 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse14 (<= ~r1 1)) (.cse2 (<= 1 ~mode5)) (.cse10 (<= .cse11 0)) (.cse0 (= ~r1 0)) (.cse1 (<= 1 ULTIMATE.start_check_~tmp~127)) (.cse12 (not (= ~p4_new ~nomsg))) (.cse3 (<= ~send4 127)) (.cse4 (<= (div ULTIMATE.start_assert_~arg 256) 0)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 1 ULTIMATE.start_assert_~arg)) (.cse7 (not (= ~p4_old ~nomsg))) (.cse9 (< 0 (+ (div ~send4 256) 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~mode5 (* 256 .cse11)) .cse0 .cse12 .cse3 .cse5 .cse9) (and .cse13 .cse14 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse13 .cse12 .cse14 .cse2 .cse3 .cse5 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9)))) [2018-12-03 19:15:47,995 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 07:15:47 BoogieIcfgContainer [2018-12-03 19:15:47,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 19:15:47,996 INFO L168 Benchmark]: Toolchain (without parser) took 81662.79 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: -1.9 GB). Peak memory consumption was 763.0 MB. Max. memory is 7.1 GB. [2018-12-03 19:15:47,997 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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-12-03 19:15:47,998 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.80 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-12-03 19:15:47,998 INFO L168 Benchmark]: Boogie Preprocessor took 51.00 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-12-03 19:15:47,999 INFO L168 Benchmark]: RCFGBuilder took 806.10 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 19:15:48,000 INFO L168 Benchmark]: TraceAbstraction took 80742.05 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -1.9 GB). Peak memory consumption was 731.3 MB. Max. memory is 7.1 GB. [2018-12-03 19:15:48,004 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.23 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 58.80 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 51.00 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 806.10 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 80742.05 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -1.9 GB). Peak memory consumption was 731.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 465]: 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: 356]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0 - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0 - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || (((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || (((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && !(~p4_new == ~nomsg)) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 < ~send4 / 256 + 1)) || ((((((((~mode1 == 256 * (~mode1 / 256) && ~r1 <= 1) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0)) || ((((((((~mode1 == 256 * (~mode1 / 256) && !(~p4_new == ~nomsg)) && ~r1 <= 1) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0)) || ((((((((~r1 == 0 && 1 <= check_~tmp~127) && !(~p4_new == ~nomsg)) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && !(~p4_new == ~nomsg)) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0 - InvariantResult [Line: 365]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || (((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: (((((((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || (((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && !(~p4_new == ~nomsg)) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 < ~send4 / 256 + 1)) || ((((((((~mode1 == 256 * (~mode1 / 256) && ~r1 <= 1) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0)) || ((((((((~mode1 == 256 * (~mode1 / 256) && !(~p4_new == ~nomsg)) && ~r1 <= 1) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0)) || ((((((((~r1 == 0 && 1 <= check_~tmp~127) && !(~p4_new == ~nomsg)) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) - InvariantResult [Line: 463]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 80.6s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 284 SDtfs, 230 SDslu, 231 SDs, 0 SdLazy, 167 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=741occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 70.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 611 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 107 NumberOfFragments, 1441 HoareAnnotationTreeSize, 15 FomulaSimplifications, 10115 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 15 FomulaSimplificationsInter, 78 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 34017 SizeOfPredicates, 8 NumberOfNonLiveVariables, 299 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 110/140 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...