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-1cc990c [2018-10-01 00:42:15,034 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:42:15,037 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:42:15,051 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:42:15,052 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:42:15,053 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:42:15,054 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:42:15,058 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:42:15,060 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:42:15,062 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:42:15,063 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:42:15,063 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:42:15,066 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:42:15,067 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:42:15,069 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:42:15,069 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:42:15,070 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:42:15,080 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:42:15,083 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:42:15,086 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:42:15,088 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:42:15,090 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:42:15,092 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:42:15,092 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:42:15,092 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:42:15,093 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:42:15,095 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:42:15,096 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:42:15,098 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:42:15,100 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:42:15,100 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:42:15,101 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:42:15,101 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:42:15,101 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:42:15,103 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:42:15,103 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:42:15,104 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-01 00:42:15,128 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:42:15,128 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:42:15,129 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:42:15,129 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:42:15,130 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:42:15,130 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:42:15,130 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:42:15,130 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:42:15,131 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:42:15,131 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:42:15,131 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:42:15,131 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:42:15,134 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:42:15,134 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:42:15,134 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:42:15,134 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:42:15,135 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:42:15,135 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:42:15,135 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:42:15,135 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:42:15,135 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:42:15,136 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:42:15,136 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:42:15,136 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:42:15,136 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:42:15,137 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:42:15,138 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:42:15,138 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:42:15,138 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:42:15,138 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:42:15,139 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:42:15,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:42:15,201 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:42:15,206 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:42:15,207 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:42:15,208 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:42:15,209 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-01 00:42:15,209 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2018-10-01 00:42:15,269 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:42:15,275 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:42:15,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:42:15,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:42:15,276 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:42:15,295 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 01.10 12:42:15" (1/1) ... [2018-10-01 00:42:15,313 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 01.10 12:42:15" (1/1) ... [2018-10-01 00:42:15,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:42:15,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:42:15,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:42:15,322 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:42:15,333 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 01.10 12:42:15" (1/1) ... [2018-10-01 00:42:15,333 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 01.10 12:42:15" (1/1) ... [2018-10-01 00:42:15,335 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 01.10 12:42:15" (1/1) ... [2018-10-01 00:42:15,335 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 01.10 12:42:15" (1/1) ... [2018-10-01 00:42:15,341 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 01.10 12:42:15" (1/1) ... [2018-10-01 00:42:15,349 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 01.10 12:42:15" (1/1) ... [2018-10-01 00:42:15,350 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 01.10 12:42:15" (1/1) ... [2018-10-01 00:42:15,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:42:15,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:42:15,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:42:15,357 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:42:15,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:42:15" (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-01 00:42:15,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:42:15,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:42:15,729 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:42:15,730 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:42:15 BoogieIcfgContainer [2018-10-01 00:42:15,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:42:15,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:42:15,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:42:15,735 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:42:15,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:42:15" (1/2) ... [2018-10-01 00:42:15,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3daad2b6 and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:42:15, skipping insertion in model container [2018-10-01 00:42:15,737 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 01.10 12:42:15" (2/2) ... [2018-10-01 00:42:15,739 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2018-10-01 00:42:15,749 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:42:15,757 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:42:15,860 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:42:15,861 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:42:15,861 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:42:15,861 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:42:15,862 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:42:15,862 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:42:15,862 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:42:15,862 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:42:15,866 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:42:15,901 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-10-01 00:42:15,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-01 00:42:15,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:15,917 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-01 00:42:15,919 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:15,935 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:15,936 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-10-01 00:42:15,944 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:15,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:15,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:15,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:15,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:16,114 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-01 00:42:16,117 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:42:16,117 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:42:16,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:42:16,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:42:16,133 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:16,134 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-10-01 00:42:16,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:16,236 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2018-10-01 00:42:16,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:42:16,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-10-01 00:42:16,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:16,250 INFO L225 Difference]: With dead ends: 17 [2018-10-01 00:42:16,251 INFO L226 Difference]: Without dead ends: 11 [2018-10-01 00:42:16,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:42:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-01 00:42:16,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-01 00:42:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-01 00:42:16,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-10-01 00:42:16,292 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 6 [2018-10-01 00:42:16,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:16,293 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-10-01 00:42:16,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:42:16,293 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-10-01 00:42:16,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:42:16,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:16,294 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-10-01 00:42:16,294 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:16,294 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:16,295 INFO L82 PathProgramCache]: Analyzing trace with hash 198621957, now seen corresponding path program 1 times [2018-10-01 00:42:16,295 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:16,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:16,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:16,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:16,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:16,367 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-01 00:42:16,368 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:16,368 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-01 00:42:16,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:16,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:16,464 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-01 00:42:16,484 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:16,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-01 00:42:16,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:42:16,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:42:16,486 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:16,486 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 4 states. [2018-10-01 00:42:16,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:16,546 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-10-01 00:42:16,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:42:16,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-01 00:42:16,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:16,549 INFO L225 Difference]: With dead ends: 19 [2018-10-01 00:42:16,549 INFO L226 Difference]: Without dead ends: 13 [2018-10-01 00:42:16,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:42:16,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-01 00:42:16,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-01 00:42:16,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-01 00:42:16,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-10-01 00:42:16,554 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2018-10-01 00:42:16,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:16,554 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-10-01 00:42:16,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:42:16,555 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-10-01 00:42:16,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:42:16,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:16,556 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-10-01 00:42:16,556 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:16,556 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:16,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1946764223, now seen corresponding path program 2 times [2018-10-01 00:42:16,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:16,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:16,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:16,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:16,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:16,631 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-01 00:42:16,631 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:16,631 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-01 00:42:16,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:42:16,677 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-01 00:42:16,677 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:16,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:16,905 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-01 00:42:16,932 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:42:16,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-01 00:42:16,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:42:16,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:42:16,934 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:16,935 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 7 states. [2018-10-01 00:42:17,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:17,487 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-10-01 00:42:17,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:42:17,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-10-01 00:42:17,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:17,489 INFO L225 Difference]: With dead ends: 25 [2018-10-01 00:42:17,490 INFO L226 Difference]: Without dead ends: 19 [2018-10-01 00:42:17,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:42:17,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-01 00:42:17,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-10-01 00:42:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-01 00:42:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-10-01 00:42:17,498 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2018-10-01 00:42:17,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:17,498 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-10-01 00:42:17,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:42:17,499 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-10-01 00:42:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:42:17,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:17,500 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:42:17,501 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:17,501 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:17,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1085907505, now seen corresponding path program 1 times [2018-10-01 00:42:17,502 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:17,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:17,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:17,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:17,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:17,581 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-01 00:42:17,581 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:17,582 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-01 00:42:17,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:17,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:17,671 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-01 00:42:17,694 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:17,695 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-01 00:42:17,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:42:17,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:42:17,696 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:17,696 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 6 states. [2018-10-01 00:42:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:18,122 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-10-01 00:42:18,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:42:18,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-01 00:42:18,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:18,124 INFO L225 Difference]: With dead ends: 27 [2018-10-01 00:42:18,124 INFO L226 Difference]: Without dead ends: 19 [2018-10-01 00:42:18,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:42:18,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-01 00:42:18,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-01 00:42:18,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-01 00:42:18,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-10-01 00:42:18,130 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2018-10-01 00:42:18,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:18,130 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-10-01 00:42:18,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:42:18,131 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-10-01 00:42:18,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:42:18,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:18,132 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:42:18,132 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:18,132 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:18,133 INFO L82 PathProgramCache]: Analyzing trace with hash -366375799, now seen corresponding path program 2 times [2018-10-01 00:42:18,133 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:18,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:18,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:18,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:18,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:18,250 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-01 00:42:18,250 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:18,251 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-01 00:42:18,259 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:42:18,299 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:42:18,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:18,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:18,373 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-01 00:42:18,393 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:18,394 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-01 00:42:18,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:42:18,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:42:18,395 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:18,395 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 7 states. [2018-10-01 00:42:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:18,480 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-10-01 00:42:18,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:42:18,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-10-01 00:42:18,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:18,483 INFO L225 Difference]: With dead ends: 29 [2018-10-01 00:42:18,484 INFO L226 Difference]: Without dead ends: 21 [2018-10-01 00:42:18,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:42:18,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-01 00:42:18,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-01 00:42:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-01 00:42:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-10-01 00:42:18,490 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 18 [2018-10-01 00:42:18,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:18,490 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-10-01 00:42:18,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:42:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-10-01 00:42:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:42:18,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:18,492 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:42:18,492 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:18,492 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:18,492 INFO L82 PathProgramCache]: Analyzing trace with hash -386140989, now seen corresponding path program 3 times [2018-10-01 00:42:18,492 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:18,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:18,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:18,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:18,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:18,624 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-01 00:42:18,624 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:42:18,624 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:42:18,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:42:18,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:42:18,625 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:18,625 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-10-01 00:42:18,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:18,815 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-10-01 00:42:18,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:42:18,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-10-01 00:42:18,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:18,817 INFO L225 Difference]: With dead ends: 31 [2018-10-01 00:42:18,817 INFO L226 Difference]: Without dead ends: 25 [2018-10-01 00:42:18,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:42:18,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-01 00:42:18,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-10-01 00:42:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-01 00:42:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-10-01 00:42:18,825 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2018-10-01 00:42:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:18,826 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-10-01 00:42:18,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:42:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-10-01 00:42:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-01 00:42:18,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:18,827 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:42:18,828 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:18,828 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:18,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1646565475, now seen corresponding path program 1 times [2018-10-01 00:42:18,828 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:18,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:18,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:18,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:18,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:19,031 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-01 00:42:19,032 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:19,032 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-01 00:42:19,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:19,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:19,205 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-01 00:42:19,232 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:19,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-01 00:42:19,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:42:19,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:42:19,234 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:19,234 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 9 states. [2018-10-01 00:42:19,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:19,690 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-10-01 00:42:19,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:42:19,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-10-01 00:42:19,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:19,692 INFO L225 Difference]: With dead ends: 39 [2018-10-01 00:42:19,692 INFO L226 Difference]: Without dead ends: 33 [2018-10-01 00:42:19,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:42:19,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-01 00:42:19,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-01 00:42:19,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-01 00:42:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-10-01 00:42:19,702 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2018-10-01 00:42:19,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:19,702 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-10-01 00:42:19,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:42:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-10-01 00:42:19,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-01 00:42:19,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:19,704 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1] [2018-10-01 00:42:19,704 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:19,704 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:19,704 INFO L82 PathProgramCache]: Analyzing trace with hash 231899811, now seen corresponding path program 2 times [2018-10-01 00:42:19,705 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:19,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:19,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:19,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:19,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:19,772 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-01 00:42:19,772 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:42:19,772 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:42:19,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:42:19,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:42:19,773 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:19,773 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-10-01 00:42:19,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:19,847 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-10-01 00:42:19,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:42:19,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-10-01 00:42:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:19,848 INFO L225 Difference]: With dead ends: 47 [2018-10-01 00:42:19,848 INFO L226 Difference]: Without dead ends: 35 [2018-10-01 00:42:19,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:42:19,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-01 00:42:19,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-01 00:42:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-01 00:42:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-10-01 00:42:19,859 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2018-10-01 00:42:19,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:19,860 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-10-01 00:42:19,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:42:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-10-01 00:42:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:42:19,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:19,861 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 3, 3, 3, 1, 1, 1, 1] [2018-10-01 00:42:19,862 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:19,862 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:19,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2097831421, now seen corresponding path program 3 times [2018-10-01 00:42:19,862 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:19,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:19,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:19,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:19,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:20,086 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-01 00:42:20,088 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:20,088 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-01 00:42:20,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:42:20,152 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-01 00:42:20,153 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:20,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:20,209 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-01 00:42:20,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:42:20,311 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-01 00:42:20,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-10-01 00:42:20,554 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:20,555 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:189) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.PredicateTrie.unifyPredicate(PredicateTrie.java:135) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicateInternal(BPredicateUnifier.java:243) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:209) 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:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) 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:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) 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-01 00:42:20,559 INFO L168 Benchmark]: Toolchain (without parser) took 5289.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 298.7 MB). Peak memory consumption was 298.7 MB. Max. memory is 7.1 GB. [2018-10-01 00:42:20,561 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-01 00:42:20,561 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.22 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-01 00:42:20,562 INFO L168 Benchmark]: Boogie Preprocessor took 31.78 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-01 00:42:20,563 INFO L168 Benchmark]: RCFGBuilder took 373.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-01 00:42:20,564 INFO L168 Benchmark]: TraceAbstraction took 4826.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 277.5 MB). Peak memory consumption was 277.5 MB. Max. memory is 7.1 GB. [2018-10-01 00:42:20,568 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.19 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 45.22 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 31.78 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 373.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4826.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 277.5 MB). Peak memory consumption was 277.5 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-01_00-42-20-581.csv Received shutdown request...