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/array4.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:24:57,036 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:24:57,038 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:24:57,052 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:24:57,052 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:24:57,053 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:24:57,055 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:24:57,057 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:24:57,058 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:24:57,059 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:24:57,062 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:24:57,063 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:24:57,064 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:24:57,065 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:24:57,068 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:24:57,068 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:24:57,071 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:24:57,073 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:24:57,080 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:24:57,084 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:24:57,085 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:24:57,092 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:24:57,094 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:24:57,094 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:24:57,094 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:24:57,095 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:24:57,100 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:24:57,101 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:24:57,102 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:24:57,103 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:24:57,103 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:24:57,104 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:24:57,104 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:24:57,104 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:24:57,105 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:24:57,106 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:24:57,106 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 14:24:57,121 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:24:57,121 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:24:57,122 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:24:57,122 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:24:57,122 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:24:57,123 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:24:57,123 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:24:57,123 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:24:57,123 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:24:57,124 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:24:57,124 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:24:57,124 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:24:57,124 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:24:57,124 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:24:57,125 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:24:57,125 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:24:57,125 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:24:57,125 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:24:57,125 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:24:57,126 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:24:57,126 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:24:57,126 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:24:57,126 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:24:57,126 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:24:57,127 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:24:57,127 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:24:57,127 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:24:57,127 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:24:57,127 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:24:57,128 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:24:57,129 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:24:57,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:24:57,195 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:24:57,199 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:24:57,201 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:24:57,201 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:24:57,202 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl [2018-10-04 14:24:57,202 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl' [2018-10-04 14:24:57,255 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:24:57,256 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:24:57,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:24:57,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:24:57,258 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:24:57,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (1/1) ... [2018-10-04 14:24:57,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (1/1) ... [2018-10-04 14:24:57,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:24:57,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:24:57,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:24:57,301 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:24:57,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (1/1) ... [2018-10-04 14:24:57,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (1/1) ... [2018-10-04 14:24:57,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (1/1) ... [2018-10-04 14:24:57,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (1/1) ... [2018-10-04 14:24:57,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (1/1) ... [2018-10-04 14:24:57,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (1/1) ... [2018-10-04 14:24:57,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (1/1) ... [2018-10-04 14:24:57,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:24:57,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:24:57,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:24:57,322 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:24:57,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (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 14:24:57,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 14:24:57,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 14:24:57,613 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 14:24:57,614 INFO L202 PluginConnector]: Adding new model array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:24:57 BoogieIcfgContainer [2018-10-04 14:24:57,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:24:57,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:24:57,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:24:57,619 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:24:57,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (1/2) ... [2018-10-04 14:24:57,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a59fe6 and model type array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:24:57, skipping insertion in model container [2018-10-04 14:24:57,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:24:57" (2/2) ... [2018-10-04 14:24:57,622 INFO L112 eAbstractionObserver]: Analyzing ICFG array4.i_4.bpl [2018-10-04 14:24:57,632 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:24:57,640 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:24:57,687 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:24:57,687 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:24:57,688 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:24:57,688 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:24:57,688 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:24:57,688 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:24:57,688 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:24:57,689 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:24:57,689 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:24:57,703 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-10-04 14:24:57,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 14:24:57,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:57,711 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-04 14:24:57,712 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:57,719 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:57,719 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-10-04 14:24:57,722 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:57,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:57,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:57,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:57,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:57,859 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 14:24:57,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:24:57,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:24:57,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:24:57,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:24:57,878 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:57,880 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-10-04 14:24:57,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:57,971 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-10-04 14:24:57,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:24:57,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-10-04 14:24:57,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:57,985 INFO L225 Difference]: With dead ends: 17 [2018-10-04 14:24:57,985 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 14:24:57,988 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 14:24:58,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 14:24:58,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 14:24:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 14:24:58,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-10-04 14:24:58,026 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2018-10-04 14:24:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:58,027 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-10-04 14:24:58,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:24:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-10-04 14:24:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:24:58,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:58,028 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 14:24:58,028 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:58,028 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:58,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2018-10-04 14:24:58,029 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:58,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:58,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:58,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:58,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:58,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 14:24:58,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:58,168 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 14:24:58,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:58,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 14:24:58,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:58,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 14:24:58,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:24:58,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:24:58,290 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:58,291 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 4 states. [2018-10-04 14:24:58,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:58,348 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-10-04 14:24:58,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:24:58,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-10-04 14:24:58,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:58,350 INFO L225 Difference]: With dead ends: 21 [2018-10-04 14:24:58,351 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 14:24:58,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 2 [2018-10-04 14:24:58,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 14:24:58,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 14:24:58,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 14:24:58,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-10-04 14:24:58,357 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-10-04 14:24:58,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:58,357 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-10-04 14:24:58,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:24:58,358 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-10-04 14:24:58,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:24:58,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:58,358 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-10-04 14:24:58,359 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:58,359 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:58,359 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 2 times [2018-10-04 14:24:58,359 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:58,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:58,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:58,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:58,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:58,504 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 14:24:58,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:58,505 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 14:24:58,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:58,545 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:58,546 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:58,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 14:24:58,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:58,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 14:24:58,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:24:58,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:24:58,623 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:58,624 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2018-10-04 14:24:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:58,728 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-10-04 14:24:58,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:24:58,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-04 14:24:58,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:58,730 INFO L225 Difference]: With dead ends: 27 [2018-10-04 14:24:58,730 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 14:24:58,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 14:24:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 14:24:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 14:24:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 14:24:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-10-04 14:24:58,737 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-10-04 14:24:58,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:58,737 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-10-04 14:24:58,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:24:58,737 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-10-04 14:24:58,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:24:58,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:58,738 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-10-04 14:24:58,739 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:58,739 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:58,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1310275289, now seen corresponding path program 3 times [2018-10-04 14:24:58,739 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:58,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:58,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:58,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:58,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:59,003 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-04 14:24:59,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:59,004 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 14:24:59,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:24:59,069 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 14:24:59,069 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:59,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-04 14:24:59,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:59,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:24:59,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:24:59,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:24:59,170 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:59,170 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2018-10-04 14:24:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:59,222 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-10-04 14:24:59,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:24:59,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-10-04 14:24:59,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:59,223 INFO L225 Difference]: With dead ends: 33 [2018-10-04 14:24:59,223 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 14:24:59,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 4 [2018-10-04 14:24:59,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 14:24:59,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 14:24:59,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 14:24:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-10-04 14:24:59,229 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2018-10-04 14:24:59,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:59,230 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-10-04 14:24:59,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:24:59,231 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-10-04 14:24:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 14:24:59,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:59,232 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-10-04 14:24:59,232 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:59,232 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:59,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1731406235, now seen corresponding path program 4 times [2018-10-04 14:24:59,233 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:59,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:59,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:59,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:59,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:59,356 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-04 14:24:59,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:59,357 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 14:24:59,369 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:24:59,415 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:24:59,415 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:59,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-04 14:24:59,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:59,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:24:59,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:24:59,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:24:59,569 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:59,569 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2018-10-04 14:24:59,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:59,622 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-10-04 14:24:59,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:24:59,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-10-04 14:24:59,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:59,625 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:24:59,625 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 14:24:59,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 5 [2018-10-04 14:24:59,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 14:24:59,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 14:24:59,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 14:24:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-10-04 14:24:59,632 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2018-10-04 14:24:59,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:59,632 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-10-04 14:24:59,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:24:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-10-04 14:24:59,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 14:24:59,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:59,634 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-10-04 14:24:59,634 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:59,634 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:59,634 INFO L82 PathProgramCache]: Analyzing trace with hash 77451279, now seen corresponding path program 5 times [2018-10-04 14:24:59,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:59,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:59,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:59,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:59,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-04 14:24:59,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:59,752 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 14:24:59,762 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:24:59,785 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 14:24:59,785 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:59,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:59,849 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-04 14:24:59,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:59,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:24:59,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:24:59,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:24:59,874 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:59,874 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2018-10-04 14:25:00,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:00,173 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-10-04 14:25:00,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:25:00,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-10-04 14:25:00,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:00,176 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:25:00,176 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:25:00,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 14:25:00,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:25:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 14:25:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 14:25:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-10-04 14:25:00,187 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2018-10-04 14:25:00,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:00,187 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-10-04 14:25:00,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:25:00,187 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-10-04 14:25:00,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 14:25:00,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:00,189 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2018-10-04 14:25:00,190 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:00,191 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:00,191 INFO L82 PathProgramCache]: Analyzing trace with hash 422296707, now seen corresponding path program 6 times [2018-10-04 14:25:00,191 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:00,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:00,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:00,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:00,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-04 14:25:00,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:00,467 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 14:25:00,489 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:00,511 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:25:00,511 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:00,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:00,607 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-04 14:25:00,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:00,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2018-10-04 14:25:00,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:25:00,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:25:00,629 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:00,629 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 9 states. [2018-10-04 14:25:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:00,710 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-10-04 14:25:00,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:25:00,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-10-04 14:25:00,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:00,711 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:25:00,711 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:25:00,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 7 [2018-10-04 14:25:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:25:00,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 14:25:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 14:25:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-10-04 14:25:00,718 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-10-04 14:25:00,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:00,719 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-10-04 14:25:00,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:25:00,719 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-10-04 14:25:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 14:25:00,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:00,720 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-10-04 14:25:00,721 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:00,721 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:00,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1553862921, now seen corresponding path program 7 times [2018-10-04 14:25:00,721 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:00,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:00,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:00,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:00,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-04 14:25:00,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:00,942 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:00,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:00,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:01,212 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-04 14:25:01,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:01,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:25:01,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:25:01,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:25:01,235 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:01,235 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 10 states. [2018-10-04 14:25:01,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:01,388 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-10-04 14:25:01,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:25:01,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-10-04 14:25:01,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:01,390 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:25:01,390 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:25:01,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 8 [2018-10-04 14:25:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:25:01,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-04 14:25:01,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 14:25:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-10-04 14:25:01,397 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-10-04 14:25:01,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:01,398 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-10-04 14:25:01,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:25:01,398 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-10-04 14:25:01,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 14:25:01,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:01,399 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2018-10-04 14:25:01,399 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:01,400 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:01,400 INFO L82 PathProgramCache]: Analyzing trace with hash -783980693, now seen corresponding path program 8 times [2018-10-04 14:25:01,400 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:01,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:01,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:01,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:01,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-04 14:25:01,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:01,630 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:01,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:25:01,686 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:25:01,686 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:01,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-04 14:25:01,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:01,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:25:01,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:25:01,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:25:01,811 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:01,811 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2018-10-04 14:25:02,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:02,009 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-10-04 14:25:02,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:25:02,012 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-10-04 14:25:02,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:02,014 INFO L225 Difference]: With dead ends: 63 [2018-10-04 14:25:02,014 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:25:02,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 9 [2018-10-04 14:25:02,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:25:02,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 14:25:02,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 14:25:02,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-10-04 14:25:02,021 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 38 [2018-10-04 14:25:02,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:02,021 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-10-04 14:25:02,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:25:02,021 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-10-04 14:25:02,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 14:25:02,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:02,023 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-10-04 14:25:02,023 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:02,023 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:02,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1067768353, now seen corresponding path program 9 times [2018-10-04 14:25:02,024 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:02,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:02,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:02,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:02,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-04 14:25:02,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:02,216 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:02,225 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:02,368 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-04 14:25:02,368 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:02,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-04 14:25:02,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:02,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 14:25:02,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 14:25:02,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 14:25:02,611 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:02,611 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 12 states. [2018-10-04 14:25:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:02,682 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-10-04 14:25:02,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:25:02,683 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-10-04 14:25:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:02,684 INFO L225 Difference]: With dead ends: 69 [2018-10-04 14:25:02,684 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:25:02,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 10 [2018-10-04 14:25:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:25:02,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-04 14:25:02,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-04 14:25:02,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-10-04 14:25:02,691 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 42 [2018-10-04 14:25:02,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:02,692 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-10-04 14:25:02,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 14:25:02,692 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-10-04 14:25:02,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 14:25:02,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:02,693 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2018-10-04 14:25:02,694 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:02,694 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:02,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431059, now seen corresponding path program 10 times [2018-10-04 14:25:02,694 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:02,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:02,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:02,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:02,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-04 14:25:02,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:02,861 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:02,869 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:02,904 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:02,905 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:02,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-04 14:25:03,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:03,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-04 14:25:03,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:25:03,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:25:03,022 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:03,023 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 13 states. [2018-10-04 14:25:03,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:03,127 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-10-04 14:25:03,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:25:03,127 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-10-04 14:25:03,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:03,128 INFO L225 Difference]: With dead ends: 75 [2018-10-04 14:25:03,129 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:25:03,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 11 [2018-10-04 14:25:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:25:03,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-04 14:25:03,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 14:25:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-10-04 14:25:03,135 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2018-10-04 14:25:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:03,136 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-10-04 14:25:03,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:25:03,136 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-10-04 14:25:03,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-04 14:25:03,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:03,137 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2018-10-04 14:25:03,137 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:03,138 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:03,138 INFO L82 PathProgramCache]: Analyzing trace with hash -2051967801, now seen corresponding path program 11 times [2018-10-04 14:25:03,138 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:03,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:03,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:03,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:03,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:03,286 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-04 14:25:03,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:03,287 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:03,296 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:25:03,351 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-04 14:25:03,351 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:03,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:03,428 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-04 14:25:03,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:03,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 14:25:03,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:25:03,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:25:03,450 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:03,450 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 14 states. [2018-10-04 14:25:03,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:03,608 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-10-04 14:25:03,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:25:03,609 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-10-04 14:25:03,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:03,610 INFO L225 Difference]: With dead ends: 81 [2018-10-04 14:25:03,610 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:25:03,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-04 14:25:03,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:25:03,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-04 14:25:03,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 14:25:03,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-10-04 14:25:03,619 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2018-10-04 14:25:03,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:03,619 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-10-04 14:25:03,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:25:03,619 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-10-04 14:25:03,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 14:25:03,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:03,621 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2018-10-04 14:25:03,621 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:03,621 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:03,621 INFO L82 PathProgramCache]: Analyzing trace with hash 75236667, now seen corresponding path program 12 times [2018-10-04 14:25:03,621 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:03,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:03,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:03,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:03,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-04 14:25:03,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:03,825 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:03,834 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:03,903 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 14:25:03,904 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:03,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:04,056 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-04 14:25:04,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:04,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 15 [2018-10-04 14:25:04,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:25:04,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:25:04,077 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:04,077 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 15 states. [2018-10-04 14:25:04,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:04,187 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2018-10-04 14:25:04,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:25:04,187 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-10-04 14:25:04,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:04,188 INFO L225 Difference]: With dead ends: 87 [2018-10-04 14:25:04,188 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:25:04,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 13 [2018-10-04 14:25:04,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:25:04,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-04 14:25:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 14:25:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-10-04 14:25:04,195 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-10-04 14:25:04,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:04,195 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-10-04 14:25:04,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:25:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-10-04 14:25:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 14:25:04,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:04,196 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2018-10-04 14:25:04,196 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:04,196 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:04,196 INFO L82 PathProgramCache]: Analyzing trace with hash 361552815, now seen corresponding path program 13 times [2018-10-04 14:25:04,197 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:04,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:04,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:04,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:04,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-10-04 14:25:04,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:04,426 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:04,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:04,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-10-04 14:25:04,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:04,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 14:25:04,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:25:04,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:25:04,670 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:04,670 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 16 states. [2018-10-04 14:25:04,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:04,834 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-10-04 14:25:04,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:25:04,835 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-10-04 14:25:04,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:04,836 INFO L225 Difference]: With dead ends: 93 [2018-10-04 14:25:04,836 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 14:25:04,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 14 [2018-10-04 14:25:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 14:25:04,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-04 14:25:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 14:25:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-10-04 14:25:04,844 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 58 [2018-10-04 14:25:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:04,844 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-10-04 14:25:04,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:25:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-10-04 14:25:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 14:25:04,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:04,846 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1] [2018-10-04 14:25:04,846 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:04,846 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:04,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1008142301, now seen corresponding path program 14 times [2018-10-04 14:25:04,846 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:04,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:04,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:04,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:04,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:05,534 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-10-04 14:25:05,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:05,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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:05,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:25:05,578 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:25:05,579 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:05,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:05,729 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-10-04 14:25:05,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:05,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 14:25:05,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:25:05,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:25:05,751 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:05,751 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 17 states. [2018-10-04 14:25:05,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:05,864 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-10-04 14:25:05,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:25:05,865 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 62 [2018-10-04 14:25:05,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:05,865 INFO L225 Difference]: With dead ends: 99 [2018-10-04 14:25:05,865 INFO L226 Difference]: Without dead ends: 67 [2018-10-04 14:25:05,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 15 [2018-10-04 14:25:05,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-04 14:25:05,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-04 14:25:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 14:25:05,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-10-04 14:25:05,872 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2018-10-04 14:25:05,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:05,872 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-10-04 14:25:05,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:25:05,873 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-10-04 14:25:05,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 14:25:05,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:05,874 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2018-10-04 14:25:05,874 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:05,874 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:05,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1978312041, now seen corresponding path program 15 times [2018-10-04 14:25:05,875 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:05,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:05,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:05,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:05,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-10-04 14:25:06,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:06,162 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:06,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:06,283 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-04 14:25:06,283 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:06,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:06,410 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-10-04 14:25:06,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:06,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 14:25:06,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:25:06,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:25:06,431 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:06,431 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 18 states. [2018-10-04 14:25:06,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:06,686 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-10-04 14:25:06,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:25:06,686 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2018-10-04 14:25:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:06,687 INFO L225 Difference]: With dead ends: 105 [2018-10-04 14:25:06,687 INFO L226 Difference]: Without dead ends: 71 [2018-10-04 14:25:06,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 16 [2018-10-04 14:25:06,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-04 14:25:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-04 14:25:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-04 14:25:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-10-04 14:25:06,693 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 66 [2018-10-04 14:25:06,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:06,694 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-10-04 14:25:06,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:25:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-10-04 14:25:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-04 14:25:06,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:06,695 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1] [2018-10-04 14:25:06,695 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:06,696 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:06,696 INFO L82 PathProgramCache]: Analyzing trace with hash 303497995, now seen corresponding path program 16 times [2018-10-04 14:25:06,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:06,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:06,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:06,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:06,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-04 14:25:07,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:07,140 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:07,147 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:07,200 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:07,200 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:07,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-04 14:25:07,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:07,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-04 14:25:07,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:25:07,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:25:07,362 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:07,362 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 19 states. [2018-10-04 14:25:07,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:07,456 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2018-10-04 14:25:07,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 14:25:07,456 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2018-10-04 14:25:07,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:07,457 INFO L225 Difference]: With dead ends: 111 [2018-10-04 14:25:07,457 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 14:25:07,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 17 [2018-10-04 14:25:07,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 14:25:07,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-04 14:25:07,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-04 14:25:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-10-04 14:25:07,463 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 70 [2018-10-04 14:25:07,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:07,463 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-10-04 14:25:07,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:25:07,463 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-10-04 14:25:07,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-04 14:25:07,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:07,464 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2018-10-04 14:25:07,465 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:07,465 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:07,465 INFO L82 PathProgramCache]: Analyzing trace with hash -177016449, now seen corresponding path program 17 times [2018-10-04 14:25:07,465 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:07,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:07,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:07,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:07,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-10-04 14:25:08,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:08,405 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:08,413 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:25:08,473 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-04 14:25:08,474 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:08,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-10-04 14:25:08,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:08,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 14:25:08,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:25:08,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:25:08,775 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:08,775 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 20 states. [2018-10-04 14:25:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:09,160 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2018-10-04 14:25:09,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 14:25:09,161 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2018-10-04 14:25:09,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:09,162 INFO L225 Difference]: With dead ends: 117 [2018-10-04 14:25:09,162 INFO L226 Difference]: Without dead ends: 79 [2018-10-04 14:25:09,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.6s impTime 18 [2018-10-04 14:25:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-04 14:25:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-10-04 14:25:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-04 14:25:09,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-10-04 14:25:09,167 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2018-10-04 14:25:09,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:09,167 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-10-04 14:25:09,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:25:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-10-04 14:25:09,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-04 14:25:09,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:09,168 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1] [2018-10-04 14:25:09,169 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:09,169 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:09,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2100176371, now seen corresponding path program 18 times [2018-10-04 14:25:09,169 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:09,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:09,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:09,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:09,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-10-04 14:25:09,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:09,506 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:09,513 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:09,594 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 14:25:09,594 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:09,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:09,707 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-10-04 14:25:09,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:09,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 21 [2018-10-04 14:25:09,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 14:25:09,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 14:25:09,728 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:09,728 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 21 states. [2018-10-04 14:25:09,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:09,864 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2018-10-04 14:25:09,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:25:09,864 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2018-10-04 14:25:09,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:09,866 INFO L225 Difference]: With dead ends: 123 [2018-10-04 14:25:09,866 INFO L226 Difference]: Without dead ends: 83 [2018-10-04 14:25:09,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 19 [2018-10-04 14:25:09,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-04 14:25:09,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-10-04 14:25:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-04 14:25:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-10-04 14:25:09,872 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 78 [2018-10-04 14:25:09,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:09,872 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-10-04 14:25:09,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 14:25:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-10-04 14:25:09,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-04 14:25:09,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:09,874 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2018-10-04 14:25:09,874 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:09,874 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:09,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1640865895, now seen corresponding path program 19 times [2018-10-04 14:25:09,875 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:09,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:09,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:09,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:09,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-04 14:25:10,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:10,737 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:10,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:10,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:10,987 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-04 14:25:11,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:11,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-04 14:25:11,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 14:25:11,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 14:25:11,009 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:11,009 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 22 states. [2018-10-04 14:25:11,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:11,139 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2018-10-04 14:25:11,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 14:25:11,140 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 82 [2018-10-04 14:25:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:11,140 INFO L225 Difference]: With dead ends: 129 [2018-10-04 14:25:11,141 INFO L226 Difference]: Without dead ends: 87 [2018-10-04 14:25:11,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime 20 [2018-10-04 14:25:11,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-04 14:25:11,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-10-04 14:25:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-04 14:25:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-10-04 14:25:11,146 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2018-10-04 14:25:11,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:11,146 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-10-04 14:25:11,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 14:25:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-10-04 14:25:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-04 14:25:11,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:11,147 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1] [2018-10-04 14:25:11,147 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:11,148 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:11,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1957273381, now seen corresponding path program 20 times [2018-10-04 14:25:11,148 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:11,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:11,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:11,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:11,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:11,542 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-10-04 14:25:11,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:11,543 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:11,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:25:11,587 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:25:11,587 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:11,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-10-04 14:25:11,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:11,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 14:25:11,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 14:25:11,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 14:25:11,708 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:11,708 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 23 states. [2018-10-04 14:25:11,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:11,785 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2018-10-04 14:25:11,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:25:11,786 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2018-10-04 14:25:11,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:11,787 INFO L225 Difference]: With dead ends: 135 [2018-10-04 14:25:11,787 INFO L226 Difference]: Without dead ends: 91 [2018-10-04 14:25:11,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 21 [2018-10-04 14:25:11,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-04 14:25:11,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-10-04 14:25:11,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-04 14:25:11,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-10-04 14:25:11,790 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2018-10-04 14:25:11,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:11,791 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-10-04 14:25:11,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 14:25:11,791 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-10-04 14:25:11,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-04 14:25:11,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:11,792 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2018-10-04 14:25:11,792 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:11,792 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:11,792 INFO L82 PathProgramCache]: Analyzing trace with hash -783456433, now seen corresponding path program 21 times [2018-10-04 14:25:11,792 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:11,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:11,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:11,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:11,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-10-04 14:25:12,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:12,208 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:12,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:12,346 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-04 14:25:12,346 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:12,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:12,379 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 14:25:12,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 14:25:12,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 14:25:12,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-04 14:25:12,651 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:12,653 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_~A~5 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 14:25:12,658 INFO L168 Benchmark]: Toolchain (without parser) took 15402.46 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 136.3 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -14.6 MB). Peak memory consumption was 121.7 MB. Max. memory is 7.1 GB. [2018-10-04 14:25:12,660 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 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 14:25:12,660 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.76 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 14:25:12,661 INFO L168 Benchmark]: Boogie Preprocessor took 21.16 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 14:25:12,661 INFO L168 Benchmark]: RCFGBuilder took 291.98 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-04 14:25:12,662 INFO L168 Benchmark]: TraceAbstraction took 15041.96 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 136.3 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -35.7 MB). Peak memory consumption was 100.6 MB. Max. memory is 7.1 GB. [2018-10-04 14:25:12,667 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.18 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 42.76 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 21.16 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 291.98 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 15041.96 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 136.3 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -35.7 MB). Peak memory consumption was 100.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_~A~5 of sort (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Cannot provide value for term c_ULTIMATE.start_main_~A~5 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/array4.i_4.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-25-12-686.csv Received shutdown request...