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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:25:47,086 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:25:47,088 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:25:47,106 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:25:47,106 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:25:47,108 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:25:47,110 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:25:47,113 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:25:47,114 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:25:47,116 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:25:47,117 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:25:47,117 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:25:47,120 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:25:47,121 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:25:47,122 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:25:47,125 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:25:47,126 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:25:47,130 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:25:47,139 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:25:47,142 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:25:47,143 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:25:47,144 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:25:47,146 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:25:47,146 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:25:47,147 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:25:47,147 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:25:47,148 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:25:47,149 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:25:47,150 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:25:47,151 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:25:47,151 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:25:47,152 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:25:47,152 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:25:47,152 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:25:47,153 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:25:47,154 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:25:47,154 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:25:47,166 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:25:47,167 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:25:47,169 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:25:47,170 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:25:47,170 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:25:47,170 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:25:47,170 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:25:47,170 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:25:47,171 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:25:47,171 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:25:47,171 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:25:47,171 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:25:47,171 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:25:47,172 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:25:47,172 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:25:47,173 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:25:47,173 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:25:47,173 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:25:47,174 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:25:47,174 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:25:47,174 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:25:47,174 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:25:47,175 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:25:47,176 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:25:47,176 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:25:47,176 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:25:47,177 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:25:47,177 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:25:47,177 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:25:47,177 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:25:47,178 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:25:47,178 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:25:47,178 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:25:47,178 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:25:47,178 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:25:47,179 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:25:47,179 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:25:47,179 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:25:47,179 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:25:47,179 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:25:47,180 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:25:47,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:25:47,240 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:25:47,244 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:25:47,245 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:25:47,246 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:25:47,247 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl [2018-12-03 16:25:47,247 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl' [2018-12-03 16:25:47,314 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:25:47,316 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:25:47,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:25:47,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:25:47,317 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:25:47,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:47" (1/1) ... [2018-12-03 16:25:47,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:47" (1/1) ... [2018-12-03 16:25:47,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:25:47,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:25:47,368 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:25:47,368 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:25:47,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:47" (1/1) ... [2018-12-03 16:25:47,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:47" (1/1) ... [2018-12-03 16:25:47,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:47" (1/1) ... [2018-12-03 16:25:47,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:47" (1/1) ... [2018-12-03 16:25:47,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:47" (1/1) ... [2018-12-03 16:25:47,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:47" (1/1) ... [2018-12-03 16:25:47,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:47" (1/1) ... [2018-12-03 16:25:47,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:25:47,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:25:47,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:25:47,404 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:25:47,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:47" (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 16:25:47,482 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 16:25:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:25:47,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:25:48,110 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:25:48,110 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 16:25:48,111 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:25:48 BoogieIcfgContainer [2018-12-03 16:25:48,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:25:48,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:25:48,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:25:48,115 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:25:48,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:47" (1/2) ... [2018-12-03 16:25:48,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9ddae8 and model type pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:25:48, skipping insertion in model container [2018-12-03 16:25:48,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:25:48" (2/2) ... [2018-12-03 16:25:48,119 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl [2018-12-03 16:25:48,129 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:25:48,137 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:25:48,155 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:25:48,186 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:25:48,187 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:25:48,187 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:25:48,187 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:25:48,187 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:25:48,187 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:25:48,187 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:25:48,188 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:25:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-12-03 16:25:48,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:25:48,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:48,212 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:25:48,214 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:48,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:48,221 INFO L82 PathProgramCache]: Analyzing trace with hash -417618601, now seen corresponding path program 1 times [2018-12-03 16:25:48,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:48,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:48,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:48,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:48,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:48,440 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 16:25:48,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:25:48,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:25:48,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:25:48,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:25:48,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:25:48,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:25:48,463 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-12-03 16:25:48,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:48,542 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2018-12-03 16:25:48,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:25:48,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 16:25:48,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:48,557 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:25:48,557 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:25:48,563 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 16:25:48,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:25:48,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 16:25:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:25:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-12-03 16:25:48,604 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 16 [2018-12-03 16:25:48,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:48,604 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-12-03 16:25:48,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:25:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2018-12-03 16:25:48,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:25:48,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:48,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:25:48,606 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:48,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:48,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735851, now seen corresponding path program 1 times [2018-12-03 16:25:48,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:48,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:48,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:48,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:48,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:48,722 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 16:25:48,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:25:48,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:25:48,724 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:25:48,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:25:48,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:25:48,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:25:48,730 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 3 states. [2018-12-03 16:25:48,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:48,755 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2018-12-03 16:25:48,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:25:48,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 16:25:48,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:48,757 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:25:48,757 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:25:48,758 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 16:25:48,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:25:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 16:25:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:25:48,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-12-03 16:25:48,764 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 16 [2018-12-03 16:25:48,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:48,765 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-12-03 16:25:48,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:25:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2018-12-03 16:25:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:25:48,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:48,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:25:48,766 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:48,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:48,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1686901289, now seen corresponding path program 1 times [2018-12-03 16:25:48,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:48,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:48,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:48,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:48,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:48,848 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 16:25:48,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:25:48,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:25:48,849 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:25:48,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:25:48,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:25:48,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:25:48,851 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 3 states. [2018-12-03 16:25:48,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:48,898 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-12-03 16:25:48,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:25:48,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 16:25:48,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:48,900 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:25:48,900 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:25:48,901 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 16:25:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:25:48,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 16:25:48,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 16:25:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-12-03 16:25:48,907 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 16 [2018-12-03 16:25:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:48,908 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-03 16:25:48,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:25:48,908 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2018-12-03 16:25:48,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:25:48,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:48,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:25:48,909 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:48,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:48,910 INFO L82 PathProgramCache]: Analyzing trace with hash -2079928299, now seen corresponding path program 1 times [2018-12-03 16:25:48,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:48,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:48,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:48,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:48,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:49,016 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 16:25:49,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:25:49,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:25:49,017 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:25:49,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:25:49,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:25:49,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:25:49,019 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 3 states. [2018-12-03 16:25:49,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:49,068 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2018-12-03 16:25:49,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:25:49,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 16:25:49,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:49,069 INFO L225 Difference]: With dead ends: 41 [2018-12-03 16:25:49,070 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:25:49,070 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 16:25:49,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:25:49,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 16:25:49,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 16:25:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-12-03 16:25:49,078 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 16 [2018-12-03 16:25:49,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:49,078 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-12-03 16:25:49,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:25:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2018-12-03 16:25:49,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:25:49,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:49,079 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:25:49,080 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:49,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:49,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1270581673, now seen corresponding path program 1 times [2018-12-03 16:25:49,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:49,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:49,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:49,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:49,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:49,182 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 16:25:49,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:25:49,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:25:49,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:25:49,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:25:49,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:25:49,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:25:49,184 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 3 states. [2018-12-03 16:25:49,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:49,246 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2018-12-03 16:25:49,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:25:49,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 16:25:49,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:49,248 INFO L225 Difference]: With dead ends: 57 [2018-12-03 16:25:49,249 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 16:25:49,250 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 16:25:49,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 16:25:49,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-12-03 16:25:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 16:25:49,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2018-12-03 16:25:49,269 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 16 [2018-12-03 16:25:49,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:49,269 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2018-12-03 16:25:49,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:25:49,269 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2018-12-03 16:25:49,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:25:49,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:49,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:25:49,271 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:49,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:49,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1213323371, now seen corresponding path program 1 times [2018-12-03 16:25:49,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:49,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:49,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:49,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:49,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:49,477 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 16:25:49,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:25:49,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:25:49,477 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:25:49,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:25:49,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:25:49,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:25:49,478 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand 4 states. [2018-12-03 16:25:49,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:49,608 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2018-12-03 16:25:49,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:25:49,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 16:25:49,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:49,614 INFO L225 Difference]: With dead ends: 90 [2018-12-03 16:25:49,614 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 16:25:49,615 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 16:25:49,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 16:25:49,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 41. [2018-12-03 16:25:49,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 16:25:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2018-12-03 16:25:49,635 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 16 [2018-12-03 16:25:49,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:49,635 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2018-12-03 16:25:49,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:25:49,636 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2018-12-03 16:25:49,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:25:49,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:49,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:25:49,640 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:49,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:49,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1213382953, now seen corresponding path program 1 times [2018-12-03 16:25:49,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:49,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:49,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:49,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:49,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:49,732 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 16:25:49,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:25:49,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:25:49,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:25:49,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:25:49,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:25:49,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:25:49,735 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand 4 states. [2018-12-03 16:25:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:49,864 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2018-12-03 16:25:49,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:25:49,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 16:25:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:49,869 INFO L225 Difference]: With dead ends: 64 [2018-12-03 16:25:49,869 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 16:25:49,870 INFO L631 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-12-03 16:25:49,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 16:25:49,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-12-03 16:25:49,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 16:25:49,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2018-12-03 16:25:49,883 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 16 [2018-12-03 16:25:49,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:49,883 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-12-03 16:25:49,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:25:49,883 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-12-03 16:25:49,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 16:25:49,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:49,885 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 16:25:49,885 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:49,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:49,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1468461941, now seen corresponding path program 1 times [2018-12-03 16:25:49,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:49,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:49,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:49,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:49,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:50,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:50,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:50,041 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-03 16:25:50,043 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 16:25:50,089 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:25:50,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:25:51,538 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:25:51,540 INFO L272 AbstractInterpreter]: Visited 23 different actions 172 times. Merged at 22 different actions 102 times. Widened at 12 different actions 15 times. Found 36 fixpoints after 14 different actions. Largest state had 0 variables. [2018-12-03 16:25:51,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:51,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:25:51,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:51,586 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 16:25:51,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:51,602 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:51,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:51,966 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:25:51,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:25:52,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:52,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-12-03 16:25:52,220 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:52,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:25:52,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:25:52,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:25:52,221 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 6 states. [2018-12-03 16:25:53,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:53,019 INFO L93 Difference]: Finished difference Result 157 states and 203 transitions. [2018-12-03 16:25:53,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:25:53,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-03 16:25:53,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:53,021 INFO L225 Difference]: With dead ends: 157 [2018-12-03 16:25:53,021 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 16:25:53,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:25:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 16:25:53,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2018-12-03 16:25:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 16:25:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 142 transitions. [2018-12-03 16:25:53,049 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 142 transitions. Word has length 30 [2018-12-03 16:25:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:53,050 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 142 transitions. [2018-12-03 16:25:53,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:25:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 142 transitions. [2018-12-03 16:25:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 16:25:53,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:53,052 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:25:53,053 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:53,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:53,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1126846763, now seen corresponding path program 2 times [2018-12-03 16:25:53,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:53,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:53,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:53,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:53,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:25:53,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:25:53,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:25:53,150 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:25:53,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:25:53,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:25:53,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:25:53,151 INFO L87 Difference]: Start difference. First operand 113 states and 142 transitions. Second operand 3 states. [2018-12-03 16:25:53,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:53,182 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2018-12-03 16:25:53,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:25:53,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-03 16:25:53,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:53,183 INFO L225 Difference]: With dead ends: 139 [2018-12-03 16:25:53,184 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:25:53,186 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 16:25:53,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:25:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:25:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:25:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:25:53,187 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-12-03 16:25:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:53,187 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:25:53,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:25:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:25:53,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:25:53,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:25:53,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:25:53,554 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-12-03 16:25:53,655 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-03 16:25:53,899 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2018-12-03 16:25:54,140 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-12-03 16:25:54,511 INFO L444 ceAbstractionStarter]: At program point L287(lines 280 288) the Hoare annotation is: (or (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= 1 ~mode4) (<= ~r1 1) (not (= ~p3_old ~nomsg))) (and (<= ~r1 0) (<= (+ ~mode3 257) 0) (<= (+ ~mode4 256) 0))) [2018-12-03 16:25:54,511 INFO L444 ceAbstractionStarter]: At program point L316(lines 316 325) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse1 (not (= ~p3_old ~nomsg))) (.cse2 (<= ~r1 0)) (.cse3 (not (= ~p3_new ~nomsg)))) (or (and .cse0 (<= 1 ~mode4) (<= ~r1 1) .cse1) (and (<= 1 ULTIMATE.start_check_~tmp~101) (<= 1 ULTIMATE.start_main_~c1~108) .cse2 .cse0 .cse3 (not (= 0 |ULTIMATE.start_assert_#in~arg|)) .cse1) (and .cse2 .cse3 (<= (+ ~mode4 256) 0)))) [2018-12-03 16:25:54,512 INFO L444 ceAbstractionStarter]: At program point L250(lines 250 262) the Hoare annotation is: (let ((.cse0 (<= ~r1 0))) (or (and .cse0 (<= (+ ~mode3 257) 0) (<= (+ ~mode1 256) 0) (<= (+ ~mode4 256) 0) (<= 512 ~mode2)) (and (<= 1 ULTIMATE.start_check_~tmp~101) (<= 1 ULTIMATE.start_main_~c1~108) .cse0 (not (= 0 ULTIMATE.start_assert_~arg)) (<= 1 ~mode4) (not (= 0 |ULTIMATE.start_assert_#in~arg|)) (not (= ~p3_old ~nomsg))))) [2018-12-03 16:25:54,512 INFO L444 ceAbstractionStarter]: At program point L345(lines 345 353) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ~mode4) (not (= ~p3_old ~nomsg))) [2018-12-03 16:25:54,512 INFO L444 ceAbstractionStarter]: At program point L267(lines 261 268) the Hoare annotation is: (or (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= 1 ~mode4) (<= ~r1 1) (not (= ~p3_old ~nomsg))) (and (<= ~r1 0) (<= (+ ~mode3 257) 0) (<= (+ ~mode4 256) 0) (<= 512 ~mode2))) [2018-12-03 16:25:54,512 INFO L444 ceAbstractionStarter]: At program point L292(lines 292 302) the Hoare annotation is: (or (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= 1 ~mode4) (<= ~r1 1) (not (= ~p3_old ~nomsg))) (and (<= ~r1 0) (<= (+ ~mode3 257) 0) (<= (+ ~mode4 256) 0))) [2018-12-03 16:25:54,512 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 61 391) no Hoare annotation was computed. [2018-12-03 16:25:54,513 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 61 391) no Hoare annotation was computed. [2018-12-03 16:25:54,513 INFO L444 ceAbstractionStarter]: At program point L272(lines 272 281) the Hoare annotation is: (or (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= 1 ~mode4) (<= ~r1 1) (not (= ~p3_old ~nomsg))) (and (<= ~r1 0) (<= (+ ~mode3 257) 0) (<= (+ ~mode4 256) 0) (<= 512 ~mode2))) [2018-12-03 16:25:54,513 INFO L444 ceAbstractionStarter]: At program point L363(lines 363 370) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~101) (<= 1 ULTIMATE.start_main_~c1~108) (<= ~r1 0) (<= 1 ~mode4) (not (= ~p3_old ~nomsg))) [2018-12-03 16:25:54,513 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 390) no Hoare annotation was computed. [2018-12-03 16:25:54,513 INFO L444 ceAbstractionStarter]: At program point L388(lines 388 389) the Hoare annotation is: false [2018-12-03 16:25:54,513 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 61 391) no Hoare annotation was computed. [2018-12-03 16:25:54,514 INFO L444 ceAbstractionStarter]: At program point L331(lines 324 332) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ~mode4) (not (= ~p3_new ~nomsg))) [2018-12-03 16:25:54,514 INFO L444 ceAbstractionStarter]: At program point L356(lines 352 357) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~101) (<= ~r1 0) (<= 1 ~mode4) (not (= ~p3_old ~nomsg))) [2018-12-03 16:25:54,514 INFO L444 ceAbstractionStarter]: At program point L385(lines 244 385) the Hoare annotation is: (let ((.cse0 (<= ~r1 0))) (or (and .cse0 (<= (+ ~mode3 257) 0) (<= (+ ~mode1 256) 0) (<= (+ ~mode4 256) 0) (<= 512 ~mode2)) (and (<= 1 ULTIMATE.start_check_~tmp~101) (<= 1 ULTIMATE.start_main_~c1~108) .cse0 (not (= 0 ULTIMATE.start_assert_~arg)) (<= 1 ~mode4) (not (= 0 |ULTIMATE.start_assert_#in~arg|)) (not (= ~p3_old ~nomsg))))) [2018-12-03 16:25:54,515 INFO L444 ceAbstractionStarter]: At program point L377(lines 377 386) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~101) (<= 1 ULTIMATE.start_main_~c1~108) (<= ~r1 0) (not (= 0 ULTIMATE.start_assert_~arg)) (<= 1 ~mode4) (not (= 0 |ULTIMATE.start_assert_#in~arg|)) (not (= ~p3_old ~nomsg))) [2018-12-03 16:25:54,515 INFO L444 ceAbstractionStarter]: At program point L311(lines 301 312) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse1 (not (= ~p3_old ~nomsg))) (.cse2 (<= ~r1 0)) (.cse3 (not (= ~p3_new ~nomsg)))) (or (and .cse0 (<= 1 ~mode4) (<= ~r1 1) .cse1) (and (<= 1 ULTIMATE.start_check_~tmp~101) (<= 1 ULTIMATE.start_main_~c1~108) .cse2 .cse0 .cse3 (not (= 0 |ULTIMATE.start_assert_#in~arg|)) .cse1) (and .cse2 .cse3 (<= (+ ~mode4 256) 0)))) [2018-12-03 16:25:54,515 INFO L444 ceAbstractionStarter]: At program point L373(lines 369 374) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~101) (<= 1 ULTIMATE.start_main_~c1~108) (<= ~r1 0) (<= 1 ~mode4) (not (= 0 |ULTIMATE.start_assert_#in~arg|)) (not (= ~p3_old ~nomsg))) [2018-12-03 16:25:54,532 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:25:54 BoogieIcfgContainer [2018-12-03 16:25:54,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:25:54,536 INFO L168 Benchmark]: Toolchain (without parser) took 7220.66 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 672.7 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -308.2 MB). Peak memory consumption was 364.5 MB. Max. memory is 7.1 GB. [2018-12-03 16:25:54,538 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:25:54,538 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:25:54,539 INFO L168 Benchmark]: Boogie Preprocessor took 35.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:25:54,540 INFO L168 Benchmark]: RCFGBuilder took 707.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 16:25:54,541 INFO L168 Benchmark]: TraceAbstraction took 6421.29 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 672.7 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -339.9 MB). Peak memory consumption was 332.8 MB. Max. memory is 7.1 GB. [2018-12-03 16:25:54,546 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 50.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 707.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 6421.29 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 672.7 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -339.9 MB). Peak memory consumption was 332.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 390]: 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: 352]: Loop Invariant Derived loop invariant: ((1 <= check_~tmp~101 && ~r1 <= 0) && 1 <= ~mode4) && !(~p3_old == ~nomsg) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 250]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && ~mode3 + 257 <= 0) && ~mode1 + 256 <= 0) && ~mode4 + 256 <= 0) && 512 <= ~mode2) || ((((((1 <= check_~tmp~101 && 1 <= main_~c1~108) && ~r1 <= 0) && !(0 == assert_~arg)) && 1 <= ~mode4) && !(0 == assert_#in~arg)) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (~r1 <= 0 && 1 <= ~mode4) && !(~p3_old == ~nomsg) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: (((((1 <= check_~tmp~101 && 1 <= main_~c1~108) && ~r1 <= 0) && !(0 == assert_~arg)) && 1 <= ~mode4) && !(0 == assert_#in~arg)) && !(~p3_old == ~nomsg) - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: (((!(0 == assert_~arg) && 1 <= ~mode4) && ~r1 <= 1) && !(~p3_old == ~nomsg)) || (((~r1 <= 0 && ~mode3 + 257 <= 0) && ~mode4 + 256 <= 0) && 512 <= ~mode2) - InvariantResult [Line: 301]: Loop Invariant Derived loop invariant: ((((!(0 == assert_~arg) && 1 <= ~mode4) && ~r1 <= 1) && !(~p3_old == ~nomsg)) || ((((((1 <= check_~tmp~101 && 1 <= main_~c1~108) && ~r1 <= 0) && !(0 == assert_~arg)) && !(~p3_new == ~nomsg)) && !(0 == assert_#in~arg)) && !(~p3_old == ~nomsg))) || ((~r1 <= 0 && !(~p3_new == ~nomsg)) && ~mode4 + 256 <= 0) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && ~mode3 + 257 <= 0) && ~mode1 + 256 <= 0) && ~mode4 + 256 <= 0) && 512 <= ~mode2) || ((((((1 <= check_~tmp~101 && 1 <= main_~c1~108) && ~r1 <= 0) && !(0 == assert_~arg)) && 1 <= ~mode4) && !(0 == assert_#in~arg)) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: (~r1 <= 0 && 1 <= ~mode4) && !(~p3_new == ~nomsg) - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((1 <= check_~tmp~101 && 1 <= main_~c1~108) && ~r1 <= 0) && 1 <= ~mode4) && !(~p3_old == ~nomsg) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: ((((1 <= check_~tmp~101 && 1 <= main_~c1~108) && ~r1 <= 0) && 1 <= ~mode4) && !(0 == assert_#in~arg)) && !(~p3_old == ~nomsg) - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: (((!(0 == assert_~arg) && 1 <= ~mode4) && ~r1 <= 1) && !(~p3_old == ~nomsg)) || ((~r1 <= 0 && ~mode3 + 257 <= 0) && ~mode4 + 256 <= 0) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((!(0 == assert_~arg) && 1 <= ~mode4) && ~r1 <= 1) && !(~p3_old == ~nomsg)) || (((~r1 <= 0 && ~mode3 + 257 <= 0) && ~mode4 + 256 <= 0) && 512 <= ~mode2) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: ((((!(0 == assert_~arg) && 1 <= ~mode4) && ~r1 <= 1) && !(~p3_old == ~nomsg)) || ((((((1 <= check_~tmp~101 && 1 <= main_~c1~108) && ~r1 <= 0) && !(0 == assert_~arg)) && !(~p3_new == ~nomsg)) && !(0 == assert_#in~arg)) && !(~p3_old == ~nomsg))) || ((~r1 <= 0 && !(~p3_new == ~nomsg)) && ~mode4 + 256 <= 0) - InvariantResult [Line: 292]: Loop Invariant Derived loop invariant: (((!(0 == assert_~arg) && 1 <= ~mode4) && ~r1 <= 1) && !(~p3_old == ~nomsg)) || ((~r1 <= 0 && ~mode3 + 257 <= 0) && ~mode4 + 256 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 6.3s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 233 SDtfs, 149 SDslu, 276 SDs, 0 SdLazy, 147 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 50 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 47 NumberOfFragments, 432 HoareAnnotationTreeSize, 15 FomulaSimplifications, 409 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 150 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 12857 SizeOfPredicates, 1 NumberOfNonLiveVariables, 284 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 66/84 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...