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.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:26:13,219 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:26:13,221 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:26:13,238 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:26:13,238 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:26:13,240 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:26:13,242 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:26:13,244 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:26:13,247 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:26:13,248 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:26:13,255 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:26:13,256 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:26:13,257 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:26:13,257 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:26:13,260 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:26:13,261 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:26:13,262 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:26:13,263 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:26:13,265 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:26:13,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:26:13,268 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:26:13,269 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:26:13,271 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:26:13,272 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:26:13,272 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:26:13,273 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:26:13,274 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:26:13,274 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:26:13,275 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:26:13,276 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:26:13,277 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:26:13,277 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:26:13,277 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:26:13,278 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:26:13,279 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:26:13,279 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:26:13,280 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 20:26:13,295 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:26:13,295 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:26:13,296 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:26:13,296 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:26:13,297 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:26:13,297 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:26:13,297 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:26:13,298 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:26:13,298 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:26:13,298 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:26:13,298 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:26:13,299 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:26:13,299 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:26:13,299 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:26:13,299 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:26:13,299 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:26:13,300 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:26:13,300 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:26:13,300 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:26:13,300 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:26:13,300 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:26:13,301 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:26:13,301 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:26:13,301 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:26:13,301 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:26:13,301 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:26:13,302 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:26:13,302 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:26:13,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:26:13,302 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:26:13,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:26:13,385 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:26:13,392 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:26:13,394 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:26:13,395 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:26:13,396 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl [2018-09-30 20:26:13,397 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl' [2018-09-30 20:26:13,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:26:13,484 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:26:13,485 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:26:13,485 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:26:13,486 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:26:13,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:13" (1/1) ... [2018-09-30 20:26:13,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:13" (1/1) ... [2018-09-30 20:26:13,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:26:13,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:26:13,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:26:13,557 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:26:13,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:13" (1/1) ... [2018-09-30 20:26:13,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:13" (1/1) ... [2018-09-30 20:26:13,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:13" (1/1) ... [2018-09-30 20:26:13,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:13" (1/1) ... [2018-09-30 20:26:13,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:13" (1/1) ... [2018-09-30 20:26:13,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:13" (1/1) ... [2018-09-30 20:26:13,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:13" (1/1) ... [2018-09-30 20:26:13,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:26:13,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:26:13,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:26:13,587 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:26:13,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:13" (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-09-30 20:26:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 20:26:13,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 20:26:13,901 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 20:26:13,902 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:26:13 BoogieIcfgContainer [2018-09-30 20:26:13,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:26:13,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:26:13,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:26:13,914 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:26:13,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:13" (1/2) ... [2018-09-30 20:26:13,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b5f36e and model type PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:26:13, skipping insertion in model container [2018-09-30 20:26:13,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:26:13" (2/2) ... [2018-09-30 20:26:13,921 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement.bpl [2018-09-30 20:26:13,943 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:26:13,963 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-09-30 20:26:14,034 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:26:14,036 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:26:14,036 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:26:14,036 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:26:14,036 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:26:14,037 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:26:14,037 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:26:14,037 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:26:14,038 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:26:14,054 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-09-30 20:26:14,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 20:26:14,062 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:14,063 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 20:26:14,065 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:14,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:14,072 INFO L82 PathProgramCache]: Analyzing trace with hash 28694788, now seen corresponding path program 1 times [2018-09-30 20:26:14,075 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:14,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:14,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:14,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:14,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:14,286 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:26:14,287 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:26:14,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:26:14,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:26:14,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:26:14,305 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2018-09-30 20:26:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:14,406 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-09-30 20:26:14,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:26:14,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-09-30 20:26:14,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:14,425 INFO L225 Difference]: With dead ends: 24 [2018-09-30 20:26:14,425 INFO L226 Difference]: Without dead ends: 11 [2018-09-30 20:26:14,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:26:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-30 20:26:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-09-30 20:26:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-30 20:26:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-09-30 20:26:14,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2018-09-30 20:26:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:14,465 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-09-30 20:26:14,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:26:14,466 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-09-30 20:26:14,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-30 20:26:14,466 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:14,466 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-30 20:26:14,467 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:14,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:14,467 INFO L82 PathProgramCache]: Analyzing trace with hash 889538471, now seen corresponding path program 1 times [2018-09-30 20:26:14,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:14,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:14,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:14,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:14,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:14,614 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:26:14,615 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:26:14,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:26:14,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:26:14,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:26:14,618 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-09-30 20:26:14,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:14,834 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-09-30 20:26:14,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:26:14,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-30 20:26:14,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:14,836 INFO L225 Difference]: With dead ends: 18 [2018-09-30 20:26:14,836 INFO L226 Difference]: Without dead ends: 17 [2018-09-30 20:26:14,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:26:14,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-30 20:26:14,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-09-30 20:26:14,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-30 20:26:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-09-30 20:26:14,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2018-09-30 20:26:14,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:14,843 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-09-30 20:26:14,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:26:14,843 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-09-30 20:26:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:26:14,844 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:14,844 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:26:14,844 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:14,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:14,845 INFO L82 PathProgramCache]: Analyzing trace with hash 473213613, now seen corresponding path program 1 times [2018-09-30 20:26:14,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:14,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:14,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:14,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:14,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:14,899 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:26:14,899 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:26:14,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:26:14,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:26:14,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:26:14,901 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 3 states. [2018-09-30 20:26:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:14,930 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-09-30 20:26:14,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:26:14,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-09-30 20:26:14,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:14,932 INFO L225 Difference]: With dead ends: 19 [2018-09-30 20:26:14,932 INFO L226 Difference]: Without dead ends: 12 [2018-09-30 20:26:14,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:26:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-30 20:26:14,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-30 20:26:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-30 20:26:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-30 20:26:14,936 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-09-30 20:26:14,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:14,937 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-30 20:26:14,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:26:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-30 20:26:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:26:14,938 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:14,938 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 20:26:14,938 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:14,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:14,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1846021201, now seen corresponding path program 1 times [2018-09-30 20:26:14,939 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:14,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:14,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:14,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:14,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:15,190 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:15,191 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-09-30 20:26:15,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:15,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:15,308 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-09-30 20:26:15,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:15,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:15,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:15,458 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:15,458 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-09-30 20:26:15,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:26:15,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:26:15,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:26:15,460 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2018-09-30 20:26:15,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:15,695 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-30 20:26:15,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 20:26:15,696 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-09-30 20:26:15,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:15,697 INFO L225 Difference]: With dead ends: 21 [2018-09-30 20:26:15,698 INFO L226 Difference]: Without dead ends: 20 [2018-09-30 20:26:15,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-09-30 20:26:15,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-30 20:26:15,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-09-30 20:26:15,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-30 20:26:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-30 20:26:15,704 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2018-09-30 20:26:15,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:15,704 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-30 20:26:15,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:26:15,705 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-30 20:26:15,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:26:15,705 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:15,705 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1] [2018-09-30 20:26:15,706 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:15,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:15,706 INFO L82 PathProgramCache]: Analyzing trace with hash 506962407, now seen corresponding path program 2 times [2018-09-30 20:26:15,706 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:15,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:15,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:15,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:15,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:15,838 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:15,838 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-09-30 20:26:15,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:26:15,898 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:26:15,898 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:15,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:15,926 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-09-30 20:26:15,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:16,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:16,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:16,203 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:16,241 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:16,241 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-09-30 20:26:16,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 20:26:16,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 20:26:16,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-09-30 20:26:16,245 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-09-30 20:26:16,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:16,635 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-30 20:26:16,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 20:26:16,638 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-30 20:26:16,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:16,639 INFO L225 Difference]: With dead ends: 26 [2018-09-30 20:26:16,639 INFO L226 Difference]: Without dead ends: 25 [2018-09-30 20:26:16,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-09-30 20:26:16,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-30 20:26:16,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-09-30 20:26:16,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-30 20:26:16,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-30 20:26:16,647 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2018-09-30 20:26:16,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:16,648 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-30 20:26:16,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 20:26:16,648 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-30 20:26:16,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-30 20:26:16,649 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:16,649 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1] [2018-09-30 20:26:16,649 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:16,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:16,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1970543121, now seen corresponding path program 3 times [2018-09-30 20:26:16,650 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:16,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:16,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:16,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:16,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:16,835 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:16,835 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-09-30 20:26:16,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:26:16,878 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-30 20:26:16,878 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:16,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:16,894 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-09-30 20:26:16,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:16,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:16,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:17,029 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:17,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-09-30 20:26:17,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 20:26:17,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 20:26:17,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-09-30 20:26:17,031 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2018-09-30 20:26:17,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:17,261 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-30 20:26:17,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 20:26:17,263 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-30 20:26:17,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:17,264 INFO L225 Difference]: With dead ends: 31 [2018-09-30 20:26:17,264 INFO L226 Difference]: Without dead ends: 30 [2018-09-30 20:26:17,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:26:17,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-30 20:26:17,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-09-30 20:26:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-30 20:26:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-30 20:26:17,271 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2018-09-30 20:26:17,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:17,271 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-30 20:26:17,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 20:26:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-30 20:26:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-30 20:26:17,273 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:17,273 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1] [2018-09-30 20:26:17,273 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:17,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:17,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1357786151, now seen corresponding path program 4 times [2018-09-30 20:26:17,274 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:17,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:17,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:17,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:17,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:17,441 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:17,442 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:17,442 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-09-30 20:26:17,453 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:26:17,505 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:26:17,506 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:17,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:17,516 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-09-30 20:26:17,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:17,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:17,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:17,684 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:17,684 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-30 20:26:17,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:26:17,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:26:17,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-30 20:26:17,685 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-09-30 20:26:18,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:18,054 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-30 20:26:18,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:26:18,055 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-09-30 20:26:18,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:18,057 INFO L225 Difference]: With dead ends: 36 [2018-09-30 20:26:18,057 INFO L226 Difference]: Without dead ends: 35 [2018-09-30 20:26:18,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:26:18,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-30 20:26:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-09-30 20:26:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-30 20:26:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-30 20:26:18,067 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2018-09-30 20:26:18,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:18,067 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-30 20:26:18,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:26:18,068 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-30 20:26:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-30 20:26:18,069 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:18,069 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1] [2018-09-30 20:26:18,069 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:18,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:18,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1853487057, now seen corresponding path program 5 times [2018-09-30 20:26:18,070 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:18,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:18,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:18,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:18,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:18,251 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:18,251 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-30 20:26:18,261 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:26:18,331 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-30 20:26:18,332 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:18,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:18,348 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-09-30 20:26:18,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:18,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:18,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:18,573 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:18,574 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-09-30 20:26:18,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:26:18,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:26:18,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:26:18,575 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 16 states. [2018-09-30 20:26:19,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:19,139 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-30 20:26:19,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 20:26:19,140 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-09-30 20:26:19,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:19,141 INFO L225 Difference]: With dead ends: 41 [2018-09-30 20:26:19,142 INFO L226 Difference]: Without dead ends: 40 [2018-09-30 20:26:19,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-09-30 20:26:19,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-30 20:26:19,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-09-30 20:26:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-30 20:26:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-30 20:26:19,150 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2018-09-30 20:26:19,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:19,150 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-30 20:26:19,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:26:19,150 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-30 20:26:19,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 20:26:19,151 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:19,151 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1] [2018-09-30 20:26:19,152 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:19,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:19,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1716722073, now seen corresponding path program 6 times [2018-09-30 20:26:19,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:19,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:19,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:19,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:19,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:19,714 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:19,714 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-09-30 20:26:19,730 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:26:19,788 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-30 20:26:19,789 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:19,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:19,813 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-09-30 20:26:19,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:19,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:19,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:20,001 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:20,001 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-09-30 20:26:20,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 20:26:20,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 20:26:20,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-09-30 20:26:20,004 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 18 states. [2018-09-30 20:26:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:20,529 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-30 20:26:20,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:26:20,530 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-09-30 20:26:20,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:20,531 INFO L225 Difference]: With dead ends: 46 [2018-09-30 20:26:20,531 INFO L226 Difference]: Without dead ends: 45 [2018-09-30 20:26:20,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=385, Unknown=0, NotChecked=0, Total=600 [2018-09-30 20:26:20,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-30 20:26:20,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-09-30 20:26:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-30 20:26:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-30 20:26:20,540 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2018-09-30 20:26:20,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:20,540 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-30 20:26:20,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 20:26:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-30 20:26:20,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-30 20:26:20,542 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:20,542 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1] [2018-09-30 20:26:20,542 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:20,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:20,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1089100399, now seen corresponding path program 7 times [2018-09-30 20:26:20,543 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:20,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:20,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:20,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:20,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:20,756 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:20,756 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-09-30 20:26:20,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:20,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:20,845 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-09-30 20:26:20,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:20,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:20,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:21,087 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:21,108 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:21,108 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-09-30 20:26:21,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 20:26:21,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 20:26:21,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-09-30 20:26:21,109 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 20 states. [2018-09-30 20:26:21,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:21,444 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-30 20:26:21,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:26:21,451 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2018-09-30 20:26:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:21,452 INFO L225 Difference]: With dead ends: 51 [2018-09-30 20:26:21,452 INFO L226 Difference]: Without dead ends: 50 [2018-09-30 20:26:21,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=487, Unknown=0, NotChecked=0, Total=756 [2018-09-30 20:26:21,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-30 20:26:21,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-09-30 20:26:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-30 20:26:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-30 20:26:21,460 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 41 [2018-09-30 20:26:21,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:21,461 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-30 20:26:21,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 20:26:21,461 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-30 20:26:21,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-30 20:26:21,462 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:21,462 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1] [2018-09-30 20:26:21,463 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:21,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:21,463 INFO L82 PathProgramCache]: Analyzing trace with hash -268971865, now seen corresponding path program 8 times [2018-09-30 20:26:21,463 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:21,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:21,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:21,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:21,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:21,764 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:21,764 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-09-30 20:26:21,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:26:21,822 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:26:21,823 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:21,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:21,854 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-09-30 20:26:21,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:21,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:21,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:22,331 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:22,356 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:22,357 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-09-30 20:26:22,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-30 20:26:22,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-30 20:26:22,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-09-30 20:26:22,358 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 22 states. [2018-09-30 20:26:22,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:22,755 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-30 20:26:22,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:26:22,756 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-09-30 20:26:22,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:22,757 INFO L225 Difference]: With dead ends: 56 [2018-09-30 20:26:22,757 INFO L226 Difference]: Without dead ends: 55 [2018-09-30 20:26:22,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=329, Invalid=601, Unknown=0, NotChecked=0, Total=930 [2018-09-30 20:26:22,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-30 20:26:22,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-09-30 20:26:22,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-30 20:26:22,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-30 20:26:22,766 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 46 [2018-09-30 20:26:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:22,767 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-30 20:26:22,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-30 20:26:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-30 20:26:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-30 20:26:22,768 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:22,768 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1] [2018-09-30 20:26:22,768 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:22,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:22,769 INFO L82 PathProgramCache]: Analyzing trace with hash -2109529263, now seen corresponding path program 9 times [2018-09-30 20:26:22,769 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:22,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:22,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:22,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:22,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:23,183 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:23,183 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-09-30 20:26:23,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:26:23,238 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-30 20:26:23,238 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:23,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:23,259 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-09-30 20:26:23,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:23,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:23,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:23,532 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:23,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-09-30 20:26:23,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-30 20:26:23,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-30 20:26:23,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-09-30 20:26:23,533 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 24 states. [2018-09-30 20:26:24,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:24,001 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-09-30 20:26:24,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:26:24,002 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2018-09-30 20:26:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:24,002 INFO L225 Difference]: With dead ends: 61 [2018-09-30 20:26:24,002 INFO L226 Difference]: Without dead ends: 60 [2018-09-30 20:26:24,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=395, Invalid=727, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 20:26:24,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-30 20:26:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-09-30 20:26:24,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-30 20:26:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-30 20:26:24,013 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 51 [2018-09-30 20:26:24,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:24,013 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-30 20:26:24,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-30 20:26:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-30 20:26:24,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-30 20:26:24,014 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:24,015 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1] [2018-09-30 20:26:24,015 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:24,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:24,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1236079897, now seen corresponding path program 10 times [2018-09-30 20:26:24,016 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:24,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:24,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:24,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:24,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:24,310 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:24,310 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-09-30 20:26:24,320 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:26:24,361 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:26:24,361 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:24,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:24,373 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-09-30 20:26:24,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:24,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:24,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:24,607 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:24,607 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-09-30 20:26:24,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-30 20:26:24,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-30 20:26:24,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2018-09-30 20:26:24,609 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2018-09-30 20:26:25,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:25,079 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-30 20:26:25,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:26:25,081 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-09-30 20:26:25,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:25,081 INFO L225 Difference]: With dead ends: 66 [2018-09-30 20:26:25,082 INFO L226 Difference]: Without dead ends: 65 [2018-09-30 20:26:25,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=467, Invalid=865, Unknown=0, NotChecked=0, Total=1332 [2018-09-30 20:26:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-30 20:26:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-09-30 20:26:25,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-30 20:26:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-30 20:26:25,100 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 56 [2018-09-30 20:26:25,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:25,100 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-30 20:26:25,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-30 20:26:25,100 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-30 20:26:25,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-30 20:26:25,102 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:25,102 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1] [2018-09-30 20:26:25,102 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:25,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:25,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1207857425, now seen corresponding path program 11 times [2018-09-30 20:26:25,103 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:25,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:25,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:25,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:25,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:25,748 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:25,749 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:25,749 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-09-30 20:26:25,756 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:26:25,835 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-30 20:26:25,835 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:25,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:25,849 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-09-30 20:26:25,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:25,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:25,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:26,178 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:26,178 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-09-30 20:26:26,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-30 20:26:26,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-30 20:26:26,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2018-09-30 20:26:26,179 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 28 states. [2018-09-30 20:26:26,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:26,686 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-30 20:26:26,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:26:26,688 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-09-30 20:26:26,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:26,689 INFO L225 Difference]: With dead ends: 71 [2018-09-30 20:26:26,689 INFO L226 Difference]: Without dead ends: 70 [2018-09-30 20:26:26,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=545, Invalid=1015, Unknown=0, NotChecked=0, Total=1560 [2018-09-30 20:26:26,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-30 20:26:26,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-09-30 20:26:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-30 20:26:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-30 20:26:26,704 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 61 [2018-09-30 20:26:26,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:26,705 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-30 20:26:26,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-30 20:26:26,705 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-30 20:26:26,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 20:26:26,706 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:26,706 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1] [2018-09-30 20:26:26,706 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:26,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:26,707 INFO L82 PathProgramCache]: Analyzing trace with hash -96324313, now seen corresponding path program 12 times [2018-09-30 20:26:26,707 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:26,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:26,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:26,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:26,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:26,989 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:26,989 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-09-30 20:26:27,000 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:26:27,057 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-30 20:26:27,057 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:27,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:27,080 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-09-30 20:26:27,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:27,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:27,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:27,394 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:27,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-09-30 20:26:27,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-30 20:26:27,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-30 20:26:27,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2018-09-30 20:26:27,396 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 30 states. [2018-09-30 20:26:27,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:27,923 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-30 20:26:27,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:26:27,924 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2018-09-30 20:26:27,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:27,925 INFO L225 Difference]: With dead ends: 76 [2018-09-30 20:26:27,925 INFO L226 Difference]: Without dead ends: 75 [2018-09-30 20:26:27,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=629, Invalid=1177, Unknown=0, NotChecked=0, Total=1806 [2018-09-30 20:26:27,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-30 20:26:27,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-09-30 20:26:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-30 20:26:27,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-30 20:26:27,937 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 66 [2018-09-30 20:26:27,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:27,937 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-30 20:26:27,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-30 20:26:27,938 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-30 20:26:27,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-30 20:26:27,939 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:27,939 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1] [2018-09-30 20:26:27,939 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:27,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:27,939 INFO L82 PathProgramCache]: Analyzing trace with hash -716992815, now seen corresponding path program 13 times [2018-09-30 20:26:27,940 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:27,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:27,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:27,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:27,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:28,284 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:28,284 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:28,285 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-09-30 20:26:28,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:28,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:28,373 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-09-30 20:26:28,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:28,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:28,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:28,719 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:28,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-09-30 20:26:28,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-30 20:26:28,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-30 20:26:28,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-09-30 20:26:28,721 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 32 states. [2018-09-30 20:26:29,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:29,355 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-30 20:26:29,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 20:26:29,356 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-09-30 20:26:29,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:29,357 INFO L225 Difference]: With dead ends: 81 [2018-09-30 20:26:29,357 INFO L226 Difference]: Without dead ends: 80 [2018-09-30 20:26:29,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=719, Invalid=1351, Unknown=0, NotChecked=0, Total=2070 [2018-09-30 20:26:29,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-30 20:26:29,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-09-30 20:26:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-30 20:26:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-30 20:26:29,371 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 71 [2018-09-30 20:26:29,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:29,372 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-30 20:26:29,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-30 20:26:29,372 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-30 20:26:29,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-30 20:26:29,373 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:29,373 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1] [2018-09-30 20:26:29,373 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:29,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:29,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1270239385, now seen corresponding path program 14 times [2018-09-30 20:26:29,374 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:29,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:29,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:29,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:29,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:30,084 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:30,085 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:30,085 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-09-30 20:26:30,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:26:30,151 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:26:30,152 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:30,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:30,173 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-09-30 20:26:30,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:30,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:30,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:30,510 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:30,533 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:30,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-09-30 20:26:30,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-30 20:26:30,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-30 20:26:30,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 20:26:30,534 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 34 states. [2018-09-30 20:26:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:31,194 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-30 20:26:31,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 20:26:31,195 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 76 [2018-09-30 20:26:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:31,195 INFO L225 Difference]: With dead ends: 86 [2018-09-30 20:26:31,196 INFO L226 Difference]: Without dead ends: 85 [2018-09-30 20:26:31,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=815, Invalid=1537, Unknown=0, NotChecked=0, Total=2352 [2018-09-30 20:26:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-30 20:26:31,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-09-30 20:26:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-30 20:26:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-30 20:26:31,207 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 76 [2018-09-30 20:26:31,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:31,207 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-30 20:26:31,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-30 20:26:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-30 20:26:31,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-30 20:26:31,208 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:31,208 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1] [2018-09-30 20:26:31,209 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:31,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:31,209 INFO L82 PathProgramCache]: Analyzing trace with hash -468812655, now seen corresponding path program 15 times [2018-09-30 20:26:31,209 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:31,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:31,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:31,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:31,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:31,587 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:31,587 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-09-30 20:26:31,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:26:31,687 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-30 20:26:31,688 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:31,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:31,709 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-09-30 20:26:31,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:31,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:31,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:32,150 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:32,171 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:32,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-09-30 20:26:32,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-30 20:26:32,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-30 20:26:32,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2018-09-30 20:26:32,173 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 36 states. [2018-09-30 20:26:32,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:32,746 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-30 20:26:32,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 20:26:32,747 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 81 [2018-09-30 20:26:32,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:32,747 INFO L225 Difference]: With dead ends: 91 [2018-09-30 20:26:32,748 INFO L226 Difference]: Without dead ends: 90 [2018-09-30 20:26:32,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=917, Invalid=1735, Unknown=0, NotChecked=0, Total=2652 [2018-09-30 20:26:32,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-30 20:26:32,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-09-30 20:26:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-30 20:26:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-30 20:26:32,762 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 81 [2018-09-30 20:26:32,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:32,762 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-30 20:26:32,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-30 20:26:32,762 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-30 20:26:32,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-30 20:26:32,763 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:32,763 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1] [2018-09-30 20:26:32,764 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:32,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:32,764 INFO L82 PathProgramCache]: Analyzing trace with hash 132995495, now seen corresponding path program 16 times [2018-09-30 20:26:32,764 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:32,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:32,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:32,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:32,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:33,736 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:33,736 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:33,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 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-09-30 20:26:33,744 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:26:33,806 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:26:33,806 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:33,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:33,818 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-09-30 20:26:33,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:33,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:33,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:34,213 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:34,233 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:34,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-09-30 20:26:34,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-30 20:26:34,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-30 20:26:34,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2018-09-30 20:26:34,235 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 38 states. [2018-09-30 20:26:34,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:34,832 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-30 20:26:34,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:26:34,833 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2018-09-30 20:26:34,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:34,834 INFO L225 Difference]: With dead ends: 96 [2018-09-30 20:26:34,834 INFO L226 Difference]: Without dead ends: 95 [2018-09-30 20:26:34,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1025, Invalid=1945, Unknown=0, NotChecked=0, Total=2970 [2018-09-30 20:26:34,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-30 20:26:34,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-09-30 20:26:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-30 20:26:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-30 20:26:34,846 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 86 [2018-09-30 20:26:34,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:34,846 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-30 20:26:34,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-30 20:26:34,846 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-30 20:26:34,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-30 20:26:34,847 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:34,847 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1] [2018-09-30 20:26:34,847 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:34,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:34,847 INFO L82 PathProgramCache]: Analyzing trace with hash -480560559, now seen corresponding path program 17 times [2018-09-30 20:26:34,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:34,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:34,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:34,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:34,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:35,216 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:35,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 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-09-30 20:26:35,224 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:26:35,301 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-30 20:26:35,301 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:35,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:35,308 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-09-30 20:26:35,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:35,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:35,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:35,632 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:35,655 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:35,655 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-09-30 20:26:35,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-30 20:26:35,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-30 20:26:35,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2018-09-30 20:26:35,656 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 40 states. [2018-09-30 20:26:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:36,377 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-30 20:26:36,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 20:26:36,382 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 91 [2018-09-30 20:26:36,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:36,383 INFO L225 Difference]: With dead ends: 101 [2018-09-30 20:26:36,383 INFO L226 Difference]: Without dead ends: 100 [2018-09-30 20:26:36,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1139, Invalid=2167, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 20:26:36,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-30 20:26:36,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-09-30 20:26:36,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-30 20:26:36,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-30 20:26:36,394 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 91 [2018-09-30 20:26:36,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:36,394 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-30 20:26:36,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-30 20:26:36,394 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-30 20:26:36,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-30 20:26:36,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:36,395 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1] [2018-09-30 20:26:36,395 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:36,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:36,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2085538841, now seen corresponding path program 18 times [2018-09-30 20:26:36,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:36,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:36,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:36,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:36,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:36,778 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:36,778 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-09-30 20:26:36,786 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:26:36,990 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-30 20:26:36,990 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:36,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:37,006 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-09-30 20:26:37,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:37,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:37,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:37,439 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:37,439 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-09-30 20:26:37,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-30 20:26:37,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-30 20:26:37,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2018-09-30 20:26:37,440 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 42 states. [2018-09-30 20:26:38,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:38,161 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-30 20:26:38,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:26:38,162 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2018-09-30 20:26:38,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:38,163 INFO L225 Difference]: With dead ends: 106 [2018-09-30 20:26:38,163 INFO L226 Difference]: Without dead ends: 105 [2018-09-30 20:26:38,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1259, Invalid=2401, Unknown=0, NotChecked=0, Total=3660 [2018-09-30 20:26:38,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-30 20:26:38,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2018-09-30 20:26:38,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-30 20:26:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-09-30 20:26:38,176 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 96 [2018-09-30 20:26:38,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:38,176 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-09-30 20:26:38,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-30 20:26:38,176 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-09-30 20:26:38,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-30 20:26:38,177 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:38,177 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1] [2018-09-30 20:26:38,177 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:38,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:38,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1222260719, now seen corresponding path program 19 times [2018-09-30 20:26:38,177 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:38,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:38,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:38,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:38,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:39,198 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:39,198 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-09-30 20:26:39,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:39,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:39,281 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-09-30 20:26:39,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:39,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:39,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:39,709 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:39,709 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-09-30 20:26:39,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-30 20:26:39,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-30 20:26:39,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2018-09-30 20:26:39,710 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 44 states. [2018-09-30 20:26:40,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:40,400 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-30 20:26:40,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:26:40,402 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 101 [2018-09-30 20:26:40,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:40,403 INFO L225 Difference]: With dead ends: 111 [2018-09-30 20:26:40,403 INFO L226 Difference]: Without dead ends: 110 [2018-09-30 20:26:40,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1385, Invalid=2647, Unknown=0, NotChecked=0, Total=4032 [2018-09-30 20:26:40,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-30 20:26:40,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2018-09-30 20:26:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-30 20:26:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-09-30 20:26:40,416 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 101 [2018-09-30 20:26:40,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:40,417 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-09-30 20:26:40,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-30 20:26:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-09-30 20:26:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-30 20:26:40,417 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:40,417 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1, 1] [2018-09-30 20:26:40,418 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:40,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:40,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1629044263, now seen corresponding path program 20 times [2018-09-30 20:26:40,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:40,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:40,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:40,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:40,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:41,033 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:41,033 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-09-30 20:26:41,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:26:41,122 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:26:41,122 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:41,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:41,142 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-09-30 20:26:41,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:41,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:41,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:44,721 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:44,721 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-09-30 20:26:44,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-30 20:26:44,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-30 20:26:44,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2018-09-30 20:26:44,723 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 46 states. [2018-09-30 20:26:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:45,507 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-09-30 20:26:45,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 20:26:45,507 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 106 [2018-09-30 20:26:45,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:45,509 INFO L225 Difference]: With dead ends: 116 [2018-09-30 20:26:45,509 INFO L226 Difference]: Without dead ends: 115 [2018-09-30 20:26:45,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1517, Invalid=2905, Unknown=0, NotChecked=0, Total=4422 [2018-09-30 20:26:45,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-30 20:26:45,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2018-09-30 20:26:45,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-30 20:26:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-09-30 20:26:45,528 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 106 [2018-09-30 20:26:45,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:45,528 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-09-30 20:26:45,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-30 20:26:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-09-30 20:26:45,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-30 20:26:45,529 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:45,530 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1, 1] [2018-09-30 20:26:45,530 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:45,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:45,530 INFO L82 PathProgramCache]: Analyzing trace with hash 2020222417, now seen corresponding path program 21 times [2018-09-30 20:26:45,530 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:45,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:45,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:45,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:45,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:46,433 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:46,433 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-09-30 20:26:46,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:26:46,571 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-30 20:26:46,571 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:46,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:46,595 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-09-30 20:26:46,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:46,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:46,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:47,215 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:47,216 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-09-30 20:26:47,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-30 20:26:47,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-30 20:26:47,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2018-09-30 20:26:47,217 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 48 states. [2018-09-30 20:26:48,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:48,109 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-09-30 20:26:48,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-30 20:26:48,110 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 111 [2018-09-30 20:26:48,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:48,111 INFO L225 Difference]: With dead ends: 121 [2018-09-30 20:26:48,111 INFO L226 Difference]: Without dead ends: 120 [2018-09-30 20:26:48,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1655, Invalid=3175, Unknown=0, NotChecked=0, Total=4830 [2018-09-30 20:26:48,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-09-30 20:26:48,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-09-30 20:26:48,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-30 20:26:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-30 20:26:48,126 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 111 [2018-09-30 20:26:48,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:48,126 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-30 20:26:48,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-30 20:26:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-30 20:26:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-30 20:26:48,127 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:48,127 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1] [2018-09-30 20:26:48,127 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:48,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:48,128 INFO L82 PathProgramCache]: Analyzing trace with hash -995526553, now seen corresponding path program 22 times [2018-09-30 20:26:48,128 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:48,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:48,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:48,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:48,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:48,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:48,615 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:48,615 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:48,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:26:48,704 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:26:48,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:48,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:48,712 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-09-30 20:26:48,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:48,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:48,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:49,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:49,279 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-09-30 20:26:49,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-30 20:26:49,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-30 20:26:49,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=902, Invalid=1548, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 20:26:49,280 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 50 states. [2018-09-30 20:26:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:50,259 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-09-30 20:26:50,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 20:26:50,260 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 116 [2018-09-30 20:26:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:50,261 INFO L225 Difference]: With dead ends: 126 [2018-09-30 20:26:50,261 INFO L226 Difference]: Without dead ends: 125 [2018-09-30 20:26:50,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1799, Invalid=3457, Unknown=0, NotChecked=0, Total=5256 [2018-09-30 20:26:50,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-30 20:26:50,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-09-30 20:26:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-09-30 20:26:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-09-30 20:26:50,276 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 116 [2018-09-30 20:26:50,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:50,276 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-09-30 20:26:50,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-30 20:26:50,276 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-09-30 20:26:50,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-30 20:26:50,277 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:50,277 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1, 1] [2018-09-30 20:26:50,277 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:50,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:50,278 INFO L82 PathProgramCache]: Analyzing trace with hash 891573137, now seen corresponding path program 23 times [2018-09-30 20:26:50,278 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:50,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:50,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:50,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:50,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:50,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:50,772 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:50,772 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:50,780 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:26:50,911 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-30 20:26:50,912 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:50,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:50,920 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-09-30 20:26:50,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:50,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:50,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:51,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:51,756 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:51,757 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-09-30 20:26:51,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-30 20:26:51,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-30 20:26:51,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2018-09-30 20:26:51,758 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 52 states. [2018-09-30 20:26:52,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:52,793 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-30 20:26:52,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 20:26:52,794 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 121 [2018-09-30 20:26:52,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:52,795 INFO L225 Difference]: With dead ends: 131 [2018-09-30 20:26:52,795 INFO L226 Difference]: Without dead ends: 130 [2018-09-30 20:26:52,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1949, Invalid=3751, Unknown=0, NotChecked=0, Total=5700 [2018-09-30 20:26:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-30 20:26:52,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2018-09-30 20:26:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-30 20:26:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-09-30 20:26:52,810 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 121 [2018-09-30 20:26:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:52,810 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-09-30 20:26:52,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-30 20:26:52,810 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-09-30 20:26:52,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-30 20:26:52,811 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:52,811 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1, 1] [2018-09-30 20:26:52,811 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:52,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:52,811 INFO L82 PathProgramCache]: Analyzing trace with hash -35265881, now seen corresponding path program 24 times [2018-09-30 20:26:52,811 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:52,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:52,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:52,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:52,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:53,465 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:53,465 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:53,472 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:26:53,606 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-30 20:26:53,606 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:53,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:53,629 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-09-30 20:26:53,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:53,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:53,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:54,177 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:54,177 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-09-30 20:26:54,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-30 20:26:54,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-30 20:26:54,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2018-09-30 20:26:54,179 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 54 states. [2018-09-30 20:26:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:55,133 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-09-30 20:26:55,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 20:26:55,133 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 126 [2018-09-30 20:26:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:55,134 INFO L225 Difference]: With dead ends: 136 [2018-09-30 20:26:55,134 INFO L226 Difference]: Without dead ends: 135 [2018-09-30 20:26:55,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2105, Invalid=4057, Unknown=0, NotChecked=0, Total=6162 [2018-09-30 20:26:55,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-30 20:26:55,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2018-09-30 20:26:55,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-09-30 20:26:55,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-09-30 20:26:55,156 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 126 [2018-09-30 20:26:55,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:55,157 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-09-30 20:26:55,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-30 20:26:55,157 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-09-30 20:26:55,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-09-30 20:26:55,157 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:55,158 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1, 1] [2018-09-30 20:26:55,158 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:55,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:55,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1336913583, now seen corresponding path program 25 times [2018-09-30 20:26:55,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:55,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:55,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:55,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:55,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:55,811 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:55,811 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:55,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:55,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:55,931 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-09-30 20:26:55,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:56,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:56,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:57,706 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:57,707 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-09-30 20:26:57,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-30 20:26:57,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-30 20:26:57,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1136, Invalid=1944, Unknown=0, NotChecked=0, Total=3080 [2018-09-30 20:26:57,708 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 56 states. [2018-09-30 20:26:58,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:58,757 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-09-30 20:26:58,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 20:26:58,757 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 131 [2018-09-30 20:26:58,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:58,758 INFO L225 Difference]: With dead ends: 141 [2018-09-30 20:26:58,758 INFO L226 Difference]: Without dead ends: 140 [2018-09-30 20:26:58,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2267, Invalid=4375, Unknown=0, NotChecked=0, Total=6642 [2018-09-30 20:26:58,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-09-30 20:26:58,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2018-09-30 20:26:58,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-30 20:26:58,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-30 20:26:58,782 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 131 [2018-09-30 20:26:58,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:58,782 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-30 20:26:58,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-30 20:26:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-30 20:26:58,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-30 20:26:58,783 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:58,783 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1, 1] [2018-09-30 20:26:58,783 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:58,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:58,783 INFO L82 PathProgramCache]: Analyzing trace with hash -950895385, now seen corresponding path program 26 times [2018-09-30 20:26:58,783 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:58,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:58,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:58,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:58,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:59,977 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:59,977 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:59,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:27:00,071 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:27:00,072 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:00,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:00,080 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-09-30 20:27:00,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:00,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:00,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:00,755 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:00,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-09-30 20:27:00,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-30 20:27:00,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-30 20:27:00,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1220, Invalid=2086, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 20:27:00,756 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 58 states. [2018-09-30 20:27:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:02,140 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-09-30 20:27:02,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 20:27:02,140 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 136 [2018-09-30 20:27:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:02,142 INFO L225 Difference]: With dead ends: 146 [2018-09-30 20:27:02,142 INFO L226 Difference]: Without dead ends: 145 [2018-09-30 20:27:02,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2182 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2435, Invalid=4705, Unknown=0, NotChecked=0, Total=7140 [2018-09-30 20:27:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-30 20:27:02,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2018-09-30 20:27:02,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-09-30 20:27:02,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-09-30 20:27:02,169 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 136 [2018-09-30 20:27:02,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:02,170 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-09-30 20:27:02,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-30 20:27:02,170 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-09-30 20:27:02,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-09-30 20:27:02,170 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:02,171 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1, 1] [2018-09-30 20:27:02,171 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:02,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:02,171 INFO L82 PathProgramCache]: Analyzing trace with hash 568991505, now seen corresponding path program 27 times [2018-09-30 20:27:02,171 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:02,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:02,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:02,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:02,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:02,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:02,805 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:02,805 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:02,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:27:02,969 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-30 20:27:02,970 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:02,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:02,985 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-09-30 20:27:02,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:02,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:02,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:03,726 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:03,726 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-09-30 20:27:03,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-30 20:27:03,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-30 20:27:03,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1307, Invalid=2233, Unknown=0, NotChecked=0, Total=3540 [2018-09-30 20:27:03,727 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 60 states. [2018-09-30 20:27:04,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:04,900 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-30 20:27:04,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 20:27:04,900 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 141 [2018-09-30 20:27:04,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:04,901 INFO L225 Difference]: With dead ends: 151 [2018-09-30 20:27:04,902 INFO L226 Difference]: Without dead ends: 150 [2018-09-30 20:27:04,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2609, Invalid=5047, Unknown=0, NotChecked=0, Total=7656 [2018-09-30 20:27:04,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-30 20:27:04,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2018-09-30 20:27:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-30 20:27:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-09-30 20:27:04,923 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 141 [2018-09-30 20:27:04,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:04,923 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-09-30 20:27:04,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-30 20:27:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-09-30 20:27:04,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-30 20:27:04,924 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:04,924 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1, 1] [2018-09-30 20:27:04,924 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:04,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:04,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2039265497, now seen corresponding path program 28 times [2018-09-30 20:27:04,924 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:04,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:04,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:04,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:04,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:05,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:05,561 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:05,561 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:05,568 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:27:05,672 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:27:05,673 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:05,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:05,680 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-09-30 20:27:05,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:05,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:05,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:06,414 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:06,414 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-09-30 20:27:06,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-30 20:27:06,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-30 20:27:06,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1397, Invalid=2385, Unknown=0, NotChecked=0, Total=3782 [2018-09-30 20:27:06,415 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 62 states. [2018-09-30 20:27:07,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:07,820 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-09-30 20:27:07,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-30 20:27:07,821 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 146 [2018-09-30 20:27:07,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:07,822 INFO L225 Difference]: With dead ends: 156 [2018-09-30 20:27:07,822 INFO L226 Difference]: Without dead ends: 155 [2018-09-30 20:27:07,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2789, Invalid=5401, Unknown=0, NotChecked=0, Total=8190 [2018-09-30 20:27:07,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-30 20:27:07,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2018-09-30 20:27:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-09-30 20:27:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-09-30 20:27:07,852 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 146 [2018-09-30 20:27:07,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:07,853 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-09-30 20:27:07,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-30 20:27:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-09-30 20:27:07,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-30 20:27:07,854 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:07,854 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1, 1] [2018-09-30 20:27:07,854 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:07,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:07,854 INFO L82 PathProgramCache]: Analyzing trace with hash -152191791, now seen corresponding path program 29 times [2018-09-30 20:27:07,854 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:07,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:07,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:07,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:07,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:08,892 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:08,892 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:08,901 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:27:09,054 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-30 20:27:09,054 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:09,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:09,070 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-09-30 20:27:09,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:09,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:09,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:10,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:10,290 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:10,290 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-09-30 20:27:10,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-30 20:27:10,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-30 20:27:10,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=2542, Unknown=0, NotChecked=0, Total=4032 [2018-09-30 20:27:10,291 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 64 states. [2018-09-30 20:27:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:11,645 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-09-30 20:27:11,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-30 20:27:11,645 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 151 [2018-09-30 20:27:11,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:11,646 INFO L225 Difference]: With dead ends: 161 [2018-09-30 20:27:11,646 INFO L226 Difference]: Without dead ends: 160 [2018-09-30 20:27:11,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2695 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2975, Invalid=5767, Unknown=0, NotChecked=0, Total=8742 [2018-09-30 20:27:11,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-30 20:27:11,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2018-09-30 20:27:11,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-30 20:27:11,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-30 20:27:11,673 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 151 [2018-09-30 20:27:11,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:11,673 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-30 20:27:11,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-30 20:27:11,674 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-30 20:27:11,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-30 20:27:11,674 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:11,675 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1, 1] [2018-09-30 20:27:11,675 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:11,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:11,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1949548185, now seen corresponding path program 30 times [2018-09-30 20:27:11,675 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:11,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:11,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:11,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:11,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:12,457 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:12,457 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:12,464 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:27:12,639 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-30 20:27:12,640 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:12,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:12,647 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-09-30 20:27:12,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:12,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:12,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:13,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:13,435 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:13,436 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-09-30 20:27:13,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-30 20:27:13,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-30 20:27:13,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1586, Invalid=2704, Unknown=0, NotChecked=0, Total=4290 [2018-09-30 20:27:13,437 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 66 states. [2018-09-30 20:27:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:14,789 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-09-30 20:27:14,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-30 20:27:14,789 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 156 [2018-09-30 20:27:14,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:14,790 INFO L225 Difference]: With dead ends: 166 [2018-09-30 20:27:14,790 INFO L226 Difference]: Without dead ends: 165 [2018-09-30 20:27:14,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2878 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3167, Invalid=6145, Unknown=0, NotChecked=0, Total=9312 [2018-09-30 20:27:14,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-30 20:27:14,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2018-09-30 20:27:14,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-30 20:27:14,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-09-30 20:27:14,825 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 156 [2018-09-30 20:27:14,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:14,826 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-09-30 20:27:14,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-30 20:27:14,826 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-09-30 20:27:14,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-09-30 20:27:14,827 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:14,827 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1, 1] [2018-09-30 20:27:14,827 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:14,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:14,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1856558447, now seen corresponding path program 31 times [2018-09-30 20:27:14,828 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:14,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:14,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:14,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:14,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:16,073 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:16,073 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:16,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:27:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:16,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:16,197 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-09-30 20:27:16,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:16,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:16,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:17,308 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:17,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-09-30 20:27:17,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-30 20:27:17,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-30 20:27:17,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1685, Invalid=2871, Unknown=0, NotChecked=0, Total=4556 [2018-09-30 20:27:17,311 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 68 states. [2018-09-30 20:27:18,261 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:27:18,806 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:27:20,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:20,028 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-30 20:27:20,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-30 20:27:20,028 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 161 [2018-09-30 20:27:20,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:20,029 INFO L225 Difference]: With dead ends: 171 [2018-09-30 20:27:20,029 INFO L226 Difference]: Without dead ends: 170 [2018-09-30 20:27:20,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3067 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3365, Invalid=6535, Unknown=0, NotChecked=0, Total=9900 [2018-09-30 20:27:20,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-30 20:27:20,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2018-09-30 20:27:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-30 20:27:20,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-09-30 20:27:20,063 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 161 [2018-09-30 20:27:20,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:20,064 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-09-30 20:27:20,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-30 20:27:20,064 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-09-30 20:27:20,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-30 20:27:20,064 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:20,064 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1, 1] [2018-09-30 20:27:20,065 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:20,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:20,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1390504871, now seen corresponding path program 32 times [2018-09-30 20:27:20,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:20,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:20,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:20,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:27:20,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:21,060 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:21,060 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:21,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:27:21,182 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:27:21,182 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:21,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:21,202 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-09-30 20:27:21,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:21,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:21,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:22,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:22,367 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:22,368 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-09-30 20:27:22,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-30 20:27:22,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-30 20:27:22,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1787, Invalid=3043, Unknown=0, NotChecked=0, Total=4830 [2018-09-30 20:27:22,370 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 70 states. [2018-09-30 20:27:23,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:23,855 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-09-30 20:27:23,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-30 20:27:23,855 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 166 [2018-09-30 20:27:23,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:23,857 INFO L225 Difference]: With dead ends: 176 [2018-09-30 20:27:23,857 INFO L226 Difference]: Without dead ends: 175 [2018-09-30 20:27:23,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3262 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3569, Invalid=6937, Unknown=0, NotChecked=0, Total=10506 [2018-09-30 20:27:23,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-30 20:27:23,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2018-09-30 20:27:23,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-09-30 20:27:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-09-30 20:27:23,895 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 166 [2018-09-30 20:27:23,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:23,896 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-09-30 20:27:23,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-30 20:27:23,896 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-09-30 20:27:23,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-09-30 20:27:23,897 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:23,897 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1, 1] [2018-09-30 20:27:23,897 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:23,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:23,897 INFO L82 PathProgramCache]: Analyzing trace with hash 136472657, now seen corresponding path program 33 times [2018-09-30 20:27:23,898 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:23,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:23,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:23,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:23,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:25,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:25,020 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:25,021 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:25,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:27:25,223 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-30 20:27:25,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:25,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:25,258 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-09-30 20:27:25,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:25,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:25,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:26,375 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:26,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-09-30 20:27:26,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-30 20:27:26,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-30 20:27:26,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=3220, Unknown=0, NotChecked=0, Total=5112 [2018-09-30 20:27:26,377 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 72 states. [2018-09-30 20:27:28,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:28,062 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-09-30 20:27:28,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-30 20:27:28,063 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 171 [2018-09-30 20:27:28,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:28,064 INFO L225 Difference]: With dead ends: 181 [2018-09-30 20:27:28,064 INFO L226 Difference]: Without dead ends: 180 [2018-09-30 20:27:28,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3779, Invalid=7351, Unknown=0, NotChecked=0, Total=11130 [2018-09-30 20:27:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-09-30 20:27:28,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2018-09-30 20:27:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-30 20:27:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-30 20:27:28,101 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 171 [2018-09-30 20:27:28,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:28,101 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-30 20:27:28,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-30 20:27:28,101 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-30 20:27:28,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-30 20:27:28,102 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:28,102 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1, 1] [2018-09-30 20:27:28,102 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:28,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:28,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1036597785, now seen corresponding path program 34 times [2018-09-30 20:27:28,103 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:28,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:28,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:28,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:28,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:28,992 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:28,992 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:28,999 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:27:29,116 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:27:29,117 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:29,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:29,130 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-09-30 20:27:29,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:29,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:29,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:30,080 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:30,080 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-09-30 20:27:30,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-30 20:27:30,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-30 20:27:30,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2000, Invalid=3402, Unknown=0, NotChecked=0, Total=5402 [2018-09-30 20:27:30,082 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 74 states. [2018-09-30 20:27:31,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:31,675 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-09-30 20:27:31,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 20:27:31,676 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 176 [2018-09-30 20:27:31,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:31,677 INFO L225 Difference]: With dead ends: 186 [2018-09-30 20:27:31,677 INFO L226 Difference]: Without dead ends: 185 [2018-09-30 20:27:31,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3670 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3995, Invalid=7777, Unknown=0, NotChecked=0, Total=11772 [2018-09-30 20:27:31,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-09-30 20:27:31,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-09-30 20:27:31,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-30 20:27:31,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-09-30 20:27:31,708 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 176 [2018-09-30 20:27:31,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:31,709 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-09-30 20:27:31,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-30 20:27:31,709 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-09-30 20:27:31,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-09-30 20:27:31,710 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:31,710 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1, 1] [2018-09-30 20:27:31,710 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:31,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:31,710 INFO L82 PathProgramCache]: Analyzing trace with hash -414484975, now seen corresponding path program 35 times [2018-09-30 20:27:31,711 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:31,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:31,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:31,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:31,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:32,846 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:32,846 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:32,853 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:27:33,048 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-30 20:27:33,048 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:33,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:33,076 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-09-30 20:27:33,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:33,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:33,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:34,208 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:34,209 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-09-30 20:27:34,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-30 20:27:34,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-30 20:27:34,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2111, Invalid=3589, Unknown=0, NotChecked=0, Total=5700 [2018-09-30 20:27:34,210 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 76 states. [2018-09-30 20:27:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:35,881 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-09-30 20:27:35,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 20:27:35,882 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 181 [2018-09-30 20:27:35,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:35,882 INFO L225 Difference]: With dead ends: 191 [2018-09-30 20:27:35,883 INFO L226 Difference]: Without dead ends: 190 [2018-09-30 20:27:35,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3883 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4217, Invalid=8215, Unknown=0, NotChecked=0, Total=12432 [2018-09-30 20:27:35,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-30 20:27:35,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2018-09-30 20:27:35,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-30 20:27:35,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-09-30 20:27:35,914 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 181 [2018-09-30 20:27:35,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:35,914 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-09-30 20:27:35,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-30 20:27:35,914 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-09-30 20:27:35,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-30 20:27:35,915 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:35,915 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1, 1] [2018-09-30 20:27:35,915 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:35,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:35,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1800425511, now seen corresponding path program 36 times [2018-09-30 20:27:35,915 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:35,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:35,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:35,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:35,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:36,969 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:36,969 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:36,976 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:27:37,211 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-30 20:27:37,211 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:37,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:37,236 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-09-30 20:27:37,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:37,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:37,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:39,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:39,375 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:39,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-09-30 20:27:39,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-30 20:27:39,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-30 20:27:39,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2225, Invalid=3781, Unknown=0, NotChecked=0, Total=6006 [2018-09-30 20:27:39,377 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 78 states. [2018-09-30 20:27:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:41,109 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-09-30 20:27:41,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-30 20:27:41,109 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 186 [2018-09-30 20:27:41,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:41,110 INFO L225 Difference]: With dead ends: 196 [2018-09-30 20:27:41,110 INFO L226 Difference]: Without dead ends: 195 [2018-09-30 20:27:41,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4445, Invalid=8665, Unknown=0, NotChecked=0, Total=13110 [2018-09-30 20:27:41,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-30 20:27:41,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2018-09-30 20:27:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-09-30 20:27:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-09-30 20:27:41,142 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 186 [2018-09-30 20:27:41,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:41,143 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-09-30 20:27:41,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-30 20:27:41,143 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-09-30 20:27:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-30 20:27:41,143 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:41,144 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1, 1] [2018-09-30 20:27:41,144 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:41,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:41,144 INFO L82 PathProgramCache]: Analyzing trace with hash -271690799, now seen corresponding path program 37 times [2018-09-30 20:27:41,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:41,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:41,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:41,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:41,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:42,143 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:42,143 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:42,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:27:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:42,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:42,292 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-09-30 20:27:42,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:42,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:42,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:43,539 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:43,539 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-09-30 20:27:43,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-30 20:27:43,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-30 20:27:43,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2342, Invalid=3978, Unknown=0, NotChecked=0, Total=6320 [2018-09-30 20:27:43,541 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 80 states. [2018-09-30 20:27:45,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:45,311 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-09-30 20:27:45,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-30 20:27:45,312 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 191 [2018-09-30 20:27:45,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:45,313 INFO L225 Difference]: With dead ends: 201 [2018-09-30 20:27:45,313 INFO L226 Difference]: Without dead ends: 200 [2018-09-30 20:27:45,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4327 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4679, Invalid=9127, Unknown=0, NotChecked=0, Total=13806 [2018-09-30 20:27:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-30 20:27:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2018-09-30 20:27:45,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-30 20:27:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-30 20:27:45,358 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 191 [2018-09-30 20:27:45,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:45,358 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-30 20:27:45,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-30 20:27:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-30 20:27:45,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-30 20:27:45,359 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:45,359 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1, 1] [2018-09-30 20:27:45,359 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:45,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:45,360 INFO L82 PathProgramCache]: Analyzing trace with hash -894301593, now seen corresponding path program 38 times [2018-09-30 20:27:45,360 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:45,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:45,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:45,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:27:45,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:46,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:46,890 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:46,890 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:46,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:27:47,037 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:27:47,037 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:47,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:47,047 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-09-30 20:27:47,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:47,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:47,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:48,470 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:48,470 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-09-30 20:27:48,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-30 20:27:48,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-30 20:27:48,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2462, Invalid=4180, Unknown=0, NotChecked=0, Total=6642 [2018-09-30 20:27:48,471 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 82 states. [2018-09-30 20:27:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:50,449 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-09-30 20:27:50,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 20:27:50,450 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 196 [2018-09-30 20:27:50,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:50,451 INFO L225 Difference]: With dead ends: 206 [2018-09-30 20:27:50,451 INFO L226 Difference]: Without dead ends: 205 [2018-09-30 20:27:50,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4558 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4919, Invalid=9601, Unknown=0, NotChecked=0, Total=14520 [2018-09-30 20:27:50,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-09-30 20:27:50,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2018-09-30 20:27:50,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-30 20:27:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-09-30 20:27:50,486 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 196 [2018-09-30 20:27:50,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:50,486 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-09-30 20:27:50,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-30 20:27:50,486 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-09-30 20:27:50,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-30 20:27:50,487 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:50,487 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1, 1] [2018-09-30 20:27:50,488 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:50,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:50,488 INFO L82 PathProgramCache]: Analyzing trace with hash -676920943, now seen corresponding path program 39 times [2018-09-30 20:27:50,488 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:50,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:50,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:50,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:50,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:51,628 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:51,628 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:51,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:27:51,933 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-30 20:27:51,934 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:51,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:51,944 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-09-30 20:27:51,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:51,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:51,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:53,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:53,439 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:53,440 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-09-30 20:27:53,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-30 20:27:53,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-30 20:27:53,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2585, Invalid=4387, Unknown=0, NotChecked=0, Total=6972 [2018-09-30 20:27:53,441 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 84 states. [2018-09-30 20:27:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:55,333 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-09-30 20:27:55,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-30 20:27:55,333 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 201 [2018-09-30 20:27:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:55,334 INFO L225 Difference]: With dead ends: 211 [2018-09-30 20:27:55,335 INFO L226 Difference]: Without dead ends: 210 [2018-09-30 20:27:55,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4795 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5165, Invalid=10087, Unknown=0, NotChecked=0, Total=15252 [2018-09-30 20:27:55,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-09-30 20:27:55,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2018-09-30 20:27:55,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-30 20:27:55,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-09-30 20:27:55,377 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 201 [2018-09-30 20:27:55,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:55,377 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-09-30 20:27:55,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-30 20:27:55,377 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-09-30 20:27:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-30 20:27:55,378 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:55,378 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1, 1] [2018-09-30 20:27:55,378 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:55,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:55,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2015365977, now seen corresponding path program 40 times [2018-09-30 20:27:55,379 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:55,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:55,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:55,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:55,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:56,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:56,472 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:56,472 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:56,478 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:27:56,628 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:27:56,629 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:56,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:56,654 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-09-30 20:27:56,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:56,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:56,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:58,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:58,130 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:58,130 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-09-30 20:27:58,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-30 20:27:58,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-30 20:27:58,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2711, Invalid=4599, Unknown=0, NotChecked=0, Total=7310 [2018-09-30 20:27:58,133 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 86 states. [2018-09-30 20:28:00,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:00,217 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-09-30 20:28:00,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-30 20:28:00,217 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 206 [2018-09-30 20:28:00,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:00,218 INFO L225 Difference]: With dead ends: 216 [2018-09-30 20:28:00,218 INFO L226 Difference]: Without dead ends: 215 [2018-09-30 20:28:00,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5038 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5417, Invalid=10585, Unknown=0, NotChecked=0, Total=16002 [2018-09-30 20:28:00,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-30 20:28:00,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2018-09-30 20:28:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-09-30 20:28:00,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-09-30 20:28:00,255 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 206 [2018-09-30 20:28:00,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:00,255 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-09-30 20:28:00,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-30 20:28:00,255 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-09-30 20:28:00,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-09-30 20:28:00,256 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:00,256 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1, 1] [2018-09-30 20:28:00,257 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:28:00,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:00,257 INFO L82 PathProgramCache]: Analyzing trace with hash 164724561, now seen corresponding path program 41 times [2018-09-30 20:28:00,257 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:00,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:00,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:00,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:00,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:01,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:01,400 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:01,401 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:28:01,416 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:28:01,666 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-30 20:28:01,666 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:01,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:01,693 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-09-30 20:28:01,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:01,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:01,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:03,285 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:03,285 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-09-30 20:28:03,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-30 20:28:03,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-30 20:28:03,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2840, Invalid=4816, Unknown=0, NotChecked=0, Total=7656 [2018-09-30 20:28:03,287 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 88 states. [2018-09-30 20:28:05,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:05,369 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-09-30 20:28:05,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-30 20:28:05,370 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 211 [2018-09-30 20:28:05,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:05,371 INFO L225 Difference]: With dead ends: 221 [2018-09-30 20:28:05,371 INFO L226 Difference]: Without dead ends: 220 [2018-09-30 20:28:05,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5287 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5675, Invalid=11095, Unknown=0, NotChecked=0, Total=16770 [2018-09-30 20:28:05,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-09-30 20:28:05,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2018-09-30 20:28:05,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-30 20:28:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-09-30 20:28:05,416 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 211 [2018-09-30 20:28:05,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:05,417 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-09-30 20:28:05,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-30 20:28:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-09-30 20:28:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-30 20:28:05,418 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:05,418 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1, 1] [2018-09-30 20:28:05,418 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:28:05,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:05,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1252127001, now seen corresponding path program 42 times [2018-09-30 20:28:05,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:05,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:05,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:05,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:05,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:06,624 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:06,624 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:28:06,631 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:28:06,922 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-30 20:28:06,923 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:06,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:06,934 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-09-30 20:28:06,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:06,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:06,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:08,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:08,619 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:08,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 89 [2018-09-30 20:28:08,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-30 20:28:08,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-30 20:28:08,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=5038, Unknown=0, NotChecked=0, Total=8010 [2018-09-30 20:28:08,621 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 90 states. [2018-09-30 20:28:10,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:10,795 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-09-30 20:28:10,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-30 20:28:10,795 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 216 [2018-09-30 20:28:10,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:10,796 INFO L225 Difference]: With dead ends: 226 [2018-09-30 20:28:10,796 INFO L226 Difference]: Without dead ends: 225 [2018-09-30 20:28:10,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5542 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5939, Invalid=11617, Unknown=0, NotChecked=0, Total=17556 [2018-09-30 20:28:10,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-30 20:28:10,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2018-09-30 20:28:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-09-30 20:28:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-09-30 20:28:10,840 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 216 [2018-09-30 20:28:10,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:10,840 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-09-30 20:28:10,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-30 20:28:10,840 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-09-30 20:28:10,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-09-30 20:28:10,841 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:10,841 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1, 1] [2018-09-30 20:28:10,842 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:28:10,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:10,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1716112657, now seen corresponding path program 43 times [2018-09-30 20:28:10,842 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:10,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:10,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:10,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:10,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:12,103 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:12,103 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:28:12,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:28:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:12,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:12,270 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-09-30 20:28:12,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:12,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:12,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:14,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:14,269 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:14,269 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 91 [2018-09-30 20:28:14,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-30 20:28:14,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-30 20:28:14,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3107, Invalid=5265, Unknown=0, NotChecked=0, Total=8372 [2018-09-30 20:28:14,271 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 92 states. [2018-09-30 20:28:16,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:16,607 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-09-30 20:28:16,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-30 20:28:16,608 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 221 [2018-09-30 20:28:16,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:16,609 INFO L225 Difference]: With dead ends: 231 [2018-09-30 20:28:16,609 INFO L226 Difference]: Without dead ends: 230 [2018-09-30 20:28:16,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5803 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6209, Invalid=12151, Unknown=0, NotChecked=0, Total=18360 [2018-09-30 20:28:16,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-30 20:28:16,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2018-09-30 20:28:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-30 20:28:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-09-30 20:28:16,666 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 221 [2018-09-30 20:28:16,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:16,667 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-09-30 20:28:16,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-30 20:28:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-09-30 20:28:16,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-30 20:28:16,668 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:16,668 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1, 1] [2018-09-30 20:28:16,668 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:28:16,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:16,669 INFO L82 PathProgramCache]: Analyzing trace with hash 279992615, now seen corresponding path program 44 times [2018-09-30 20:28:16,669 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:16,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:16,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:16,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:28:16,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:18,035 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:18,035 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:28:18,044 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:28:18,193 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:28:18,193 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:18,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:18,204 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-09-30 20:28:18,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:18,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:18,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:19,749 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:19,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 93 [2018-09-30 20:28:19,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-30 20:28:19,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-30 20:28:19,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3245, Invalid=5497, Unknown=0, NotChecked=0, Total=8742 [2018-09-30 20:28:19,751 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 94 states. [2018-09-30 20:28:22,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:22,130 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-09-30 20:28:22,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-30 20:28:22,131 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 226 [2018-09-30 20:28:22,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:22,132 INFO L225 Difference]: With dead ends: 236 [2018-09-30 20:28:22,132 INFO L226 Difference]: Without dead ends: 235 [2018-09-30 20:28:22,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6070 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6485, Invalid=12697, Unknown=0, NotChecked=0, Total=19182 [2018-09-30 20:28:22,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-30 20:28:22,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-09-30 20:28:22,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-09-30 20:28:22,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-09-30 20:28:22,191 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 226 [2018-09-30 20:28:22,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:22,192 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-09-30 20:28:22,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-30 20:28:22,192 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-09-30 20:28:22,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-09-30 20:28:22,193 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:22,193 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1, 1] [2018-09-30 20:28:22,193 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:28:22,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:22,194 INFO L82 PathProgramCache]: Analyzing trace with hash 34335441, now seen corresponding path program 45 times [2018-09-30 20:28:22,194 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:22,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:22,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:22,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:22,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:23,976 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:23,976 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:28:23,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:28:24,289 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-30 20:28:24,289 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:24,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:24,299 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-09-30 20:28:24,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:24,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:24,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:26,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:26,054 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:26,055 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2018-09-30 20:28:26,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-30 20:28:26,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-30 20:28:26,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3386, Invalid=5734, Unknown=0, NotChecked=0, Total=9120 [2018-09-30 20:28:26,056 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 96 states. [2018-09-30 20:28:28,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:28,891 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-09-30 20:28:28,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-30 20:28:28,891 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 231 [2018-09-30 20:28:28,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:28,893 INFO L225 Difference]: With dead ends: 241 [2018-09-30 20:28:28,893 INFO L226 Difference]: Without dead ends: 240 [2018-09-30 20:28:28,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6343 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6767, Invalid=13255, Unknown=0, NotChecked=0, Total=20022 [2018-09-30 20:28:28,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-09-30 20:28:28,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2018-09-30 20:28:28,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-30 20:28:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-09-30 20:28:28,957 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 231 [2018-09-30 20:28:28,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:28,957 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-09-30 20:28:28,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-30 20:28:28,958 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-09-30 20:28:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-30 20:28:28,959 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:28,959 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1, 1] [2018-09-30 20:28:28,959 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:28:28,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:28,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1113248615, now seen corresponding path program 46 times [2018-09-30 20:28:28,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:28,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:28,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:28,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:28,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:30,458 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:30,458 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:28:30,465 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:28:30,633 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:28:30,634 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:30,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:30,663 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-09-30 20:28:30,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:30,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:30,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:32,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:32,322 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:32,322 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 97 [2018-09-30 20:28:32,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-30 20:28:32,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-30 20:28:32,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3530, Invalid=5976, Unknown=0, NotChecked=0, Total=9506 [2018-09-30 20:28:32,324 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 98 states. [2018-09-30 20:28:35,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:35,130 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-09-30 20:28:35,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 20:28:35,130 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 236 [2018-09-30 20:28:35,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:35,131 INFO L225 Difference]: With dead ends: 246 [2018-09-30 20:28:35,131 INFO L226 Difference]: Without dead ends: 245 [2018-09-30 20:28:35,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6622 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7055, Invalid=13825, Unknown=0, NotChecked=0, Total=20880 [2018-09-30 20:28:35,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-30 20:28:35,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2018-09-30 20:28:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-09-30 20:28:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-09-30 20:28:35,179 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 236 [2018-09-30 20:28:35,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:35,179 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-09-30 20:28:35,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-30 20:28:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-09-30 20:28:35,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-09-30 20:28:35,180 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:35,181 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1, 1] [2018-09-30 20:28:35,181 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:28:35,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:35,181 INFO L82 PathProgramCache]: Analyzing trace with hash -418129775, now seen corresponding path program 47 times [2018-09-30 20:28:35,181 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:35,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:35,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:35,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:35,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:36,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:36,578 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:36,578 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:28:36,585 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:28:36,859 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-30 20:28:36,860 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:36,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:36,871 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-09-30 20:28:36,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:36,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:36,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:38,557 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:38,557 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 99 [2018-09-30 20:28:38,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-30 20:28:38,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-30 20:28:38,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3677, Invalid=6223, Unknown=0, NotChecked=0, Total=9900 [2018-09-30 20:28:38,559 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 100 states. [2018-09-30 20:28:41,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:41,362 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-09-30 20:28:41,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-30 20:28:41,362 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 241 [2018-09-30 20:28:41,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:41,363 INFO L225 Difference]: With dead ends: 251 [2018-09-30 20:28:41,363 INFO L226 Difference]: Without dead ends: 250 [2018-09-30 20:28:41,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6907 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7349, Invalid=14407, Unknown=0, NotChecked=0, Total=21756 [2018-09-30 20:28:41,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-30 20:28:41,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2018-09-30 20:28:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-09-30 20:28:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-09-30 20:28:41,411 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 241 [2018-09-30 20:28:41,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:41,411 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-09-30 20:28:41,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-30 20:28:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-09-30 20:28:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-09-30 20:28:41,412 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:41,412 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1, 1] [2018-09-30 20:28:41,412 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:28:41,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:41,413 INFO L82 PathProgramCache]: Analyzing trace with hash 501317031, now seen corresponding path program 48 times [2018-09-30 20:28:41,413 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:41,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:41,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:41,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:41,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:42,829 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:42,829 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:28:42,836 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:28:43,180 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-30 20:28:43,180 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:43,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:43,192 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-09-30 20:28:43,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:43,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:43,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:45,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:45,319 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:45,319 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 101 [2018-09-30 20:28:45,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-30 20:28:45,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-30 20:28:45,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3827, Invalid=6475, Unknown=0, NotChecked=0, Total=10302 [2018-09-30 20:28:45,322 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 102 states. [2018-09-30 20:28:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:48,114 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-09-30 20:28:48,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-30 20:28:48,114 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 246 [2018-09-30 20:28:48,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:48,116 INFO L225 Difference]: With dead ends: 256 [2018-09-30 20:28:48,116 INFO L226 Difference]: Without dead ends: 255 [2018-09-30 20:28:48,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7198 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7649, Invalid=15001, Unknown=0, NotChecked=0, Total=22650 [2018-09-30 20:28:48,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-09-30 20:28:48,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2018-09-30 20:28:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-09-30 20:28:48,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-09-30 20:28:48,168 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 246 [2018-09-30 20:28:48,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:48,168 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-09-30 20:28:48,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-30 20:28:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-09-30 20:28:48,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-09-30 20:28:48,170 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:48,170 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1, 1] [2018-09-30 20:28:48,170 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:28:48,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:48,170 INFO L82 PathProgramCache]: Analyzing trace with hash -732064175, now seen corresponding path program 49 times [2018-09-30 20:28:48,171 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:48,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:48,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:48,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:48,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:49,920 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:49,921 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:28:49,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:28:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:50,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:50,106 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-09-30 20:28:50,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:50,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:50,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:51,937 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:51,938 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 103 [2018-09-30 20:28:51,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-30 20:28:51,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-30 20:28:51,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3980, Invalid=6732, Unknown=0, NotChecked=0, Total=10712 [2018-09-30 20:28:51,940 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 104 states. [2018-09-30 20:28:54,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:54,936 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-09-30 20:28:54,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-30 20:28:54,937 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 251 [2018-09-30 20:28:54,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:54,938 INFO L225 Difference]: With dead ends: 261 [2018-09-30 20:28:54,938 INFO L226 Difference]: Without dead ends: 260 [2018-09-30 20:28:54,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7495 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7955, Invalid=15607, Unknown=0, NotChecked=0, Total=23562 [2018-09-30 20:28:54,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-09-30 20:28:54,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2018-09-30 20:28:54,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-30 20:28:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-09-30 20:28:54,999 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 251 [2018-09-30 20:28:54,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:54,999 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-09-30 20:28:54,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-30 20:28:54,999 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-09-30 20:28:55,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-30 20:28:55,000 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:55,001 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1, 1] [2018-09-30 20:28:55,001 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:28:55,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:55,001 INFO L82 PathProgramCache]: Analyzing trace with hash -506963993, now seen corresponding path program 50 times [2018-09-30 20:28:55,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:55,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:55,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:55,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:28:55,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:56,734 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:56,734 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:28:56,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:28:56,920 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:28:56,921 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:56,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:56,933 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-09-30 20:28:56,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:56,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:56,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:58,772 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:58,772 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 105 [2018-09-30 20:28:58,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-30 20:28:58,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-30 20:28:58,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4136, Invalid=6994, Unknown=0, NotChecked=0, Total=11130 [2018-09-30 20:28:58,775 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 106 states. [2018-09-30 20:29:01,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:01,894 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2018-09-30 20:29:01,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-30 20:29:01,894 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 256 [2018-09-30 20:29:01,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:01,895 INFO L225 Difference]: With dead ends: 266 [2018-09-30 20:29:01,895 INFO L226 Difference]: Without dead ends: 265 [2018-09-30 20:29:01,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7798 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8267, Invalid=16225, Unknown=0, NotChecked=0, Total=24492 [2018-09-30 20:29:01,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-09-30 20:29:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2018-09-30 20:29:01,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-09-30 20:29:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2018-09-30 20:29:01,950 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 256 [2018-09-30 20:29:01,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:01,950 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2018-09-30 20:29:01,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-30 20:29:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2018-09-30 20:29:01,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-09-30 20:29:01,952 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:01,952 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1, 1] [2018-09-30 20:29:01,952 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:29:01,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:01,952 INFO L82 PathProgramCache]: Analyzing trace with hash -35314671, now seen corresponding path program 51 times [2018-09-30 20:29:01,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:01,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:01,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:01,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:01,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:03,546 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:03,547 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:29:03,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:29:03,960 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-09-30 20:29:03,960 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:03,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:03,971 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-09-30 20:29:03,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:03,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:03,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:06,125 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:06,125 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 107 [2018-09-30 20:29:06,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-30 20:29:06,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-30 20:29:06,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4295, Invalid=7261, Unknown=0, NotChecked=0, Total=11556 [2018-09-30 20:29:06,127 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 108 states. [2018-09-30 20:29:09,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:09,182 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-09-30 20:29:09,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 20:29:09,183 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 261 [2018-09-30 20:29:09,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:09,184 INFO L225 Difference]: With dead ends: 271 [2018-09-30 20:29:09,184 INFO L226 Difference]: Without dead ends: 270 [2018-09-30 20:29:09,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8107 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8585, Invalid=16855, Unknown=0, NotChecked=0, Total=25440 [2018-09-30 20:29:09,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-09-30 20:29:09,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2018-09-30 20:29:09,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-09-30 20:29:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-09-30 20:29:09,244 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 261 [2018-09-30 20:29:09,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:09,244 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-09-30 20:29:09,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-30 20:29:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-09-30 20:29:09,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-09-30 20:29:09,245 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:09,245 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1, 1] [2018-09-30 20:29:09,246 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:29:09,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:09,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2006147623, now seen corresponding path program 52 times [2018-09-30 20:29:09,246 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:09,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:09,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:09,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:09,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:11,034 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:11,035 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:29:11,044 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:29:11,242 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:29:11,242 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:11,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:11,259 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-09-30 20:29:11,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:11,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:11,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:13,281 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:13,281 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 109 [2018-09-30 20:29:13,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-30 20:29:13,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-30 20:29:13,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4457, Invalid=7533, Unknown=0, NotChecked=0, Total=11990 [2018-09-30 20:29:13,282 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 110 states. [2018-09-30 20:29:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:16,324 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-09-30 20:29:16,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-30 20:29:16,325 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 266 [2018-09-30 20:29:16,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:16,326 INFO L225 Difference]: With dead ends: 276 [2018-09-30 20:29:16,326 INFO L226 Difference]: Without dead ends: 275 [2018-09-30 20:29:16,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8422 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8909, Invalid=17497, Unknown=0, NotChecked=0, Total=26406 [2018-09-30 20:29:16,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-09-30 20:29:16,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2018-09-30 20:29:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-09-30 20:29:16,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-09-30 20:29:16,391 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 266 [2018-09-30 20:29:16,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:16,391 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-09-30 20:29:16,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-30 20:29:16,392 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-09-30 20:29:16,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-09-30 20:29:16,393 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:16,393 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1, 1] [2018-09-30 20:29:16,393 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:29:16,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:16,394 INFO L82 PathProgramCache]: Analyzing trace with hash -861503023, now seen corresponding path program 53 times [2018-09-30 20:29:16,394 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:16,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:16,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:16,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:16,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:18,032 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:18,032 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:29:18,040 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:29:18,380 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-09-30 20:29:18,380 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:18,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:18,395 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-09-30 20:29:18,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:18,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:18,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:20,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:20,499 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:20,499 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 111 [2018-09-30 20:29:20,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-30 20:29:20,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-30 20:29:20,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4622, Invalid=7810, Unknown=0, NotChecked=0, Total=12432 [2018-09-30 20:29:20,502 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 112 states. [2018-09-30 20:29:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:23,623 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-09-30 20:29:23,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-30 20:29:23,623 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 271 [2018-09-30 20:29:23,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:23,624 INFO L225 Difference]: With dead ends: 281 [2018-09-30 20:29:23,625 INFO L226 Difference]: Without dead ends: 280 [2018-09-30 20:29:23,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8743 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9239, Invalid=18151, Unknown=0, NotChecked=0, Total=27390 [2018-09-30 20:29:23,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-09-30 20:29:23,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2018-09-30 20:29:23,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-30 20:29:23,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-09-30 20:29:23,693 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 271 [2018-09-30 20:29:23,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:23,693 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-09-30 20:29:23,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-30 20:29:23,693 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-09-30 20:29:23,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-30 20:29:23,695 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:23,695 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1, 1] [2018-09-30 20:29:23,695 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:29:23,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:23,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1278829465, now seen corresponding path program 54 times [2018-09-30 20:29:23,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:23,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:23,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:23,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:23,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:25,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:25,538 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:25,538 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:29:25,545 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:29:25,965 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-09-30 20:29:25,965 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:25,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:25,980 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-09-30 20:29:25,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:25,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:25,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:28,105 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:28,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 113 [2018-09-30 20:29:28,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-30 20:29:28,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-30 20:29:28,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4790, Invalid=8092, Unknown=0, NotChecked=0, Total=12882 [2018-09-30 20:29:28,108 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 114 states. [2018-09-30 20:29:31,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:31,394 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2018-09-30 20:29:31,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-30 20:29:31,394 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 276 [2018-09-30 20:29:31,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:31,395 INFO L225 Difference]: With dead ends: 286 [2018-09-30 20:29:31,395 INFO L226 Difference]: Without dead ends: 285 [2018-09-30 20:29:31,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9070 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9575, Invalid=18817, Unknown=0, NotChecked=0, Total=28392 [2018-09-30 20:29:31,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-09-30 20:29:31,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2018-09-30 20:29:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-09-30 20:29:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2018-09-30 20:29:31,473 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 276 [2018-09-30 20:29:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:31,473 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2018-09-30 20:29:31,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-30 20:29:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2018-09-30 20:29:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-09-30 20:29:31,474 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:31,475 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1, 1] [2018-09-30 20:29:31,475 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:29:31,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:31,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1633833071, now seen corresponding path program 55 times [2018-09-30 20:29:31,475 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:31,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:31,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:31,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:31,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:33,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:33,226 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:33,226 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:29:33,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:29:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:33,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:33,431 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-09-30 20:29:33,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:33,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:33,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:35,580 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:35,580 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 115 [2018-09-30 20:29:35,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-30 20:29:35,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-30 20:29:35,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4961, Invalid=8379, Unknown=0, NotChecked=0, Total=13340 [2018-09-30 20:29:35,582 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 116 states. [2018-09-30 20:29:38,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:38,716 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-09-30 20:29:38,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-30 20:29:38,716 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 281 [2018-09-30 20:29:38,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:38,717 INFO L225 Difference]: With dead ends: 291 [2018-09-30 20:29:38,718 INFO L226 Difference]: Without dead ends: 290 [2018-09-30 20:29:38,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9403 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9917, Invalid=19495, Unknown=0, NotChecked=0, Total=29412 [2018-09-30 20:29:38,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-09-30 20:29:38,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2018-09-30 20:29:38,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-09-30 20:29:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-09-30 20:29:38,783 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 281 [2018-09-30 20:29:38,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:38,783 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-09-30 20:29:38,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-30 20:29:38,783 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-09-30 20:29:38,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-09-30 20:29:38,784 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:38,784 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1, 1] [2018-09-30 20:29:38,784 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:29:38,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:38,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1780087129, now seen corresponding path program 56 times [2018-09-30 20:29:38,785 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:38,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:38,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:38,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:29:38,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:40,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:40,676 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:40,676 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:29:40,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:29:40,864 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:29:40,864 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:40,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:40,878 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-09-30 20:29:40,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:40,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:40,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:42,979 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:43,001 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:43,002 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 117 [2018-09-30 20:29:43,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-30 20:29:43,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-30 20:29:43,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5135, Invalid=8671, Unknown=0, NotChecked=0, Total=13806 [2018-09-30 20:29:43,004 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 118 states. [2018-09-30 20:29:46,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:46,338 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2018-09-30 20:29:46,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-30 20:29:46,339 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 286 [2018-09-30 20:29:46,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:46,340 INFO L225 Difference]: With dead ends: 296 [2018-09-30 20:29:46,340 INFO L226 Difference]: Without dead ends: 295 [2018-09-30 20:29:46,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9742 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10265, Invalid=20185, Unknown=0, NotChecked=0, Total=30450 [2018-09-30 20:29:46,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-09-30 20:29:46,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2018-09-30 20:29:46,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-09-30 20:29:46,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2018-09-30 20:29:46,411 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 286 [2018-09-30 20:29:46,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:46,411 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2018-09-30 20:29:46,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-30 20:29:46,411 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2018-09-30 20:29:46,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-09-30 20:29:46,413 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:46,413 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1, 1] [2018-09-30 20:29:46,413 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:29:46,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:46,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2033799855, now seen corresponding path program 57 times [2018-09-30 20:29:46,413 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:46,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:46,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:46,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:46,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:48,270 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:48,270 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:29:48,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:29:48,704 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-09-30 20:29:48,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:48,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:48,720 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-09-30 20:29:48,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:48,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:48,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:50,912 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:50,934 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:50,934 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 119 [2018-09-30 20:29:50,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-30 20:29:50,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-30 20:29:50,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5312, Invalid=8968, Unknown=0, NotChecked=0, Total=14280 [2018-09-30 20:29:50,936 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 120 states. [2018-09-30 20:29:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:54,290 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-09-30 20:29:54,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-30 20:29:54,290 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 291 [2018-09-30 20:29:54,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:54,291 INFO L225 Difference]: With dead ends: 301 [2018-09-30 20:29:54,291 INFO L226 Difference]: Without dead ends: 300 [2018-09-30 20:29:54,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10087 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10619, Invalid=20887, Unknown=0, NotChecked=0, Total=31506 [2018-09-30 20:29:54,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-09-30 20:29:54,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2018-09-30 20:29:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-09-30 20:29:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-09-30 20:29:54,369 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 291 [2018-09-30 20:29:54,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:54,369 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-09-30 20:29:54,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-30 20:29:54,369 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-09-30 20:29:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-30 20:29:54,371 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:54,371 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1, 1] [2018-09-30 20:29:54,371 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:29:54,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:54,371 INFO L82 PathProgramCache]: Analyzing trace with hash -2005557017, now seen corresponding path program 58 times [2018-09-30 20:29:54,372 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:54,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:54,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:54,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:54,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:56,244 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:56,245 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:29:56,253 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:29:56,454 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:29:56,454 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:56,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:56,478 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-09-30 20:29:56,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:56,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:56,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:58,747 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:58,747 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 121 [2018-09-30 20:29:58,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-30 20:29:58,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-30 20:29:58,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5492, Invalid=9270, Unknown=0, NotChecked=0, Total=14762 [2018-09-30 20:29:58,749 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 122 states. [2018-09-30 20:30:02,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:30:02,189 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2018-09-30 20:30:02,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-30 20:30:02,189 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 296 [2018-09-30 20:30:02,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:30:02,190 INFO L225 Difference]: With dead ends: 306 [2018-09-30 20:30:02,191 INFO L226 Difference]: Without dead ends: 305 [2018-09-30 20:30:02,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10438 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10979, Invalid=21601, Unknown=0, NotChecked=0, Total=32580 [2018-09-30 20:30:02,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-09-30 20:30:02,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2018-09-30 20:30:02,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-09-30 20:30:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-09-30 20:30:02,272 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 296 [2018-09-30 20:30:02,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:30:02,272 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-09-30 20:30:02,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-30 20:30:02,272 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-09-30 20:30:02,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-09-30 20:30:02,273 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:30:02,274 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1, 1] [2018-09-30 20:30:02,274 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:30:02,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:30:02,274 INFO L82 PathProgramCache]: Analyzing trace with hash 220035857, now seen corresponding path program 59 times [2018-09-30 20:30:02,274 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:30:02,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:30:02,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:30:02,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:30:02,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:30:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:30:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:30:04,185 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:30:04,186 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:30:04,192 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:30:04,592 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-09-30 20:30:04,592 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:30:04,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:30:04,609 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-09-30 20:30:04,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:30:04,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:30:04,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:30:07,007 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:30:07,030 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:30:07,030 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 123 [2018-09-30 20:30:07,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-30 20:30:07,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-30 20:30:07,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5675, Invalid=9577, Unknown=0, NotChecked=0, Total=15252 [2018-09-30 20:30:07,032 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 124 states. [2018-09-30 20:30:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:30:10,590 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-09-30 20:30:10,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-30 20:30:10,591 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 301 [2018-09-30 20:30:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:30:10,592 INFO L225 Difference]: With dead ends: 311 [2018-09-30 20:30:10,592 INFO L226 Difference]: Without dead ends: 310 [2018-09-30 20:30:10,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10795 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=11345, Invalid=22327, Unknown=0, NotChecked=0, Total=33672 [2018-09-30 20:30:10,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-09-30 20:30:10,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 307. [2018-09-30 20:30:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-09-30 20:30:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-09-30 20:30:10,670 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 301 [2018-09-30 20:30:10,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:30:10,671 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-09-30 20:30:10,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-30 20:30:10,671 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-09-30 20:30:10,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-09-30 20:30:10,672 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:30:10,672 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1, 1] [2018-09-30 20:30:10,672 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:30:10,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:30:10,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1594266841, now seen corresponding path program 60 times [2018-09-30 20:30:10,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:30:10,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:30:10,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:30:10,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:30:10,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:30:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-30 20:30:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:30:12,678 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:30:12,678 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:30:12,686 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:30:13,184 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-09-30 20:30:13,184 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:30:13,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:30:13,195 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-30 20:30:13,396 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:30:13,397 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 20:30:13,403 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 20:30:13,403 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:30:13 BoogieIcfgContainer [2018-09-30 20:30:13,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:30:13,404 INFO L168 Benchmark]: Toolchain (without parser) took 239922.97 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -745.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-09-30 20:30:13,405 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 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-09-30 20:30:13,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.52 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-09-30 20:30:13,405 INFO L168 Benchmark]: Boogie Preprocessor took 28.80 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-09-30 20:30:13,405 INFO L168 Benchmark]: RCFGBuilder took 315.54 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-09-30 20:30:13,406 INFO L168 Benchmark]: TraceAbstraction took 239495.24 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-09-30 20:30:13,408 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.24 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 71.52 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 28.80 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 315.54 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 239495.24 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 307 with TraceHistMax 61, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 5 quantified variables from 5 xjuncts. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 307 with TraceHistMax 61, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 5 quantified variables from 5 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 2 error locations. TIMEOUT Result, 239.3s OverallTime, 63 OverallIterations, 61 TraceHistogramMax, 96.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 207 SDtfs, 11200 SDslu, 2208 SDs, 0 SdLazy, 16368 SolverSat, 5613 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12932 GetRequests, 7320 SyntacticMatches, 0 SemanticMatches, 5612 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221132 ImplicationChecksByTransitivity, 177.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307occurred in iteration=62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 62 MinimizatonAttempts, 185 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.6s SsaConstructionTime, 9.2s SatisfiabilityAnalysisTime, 121.9s InterpolantComputationTime, 18428 NumberOfCodeBlocks, 18428 NumberOfCodeBlocksAsserted, 1031 NumberOfCheckSat, 18307 ConstructedInterpolants, 0 QuantifiedInterpolants, 29560497 SizeOfPredicates, 639 NumberOfNonLiveVariables, 39471 ConjunctsInSsa, 6411 ConjunctsInUnsatCore, 121 InterpolantComputations, 3 PerfectInterpolantSequences, 2/356362 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-30-13-416.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-30-13-416.csv Completed graceful shutdown