java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:47:11,380 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:47:11,381 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:47:11,396 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:47:11,397 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:47:11,398 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:47:11,399 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:47:11,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:47:11,403 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:47:11,403 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:47:11,404 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:47:11,404 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:47:11,405 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:47:11,406 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:47:11,407 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:47:11,408 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:47:11,409 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:47:11,411 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:47:11,413 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:47:11,414 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:47:11,416 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:47:11,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:47:11,422 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:47:11,422 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:47:11,423 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:47:11,424 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:47:11,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:47:11,428 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:47:11,428 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:47:11,429 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:47:11,430 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:47:11,430 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:47:11,431 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:47:11,434 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:47:11,435 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:47:11,436 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:47:11,436 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 12:47:11,462 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:47:11,462 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:47:11,463 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:47:11,463 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:47:11,464 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:47:11,464 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:47:11,464 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:47:11,465 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:47:11,465 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:47:11,465 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:47:11,465 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:47:11,465 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:47:11,465 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:47:11,466 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:47:11,466 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:47:11,466 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:47:11,466 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:47:11,466 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:47:11,467 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:47:11,467 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:47:11,467 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:47:11,467 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:47:11,467 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:47:11,468 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:47:11,468 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:47:11,468 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:47:11,468 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:47:11,468 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:47:11,469 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:47:11,469 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:47:11,469 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:47:11,527 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:47:11,539 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:47:11,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:47:11,545 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:47:11,546 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:47:11,547 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl [2018-10-04 12:47:11,547 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2018-10-04 12:47:11,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:47:11,628 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:47:11,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:47:11,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:47:11,631 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:47:11,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:11" (1/1) ... [2018-10-04 12:47:11,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:11" (1/1) ... [2018-10-04 12:47:11,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:47:11,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:47:11,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:47:11,680 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:47:11,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:11" (1/1) ... [2018-10-04 12:47:11,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:11" (1/1) ... [2018-10-04 12:47:11,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:11" (1/1) ... [2018-10-04 12:47:11,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:11" (1/1) ... [2018-10-04 12:47:11,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:11" (1/1) ... [2018-10-04 12:47:11,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:11" (1/1) ... [2018-10-04 12:47:11,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:11" (1/1) ... [2018-10-04 12:47:11,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:47:11,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:47:11,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:47:11,707 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:47:11,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:11" (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-10-04 12:47:11,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:47:11,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:47:12,040 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:47:12,041 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:47:12 BoogieIcfgContainer [2018-10-04 12:47:12,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:47:12,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:47:12,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:47:12,046 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:47:12,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:11" (1/2) ... [2018-10-04 12:47:12,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16cf16e0 and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:47:12, skipping insertion in model container [2018-10-04 12:47:12,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:47:12" (2/2) ... [2018-10-04 12:47:12,050 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2018-10-04 12:47:12,060 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:47:12,068 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:47:12,161 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:47:12,162 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:47:12,162 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:47:12,162 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:47:12,163 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:47:12,163 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:47:12,163 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:47:12,163 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:47:12,163 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:47:12,187 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-10-04 12:47:12,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 12:47:12,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:12,203 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-04 12:47:12,205 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:12,217 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:12,218 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-10-04 12:47:12,222 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:12,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:12,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:12,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:47:12,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:12,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:47:12,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:47:12,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:47:12,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:47:12,413 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:12,415 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-10-04 12:47:12,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:12,454 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2018-10-04 12:47:12,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:47:12,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-10-04 12:47:12,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:12,469 INFO L225 Difference]: With dead ends: 17 [2018-10-04 12:47:12,469 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 12:47:12,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:47:12,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 12:47:12,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 12:47:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 12:47:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-10-04 12:47:12,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 6 [2018-10-04 12:47:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:12,511 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-10-04 12:47:12,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:47:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-10-04 12:47:12,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:47:12,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:12,512 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:47:12,512 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:12,512 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:12,513 INFO L82 PathProgramCache]: Analyzing trace with hash 198621957, now seen corresponding path program 1 times [2018-10-04 12:47:12,513 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:12,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:12,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:12,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:47:12,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:12,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:12,591 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:47:12,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:47:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:12,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:12,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:12,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 12:47:12,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:47:12,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:47:12,760 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:12,760 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 4 states. [2018-10-04 12:47:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:12,798 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-10-04 12:47:12,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:47:12,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-04 12:47:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:12,799 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:47:12,799 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 12:47:12,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 2 [2018-10-04 12:47:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 12:47:12,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 12:47:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 12:47:12,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-10-04 12:47:12,805 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2018-10-04 12:47:12,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:12,805 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-10-04 12:47:12,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:47:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-10-04 12:47:12,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:47:12,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:12,806 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-10-04 12:47:12,807 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:12,807 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:12,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1946764223, now seen corresponding path program 2 times [2018-10-04 12:47:12,807 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:12,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:12,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:12,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:47:12,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:12,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:12,940 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:47:12,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:47:12,970 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-04 12:47:12,970 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:47:12,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 12:47:13,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:47:13,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-04 12:47:13,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:47:13,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:47:13,143 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:13,143 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 7 states. [2018-10-04 12:47:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:13,510 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-10-04 12:47:13,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:47:13,511 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-10-04 12:47:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:13,512 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:47:13,512 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 12:47:13,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 7 [2018-10-04 12:47:13,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 12:47:13,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-10-04 12:47:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 12:47:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-10-04 12:47:13,520 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2018-10-04 12:47:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:13,520 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-10-04 12:47:13,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:47:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-10-04 12:47:13,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:47:13,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:13,521 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:47:13,522 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:13,522 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:13,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1085907505, now seen corresponding path program 1 times [2018-10-04 12:47:13,523 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:13,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:13,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:13,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:47:13,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:47:13,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:13,613 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:47:13,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:47:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:13,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:47:13,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:13,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:47:13,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:47:13,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:47:13,747 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:13,748 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 6 states. [2018-10-04 12:47:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:13,864 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-10-04 12:47:13,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:47:13,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-04 12:47:13,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:13,872 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:47:13,872 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 12:47:13,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 4 [2018-10-04 12:47:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 12:47:13,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 12:47:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 12:47:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-10-04 12:47:13,878 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2018-10-04 12:47:13,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:13,878 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-10-04 12:47:13,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:47:13,879 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-10-04 12:47:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:47:13,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:13,880 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:47:13,880 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:13,880 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:13,880 INFO L82 PathProgramCache]: Analyzing trace with hash -366375799, now seen corresponding path program 2 times [2018-10-04 12:47:13,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:13,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:13,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:13,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:47:13,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:47:13,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:13,981 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:47:13,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:47:14,025 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:47:14,025 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:47:14,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:14,093 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:47:14,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:14,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:47:14,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:47:14,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:47:14,115 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:14,116 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 7 states. [2018-10-04 12:47:14,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:14,148 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-10-04 12:47:14,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:47:14,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-10-04 12:47:14,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:14,149 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:47:14,149 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:47:14,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 12:47:14,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:47:14,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 12:47:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 12:47:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-10-04 12:47:14,156 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 18 [2018-10-04 12:47:14,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:14,157 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-10-04 12:47:14,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:47:14,157 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-10-04 12:47:14,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:47:14,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:14,158 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:47:14,158 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:14,158 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:14,159 INFO L82 PathProgramCache]: Analyzing trace with hash -386140989, now seen corresponding path program 3 times [2018-10-04 12:47:14,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:14,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:14,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:14,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:47:14,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:14,304 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-04 12:47:14,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:47:14,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:47:14,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:47:14,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:47:14,307 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:14,307 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-10-04 12:47:14,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:14,456 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-10-04 12:47:14,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:47:14,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-10-04 12:47:14,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:14,457 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:47:14,458 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:47:14,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 4 [2018-10-04 12:47:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:47:14,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-10-04 12:47:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 12:47:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-10-04 12:47:14,464 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2018-10-04 12:47:14,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:14,464 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-10-04 12:47:14,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:47:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-10-04 12:47:14,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:47:14,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:14,466 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:47:14,466 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:14,466 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:14,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1646565475, now seen corresponding path program 1 times [2018-10-04 12:47:14,466 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:14,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:14,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:14,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:47:14,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:14,533 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-04 12:47:14,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:14,534 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:47:14,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:47:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:14,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-04 12:47:15,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:15,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-04 12:47:15,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:47:15,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:47:15,253 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:15,253 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 9 states. [2018-10-04 12:47:15,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:15,623 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-10-04 12:47:15,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:47:15,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-10-04 12:47:15,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:15,625 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:47:15,625 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:47:15,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.3s impTime 8 [2018-10-04 12:47:15,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:47:15,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 12:47:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 12:47:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-10-04 12:47:15,634 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2018-10-04 12:47:15,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:15,635 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-10-04 12:47:15,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:47:15,635 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-10-04 12:47:15,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 12:47:15,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:15,636 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1] [2018-10-04 12:47:15,636 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:15,637 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:15,637 INFO L82 PathProgramCache]: Analyzing trace with hash 231899811, now seen corresponding path program 2 times [2018-10-04 12:47:15,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:15,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:15,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:15,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:47:15,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:15,738 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-04 12:47:15,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:47:15,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:47:15,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:47:15,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:47:15,739 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:15,739 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-10-04 12:47:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:15,781 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-10-04 12:47:15,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:47:15,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-10-04 12:47:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:15,782 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:47:15,782 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:47:15,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 12:47:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:47:15,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 12:47:15,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 12:47:15,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-10-04 12:47:15,792 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2018-10-04 12:47:15,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:15,792 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-10-04 12:47:15,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:47:15,792 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-10-04 12:47:15,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:47:15,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:15,793 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 3, 3, 3, 1, 1, 1, 1] [2018-10-04 12:47:15,794 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:15,794 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:15,794 INFO L82 PathProgramCache]: Analyzing trace with hash 2097831421, now seen corresponding path program 3 times [2018-10-04 12:47:15,794 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:15,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:15,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:15,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:47:15,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:15,934 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-04 12:47:15,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:15,935 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:47:15,943 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:47:15,963 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-04 12:47:15,963 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:47:15,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:15,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:47:15,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:47:16,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-04 12:47:16,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-10-04 12:47:16,242 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:47:16,244 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Cannot provide value for term c_ULTIMATE.start_main_~array~7 of sort (Array Int Int) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.getValue(Scriptor.java:183) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.getValue(WrapperScript.java:146) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.PredicateTrie.compare(PredicateTrie.java:184) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.PredicateTrie.unifyPredicate(PredicateTrie.java:110) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicateInternal(BPredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) 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:429) 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:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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) [2018-10-04 12:47:16,249 INFO L168 Benchmark]: Toolchain (without parser) took 4623.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 224.7 MB). Peak memory consumption was 224.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:47:16,251 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:47:16,251 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:47:16,252 INFO L168 Benchmark]: Boogie Preprocessor took 26.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:47:16,252 INFO L168 Benchmark]: RCFGBuilder took 334.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:47:16,254 INFO L168 Benchmark]: TraceAbstraction took 4205.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 203.6 MB). Peak memory consumption was 203.6 MB. Max. memory is 7.1 GB. [2018-10-04 12:47:16,258 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 334.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4205.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 203.6 MB). Peak memory consumption was 203.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Cannot provide value for term c_ULTIMATE.start_main_~array~7 of sort (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Cannot provide value for term c_ULTIMATE.start_main_~array~7 of sort (Array Int Int): de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.getValue(Scriptor.java:183) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/eureka_05.i_5.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-47-16-271.csv Received shutdown request...