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_oct_cong.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:28:09,379 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:28:09,381 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:28:09,399 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:28:09,399 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:28:09,400 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:28:09,402 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:28:09,406 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:28:09,409 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:28:09,416 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:28:09,417 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:28:09,417 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:28:09,418 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:28:09,419 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:28:09,420 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:28:09,422 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:28:09,423 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:28:09,424 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:28:09,426 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:28:09,429 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:28:09,430 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:28:09,436 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:28:09,439 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:28:09,440 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:28:09,440 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:28:09,441 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:28:09,442 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:28:09,445 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:28:09,446 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:28:09,447 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:28:09,447 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:28:09,448 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:28:09,448 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:28:09,448 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:28:09,451 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:28:09,452 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:28:09,452 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:28:09,477 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:28:09,478 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:28:09,479 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:28:09,479 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:28:09,479 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:28:09,479 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:28:09,480 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:28:09,480 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:28:09,480 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:28:09,480 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:28:09,480 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:28:09,481 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:28:09,481 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:28:09,481 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:28:09,481 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:28:09,482 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:28:09,482 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:28:09,482 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:28:09,482 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:28:09,482 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:28:09,483 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:28:09,483 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:28:09,483 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:28:09,483 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:28:09,483 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:28:09,484 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:28:09,484 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:28:09,484 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:28:09,484 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:28:09,484 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:28:09,485 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:28:09,485 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:28:09,485 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:28:09,485 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:28:09,485 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:28:09,486 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:28:09,486 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:28:09,486 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:28:09,486 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:28:09,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:28:09,554 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:28:09,560 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:28:09,562 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:28:09,562 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:28:09,564 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.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl [2018-12-03 17:28:09,564 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl' [2018-12-03 17:28:09,652 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:28:09,655 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:28:09,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:28:09,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:28:09,656 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:28:09,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:09" (1/1) ... [2018-12-03 17:28:09,693 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:09" (1/1) ... [2018-12-03 17:28:09,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:28:09,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:28:09,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:28:09,706 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:28:09,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:09" (1/1) ... [2018-12-03 17:28:09,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:09" (1/1) ... [2018-12-03 17:28:09,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:09" (1/1) ... [2018-12-03 17:28:09,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:09" (1/1) ... [2018-12-03 17:28:09,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:09" (1/1) ... [2018-12-03 17:28:09,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:09" (1/1) ... [2018-12-03 17:28:09,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:09" (1/1) ... [2018-12-03 17:28:09,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:28:09,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:28:09,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:28:09,768 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:28:09,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:09" (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 17:28:09,866 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 17:28:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:28:09,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:28:10,483 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:28:10,484 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 17:28:10,484 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:28:10 BoogieIcfgContainer [2018-12-03 17:28:10,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:28:10,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:28:10,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:28:10,489 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:28:10,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:09" (1/2) ... [2018-12-03 17:28:10,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72cd7ce8 and model type pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:28:10, skipping insertion in model container [2018-12-03 17:28:10,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:28:10" (2/2) ... [2018-12-03 17:28:10,492 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl [2018-12-03 17:28:10,503 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:28:10,512 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:28:10,526 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:28:10,558 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:28:10,558 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:28:10,559 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:28:10,559 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:28:10,559 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:28:10,559 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:28:10,559 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:28:10,559 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:28:10,574 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-12-03 17:28:10,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:28:10,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:10,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:10,584 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:10,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:10,590 INFO L82 PathProgramCache]: Analyzing trace with hash -417618601, now seen corresponding path program 1 times [2018-12-03 17:28:10,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:10,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:10,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:10,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:10,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:10,851 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 17:28:10,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:10,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:28:10,854 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:10,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:10,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:10,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:10,876 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-12-03 17:28:10,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:10,945 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2018-12-03 17:28:10,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:10,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:28:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:10,958 INFO L225 Difference]: With dead ends: 43 [2018-12-03 17:28:10,958 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 17:28:10,963 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 17:28:10,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 17:28:11,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 17:28:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 17:28:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2018-12-03 17:28:11,009 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 16 [2018-12-03 17:28:11,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:11,009 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-12-03 17:28:11,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:11,010 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2018-12-03 17:28:11,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:28:11,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:11,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:11,011 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:11,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:11,012 INFO L82 PathProgramCache]: Analyzing trace with hash 391728025, now seen corresponding path program 1 times [2018-12-03 17:28:11,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:11,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:11,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:11,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:11,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:11,166 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 17:28:11,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:11,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:28:11,167 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:11,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:11,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:11,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:11,170 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 3 states. [2018-12-03 17:28:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:11,209 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2018-12-03 17:28:11,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:11,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:28:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:11,212 INFO L225 Difference]: With dead ends: 63 [2018-12-03 17:28:11,212 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 17:28:11,213 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 17:28:11,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 17:28:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-12-03 17:28:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 17:28:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2018-12-03 17:28:11,226 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 16 [2018-12-03 17:28:11,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:11,226 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2018-12-03 17:28:11,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2018-12-03 17:28:11,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:28:11,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:11,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:11,228 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:11,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:11,229 INFO L82 PathProgramCache]: Analyzing trace with hash 448986327, now seen corresponding path program 1 times [2018-12-03 17:28:11,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:11,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:11,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:11,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:11,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:11,325 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 17:28:11,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:11,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:28:11,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:11,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:28:11,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:28:11,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:28:11,331 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand 4 states. [2018-12-03 17:28:11,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:11,523 INFO L93 Difference]: Finished difference Result 87 states and 119 transitions. [2018-12-03 17:28:11,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:28:11,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 17:28:11,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:11,525 INFO L225 Difference]: With dead ends: 87 [2018-12-03 17:28:11,526 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 17:28:11,526 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 17:28:11,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 17:28:11,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 49. [2018-12-03 17:28:11,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 17:28:11,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2018-12-03 17:28:11,555 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 16 [2018-12-03 17:28:11,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:11,556 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2018-12-03 17:28:11,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:28:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2018-12-03 17:28:11,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:28:11,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:11,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:11,559 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:11,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:11,559 INFO L82 PathProgramCache]: Analyzing trace with hash 448926745, now seen corresponding path program 1 times [2018-12-03 17:28:11,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:11,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:11,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:11,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:11,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:11,719 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 17:28:11,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:11,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:28:11,720 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:11,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:28:11,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:28:11,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:28:11,722 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand 4 states. [2018-12-03 17:28:11,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:11,843 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-12-03 17:28:11,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:28:11,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 17:28:11,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:11,845 INFO L225 Difference]: With dead ends: 109 [2018-12-03 17:28:11,845 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 17:28:11,846 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 17:28:11,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 17:28:11,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 49. [2018-12-03 17:28:11,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 17:28:11,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2018-12-03 17:28:11,860 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 16 [2018-12-03 17:28:11,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:11,860 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-12-03 17:28:11,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:28:11,861 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2018-12-03 17:28:11,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:28:11,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:11,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:11,862 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:11,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:11,863 INFO L82 PathProgramCache]: Analyzing trace with hash -619448807, now seen corresponding path program 1 times [2018-12-03 17:28:11,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:11,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:11,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:11,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:11,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:11,922 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 17:28:11,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:11,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:28:11,923 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:11,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:11,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:11,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:11,924 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand 3 states. [2018-12-03 17:28:11,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:11,974 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2018-12-03 17:28:11,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:11,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:28:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:11,976 INFO L225 Difference]: With dead ends: 69 [2018-12-03 17:28:11,976 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 17:28:11,977 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 17:28:11,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 17:28:11,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 17:28:11,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 17:28:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2018-12-03 17:28:11,989 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 16 [2018-12-03 17:28:11,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:11,989 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2018-12-03 17:28:11,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2018-12-03 17:28:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 17:28:11,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:11,991 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:11,991 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:11,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:11,992 INFO L82 PathProgramCache]: Analyzing trace with hash -831333387, now seen corresponding path program 1 times [2018-12-03 17:28:11,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:11,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:11,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:11,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:11,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:12,088 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 17:28:12,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:12,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:28:12,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:12,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:12,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:12,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:12,091 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 3 states. [2018-12-03 17:28:12,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:12,151 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2018-12-03 17:28:12,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:12,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 17:28:12,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:12,153 INFO L225 Difference]: With dead ends: 77 [2018-12-03 17:28:12,153 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 17:28:12,154 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 17:28:12,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 17:28:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 17:28:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 17:28:12,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2018-12-03 17:28:12,166 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 30 [2018-12-03 17:28:12,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:12,167 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-12-03 17:28:12,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:12,167 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-12-03 17:28:12,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 17:28:12,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:12,169 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 17:28:12,169 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:12,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:12,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1089498825, now seen corresponding path program 1 times [2018-12-03 17:28:12,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:12,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:12,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:12,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:12,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:12,270 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 17:28:12,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:12,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:28:12,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:12,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:12,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:12,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:12,272 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 3 states. [2018-12-03 17:28:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:12,339 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2018-12-03 17:28:12,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:12,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 17:28:12,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:12,340 INFO L225 Difference]: With dead ends: 77 [2018-12-03 17:28:12,341 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 17:28:12,341 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 17:28:12,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 17:28:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 17:28:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 17:28:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2018-12-03 17:28:12,353 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 30 [2018-12-03 17:28:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:12,354 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-12-03 17:28:12,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-12-03 17:28:12,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 17:28:12,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:12,355 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 17:28:12,356 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:12,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:12,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1482525835, now seen corresponding path program 1 times [2018-12-03 17:28:12,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:12,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:12,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:12,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:12,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:12,526 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 17:28:12,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:12,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:12,529 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-03 17:28:12,531 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 17:28:12,630 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:28:12,630 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:28:13,887 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:28:23,524 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctDomainState.numVarIndex(OctDomainState.java:1167) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctDomainState.assumeNumericVarInterval(OctDomainState.java:1086) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctAssumeProcessor.lambda$18(OctAssumeProcessor.java:643) at java.util.ArrayList.forEach(ArrayList.java:1257) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctAssumeProcessor.processAffineLtZero(OctAssumeProcessor.java:643) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctAssumeProcessor.processNumericRelationWithoutIfs(OctAssumeProcessor.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctAssumeProcessor.processNumericRelation(OctAssumeProcessor.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctAssumeProcessor.processBooleanOperations(OctAssumeProcessor.java:168) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctAssumeProcessor.assumeAnd(OctAssumeProcessor.java:215) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctAssumeProcessor.processBooleanOperations(OctAssumeProcessor.java:149) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctAssumeProcessor.assume(OctAssumeProcessor.java:98) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctStatementProcessor.processStatement(OctStatementProcessor.java:68) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctPostOperator.apply(OctPostOperator.java:202) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctPostOperator.apply(OctPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainToolkit.handleStatementBySubdomain(ArrayDomainToolkit.java:159) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainToolkit.handleAssumptionBySubdomain(ArrayDomainToolkit.java:148) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainExpressionProcessor.processAssume(ArrayDomainExpressionProcessor.java:89) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainStatementProcessor.processAssume(ArrayDomainStatementProcessor.java:62) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainStatementProcessor.process(ArrayDomainStatementProcessor.java:45) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainPostOperator.handleInternalTransition(ArrayDomainPostOperator.java:120) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainPostOperator.apply(ArrayDomainPostOperator.java:70) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainPostOperator.apply(ArrayDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:536) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:220) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) ... 20 more [2018-12-03 17:28:23,529 INFO L168 Benchmark]: Toolchain (without parser) took 13876.19 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -345.9 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-12-03 17:28:23,531 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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 17:28:23,533 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.52 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 17:28:23,534 INFO L168 Benchmark]: Boogie Preprocessor took 62.23 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 17:28:23,535 INFO L168 Benchmark]: RCFGBuilder took 716.35 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-03 17:28:23,536 INFO L168 Benchmark]: TraceAbstraction took 13042.82 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -388.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-12-03 17:28:23,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.21 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 49.52 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 62.23 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 716.35 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13042.82 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -388.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.NullPointerException de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.NullPointerException: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...