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-10-01 00:01:36,727 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:01:36,729 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:01:36,742 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:01:36,742 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:01:36,743 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:01:36,745 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:01:36,746 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:01:36,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:01:36,749 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:01:36,750 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:01:36,750 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:01:36,751 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:01:36,752 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:01:36,753 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:01:36,754 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:01:36,755 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:01:36,756 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:01:36,758 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:01:36,761 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:01:36,762 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:01:36,766 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:01:36,772 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:01:36,772 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:01:36,773 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:01:36,774 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:01:36,775 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:01:36,775 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:01:36,776 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:01:36,777 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:01:36,780 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:01:36,781 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:01:36,781 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:01:36,781 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:01:36,782 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:01:36,786 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:01:36,786 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-10-01 00:01:36,800 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:01:36,800 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:01:36,801 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:01:36,805 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:01:36,805 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:01:36,805 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:01:36,806 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:01:36,806 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:01:36,806 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:01:36,806 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:01:36,806 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:01:36,807 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:01:36,807 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:01:36,807 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:01:36,807 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:01:36,807 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:01:36,809 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:01:36,809 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:01:36,810 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:01:36,810 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:01:36,810 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:01:36,810 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:01:36,810 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:01:36,810 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:01:36,811 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:01:36,811 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:01:36,811 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:01:36,811 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:01:36,811 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:01:36,812 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:01:36,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:01:36,876 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:01:36,881 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:01:36,883 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:01:36,883 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:01:36,884 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl [2018-10-01 00:01:36,884 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl' [2018-10-01 00:01:36,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:01:36,963 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:01:36,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:01:36,964 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:01:36,965 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:01:36,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:36" (1/1) ... [2018-10-01 00:01:37,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:36" (1/1) ... [2018-10-01 00:01:37,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:01:37,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:01:37,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:01:37,040 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:01:37,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:36" (1/1) ... [2018-10-01 00:01:37,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:36" (1/1) ... [2018-10-01 00:01:37,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:36" (1/1) ... [2018-10-01 00:01:37,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:36" (1/1) ... [2018-10-01 00:01:37,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:36" (1/1) ... [2018-10-01 00:01:37,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:36" (1/1) ... [2018-10-01 00:01:37,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:36" (1/1) ... [2018-10-01 00:01:37,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:01:37,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:01:37,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:01:37,073 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:01:37,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:01:37,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:01:37,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:01:37,521 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:01:37,522 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:01:37 BoogieIcfgContainer [2018-10-01 00:01:37,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:01:37,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:01:37,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:01:37,527 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:01:37,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:36" (1/2) ... [2018-10-01 00:01:37,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc1ea2a and model type PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:01:37, skipping insertion in model container [2018-10-01 00:01:37,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:01:37" (2/2) ... [2018-10-01 00:01:37,530 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement.bpl [2018-10-01 00:01:37,542 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:01:37,551 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-10-01 00:01:37,608 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:01:37,609 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:01:37,609 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:01:37,609 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:01:37,609 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:01:37,610 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:01:37,610 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:01:37,610 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:01:37,610 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:01:37,626 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-10-01 00:01:37,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 00:01:37,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:37,634 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-01 00:01:37,635 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:37,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:37,641 INFO L82 PathProgramCache]: Analyzing trace with hash 28694788, now seen corresponding path program 1 times [2018-10-01 00:01:37,643 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:37,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:37,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:37,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:37,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:37,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:37,872 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:01:37,872 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:01:37,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:01:37,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:01:37,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-01 00:01:37,892 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2018-10-01 00:01:38,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:38,007 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-10-01 00:01:38,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:01:38,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-10-01 00:01:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:38,019 INFO L225 Difference]: With dead ends: 24 [2018-10-01 00:01:38,020 INFO L226 Difference]: Without dead ends: 11 [2018-10-01 00:01:38,023 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-10-01 00:01:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-01 00:01:38,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-10-01 00:01:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-01 00:01:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-10-01 00:01:38,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2018-10-01 00:01:38,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:38,059 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-10-01 00:01:38,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:01:38,060 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-10-01 00:01:38,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-01 00:01:38,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:38,060 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-01 00:01:38,061 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:38,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:38,061 INFO L82 PathProgramCache]: Analyzing trace with hash 889538471, now seen corresponding path program 1 times [2018-10-01 00:01:38,061 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:38,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:38,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:38,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:38,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:38,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:38,215 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:01:38,216 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:01:38,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:01:38,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:01:38,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-01 00:01:38,218 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-10-01 00:01:38,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:38,389 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-10-01 00:01:38,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:01:38,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-01 00:01:38,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:38,391 INFO L225 Difference]: With dead ends: 18 [2018-10-01 00:01:38,391 INFO L226 Difference]: Without dead ends: 17 [2018-10-01 00:01:38,392 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-10-01 00:01:38,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-01 00:01:38,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-10-01 00:01:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-01 00:01:38,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-10-01 00:01:38,398 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2018-10-01 00:01:38,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:38,398 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-10-01 00:01:38,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:01:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-10-01 00:01:38,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:01:38,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:38,400 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:01:38,400 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:38,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:38,401 INFO L82 PathProgramCache]: Analyzing trace with hash 473213613, now seen corresponding path program 1 times [2018-10-01 00:01:38,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:38,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:38,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:38,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:38,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:38,466 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:01:38,466 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:01:38,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:01:38,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:01:38,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-01 00:01:38,468 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 3 states. [2018-10-01 00:01:38,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:38,494 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-10-01 00:01:38,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:01:38,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-10-01 00:01:38,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:38,495 INFO L225 Difference]: With dead ends: 19 [2018-10-01 00:01:38,495 INFO L226 Difference]: Without dead ends: 12 [2018-10-01 00:01:38,496 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-10-01 00:01:38,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-01 00:01:38,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-01 00:01:38,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-01 00:01:38,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-01 00:01:38,500 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-10-01 00:01:38,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:38,501 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-01 00:01:38,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:01:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-01 00:01:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-01 00:01:38,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:38,502 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-10-01 00:01:38,503 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:38,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:38,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1846021201, now seen corresponding path program 1 times [2018-10-01 00:01:38,503 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:38,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:38,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:38,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:38,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:38,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:38,767 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:38,767 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:01:38,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:38,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:38,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:01:38,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:38,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:01:38,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:39,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:39,057 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:39,057 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-01 00:01:39,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:01:39,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:01:39,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-01 00:01:39,060 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2018-10-01 00:01:39,319 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-01 00:01:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:39,368 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-01 00:01:39,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:01:39,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-10-01 00:01:39,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:39,370 INFO L225 Difference]: With dead ends: 21 [2018-10-01 00:01:39,370 INFO L226 Difference]: Without dead ends: 20 [2018-10-01 00:01:39,371 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-10-01 00:01:39,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-01 00:01:39,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-10-01 00:01:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-01 00:01:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-01 00:01:39,376 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2018-10-01 00:01:39,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:39,377 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-01 00:01:39,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:01:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-01 00:01:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:01:39,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:39,378 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1] [2018-10-01 00:01:39,378 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:39,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:39,379 INFO L82 PathProgramCache]: Analyzing trace with hash 506962407, now seen corresponding path program 2 times [2018-10-01 00:01:39,379 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:39,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:39,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:39,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:39,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:39,508 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:39,508 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:01:39,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:01:39,544 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:01:39,545 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:39,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:39,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:01:39,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:39,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:01:39,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:39,804 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:39,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-01 00:01:39,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:01:39,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:01:39,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-01 00:01:39,806 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-10-01 00:01:40,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:40,250 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-01 00:01:40,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:01:40,251 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-10-01 00:01:40,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:40,252 INFO L225 Difference]: With dead ends: 26 [2018-10-01 00:01:40,252 INFO L226 Difference]: Without dead ends: 25 [2018-10-01 00:01:40,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-10-01 00:01:40,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-01 00:01:40,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-10-01 00:01:40,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-01 00:01:40,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-01 00:01:40,260 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2018-10-01 00:01:40,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:40,260 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-01 00:01:40,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:01:40,260 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-01 00:01:40,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-01 00:01:40,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:40,261 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1] [2018-10-01 00:01:40,262 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:40,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:40,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1970543121, now seen corresponding path program 3 times [2018-10-01 00:01:40,262 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:40,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:40,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:40,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:40,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:40,584 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:40,584 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:01:40,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:01:40,630 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-01 00:01:40,631 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:40,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:40,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-10-01 00:01:40,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:40,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:01:40,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:40,778 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:40,801 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:40,801 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-01 00:01:40,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-01 00:01:40,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-01 00:01:40,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-01 00:01:40,802 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2018-10-01 00:01:41,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:41,051 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-01 00:01:41,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:01:41,052 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-10-01 00:01:41,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:41,053 INFO L225 Difference]: With dead ends: 31 [2018-10-01 00:01:41,053 INFO L226 Difference]: Without dead ends: 30 [2018-10-01 00:01:41,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-10-01 00:01:41,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-01 00:01:41,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-10-01 00:01:41,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-01 00:01:41,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-01 00:01:41,060 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2018-10-01 00:01:41,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:41,060 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-01 00:01:41,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-01 00:01:41,060 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-01 00:01:41,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-01 00:01:41,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:41,061 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1] [2018-10-01 00:01:41,062 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:41,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:41,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1357786151, now seen corresponding path program 4 times [2018-10-01 00:01:41,063 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:41,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:41,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:41,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:41,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:41,261 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:41,261 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:01:41,277 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:01:41,320 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:01:41,320 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:41,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:41,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:01:41,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:41,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:01:41,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:41,532 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:41,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-01 00:01:41,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:01:41,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:01:41,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-10-01 00:01:41,534 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-10-01 00:01:41,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:41,785 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-01 00:01:41,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:01:41,785 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-10-01 00:01:41,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:41,787 INFO L225 Difference]: With dead ends: 36 [2018-10-01 00:01:41,787 INFO L226 Difference]: Without dead ends: 35 [2018-10-01 00:01:41,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2018-10-01 00:01:41,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-01 00:01:41,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-10-01 00:01:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-01 00:01:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-01 00:01:41,794 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2018-10-01 00:01:41,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:41,795 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-01 00:01:41,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:01:41,795 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-01 00:01:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-01 00:01:41,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:41,796 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1] [2018-10-01 00:01:41,796 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:41,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:41,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1853487057, now seen corresponding path program 5 times [2018-10-01 00:01:41,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:41,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:41,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:41,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:41,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:41,928 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:41,929 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:41,929 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:01:41,938 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:01:41,972 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-01 00:01:41,972 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:41,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:41,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:01:41,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:41,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:01:41,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:42,245 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:42,267 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:42,267 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-01 00:01:42,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:01:42,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:01:42,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-10-01 00:01:42,268 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 16 states. [2018-10-01 00:01:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:42,679 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-01 00:01:42,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:01:42,679 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-10-01 00:01:42,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:42,681 INFO L225 Difference]: With dead ends: 41 [2018-10-01 00:01:42,681 INFO L226 Difference]: Without dead ends: 40 [2018-10-01 00:01:42,682 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-10-01 00:01:42,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-01 00:01:42,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-10-01 00:01:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-01 00:01:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-01 00:01:42,690 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2018-10-01 00:01:42,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:42,690 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-01 00:01:42,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:01:42,691 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-01 00:01:42,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-01 00:01:42,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:42,692 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1] [2018-10-01 00:01:42,692 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:42,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:42,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1716722073, now seen corresponding path program 6 times [2018-10-01 00:01:42,693 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:42,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:42,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:42,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:42,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:43,099 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:43,099 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:01:43,111 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:01:43,181 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-01 00:01:43,182 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:43,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:43,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-10-01 00:01:43,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:43,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:01:43,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:43,369 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:43,389 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:43,389 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-01 00:01:43,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:01:43,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:01:43,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-10-01 00:01:43,391 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 18 states. [2018-10-01 00:01:43,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:43,799 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-01 00:01:43,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:01:43,800 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-10-01 00:01:43,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:43,802 INFO L225 Difference]: With dead ends: 46 [2018-10-01 00:01:43,802 INFO L226 Difference]: Without dead ends: 45 [2018-10-01 00:01:43,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=385, Unknown=0, NotChecked=0, Total=600 [2018-10-01 00:01:43,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-01 00:01:43,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-10-01 00:01:43,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-01 00:01:43,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-01 00:01:43,814 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2018-10-01 00:01:43,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:43,814 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-01 00:01:43,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:01:43,814 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-01 00:01:43,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-01 00:01:43,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:43,816 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1] [2018-10-01 00:01:43,816 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:43,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:43,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1089100399, now seen corresponding path program 7 times [2018-10-01 00:01:43,817 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:43,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:43,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:43,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:43,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:43,992 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:43,993 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:43,993 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:01:44,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:44,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:44,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:01:44,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:44,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:01:44,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:44,547 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:44,547 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-01 00:01:44,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-01 00:01:44,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-01 00:01:44,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-10-01 00:01:44,548 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 20 states. [2018-10-01 00:01:44,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:44,884 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-01 00:01:44,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:01:44,885 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2018-10-01 00:01:44,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:44,887 INFO L225 Difference]: With dead ends: 51 [2018-10-01 00:01:44,887 INFO L226 Difference]: Without dead ends: 50 [2018-10-01 00:01:44,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=269, Invalid=487, Unknown=0, NotChecked=0, Total=756 [2018-10-01 00:01:44,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-01 00:01:44,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-10-01 00:01:44,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-01 00:01:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-01 00:01:44,895 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 41 [2018-10-01 00:01:44,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:44,896 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-01 00:01:44,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-01 00:01:44,896 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-01 00:01:44,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-01 00:01:44,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:44,897 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1] [2018-10-01 00:01:44,898 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:44,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:44,898 INFO L82 PathProgramCache]: Analyzing trace with hash -268971865, now seen corresponding path program 8 times [2018-10-01 00:01:44,898 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:44,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:44,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:44,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:44,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:45,083 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:45,084 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:45,084 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:01:45,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:01:45,139 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:01:45,140 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:45,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:45,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:01:45,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:45,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:01:45,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:45,485 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:45,507 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:45,507 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-01 00:01:45,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-01 00:01:45,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-01 00:01:45,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-10-01 00:01:45,508 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 22 states. [2018-10-01 00:01:45,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:45,970 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-01 00:01:45,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:01:45,971 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-10-01 00:01:45,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:45,972 INFO L225 Difference]: With dead ends: 56 [2018-10-01 00:01:45,972 INFO L226 Difference]: Without dead ends: 55 [2018-10-01 00:01:45,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=329, Invalid=601, Unknown=0, NotChecked=0, Total=930 [2018-10-01 00:01:45,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-01 00:01:45,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-10-01 00:01:45,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-01 00:01:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-01 00:01:45,983 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 46 [2018-10-01 00:01:45,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:45,984 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-01 00:01:45,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-01 00:01:45,984 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-01 00:01:45,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-01 00:01:45,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:45,985 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1] [2018-10-01 00:01:45,985 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:45,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:45,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2109529263, now seen corresponding path program 9 times [2018-10-01 00:01:45,986 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:45,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:45,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:45,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:45,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:46,233 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:46,233 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:01:46,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:01:46,293 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-01 00:01:46,293 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:46,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:46,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-10-01 00:01:46,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:46,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:01:46,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:46,546 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:46,578 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:46,578 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-10-01 00:01:46,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-01 00:01:46,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-01 00:01:46,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-10-01 00:01:46,581 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 24 states. [2018-10-01 00:01:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:47,233 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-01 00:01:47,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:01:47,233 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2018-10-01 00:01:47,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:47,234 INFO L225 Difference]: With dead ends: 61 [2018-10-01 00:01:47,234 INFO L226 Difference]: Without dead ends: 60 [2018-10-01 00:01:47,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=395, Invalid=727, Unknown=0, NotChecked=0, Total=1122 [2018-10-01 00:01:47,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-01 00:01:47,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-10-01 00:01:47,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-01 00:01:47,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-01 00:01:47,257 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 51 [2018-10-01 00:01:47,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:47,258 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-01 00:01:47,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-01 00:01:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-01 00:01:47,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-01 00:01:47,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:47,260 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1] [2018-10-01 00:01:47,260 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:47,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:47,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1236079897, now seen corresponding path program 10 times [2018-10-01 00:01:47,261 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:47,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:47,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:47,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:47,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:47,514 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:47,514 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:01:47,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:01:47,568 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:01:47,569 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:47,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:47,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:01:47,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:47,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:01:47,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:47,857 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:47,857 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-10-01 00:01:47,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-01 00:01:47,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-01 00:01:47,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2018-10-01 00:01:47,859 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2018-10-01 00:01:48,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:48,393 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-01 00:01:48,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:01:48,394 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-10-01 00:01:48,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:48,395 INFO L225 Difference]: With dead ends: 66 [2018-10-01 00:01:48,395 INFO L226 Difference]: Without dead ends: 65 [2018-10-01 00:01:48,396 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-10-01 00:01:48,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-01 00:01:48,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-10-01 00:01:48,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-01 00:01:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-01 00:01:48,405 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 56 [2018-10-01 00:01:48,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:48,405 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-01 00:01:48,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-01 00:01:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-01 00:01:48,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-01 00:01:48,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:48,407 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1] [2018-10-01 00:01:48,407 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:48,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:48,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1207857425, now seen corresponding path program 11 times [2018-10-01 00:01:48,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:48,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:48,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:48,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:48,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:48,828 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:48,828 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:01:48,840 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:01:48,917 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-01 00:01:48,918 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:48,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:48,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:01:48,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:48,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:01:48,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:49,233 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:49,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-10-01 00:01:49,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-01 00:01:49,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-01 00:01:49,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2018-10-01 00:01:49,234 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 28 states. [2018-10-01 00:01:49,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:49,786 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-01 00:01:49,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:01:49,786 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-10-01 00:01:49,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:49,787 INFO L225 Difference]: With dead ends: 71 [2018-10-01 00:01:49,787 INFO L226 Difference]: Without dead ends: 70 [2018-10-01 00:01:49,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=545, Invalid=1015, Unknown=0, NotChecked=0, Total=1560 [2018-10-01 00:01:49,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-01 00:01:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-10-01 00:01:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-01 00:01:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-01 00:01:49,801 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 61 [2018-10-01 00:01:49,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:49,801 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-01 00:01:49,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-01 00:01:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-01 00:01:49,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-01 00:01:49,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:49,811 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1] [2018-10-01 00:01:49,811 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:49,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:49,811 INFO L82 PathProgramCache]: Analyzing trace with hash -96324313, now seen corresponding path program 12 times [2018-10-01 00:01:49,812 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:49,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:49,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:49,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:49,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:50,067 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:50,067 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:01:50,078 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:01:50,140 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-01 00:01:50,140 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:50,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:50,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:01:50,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:50,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:01:50,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:50,498 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:50,498 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-10-01 00:01:50,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-01 00:01:50,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-01 00:01:50,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2018-10-01 00:01:50,499 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 30 states. [2018-10-01 00:01:51,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:51,048 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-01 00:01:51,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:01:51,048 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2018-10-01 00:01:51,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:51,049 INFO L225 Difference]: With dead ends: 76 [2018-10-01 00:01:51,049 INFO L226 Difference]: Without dead ends: 75 [2018-10-01 00:01:51,051 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-10-01 00:01:51,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-01 00:01:51,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-10-01 00:01:51,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-01 00:01:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-01 00:01:51,062 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 66 [2018-10-01 00:01:51,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:51,063 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-01 00:01:51,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-01 00:01:51,063 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-01 00:01:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-01 00:01:51,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:51,064 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1] [2018-10-01 00:01:51,064 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:51,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:51,065 INFO L82 PathProgramCache]: Analyzing trace with hash -716992815, now seen corresponding path program 13 times [2018-10-01 00:01:51,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:51,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:51,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:51,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:51,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:51,974 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:51,974 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:01:51,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:52,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:52,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:01:52,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:52,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:01:52,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:52,426 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:52,426 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-10-01 00:01:52,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-01 00:01:52,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-01 00:01:52,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-10-01 00:01:52,428 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 32 states. [2018-10-01 00:01:53,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:53,063 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-01 00:01:53,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:01:53,063 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-10-01 00:01:53,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:53,064 INFO L225 Difference]: With dead ends: 81 [2018-10-01 00:01:53,064 INFO L226 Difference]: Without dead ends: 80 [2018-10-01 00:01:53,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=719, Invalid=1351, Unknown=0, NotChecked=0, Total=2070 [2018-10-01 00:01:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-01 00:01:53,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-10-01 00:01:53,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-01 00:01:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-01 00:01:53,076 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 71 [2018-10-01 00:01:53,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:53,077 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-01 00:01:53,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-01 00:01:53,077 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-01 00:01:53,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-01 00:01:53,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:53,078 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1] [2018-10-01 00:01:53,078 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:53,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:53,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1270239385, now seen corresponding path program 14 times [2018-10-01 00:01:53,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:53,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:53,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:53,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:53,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:53,557 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:53,557 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:01:53,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:01:53,625 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:01:53,625 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:53,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:53,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:01:53,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:53,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:01:53,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:53,960 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:53,961 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-10-01 00:01:53,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-01 00:01:53,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-01 00:01:53,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2018-10-01 00:01:53,962 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 34 states. [2018-10-01 00:01:54,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:54,556 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-10-01 00:01:54,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 00:01:54,557 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 76 [2018-10-01 00:01:54,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:54,558 INFO L225 Difference]: With dead ends: 86 [2018-10-01 00:01:54,558 INFO L226 Difference]: Without dead ends: 85 [2018-10-01 00:01:54,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=815, Invalid=1537, Unknown=0, NotChecked=0, Total=2352 [2018-10-01 00:01:54,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-01 00:01:54,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-10-01 00:01:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-01 00:01:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-01 00:01:54,570 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 76 [2018-10-01 00:01:54,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:54,570 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-01 00:01:54,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-01 00:01:54,571 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-01 00:01:54,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-01 00:01:54,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:54,571 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1] [2018-10-01 00:01:54,572 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:54,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:54,572 INFO L82 PathProgramCache]: Analyzing trace with hash -468812655, now seen corresponding path program 15 times [2018-10-01 00:01:54,572 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:54,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:54,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:54,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:54,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:55,330 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:55,330 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:01:55,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:01:55,433 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-01 00:01:55,433 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:55,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:55,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:01:55,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:55,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:01:55,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:56,178 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:56,178 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-10-01 00:01:56,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-01 00:01:56,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-01 00:01:56,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2018-10-01 00:01:56,180 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 36 states. [2018-10-01 00:01:56,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:56,761 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-01 00:01:56,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-01 00:01:56,762 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 81 [2018-10-01 00:01:56,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:56,763 INFO L225 Difference]: With dead ends: 91 [2018-10-01 00:01:56,763 INFO L226 Difference]: Without dead ends: 90 [2018-10-01 00:01:56,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=917, Invalid=1735, Unknown=0, NotChecked=0, Total=2652 [2018-10-01 00:01:56,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-01 00:01:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-10-01 00:01:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-01 00:01:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-01 00:01:56,776 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 81 [2018-10-01 00:01:56,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:56,777 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-01 00:01:56,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-01 00:01:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-01 00:01:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-01 00:01:56,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:56,778 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1] [2018-10-01 00:01:56,778 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:56,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:56,778 INFO L82 PathProgramCache]: Analyzing trace with hash 132995495, now seen corresponding path program 16 times [2018-10-01 00:01:56,779 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:56,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:56,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:56,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:56,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:57,701 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:57,701 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:57,702 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:01:57,710 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:01:57,775 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:01:57,775 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:57,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:57,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:01:57,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:57,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:01:57,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:58,160 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:58,180 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:58,181 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-10-01 00:01:58,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-01 00:01:58,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-01 00:01:58,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2018-10-01 00:01:58,182 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 38 states. [2018-10-01 00:01:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:58,798 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-01 00:01:58,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:01:58,798 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2018-10-01 00:01:58,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:58,799 INFO L225 Difference]: With dead ends: 96 [2018-10-01 00:01:58,799 INFO L226 Difference]: Without dead ends: 95 [2018-10-01 00:01:58,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1025, Invalid=1945, Unknown=0, NotChecked=0, Total=2970 [2018-10-01 00:01:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-01 00:01:58,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-10-01 00:01:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-01 00:01:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-01 00:01:58,810 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 86 [2018-10-01 00:01:58,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:58,811 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-01 00:01:58,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-01 00:01:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-01 00:01:58,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-01 00:01:58,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:58,812 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1] [2018-10-01 00:01:58,812 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:58,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:58,812 INFO L82 PathProgramCache]: Analyzing trace with hash -480560559, now seen corresponding path program 17 times [2018-10-01 00:01:58,812 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:58,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:58,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:58,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:58,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:59,635 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:01:59,636 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:59,636 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:01:59,644 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:01:59,725 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-01 00:01:59,726 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:59,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:59,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:01:59,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:59,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-10-01 00:01:59,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:00,086 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:00,087 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-10-01 00:02:00,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-01 00:02:00,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-01 00:02:00,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2018-10-01 00:02:00,088 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 40 states. [2018-10-01 00:02:00,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:00,785 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-01 00:02:00,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 00:02:00,786 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 91 [2018-10-01 00:02:00,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:00,787 INFO L225 Difference]: With dead ends: 101 [2018-10-01 00:02:00,787 INFO L226 Difference]: Without dead ends: 100 [2018-10-01 00:02:00,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1139, Invalid=2167, Unknown=0, NotChecked=0, Total=3306 [2018-10-01 00:02:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-01 00:02:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-10-01 00:02:00,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-01 00:02:00,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-01 00:02:00,799 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 91 [2018-10-01 00:02:00,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:00,799 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-01 00:02:00,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-01 00:02:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-01 00:02:00,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-01 00:02:00,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:00,800 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1] [2018-10-01 00:02:00,800 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:00,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:00,801 INFO L82 PathProgramCache]: Analyzing trace with hash -2085538841, now seen corresponding path program 18 times [2018-10-01 00:02:00,801 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:00,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:00,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:00,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:00,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:01,449 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:01,449 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:02:01,456 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:02:01,641 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-01 00:02:01,642 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:01,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:01,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:02:01,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:01,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:02:01,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:02,007 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:02,028 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:02,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-10-01 00:02:02,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-01 00:02:02,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-01 00:02:02,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2018-10-01 00:02:02,029 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 42 states. [2018-10-01 00:02:02,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:02,768 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-01 00:02:02,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:02:02,768 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2018-10-01 00:02:02,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:02,769 INFO L225 Difference]: With dead ends: 106 [2018-10-01 00:02:02,769 INFO L226 Difference]: Without dead ends: 105 [2018-10-01 00:02:02,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1259, Invalid=2401, Unknown=0, NotChecked=0, Total=3660 [2018-10-01 00:02:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-01 00:02:02,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2018-10-01 00:02:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-01 00:02:02,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-10-01 00:02:02,782 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 96 [2018-10-01 00:02:02,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:02,783 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-10-01 00:02:02,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-01 00:02:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-10-01 00:02:02,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-01 00:02:02,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:02,783 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1] [2018-10-01 00:02:02,784 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:02,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:02,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1222260719, now seen corresponding path program 19 times [2018-10-01 00:02:02,784 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:02,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:02,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:02,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:02,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:03,992 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:03,992 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:03,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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:02:04,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:02:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:04,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:04,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:02:04,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:04,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:02:04,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:04,530 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:04,550 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:04,551 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-10-01 00:02:04,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-01 00:02:04,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-01 00:02:04,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2018-10-01 00:02:04,552 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 44 states. [2018-10-01 00:02:05,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:05,234 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-01 00:02:05,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:02:05,236 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 101 [2018-10-01 00:02:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:05,237 INFO L225 Difference]: With dead ends: 111 [2018-10-01 00:02:05,237 INFO L226 Difference]: Without dead ends: 110 [2018-10-01 00:02:05,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1385, Invalid=2647, Unknown=0, NotChecked=0, Total=4032 [2018-10-01 00:02:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-01 00:02:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2018-10-01 00:02:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-01 00:02:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-01 00:02:05,251 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 101 [2018-10-01 00:02:05,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:05,251 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-01 00:02:05,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-01 00:02:05,251 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-01 00:02:05,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-01 00:02:05,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:05,252 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1, 1] [2018-10-01 00:02:05,252 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:05,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:05,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1629044263, now seen corresponding path program 20 times [2018-10-01 00:02:05,253 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:05,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:05,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:05,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:02:05,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:06,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:06,091 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:06,091 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:02:06,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:02:06,177 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:02:06,177 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:06,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:06,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:02:06,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:06,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:02:06,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:07,783 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:07,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-10-01 00:02:07,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-01 00:02:07,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-01 00:02:07,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2018-10-01 00:02:07,785 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 46 states. [2018-10-01 00:02:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:08,627 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-10-01 00:02:08,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:02:08,627 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 106 [2018-10-01 00:02:08,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:08,628 INFO L225 Difference]: With dead ends: 116 [2018-10-01 00:02:08,628 INFO L226 Difference]: Without dead ends: 115 [2018-10-01 00:02:08,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1517, Invalid=2905, Unknown=0, NotChecked=0, Total=4422 [2018-10-01 00:02:08,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-01 00:02:08,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2018-10-01 00:02:08,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-01 00:02:08,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-01 00:02:08,645 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 106 [2018-10-01 00:02:08,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:08,645 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-01 00:02:08,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-01 00:02:08,645 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-01 00:02:08,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-01 00:02:08,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:08,646 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1, 1] [2018-10-01 00:02:08,646 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:08,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:08,647 INFO L82 PathProgramCache]: Analyzing trace with hash 2020222417, now seen corresponding path program 21 times [2018-10-01 00:02:08,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:08,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:08,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:08,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:08,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:09,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:09,135 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:09,135 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:02:09,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:02:09,260 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-01 00:02:09,260 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:09,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:09,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:02:09,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:09,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:02:09,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:09,923 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:09,924 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-10-01 00:02:09,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-01 00:02:09,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-01 00:02:09,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2018-10-01 00:02:09,925 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 48 states. [2018-10-01 00:02:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:10,848 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-01 00:02:10,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-01 00:02:10,848 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 111 [2018-10-01 00:02:10,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:10,849 INFO L225 Difference]: With dead ends: 121 [2018-10-01 00:02:10,849 INFO L226 Difference]: Without dead ends: 120 [2018-10-01 00:02:10,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1655, Invalid=3175, Unknown=0, NotChecked=0, Total=4830 [2018-10-01 00:02:10,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-01 00:02:10,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-10-01 00:02:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-01 00:02:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-01 00:02:10,866 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 111 [2018-10-01 00:02:10,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:10,866 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-01 00:02:10,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-01 00:02:10,866 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-01 00:02:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-01 00:02:10,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:10,867 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1] [2018-10-01 00:02:10,867 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:10,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:10,868 INFO L82 PathProgramCache]: Analyzing trace with hash -995526553, now seen corresponding path program 22 times [2018-10-01 00:02:10,868 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:10,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:10,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:10,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:10,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:11,407 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:11,407 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-10-01 00:02:11,414 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:02:11,494 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:02:11,494 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:11,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:11,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:02:11,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:11,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:02:11,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:12,049 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:12,049 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-10-01 00:02:12,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-01 00:02:12,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-01 00:02:12,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=902, Invalid=1548, Unknown=0, NotChecked=0, Total=2450 [2018-10-01 00:02:12,051 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 50 states. [2018-10-01 00:02:12,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:12,990 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-01 00:02:12,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-01 00:02:12,990 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 116 [2018-10-01 00:02:12,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:12,992 INFO L225 Difference]: With dead ends: 126 [2018-10-01 00:02:12,992 INFO L226 Difference]: Without dead ends: 125 [2018-10-01 00:02:12,993 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-10-01 00:02:12,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-01 00:02:13,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-10-01 00:02:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-01 00:02:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-10-01 00:02:13,009 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 116 [2018-10-01 00:02:13,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:13,009 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-10-01 00:02:13,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-01 00:02:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-10-01 00:02:13,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-01 00:02:13,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:13,010 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1, 1] [2018-10-01 00:02:13,010 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:13,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:13,010 INFO L82 PathProgramCache]: Analyzing trace with hash 891573137, now seen corresponding path program 23 times [2018-10-01 00:02:13,010 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:13,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:13,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:13,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:13,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:13,582 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:13,582 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-01 00:02:13,590 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:02:13,732 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-01 00:02:13,732 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:13,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:13,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:02:13,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:13,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:02:13,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:14,273 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:14,273 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-10-01 00:02:14,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-01 00:02:14,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-01 00:02:14,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2018-10-01 00:02:14,275 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 52 states. [2018-10-01 00:02:15,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:15,289 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-01 00:02:15,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 00:02:15,290 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 121 [2018-10-01 00:02:15,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:15,291 INFO L225 Difference]: With dead ends: 131 [2018-10-01 00:02:15,291 INFO L226 Difference]: Without dead ends: 130 [2018-10-01 00:02:15,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1949, Invalid=3751, Unknown=0, NotChecked=0, Total=5700 [2018-10-01 00:02:15,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-01 00:02:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2018-10-01 00:02:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-01 00:02:15,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-01 00:02:15,307 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 121 [2018-10-01 00:02:15,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:15,307 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-01 00:02:15,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-01 00:02:15,307 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-01 00:02:15,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-01 00:02:15,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:15,308 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1, 1] [2018-10-01 00:02:15,308 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:15,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:15,308 INFO L82 PathProgramCache]: Analyzing trace with hash -35265881, now seen corresponding path program 24 times [2018-10-01 00:02:15,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:15,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:15,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:15,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:15,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:15,954 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:15,954 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-10-01 00:02:15,962 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:02:16,105 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-01 00:02:16,105 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:16,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:16,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:02:16,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:16,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-10-01 00:02:16,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:16,695 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:16,695 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-10-01 00:02:16,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-01 00:02:16,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-01 00:02:16,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2018-10-01 00:02:16,697 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 54 states. [2018-10-01 00:02:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:17,651 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-10-01 00:02:17,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-01 00:02:17,652 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 126 [2018-10-01 00:02:17,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:17,652 INFO L225 Difference]: With dead ends: 136 [2018-10-01 00:02:17,653 INFO L226 Difference]: Without dead ends: 135 [2018-10-01 00:02:17,654 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-10-01 00:02:17,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-01 00:02:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2018-10-01 00:02:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-01 00:02:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-10-01 00:02:17,674 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 126 [2018-10-01 00:02:17,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:17,674 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-10-01 00:02:17,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-01 00:02:17,674 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-10-01 00:02:17,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-01 00:02:17,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:17,675 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1, 1] [2018-10-01 00:02:17,675 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:17,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:17,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1336913583, now seen corresponding path program 25 times [2018-10-01 00:02:17,676 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:17,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:17,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:17,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:17,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:18,259 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:18,259 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-10-01 00:02:18,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:02:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:18,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:18,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:02:18,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:18,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:02:18,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:20,082 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:20,082 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-10-01 00:02:20,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-01 00:02:20,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-01 00:02:20,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1136, Invalid=1944, Unknown=0, NotChecked=0, Total=3080 [2018-10-01 00:02:20,083 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 56 states. [2018-10-01 00:02:21,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:21,260 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-01 00:02:21,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-01 00:02:21,260 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 131 [2018-10-01 00:02:21,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:21,261 INFO L225 Difference]: With dead ends: 141 [2018-10-01 00:02:21,261 INFO L226 Difference]: Without dead ends: 140 [2018-10-01 00:02:21,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2267, Invalid=4375, Unknown=0, NotChecked=0, Total=6642 [2018-10-01 00:02:21,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-01 00:02:21,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2018-10-01 00:02:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-01 00:02:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-01 00:02:21,288 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 131 [2018-10-01 00:02:21,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:21,288 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-01 00:02:21,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-01 00:02:21,288 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-01 00:02:21,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-01 00:02:21,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:21,289 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1, 1] [2018-10-01 00:02:21,289 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:21,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:21,290 INFO L82 PathProgramCache]: Analyzing trace with hash -950895385, now seen corresponding path program 26 times [2018-10-01 00:02:21,290 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:21,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:21,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:21,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:02:21,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:22,436 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:22,436 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-10-01 00:02:22,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:02:22,527 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:02:22,527 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:22,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:22,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:02:22,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:22,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:02:22,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:23,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:23,178 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:23,178 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-10-01 00:02:23,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-01 00:02:23,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-01 00:02:23,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1220, Invalid=2086, Unknown=0, NotChecked=0, Total=3306 [2018-10-01 00:02:23,180 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 58 states. [2018-10-01 00:02:24,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:24,316 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-01 00:02:24,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-01 00:02:24,317 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 136 [2018-10-01 00:02:24,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:24,318 INFO L225 Difference]: With dead ends: 146 [2018-10-01 00:02:24,318 INFO L226 Difference]: Without dead ends: 145 [2018-10-01 00:02:24,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2182 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2435, Invalid=4705, Unknown=0, NotChecked=0, Total=7140 [2018-10-01 00:02:24,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-01 00:02:24,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2018-10-01 00:02:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-01 00:02:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-10-01 00:02:24,345 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 136 [2018-10-01 00:02:24,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:24,345 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-10-01 00:02:24,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-01 00:02:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-10-01 00:02:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-01 00:02:24,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:24,346 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1, 1] [2018-10-01 00:02:24,347 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:24,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:24,347 INFO L82 PathProgramCache]: Analyzing trace with hash 568991505, now seen corresponding path program 27 times [2018-10-01 00:02:24,347 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:24,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:24,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:24,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:24,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:25,082 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:25,082 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-10-01 00:02:25,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:02:25,249 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-01 00:02:25,249 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:25,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:25,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:02:25,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:25,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:02:25,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:26,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:26,024 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:26,024 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-10-01 00:02:26,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-01 00:02:26,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-01 00:02:26,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1307, Invalid=2233, Unknown=0, NotChecked=0, Total=3540 [2018-10-01 00:02:26,025 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 60 states. [2018-10-01 00:02:27,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:27,330 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-01 00:02:27,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-01 00:02:27,330 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 141 [2018-10-01 00:02:27,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:27,331 INFO L225 Difference]: With dead ends: 151 [2018-10-01 00:02:27,331 INFO L226 Difference]: Without dead ends: 150 [2018-10-01 00:02:27,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2609, Invalid=5047, Unknown=0, NotChecked=0, Total=7656 [2018-10-01 00:02:27,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-01 00:02:27,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2018-10-01 00:02:27,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-01 00:02:27,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-01 00:02:27,359 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 141 [2018-10-01 00:02:27,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:27,360 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-01 00:02:27,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-01 00:02:27,360 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-01 00:02:27,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-01 00:02:27,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:27,361 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1, 1] [2018-10-01 00:02:27,361 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:27,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:27,361 INFO L82 PathProgramCache]: Analyzing trace with hash -2039265497, now seen corresponding path program 28 times [2018-10-01 00:02:27,362 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:27,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:27,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:27,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:27,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:28,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:28,053 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:28,053 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-10-01 00:02:28,063 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:02:28,165 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:02:28,166 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:28,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:28,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:02:28,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:28,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:02:28,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:29,243 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:29,243 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-10-01 00:02:29,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-01 00:02:29,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-01 00:02:29,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1397, Invalid=2385, Unknown=0, NotChecked=0, Total=3782 [2018-10-01 00:02:29,245 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 62 states. [2018-10-01 00:02:30,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:30,506 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-10-01 00:02:30,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-01 00:02:30,506 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 146 [2018-10-01 00:02:30,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:30,507 INFO L225 Difference]: With dead ends: 156 [2018-10-01 00:02:30,507 INFO L226 Difference]: Without dead ends: 155 [2018-10-01 00:02:30,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2789, Invalid=5401, Unknown=0, NotChecked=0, Total=8190 [2018-10-01 00:02:30,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-01 00:02:30,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2018-10-01 00:02:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-01 00:02:30,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-10-01 00:02:30,533 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 146 [2018-10-01 00:02:30,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:30,534 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-10-01 00:02:30,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-01 00:02:30,534 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-10-01 00:02:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-01 00:02:30,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:30,534 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1, 1] [2018-10-01 00:02:30,535 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:30,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:30,535 INFO L82 PathProgramCache]: Analyzing trace with hash -152191791, now seen corresponding path program 29 times [2018-10-01 00:02:30,535 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:30,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:30,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:30,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:30,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:31,204 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:31,204 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-10-01 00:02:31,234 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:02:31,389 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-01 00:02:31,389 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:31,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:31,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:02:31,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:31,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:02:31,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:32,476 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:32,476 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-10-01 00:02:32,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-01 00:02:32,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-01 00:02:32,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=2542, Unknown=0, NotChecked=0, Total=4032 [2018-10-01 00:02:32,478 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 64 states. [2018-10-01 00:02:33,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:33,792 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-01 00:02:33,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-01 00:02:33,793 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 151 [2018-10-01 00:02:33,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:33,794 INFO L225 Difference]: With dead ends: 161 [2018-10-01 00:02:33,794 INFO L226 Difference]: Without dead ends: 160 [2018-10-01 00:02:33,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2695 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2975, Invalid=5767, Unknown=0, NotChecked=0, Total=8742 [2018-10-01 00:02:33,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-01 00:02:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2018-10-01 00:02:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-01 00:02:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-01 00:02:33,819 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 151 [2018-10-01 00:02:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:33,819 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-01 00:02:33,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-01 00:02:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-01 00:02:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-01 00:02:33,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:33,820 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1, 1] [2018-10-01 00:02:33,820 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:33,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:33,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1949548185, now seen corresponding path program 30 times [2018-10-01 00:02:33,820 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:33,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:33,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:33,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:33,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:34,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:34,564 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:34,564 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-10-01 00:02:34,573 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:02:34,742 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-01 00:02:34,742 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:34,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:34,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:02:34,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:34,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:02:34,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:35,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:35,539 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:35,539 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-10-01 00:02:35,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-01 00:02:35,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-01 00:02:35,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1586, Invalid=2704, Unknown=0, NotChecked=0, Total=4290 [2018-10-01 00:02:35,541 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 66 states. [2018-10-01 00:02:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:37,066 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-10-01 00:02:37,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-01 00:02:37,066 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 156 [2018-10-01 00:02:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:37,067 INFO L225 Difference]: With dead ends: 166 [2018-10-01 00:02:37,067 INFO L226 Difference]: Without dead ends: 165 [2018-10-01 00:02:37,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2878 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3167, Invalid=6145, Unknown=0, NotChecked=0, Total=9312 [2018-10-01 00:02:37,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-01 00:02:37,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2018-10-01 00:02:37,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-01 00:02:37,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-10-01 00:02:37,104 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 156 [2018-10-01 00:02:37,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:37,104 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-10-01 00:02:37,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-01 00:02:37,105 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-10-01 00:02:37,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-01 00:02:37,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:37,106 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1, 1] [2018-10-01 00:02:37,106 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:37,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:37,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1856558447, now seen corresponding path program 31 times [2018-10-01 00:02:37,107 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:37,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:37,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:37,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:37,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:38,330 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:38,330 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-10-01 00:02:38,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:02:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:38,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:38,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:02:38,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:38,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:02:38,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:39,322 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:39,322 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-10-01 00:02:39,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-01 00:02:39,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-01 00:02:39,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1685, Invalid=2871, Unknown=0, NotChecked=0, Total=4556 [2018-10-01 00:02:39,324 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 68 states. [2018-10-01 00:02:40,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:40,950 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-01 00:02:40,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-01 00:02:40,950 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 161 [2018-10-01 00:02:40,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:40,951 INFO L225 Difference]: With dead ends: 171 [2018-10-01 00:02:40,951 INFO L226 Difference]: Without dead ends: 170 [2018-10-01 00:02:40,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3067 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3365, Invalid=6535, Unknown=0, NotChecked=0, Total=9900 [2018-10-01 00:02:40,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-01 00:02:40,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2018-10-01 00:02:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-01 00:02:40,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-10-01 00:02:40,981 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 161 [2018-10-01 00:02:40,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:40,982 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-10-01 00:02:40,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-01 00:02:40,982 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-10-01 00:02:40,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-01 00:02:40,983 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:40,983 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1, 1] [2018-10-01 00:02:40,983 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:40,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:40,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1390504871, now seen corresponding path program 32 times [2018-10-01 00:02:40,983 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:40,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:40,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:40,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:02:40,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:42,360 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:42,360 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-10-01 00:02:42,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:02:42,477 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:02:42,478 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:42,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:42,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:02:42,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:42,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:02:42,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:43,457 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:43,457 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-10-01 00:02:43,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-01 00:02:43,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-01 00:02:43,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1787, Invalid=3043, Unknown=0, NotChecked=0, Total=4830 [2018-10-01 00:02:43,459 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 70 states. [2018-10-01 00:02:44,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:44,900 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-10-01 00:02:44,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-01 00:02:44,901 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 166 [2018-10-01 00:02:44,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:44,902 INFO L225 Difference]: With dead ends: 176 [2018-10-01 00:02:44,902 INFO L226 Difference]: Without dead ends: 175 [2018-10-01 00:02:44,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3262 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3569, Invalid=6937, Unknown=0, NotChecked=0, Total=10506 [2018-10-01 00:02:44,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-01 00:02:44,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2018-10-01 00:02:44,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-01 00:02:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-10-01 00:02:44,939 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 166 [2018-10-01 00:02:44,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:44,939 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-10-01 00:02:44,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-01 00:02:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-10-01 00:02:44,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-01 00:02:44,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:44,940 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1, 1] [2018-10-01 00:02:44,941 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:44,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:44,941 INFO L82 PathProgramCache]: Analyzing trace with hash 136472657, now seen corresponding path program 33 times [2018-10-01 00:02:44,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:44,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:44,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:44,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:44,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:46,521 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:46,522 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-10-01 00:02:46,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:02:46,731 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-01 00:02:46,732 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:46,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:46,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:02:46,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:46,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:02:46,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:47,823 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:47,823 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-10-01 00:02:47,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-01 00:02:47,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-01 00:02:47,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=3220, Unknown=0, NotChecked=0, Total=5112 [2018-10-01 00:02:47,824 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 72 states. [2018-10-01 00:02:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:49,281 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-01 00:02:49,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-01 00:02:49,282 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 171 [2018-10-01 00:02:49,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:49,283 INFO L225 Difference]: With dead ends: 181 [2018-10-01 00:02:49,283 INFO L226 Difference]: Without dead ends: 180 [2018-10-01 00:02:49,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3779, Invalid=7351, Unknown=0, NotChecked=0, Total=11130 [2018-10-01 00:02:49,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-01 00:02:49,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2018-10-01 00:02:49,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-01 00:02:49,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-01 00:02:49,421 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 171 [2018-10-01 00:02:49,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:49,421 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-01 00:02:49,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-01 00:02:49,422 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-01 00:02:49,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-01 00:02:49,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:49,423 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1, 1] [2018-10-01 00:02:49,423 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:49,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:49,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1036597785, now seen corresponding path program 34 times [2018-10-01 00:02:49,423 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:49,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:49,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:49,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:49,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:50,273 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:50,273 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-10-01 00:02:50,280 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:02:50,401 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:02:50,402 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:50,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:50,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:02:50,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:50,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-10-01 00:02:50,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:51,477 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:51,478 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-10-01 00:02:51,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-01 00:02:51,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-01 00:02:51,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2000, Invalid=3402, Unknown=0, NotChecked=0, Total=5402 [2018-10-01 00:02:51,479 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 74 states. [2018-10-01 00:02:52,382 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-01 00:02:53,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:53,673 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-10-01 00:02:53,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-01 00:02:53,673 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 176 [2018-10-01 00:02:53,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:53,675 INFO L225 Difference]: With dead ends: 186 [2018-10-01 00:02:53,675 INFO L226 Difference]: Without dead ends: 185 [2018-10-01 00:02:53,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3670 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3995, Invalid=7777, Unknown=0, NotChecked=0, Total=11772 [2018-10-01 00:02:53,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-01 00:02:53,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-10-01 00:02:53,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-01 00:02:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-10-01 00:02:53,710 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 176 [2018-10-01 00:02:53,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:53,710 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-10-01 00:02:53,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-01 00:02:53,710 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-10-01 00:02:53,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-01 00:02:53,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:53,711 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1, 1] [2018-10-01 00:02:53,712 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:53,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:53,712 INFO L82 PathProgramCache]: Analyzing trace with hash -414484975, now seen corresponding path program 35 times [2018-10-01 00:02:53,712 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:53,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:53,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:53,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:53,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:55,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:55,009 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:55,009 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-10-01 00:02:55,015 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:02:55,207 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-01 00:02:55,207 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:55,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:55,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:02:55,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:55,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:02:55,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:02:56,510 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:56,511 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-10-01 00:02:56,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-01 00:02:56,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-01 00:02:56,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2111, Invalid=3589, Unknown=0, NotChecked=0, Total=5700 [2018-10-01 00:02:56,512 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 76 states. [2018-10-01 00:02:58,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:58,392 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-01 00:02:58,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-01 00:02:58,393 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 181 [2018-10-01 00:02:58,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:58,394 INFO L225 Difference]: With dead ends: 191 [2018-10-01 00:02:58,394 INFO L226 Difference]: Without dead ends: 190 [2018-10-01 00:02:58,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3883 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4217, Invalid=8215, Unknown=0, NotChecked=0, Total=12432 [2018-10-01 00:02:58,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-01 00:02:58,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2018-10-01 00:02:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-01 00:02:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-10-01 00:02:58,424 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 181 [2018-10-01 00:02:58,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:58,424 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-10-01 00:02:58,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-01 00:02:58,424 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-10-01 00:02:58,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-01 00:02:58,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:58,425 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1, 1] [2018-10-01 00:02:58,425 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:58,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:58,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1800425511, now seen corresponding path program 36 times [2018-10-01 00:02:58,426 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:58,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:58,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:58,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:58,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:00,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:00,162 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:00,162 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-01 00:03:00,171 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:03:00,399 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-01 00:03:00,400 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:00,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:00,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:03:00,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:00,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:03:00,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:02,641 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:02,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-10-01 00:03:02,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-01 00:03:02,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-01 00:03:02,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2225, Invalid=3781, Unknown=0, NotChecked=0, Total=6006 [2018-10-01 00:03:02,642 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 78 states. [2018-10-01 00:03:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:04,445 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-10-01 00:03:04,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-01 00:03:04,445 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 186 [2018-10-01 00:03:04,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:04,446 INFO L225 Difference]: With dead ends: 196 [2018-10-01 00:03:04,446 INFO L226 Difference]: Without dead ends: 195 [2018-10-01 00:03:04,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4445, Invalid=8665, Unknown=0, NotChecked=0, Total=13110 [2018-10-01 00:03:04,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-01 00:03:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2018-10-01 00:03:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-01 00:03:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-10-01 00:03:04,482 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 186 [2018-10-01 00:03:04,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:04,482 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-10-01 00:03:04,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-01 00:03:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-10-01 00:03:04,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-01 00:03:04,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:04,483 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1, 1] [2018-10-01 00:03:04,484 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:04,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:04,484 INFO L82 PathProgramCache]: Analyzing trace with hash -271690799, now seen corresponding path program 37 times [2018-10-01 00:03:04,484 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:04,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:04,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:04,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:04,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:05,463 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:05,463 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-10-01 00:03:05,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:03:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:05,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:05,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:03:05,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:05,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:03:05,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:06,720 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:06,720 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-10-01 00:03:06,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-01 00:03:06,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-01 00:03:06,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2342, Invalid=3978, Unknown=0, NotChecked=0, Total=6320 [2018-10-01 00:03:06,721 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 80 states. [2018-10-01 00:03:08,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:08,656 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-10-01 00:03:08,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-01 00:03:08,656 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 191 [2018-10-01 00:03:08,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:08,658 INFO L225 Difference]: With dead ends: 201 [2018-10-01 00:03:08,658 INFO L226 Difference]: Without dead ends: 200 [2018-10-01 00:03:08,659 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-10-01 00:03:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-01 00:03:08,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2018-10-01 00:03:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-01 00:03:08,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-10-01 00:03:08,689 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 191 [2018-10-01 00:03:08,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:08,689 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-10-01 00:03:08,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-01 00:03:08,689 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-10-01 00:03:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-01 00:03:08,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:08,690 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1, 1] [2018-10-01 00:03:08,690 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:08,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:08,690 INFO L82 PathProgramCache]: Analyzing trace with hash -894301593, now seen corresponding path program 38 times [2018-10-01 00:03:08,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:08,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:08,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:08,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:03:08,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:09,773 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:09,773 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-10-01 00:03:09,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:03:09,943 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:03:09,943 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:09,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:09,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:03:09,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:09,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:03:09,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:11,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:11,121 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:11,121 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-10-01 00:03:11,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-01 00:03:11,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-01 00:03:11,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2462, Invalid=4180, Unknown=0, NotChecked=0, Total=6642 [2018-10-01 00:03:11,122 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 82 states. [2018-10-01 00:03:13,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:13,388 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-10-01 00:03:13,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-01 00:03:13,389 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 196 [2018-10-01 00:03:13,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:13,390 INFO L225 Difference]: With dead ends: 206 [2018-10-01 00:03:13,390 INFO L226 Difference]: Without dead ends: 205 [2018-10-01 00:03:13,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4558 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4919, Invalid=9601, Unknown=0, NotChecked=0, Total=14520 [2018-10-01 00:03:13,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-01 00:03:13,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2018-10-01 00:03:13,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-01 00:03:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-10-01 00:03:13,424 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 196 [2018-10-01 00:03:13,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:13,424 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-10-01 00:03:13,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-01 00:03:13,424 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-10-01 00:03:13,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-01 00:03:13,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:13,425 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1, 1] [2018-10-01 00:03:13,426 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:13,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:13,426 INFO L82 PathProgramCache]: Analyzing trace with hash -676920943, now seen corresponding path program 39 times [2018-10-01 00:03:13,426 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:13,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:13,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:13,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:13,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:14,760 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:14,760 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-10-01 00:03:14,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:03:15,100 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-01 00:03:15,101 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:15,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:15,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:03:15,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:15,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:03:15,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:16,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:16,257 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:16,257 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-10-01 00:03:16,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-01 00:03:16,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-01 00:03:16,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2585, Invalid=4387, Unknown=0, NotChecked=0, Total=6972 [2018-10-01 00:03:16,259 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 84 states. [2018-10-01 00:03:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:18,398 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-01 00:03:18,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-01 00:03:18,399 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 201 [2018-10-01 00:03:18,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:18,400 INFO L225 Difference]: With dead ends: 211 [2018-10-01 00:03:18,400 INFO L226 Difference]: Without dead ends: 210 [2018-10-01 00:03:18,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4795 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5165, Invalid=10087, Unknown=0, NotChecked=0, Total=15252 [2018-10-01 00:03:18,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-01 00:03:18,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2018-10-01 00:03:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-01 00:03:18,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-01 00:03:18,451 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 201 [2018-10-01 00:03:18,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:18,451 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-01 00:03:18,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-01 00:03:18,452 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-01 00:03:18,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-01 00:03:18,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:18,453 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1, 1] [2018-10-01 00:03:18,453 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:18,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:18,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2015365977, now seen corresponding path program 40 times [2018-10-01 00:03:18,454 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:18,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:18,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:18,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:18,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:19,888 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:19,888 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-10-01 00:03:19,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:03:20,046 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:03:20,047 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:20,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:20,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:03:20,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:20,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:03:20,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:21,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:21,445 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:21,445 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-10-01 00:03:21,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-01 00:03:21,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-01 00:03:21,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2711, Invalid=4599, Unknown=0, NotChecked=0, Total=7310 [2018-10-01 00:03:21,447 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 86 states. [2018-10-01 00:03:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:23,711 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-10-01 00:03:23,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-01 00:03:23,712 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 206 [2018-10-01 00:03:23,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:23,713 INFO L225 Difference]: With dead ends: 216 [2018-10-01 00:03:23,713 INFO L226 Difference]: Without dead ends: 215 [2018-10-01 00:03:23,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5038 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5417, Invalid=10585, Unknown=0, NotChecked=0, Total=16002 [2018-10-01 00:03:23,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-01 00:03:23,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2018-10-01 00:03:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-01 00:03:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-10-01 00:03:23,751 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 206 [2018-10-01 00:03:23,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:23,752 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-10-01 00:03:23,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-01 00:03:23,752 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-10-01 00:03:23,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-01 00:03:23,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:23,753 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1, 1] [2018-10-01 00:03:23,753 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:23,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:23,753 INFO L82 PathProgramCache]: Analyzing trace with hash 164724561, now seen corresponding path program 41 times [2018-10-01 00:03:23,753 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:23,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:23,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:23,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:23,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:25,352 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:25,352 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-10-01 00:03:25,360 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:03:25,617 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-01 00:03:25,617 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:25,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:25,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:03:25,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:25,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:03:25,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:27,016 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:27,016 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-10-01 00:03:27,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-01 00:03:27,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-01 00:03:27,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2840, Invalid=4816, Unknown=0, NotChecked=0, Total=7656 [2018-10-01 00:03:27,018 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 88 states. [2018-10-01 00:03:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:29,260 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-10-01 00:03:29,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-01 00:03:29,260 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 211 [2018-10-01 00:03:29,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:29,261 INFO L225 Difference]: With dead ends: 221 [2018-10-01 00:03:29,261 INFO L226 Difference]: Without dead ends: 220 [2018-10-01 00:03:29,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5287 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5675, Invalid=11095, Unknown=0, NotChecked=0, Total=16770 [2018-10-01 00:03:29,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-01 00:03:29,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2018-10-01 00:03:29,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-01 00:03:29,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-10-01 00:03:29,304 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 211 [2018-10-01 00:03:29,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:29,304 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-10-01 00:03:29,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-01 00:03:29,304 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-10-01 00:03:29,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-01 00:03:29,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:29,305 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1, 1] [2018-10-01 00:03:29,305 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:29,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:29,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1252127001, now seen corresponding path program 42 times [2018-10-01 00:03:29,306 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:29,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:29,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:29,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:29,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:30,544 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:30,544 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-10-01 00:03:30,552 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:03:30,826 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-01 00:03:30,826 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:30,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:30,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:03:30,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:30,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:03:30,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:32,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:32,226 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:32,226 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 89 [2018-10-01 00:03:32,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-01 00:03:32,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-01 00:03:32,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=5038, Unknown=0, NotChecked=0, Total=8010 [2018-10-01 00:03:32,227 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 90 states. [2018-10-01 00:03:34,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:34,525 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-10-01 00:03:34,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-01 00:03:34,525 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 216 [2018-10-01 00:03:34,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:34,527 INFO L225 Difference]: With dead ends: 226 [2018-10-01 00:03:34,527 INFO L226 Difference]: Without dead ends: 225 [2018-10-01 00:03:34,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5542 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5939, Invalid=11617, Unknown=0, NotChecked=0, Total=17556 [2018-10-01 00:03:34,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-01 00:03:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2018-10-01 00:03:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-01 00:03:34,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-10-01 00:03:34,569 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 216 [2018-10-01 00:03:34,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:34,569 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-10-01 00:03:34,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-01 00:03:34,569 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-10-01 00:03:34,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-01 00:03:34,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:34,570 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1, 1] [2018-10-01 00:03:34,571 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:34,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:34,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1716112657, now seen corresponding path program 43 times [2018-10-01 00:03:34,571 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:34,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:34,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:34,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:34,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:35,816 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:35,816 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-10-01 00:03:35,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:03:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:35,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:35,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-10-01 00:03:35,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:35,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:03:35,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:38,109 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:38,110 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 91 [2018-10-01 00:03:38,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-01 00:03:38,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-01 00:03:38,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3107, Invalid=5265, Unknown=0, NotChecked=0, Total=8372 [2018-10-01 00:03:38,111 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 92 states. [2018-10-01 00:03:40,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:40,500 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-10-01 00:03:40,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-01 00:03:40,500 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 221 [2018-10-01 00:03:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:40,501 INFO L225 Difference]: With dead ends: 231 [2018-10-01 00:03:40,501 INFO L226 Difference]: Without dead ends: 230 [2018-10-01 00:03:40,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5803 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6209, Invalid=12151, Unknown=0, NotChecked=0, Total=18360 [2018-10-01 00:03:40,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-01 00:03:40,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2018-10-01 00:03:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-01 00:03:40,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-01 00:03:40,559 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 221 [2018-10-01 00:03:40,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:40,559 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-01 00:03:40,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-01 00:03:40,559 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-01 00:03:40,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-01 00:03:40,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:40,561 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1, 1] [2018-10-01 00:03:40,561 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:40,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:40,561 INFO L82 PathProgramCache]: Analyzing trace with hash 279992615, now seen corresponding path program 44 times [2018-10-01 00:03:40,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:40,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:40,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:40,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:03:40,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:41,806 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:41,806 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-10-01 00:03:41,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:03:41,963 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:03:41,964 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:41,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:41,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:03:41,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:41,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:03:41,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:43,659 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:43,659 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 93 [2018-10-01 00:03:43,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-01 00:03:43,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-01 00:03:43,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3245, Invalid=5497, Unknown=0, NotChecked=0, Total=8742 [2018-10-01 00:03:43,661 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 94 states. [2018-10-01 00:03:46,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:46,057 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-10-01 00:03:46,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-01 00:03:46,058 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 226 [2018-10-01 00:03:46,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:46,059 INFO L225 Difference]: With dead ends: 236 [2018-10-01 00:03:46,059 INFO L226 Difference]: Without dead ends: 235 [2018-10-01 00:03:46,061 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-10-01 00:03:46,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-01 00:03:46,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-10-01 00:03:46,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-10-01 00:03:46,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-10-01 00:03:46,123 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 226 [2018-10-01 00:03:46,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:46,123 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-10-01 00:03:46,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-01 00:03:46,123 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-10-01 00:03:46,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-01 00:03:46,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:46,125 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1, 1] [2018-10-01 00:03:46,125 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:46,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:46,126 INFO L82 PathProgramCache]: Analyzing trace with hash 34335441, now seen corresponding path program 45 times [2018-10-01 00:03:46,126 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:46,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:46,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:46,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:46,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:47,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:47,498 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:47,498 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-10-01 00:03:47,506 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:03:47,814 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-01 00:03:47,814 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:47,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:47,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:03:47,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:47,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:03:47,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:49,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:49,726 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:49,726 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2018-10-01 00:03:49,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-01 00:03:49,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-01 00:03:49,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3386, Invalid=5734, Unknown=0, NotChecked=0, Total=9120 [2018-10-01 00:03:49,728 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 96 states. [2018-10-01 00:03:52,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:52,133 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-10-01 00:03:52,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-01 00:03:52,133 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 231 [2018-10-01 00:03:52,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:52,134 INFO L225 Difference]: With dead ends: 241 [2018-10-01 00:03:52,135 INFO L226 Difference]: Without dead ends: 240 [2018-10-01 00:03:52,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6343 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6767, Invalid=13255, Unknown=0, NotChecked=0, Total=20022 [2018-10-01 00:03:52,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-01 00:03:52,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2018-10-01 00:03:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-01 00:03:52,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-01 00:03:52,195 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 231 [2018-10-01 00:03:52,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:52,195 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-01 00:03:52,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-01 00:03:52,195 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-01 00:03:52,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-01 00:03:52,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:52,197 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1, 1] [2018-10-01 00:03:52,197 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:52,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:52,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1113248615, now seen corresponding path program 46 times [2018-10-01 00:03:52,197 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:52,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:52,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:52,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:52,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:54,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:54,021 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:54,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 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-10-01 00:03:54,028 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:03:54,192 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:03:54,192 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:54,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:54,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:03:54,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:54,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:03:54,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:55,822 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:55,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 97 [2018-10-01 00:03:55,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-01 00:03:55,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-01 00:03:55,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3530, Invalid=5976, Unknown=0, NotChecked=0, Total=9506 [2018-10-01 00:03:55,824 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 98 states. [2018-10-01 00:03:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:58,299 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-10-01 00:03:58,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-01 00:03:58,300 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 236 [2018-10-01 00:03:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:58,301 INFO L225 Difference]: With dead ends: 246 [2018-10-01 00:03:58,301 INFO L226 Difference]: Without dead ends: 245 [2018-10-01 00:03:58,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6622 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7055, Invalid=13825, Unknown=0, NotChecked=0, Total=20880 [2018-10-01 00:03:58,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-01 00:03:58,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2018-10-01 00:03:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-01 00:03:58,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-10-01 00:03:58,350 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 236 [2018-10-01 00:03:58,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:58,350 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-10-01 00:03:58,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-01 00:03:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-10-01 00:03:58,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-01 00:03:58,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:58,351 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1, 1] [2018-10-01 00:03:58,351 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:58,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:58,352 INFO L82 PathProgramCache]: Analyzing trace with hash -418129775, now seen corresponding path program 47 times [2018-10-01 00:03:58,352 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:58,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:58,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:58,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:58,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:59,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:03:59,861 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:59,861 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-01 00:03:59,869 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:04:00,146 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-01 00:04:00,147 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:00,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:00,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:04:00,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:00,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:04:00,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:04:01,917 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:01,917 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 99 [2018-10-01 00:04:01,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-01 00:04:01,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-01 00:04:01,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3677, Invalid=6223, Unknown=0, NotChecked=0, Total=9900 [2018-10-01 00:04:01,918 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 100 states. [2018-10-01 00:04:04,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:04,702 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-01 00:04:04,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-01 00:04:04,702 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 241 [2018-10-01 00:04:04,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:04,703 INFO L225 Difference]: With dead ends: 251 [2018-10-01 00:04:04,703 INFO L226 Difference]: Without dead ends: 250 [2018-10-01 00:04:04,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6907 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7349, Invalid=14407, Unknown=0, NotChecked=0, Total=21756 [2018-10-01 00:04:04,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-01 00:04:04,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2018-10-01 00:04:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-01 00:04:04,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-10-01 00:04:04,759 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 241 [2018-10-01 00:04:04,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:04,759 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-10-01 00:04:04,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-01 00:04:04,760 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-10-01 00:04:04,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-01 00:04:04,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:04,761 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1, 1] [2018-10-01 00:04:04,761 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:04:04,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:04,762 INFO L82 PathProgramCache]: Analyzing trace with hash 501317031, now seen corresponding path program 48 times [2018-10-01 00:04:04,762 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:04,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:04,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:04,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:04,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:04:06,346 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:06,346 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-10-01 00:04:06,354 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:04:06,704 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-01 00:04:06,705 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:06,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:06,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:04:06,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:06,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:04:06,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:08,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:04:08,603 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:08,603 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 101 [2018-10-01 00:04:08,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-01 00:04:08,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-01 00:04:08,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3827, Invalid=6475, Unknown=0, NotChecked=0, Total=10302 [2018-10-01 00:04:08,606 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 102 states. [2018-10-01 00:04:11,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:11,368 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-10-01 00:04:11,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-01 00:04:11,368 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 246 [2018-10-01 00:04:11,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:11,370 INFO L225 Difference]: With dead ends: 256 [2018-10-01 00:04:11,370 INFO L226 Difference]: Without dead ends: 255 [2018-10-01 00:04:11,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7198 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7649, Invalid=15001, Unknown=0, NotChecked=0, Total=22650 [2018-10-01 00:04:11,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-01 00:04:11,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2018-10-01 00:04:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-01 00:04:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-10-01 00:04:11,440 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 246 [2018-10-01 00:04:11,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:11,441 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-10-01 00:04:11,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-01 00:04:11,441 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-10-01 00:04:11,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-01 00:04:11,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:11,442 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1, 1] [2018-10-01 00:04:11,443 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:04:11,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:11,443 INFO L82 PathProgramCache]: Analyzing trace with hash -732064175, now seen corresponding path program 49 times [2018-10-01 00:04:11,443 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:11,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:11,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:11,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:11,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:04:13,015 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:13,015 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-10-01 00:04:13,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:04:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:13,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:13,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:04:13,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:13,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-10-01 00:04:13,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:04:15,266 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:15,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 103 [2018-10-01 00:04:15,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-01 00:04:15,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-01 00:04:15,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3980, Invalid=6732, Unknown=0, NotChecked=0, Total=10712 [2018-10-01 00:04:15,268 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 104 states. [2018-10-01 00:04:18,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:18,080 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-10-01 00:04:18,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-01 00:04:18,080 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 251 [2018-10-01 00:04:18,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:18,081 INFO L225 Difference]: With dead ends: 261 [2018-10-01 00:04:18,081 INFO L226 Difference]: Without dead ends: 260 [2018-10-01 00:04:18,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7495 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7955, Invalid=15607, Unknown=0, NotChecked=0, Total=23562 [2018-10-01 00:04:18,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-01 00:04:18,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2018-10-01 00:04:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-01 00:04:18,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-10-01 00:04:18,146 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 251 [2018-10-01 00:04:18,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:18,147 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-10-01 00:04:18,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-01 00:04:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-10-01 00:04:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-01 00:04:18,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:18,148 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1, 1] [2018-10-01 00:04:18,148 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:04:18,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:18,149 INFO L82 PathProgramCache]: Analyzing trace with hash -506963993, now seen corresponding path program 50 times [2018-10-01 00:04:18,149 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:18,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:18,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:18,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:04:18,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:04:20,039 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:20,039 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-10-01 00:04:20,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:04:20,214 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:04:20,214 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:20,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:20,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:04:20,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:20,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:04:20,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:04:22,032 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:22,032 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 105 [2018-10-01 00:04:22,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-01 00:04:22,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-01 00:04:22,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4136, Invalid=6994, Unknown=0, NotChecked=0, Total=11130 [2018-10-01 00:04:22,034 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 106 states. [2018-10-01 00:04:25,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:25,123 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2018-10-01 00:04:25,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-01 00:04:25,123 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 256 [2018-10-01 00:04:25,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:25,124 INFO L225 Difference]: With dead ends: 266 [2018-10-01 00:04:25,124 INFO L226 Difference]: Without dead ends: 265 [2018-10-01 00:04:25,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7798 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8267, Invalid=16225, Unknown=0, NotChecked=0, Total=24492 [2018-10-01 00:04:25,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-01 00:04:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2018-10-01 00:04:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-10-01 00:04:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2018-10-01 00:04:25,180 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 256 [2018-10-01 00:04:25,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:25,180 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2018-10-01 00:04:25,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-01 00:04:25,180 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2018-10-01 00:04:25,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-01 00:04:25,181 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:25,181 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1, 1] [2018-10-01 00:04:25,181 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:04:25,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:25,182 INFO L82 PathProgramCache]: Analyzing trace with hash -35314671, now seen corresponding path program 51 times [2018-10-01 00:04:25,182 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:25,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:25,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:25,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:26,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:04:26,767 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:26,767 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-10-01 00:04:26,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:04:27,192 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-10-01 00:04:27,192 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:27,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:27,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:04:27,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:27,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:04:27,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:29,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:04:29,087 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:29,088 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 107 [2018-10-01 00:04:29,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-01 00:04:29,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-01 00:04:29,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4295, Invalid=7261, Unknown=0, NotChecked=0, Total=11556 [2018-10-01 00:04:29,090 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 108 states. [2018-10-01 00:04:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:32,172 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-10-01 00:04:32,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-01 00:04:32,172 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 261 [2018-10-01 00:04:32,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:32,173 INFO L225 Difference]: With dead ends: 271 [2018-10-01 00:04:32,173 INFO L226 Difference]: Without dead ends: 270 [2018-10-01 00:04:32,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8107 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8585, Invalid=16855, Unknown=0, NotChecked=0, Total=25440 [2018-10-01 00:04:32,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-01 00:04:32,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2018-10-01 00:04:32,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-01 00:04:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-10-01 00:04:32,234 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 261 [2018-10-01 00:04:32,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:32,234 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-10-01 00:04:32,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-01 00:04:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-10-01 00:04:32,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-01 00:04:32,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:32,236 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1, 1] [2018-10-01 00:04:32,236 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:04:32,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:32,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2006147623, now seen corresponding path program 52 times [2018-10-01 00:04:32,237 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:32,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:32,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:32,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:32,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:04:33,985 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:33,985 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-10-01 00:04:33,995 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:04:34,186 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:04:34,186 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:34,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:34,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-10-01 00:04:34,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:34,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:04:34,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:04:36,284 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:36,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 109 [2018-10-01 00:04:36,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-01 00:04:36,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-01 00:04:36,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4457, Invalid=7533, Unknown=0, NotChecked=0, Total=11990 [2018-10-01 00:04:36,286 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 110 states. [2018-10-01 00:04:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:39,456 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-10-01 00:04:39,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-01 00:04:39,457 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 266 [2018-10-01 00:04:39,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:39,458 INFO L225 Difference]: With dead ends: 276 [2018-10-01 00:04:39,458 INFO L226 Difference]: Without dead ends: 275 [2018-10-01 00:04:39,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8422 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8909, Invalid=17497, Unknown=0, NotChecked=0, Total=26406 [2018-10-01 00:04:39,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-01 00:04:39,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2018-10-01 00:04:39,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-01 00:04:39,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-10-01 00:04:39,525 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 266 [2018-10-01 00:04:39,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:39,525 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-10-01 00:04:39,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-01 00:04:39,525 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-10-01 00:04:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-01 00:04:39,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:39,526 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1, 1] [2018-10-01 00:04:39,527 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:04:39,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:39,527 INFO L82 PathProgramCache]: Analyzing trace with hash -861503023, now seen corresponding path program 53 times [2018-10-01 00:04:39,527 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:39,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:39,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:39,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:39,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:04:41,235 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:41,235 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-10-01 00:04:41,266 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:04:41,622 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-10-01 00:04:41,623 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:41,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:41,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:04:41,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:41,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:04:41,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:04:43,672 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:43,672 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 111 [2018-10-01 00:04:43,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-01 00:04:43,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-01 00:04:43,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4622, Invalid=7810, Unknown=0, NotChecked=0, Total=12432 [2018-10-01 00:04:43,674 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 112 states. [2018-10-01 00:04:47,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:47,085 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-01 00:04:47,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-01 00:04:47,086 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 271 [2018-10-01 00:04:47,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:47,087 INFO L225 Difference]: With dead ends: 281 [2018-10-01 00:04:47,087 INFO L226 Difference]: Without dead ends: 280 [2018-10-01 00:04:47,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8743 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9239, Invalid=18151, Unknown=0, NotChecked=0, Total=27390 [2018-10-01 00:04:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-01 00:04:47,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2018-10-01 00:04:47,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-01 00:04:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-01 00:04:47,160 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 271 [2018-10-01 00:04:47,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:47,161 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-01 00:04:47,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-01 00:04:47,161 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-01 00:04:47,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-01 00:04:47,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:47,162 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1, 1] [2018-10-01 00:04:47,163 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:04:47,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:47,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1278829465, now seen corresponding path program 54 times [2018-10-01 00:04:47,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:47,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:47,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:47,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:47,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:04:48,847 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:48,847 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-10-01 00:04:48,854 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:04:49,295 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-01 00:04:49,295 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:49,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:49,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:04:49,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:49,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:04:49,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:04:51,740 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:51,740 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 113 [2018-10-01 00:04:51,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-01 00:04:51,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-01 00:04:51,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4790, Invalid=8092, Unknown=0, NotChecked=0, Total=12882 [2018-10-01 00:04:51,742 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 114 states. [2018-10-01 00:04:55,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:55,027 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2018-10-01 00:04:55,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-01 00:04:55,028 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 276 [2018-10-01 00:04:55,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:55,029 INFO L225 Difference]: With dead ends: 286 [2018-10-01 00:04:55,029 INFO L226 Difference]: Without dead ends: 285 [2018-10-01 00:04:55,030 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-10-01 00:04:55,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-10-01 00:04:55,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2018-10-01 00:04:55,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-01 00:04:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2018-10-01 00:04:55,093 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 276 [2018-10-01 00:04:55,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:55,093 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2018-10-01 00:04:55,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-01 00:04:55,093 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2018-10-01 00:04:55,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-01 00:04:55,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:55,094 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1, 1] [2018-10-01 00:04:55,095 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:04:55,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:55,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1633833071, now seen corresponding path program 55 times [2018-10-01 00:04:55,095 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:55,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:55,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:55,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:55,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:04:56,847 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:56,847 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-10-01 00:04:56,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:04:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:57,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:57,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:04:57,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:57,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:04:57,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:04:59,199 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:59,200 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 115 [2018-10-01 00:04:59,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-01 00:04:59,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-01 00:04:59,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4961, Invalid=8379, Unknown=0, NotChecked=0, Total=13340 [2018-10-01 00:04:59,202 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 116 states. [2018-10-01 00:05:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:02,826 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-10-01 00:05:02,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-01 00:05:02,826 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 281 [2018-10-01 00:05:02,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:02,828 INFO L225 Difference]: With dead ends: 291 [2018-10-01 00:05:02,828 INFO L226 Difference]: Without dead ends: 290 [2018-10-01 00:05:02,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9403 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9917, Invalid=19495, Unknown=0, NotChecked=0, Total=29412 [2018-10-01 00:05:02,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-01 00:05:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2018-10-01 00:05:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-01 00:05:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-10-01 00:05:02,895 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 281 [2018-10-01 00:05:02,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:02,895 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-10-01 00:05:02,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-01 00:05:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-10-01 00:05:02,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-01 00:05:02,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:02,896 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1, 1] [2018-10-01 00:05:02,896 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:05:02,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:02,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1780087129, now seen corresponding path program 56 times [2018-10-01 00:05:02,897 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:02,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:02,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:02,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:05:02,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:04,753 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:04,753 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:04,753 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-10-01 00:05:04,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:05:04,946 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:05:04,946 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:05:04,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:04,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:05:04,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:04,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:05:04,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:07,295 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:07,295 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 117 [2018-10-01 00:05:07,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-01 00:05:07,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-01 00:05:07,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5135, Invalid=8671, Unknown=0, NotChecked=0, Total=13806 [2018-10-01 00:05:07,297 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 118 states. [2018-10-01 00:05:10,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:10,814 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2018-10-01 00:05:10,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-01 00:05:10,815 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 286 [2018-10-01 00:05:10,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:10,816 INFO L225 Difference]: With dead ends: 296 [2018-10-01 00:05:10,816 INFO L226 Difference]: Without dead ends: 295 [2018-10-01 00:05:10,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9742 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10265, Invalid=20185, Unknown=0, NotChecked=0, Total=30450 [2018-10-01 00:05:10,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-01 00:05:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2018-10-01 00:05:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-01 00:05:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2018-10-01 00:05:10,885 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 286 [2018-10-01 00:05:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:10,886 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2018-10-01 00:05:10,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-01 00:05:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2018-10-01 00:05:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-10-01 00:05:10,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:10,887 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1, 1] [2018-10-01 00:05:10,887 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:05:10,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:10,887 INFO L82 PathProgramCache]: Analyzing trace with hash -2033799855, now seen corresponding path program 57 times [2018-10-01 00:05:10,887 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:10,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:10,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:10,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:05:10,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:12,772 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:12,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 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-10-01 00:05:12,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:05:13,240 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-10-01 00:05:13,240 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:05:13,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:13,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:05:13,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:13,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:05:13,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:15,656 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:15,679 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:15,679 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 119 [2018-10-01 00:05:15,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-01 00:05:15,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-01 00:05:15,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5312, Invalid=8968, Unknown=0, NotChecked=0, Total=14280 [2018-10-01 00:05:15,681 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 120 states. [2018-10-01 00:05:19,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:19,133 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-10-01 00:05:19,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-01 00:05:19,133 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 291 [2018-10-01 00:05:19,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:19,134 INFO L225 Difference]: With dead ends: 301 [2018-10-01 00:05:19,134 INFO L226 Difference]: Without dead ends: 300 [2018-10-01 00:05:19,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10087 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10619, Invalid=20887, Unknown=0, NotChecked=0, Total=31506 [2018-10-01 00:05:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-01 00:05:19,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2018-10-01 00:05:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-01 00:05:19,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-10-01 00:05:19,209 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 291 [2018-10-01 00:05:19,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:19,210 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-10-01 00:05:19,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-01 00:05:19,210 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-10-01 00:05:19,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-01 00:05:19,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:19,211 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1, 1] [2018-10-01 00:05:19,211 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:05:19,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:19,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2005557017, now seen corresponding path program 58 times [2018-10-01 00:05:19,212 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:19,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:19,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:19,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:05:19,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:21,437 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:21,437 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-10-01 00:05:21,446 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:05:21,658 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:05:21,658 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:05:21,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:21,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:05:21,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:21,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:05:21,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:24,001 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:24,001 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 121 [2018-10-01 00:05:24,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-01 00:05:24,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-01 00:05:24,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5492, Invalid=9270, Unknown=0, NotChecked=0, Total=14762 [2018-10-01 00:05:24,004 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 122 states. [2018-10-01 00:05:27,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:27,706 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2018-10-01 00:05:27,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-01 00:05:27,707 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 296 [2018-10-01 00:05:27,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:27,708 INFO L225 Difference]: With dead ends: 306 [2018-10-01 00:05:27,708 INFO L226 Difference]: Without dead ends: 305 [2018-10-01 00:05:27,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10438 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10979, Invalid=21601, Unknown=0, NotChecked=0, Total=32580 [2018-10-01 00:05:27,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-01 00:05:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2018-10-01 00:05:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-01 00:05:27,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-10-01 00:05:27,799 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 296 [2018-10-01 00:05:27,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:27,799 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-10-01 00:05:27,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-01 00:05:27,799 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-10-01 00:05:27,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-01 00:05:27,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:27,800 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1, 1] [2018-10-01 00:05:27,801 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:05:27,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:27,801 INFO L82 PathProgramCache]: Analyzing trace with hash 220035857, now seen corresponding path program 59 times [2018-10-01 00:05:27,801 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:27,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:27,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:27,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:05:27,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:29,742 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:29,742 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-10-01 00:05:29,749 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:05:30,169 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-10-01 00:05:30,169 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:05:30,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:30,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:05:30,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:30,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:05:30,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:32,952 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:32,952 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 123 [2018-10-01 00:05:32,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-01 00:05:32,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-01 00:05:32,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5675, Invalid=9577, Unknown=0, NotChecked=0, Total=15252 [2018-10-01 00:05:32,955 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 124 states. [2018-10-01 00:05:36,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:36,907 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-10-01 00:05:36,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-01 00:05:36,915 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 301 [2018-10-01 00:05:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:36,916 INFO L225 Difference]: With dead ends: 311 [2018-10-01 00:05:36,916 INFO L226 Difference]: Without dead ends: 310 [2018-10-01 00:05:36,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10795 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11345, Invalid=22327, Unknown=0, NotChecked=0, Total=33672 [2018-10-01 00:05:36,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-01 00:05:36,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 307. [2018-10-01 00:05:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-01 00:05:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-10-01 00:05:36,993 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 301 [2018-10-01 00:05:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:36,994 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-10-01 00:05:36,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-01 00:05:36,994 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-10-01 00:05:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-01 00:05:36,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:36,995 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1, 1] [2018-10-01 00:05:36,995 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:05:36,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:36,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1594266841, now seen corresponding path program 60 times [2018-10-01 00:05:36,996 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:36,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:36,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:36,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:05:36,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:39,006 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:39,006 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-10-01 00:05:39,015 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:05:39,545 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-10-01 00:05:39,546 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:05:39,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:39,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:05:39,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:39,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:05:39,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:42,237 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:42,238 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 125 [2018-10-01 00:05:42,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-10-01 00:05:42,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-10-01 00:05:42,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5861, Invalid=9889, Unknown=0, NotChecked=0, Total=15750 [2018-10-01 00:05:42,241 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 126 states. [2018-10-01 00:05:46,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:46,255 INFO L93 Difference]: Finished difference Result 316 states and 316 transitions. [2018-10-01 00:05:46,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-01 00:05:46,256 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 306 [2018-10-01 00:05:46,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:46,257 INFO L225 Difference]: With dead ends: 316 [2018-10-01 00:05:46,257 INFO L226 Difference]: Without dead ends: 315 [2018-10-01 00:05:46,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11158 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11717, Invalid=23065, Unknown=0, NotChecked=0, Total=34782 [2018-10-01 00:05:46,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-01 00:05:46,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 312. [2018-10-01 00:05:46,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-10-01 00:05:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 312 transitions. [2018-10-01 00:05:46,340 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 312 transitions. Word has length 306 [2018-10-01 00:05:46,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:46,340 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 312 transitions. [2018-10-01 00:05:46,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-10-01 00:05:46,340 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 312 transitions. [2018-10-01 00:05:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-10-01 00:05:46,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:46,341 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1, 1] [2018-10-01 00:05:46,342 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:05:46,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:46,342 INFO L82 PathProgramCache]: Analyzing trace with hash -291628847, now seen corresponding path program 61 times [2018-10-01 00:05:46,342 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:46,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:46,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:46,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:05:46,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:48,431 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:48,431 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:05:48,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:05:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:48,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:48,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:05:48,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:48,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:05:48,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:51,459 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:51,480 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:51,480 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 127 [2018-10-01 00:05:51,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-10-01 00:05:51,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-10-01 00:05:51,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6050, Invalid=10206, Unknown=0, NotChecked=0, Total=16256 [2018-10-01 00:05:51,483 INFO L87 Difference]: Start difference. First operand 312 states and 312 transitions. Second operand 128 states. [2018-10-01 00:05:55,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:55,328 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2018-10-01 00:05:55,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-01 00:05:55,328 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 311 [2018-10-01 00:05:55,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:55,329 INFO L225 Difference]: With dead ends: 321 [2018-10-01 00:05:55,329 INFO L226 Difference]: Without dead ends: 320 [2018-10-01 00:05:55,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11527 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=12095, Invalid=23815, Unknown=0, NotChecked=0, Total=35910 [2018-10-01 00:05:55,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-01 00:05:55,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 317. [2018-10-01 00:05:55,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-01 00:05:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-10-01 00:05:55,410 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 311 [2018-10-01 00:05:55,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:55,411 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-10-01 00:05:55,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-10-01 00:05:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-10-01 00:05:55,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-01 00:05:55,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:55,413 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1, 1] [2018-10-01 00:05:55,413 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:05:55,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:55,413 INFO L82 PathProgramCache]: Analyzing trace with hash -537565849, now seen corresponding path program 62 times [2018-10-01 00:05:55,413 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:55,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:55,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:55,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:05:55,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:57,795 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:57,795 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:05:57,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:05:58,010 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:05:58,010 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:05:58,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:58,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:05:58,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:58,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:05:58,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:06:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:00,920 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:06:00,921 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 129 [2018-10-01 00:06:00,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-10-01 00:06:00,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-10-01 00:06:00,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6242, Invalid=10528, Unknown=0, NotChecked=0, Total=16770 [2018-10-01 00:06:00,923 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 130 states. [2018-10-01 00:06:05,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:06:05,128 INFO L93 Difference]: Finished difference Result 326 states and 326 transitions. [2018-10-01 00:06:05,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-01 00:06:05,128 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 316 [2018-10-01 00:06:05,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:06:05,129 INFO L225 Difference]: With dead ends: 326 [2018-10-01 00:06:05,129 INFO L226 Difference]: Without dead ends: 325 [2018-10-01 00:06:05,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11902 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=12479, Invalid=24577, Unknown=0, NotChecked=0, Total=37056 [2018-10-01 00:06:05,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-10-01 00:06:05,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 322. [2018-10-01 00:06:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-10-01 00:06:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 322 transitions. [2018-10-01 00:06:05,212 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 322 transitions. Word has length 316 [2018-10-01 00:06:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:06:05,212 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 322 transitions. [2018-10-01 00:06:05,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-10-01 00:06:05,212 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 322 transitions. [2018-10-01 00:06:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-10-01 00:06:05,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:06:05,213 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1, 1] [2018-10-01 00:06:05,213 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:06:05,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:06:05,214 INFO L82 PathProgramCache]: Analyzing trace with hash -582711663, now seen corresponding path program 63 times [2018-10-01 00:06:05,214 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:06:05,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:06:05,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:05,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:06:05,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:06:07,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:07,731 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:06:07,731 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:06:07,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:06:08,292 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-10-01 00:06:08,293 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:06:08,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:06:08,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:06:08,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:06:08,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-10-01 00:06:08,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:06:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:11,057 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:06:11,057 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 131 [2018-10-01 00:06:11,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-10-01 00:06:11,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-10-01 00:06:11,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6437, Invalid=10855, Unknown=0, NotChecked=0, Total=17292 [2018-10-01 00:06:11,060 INFO L87 Difference]: Start difference. First operand 322 states and 322 transitions. Second operand 132 states. [2018-10-01 00:06:15,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:06:15,452 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-10-01 00:06:15,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-01 00:06:15,453 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 321 [2018-10-01 00:06:15,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:06:15,454 INFO L225 Difference]: With dead ends: 331 [2018-10-01 00:06:15,454 INFO L226 Difference]: Without dead ends: 330 [2018-10-01 00:06:15,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12283 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=12869, Invalid=25351, Unknown=0, NotChecked=0, Total=38220 [2018-10-01 00:06:15,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-10-01 00:06:15,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 327. [2018-10-01 00:06:15,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-10-01 00:06:15,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2018-10-01 00:06:15,540 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 321 [2018-10-01 00:06:15,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:06:15,540 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2018-10-01 00:06:15,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-10-01 00:06:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2018-10-01 00:06:15,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-10-01 00:06:15,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:06:15,541 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1, 1] [2018-10-01 00:06:15,542 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:06:15,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:06:15,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1894616999, now seen corresponding path program 64 times [2018-10-01 00:06:15,542 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:06:15,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:06:15,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:15,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:06:15,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:06:18,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:18,097 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:06:18,097 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:06:18,109 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:06:18,341 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:06:18,341 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:06:18,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:06:18,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:06:18,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:06:18,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:06:18,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:06:21,123 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:21,144 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:06:21,144 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 133 [2018-10-01 00:06:21,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-10-01 00:06:21,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-10-01 00:06:21,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6635, Invalid=11187, Unknown=0, NotChecked=0, Total=17822 [2018-10-01 00:06:21,147 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 134 states. [2018-10-01 00:06:25,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:06:25,627 INFO L93 Difference]: Finished difference Result 336 states and 336 transitions. [2018-10-01 00:06:25,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-01 00:06:25,627 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 326 [2018-10-01 00:06:25,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:06:25,629 INFO L225 Difference]: With dead ends: 336 [2018-10-01 00:06:25,629 INFO L226 Difference]: Without dead ends: 335 [2018-10-01 00:06:25,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12670 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=13265, Invalid=26137, Unknown=0, NotChecked=0, Total=39402 [2018-10-01 00:06:25,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-01 00:06:25,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2018-10-01 00:06:25,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-01 00:06:25,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2018-10-01 00:06:25,718 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 326 [2018-10-01 00:06:25,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:06:25,718 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2018-10-01 00:06:25,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-10-01 00:06:25,718 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2018-10-01 00:06:25,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-10-01 00:06:25,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:06:25,719 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1, 1] [2018-10-01 00:06:25,720 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:06:25,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:06:25,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1074578513, now seen corresponding path program 65 times [2018-10-01 00:06:25,720 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:06:25,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:06:25,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:25,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:06:25,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:06:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:28,345 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:06:28,346 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:06:28,353 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:06:28,818 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-10-01 00:06:28,818 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:06:28,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:06:28,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:06:28,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:06:28,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:06:28,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:06:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:31,676 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:06:31,676 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 135 [2018-10-01 00:06:31,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-10-01 00:06:31,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-10-01 00:06:31,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6836, Invalid=11524, Unknown=0, NotChecked=0, Total=18360 [2018-10-01 00:06:31,680 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand 136 states. [2018-10-01 00:06:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:06:36,173 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2018-10-01 00:06:36,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-01 00:06:36,173 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 331 [2018-10-01 00:06:36,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:06:36,174 INFO L225 Difference]: With dead ends: 341 [2018-10-01 00:06:36,175 INFO L226 Difference]: Without dead ends: 340 [2018-10-01 00:06:36,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13063 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=13667, Invalid=26935, Unknown=0, NotChecked=0, Total=40602 [2018-10-01 00:06:36,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-01 00:06:36,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 337. [2018-10-01 00:06:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-01 00:06:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2018-10-01 00:06:36,267 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 331 [2018-10-01 00:06:36,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:06:36,267 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2018-10-01 00:06:36,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-10-01 00:06:36,268 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2018-10-01 00:06:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-01 00:06:36,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:06:36,269 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1, 1] [2018-10-01 00:06:36,269 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:06:36,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:06:36,269 INFO L82 PathProgramCache]: Analyzing trace with hash -362419737, now seen corresponding path program 66 times [2018-10-01 00:06:36,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:06:36,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:06:36,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:36,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:06:36,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:06:38,989 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:38,989 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:06:38,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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:06:38,997 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:06:39,621 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-10-01 00:06:39,621 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:06:39,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:06:39,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:06:39,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:06:39,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:06:39,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:06:42,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:42,758 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:06:42,759 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 137 [2018-10-01 00:06:42,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-10-01 00:06:42,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-10-01 00:06:42,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7040, Invalid=11866, Unknown=0, NotChecked=0, Total=18906 [2018-10-01 00:06:42,762 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 138 states. [2018-10-01 00:06:47,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:06:47,339 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2018-10-01 00:06:47,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-01 00:06:47,339 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 336 [2018-10-01 00:06:47,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:06:47,340 INFO L225 Difference]: With dead ends: 346 [2018-10-01 00:06:47,340 INFO L226 Difference]: Without dead ends: 345 [2018-10-01 00:06:47,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13462 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=14075, Invalid=27745, Unknown=0, NotChecked=0, Total=41820 [2018-10-01 00:06:47,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-10-01 00:06:47,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 342. [2018-10-01 00:06:47,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-10-01 00:06:47,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 342 transitions. [2018-10-01 00:06:47,436 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 342 transitions. Word has length 336 [2018-10-01 00:06:47,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:06:47,436 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 342 transitions. [2018-10-01 00:06:47,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-10-01 00:06:47,436 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 342 transitions. [2018-10-01 00:06:47,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-10-01 00:06:47,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:06:47,438 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1, 1] [2018-10-01 00:06:47,438 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:06:47,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:06:47,438 INFO L82 PathProgramCache]: Analyzing trace with hash -218967535, now seen corresponding path program 67 times [2018-10-01 00:06:47,438 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:06:47,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:06:47,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:47,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:06:47,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:06:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:49,944 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:06:49,944 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:06:49,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:06:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:06:50,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:06:50,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:06:50,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:06:50,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:06:50,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:06:53,327 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:53,348 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:06:53,348 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 139 [2018-10-01 00:06:53,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-10-01 00:06:53,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-10-01 00:06:53,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7247, Invalid=12213, Unknown=0, NotChecked=0, Total=19460 [2018-10-01 00:06:53,350 INFO L87 Difference]: Start difference. First operand 342 states and 342 transitions. Second operand 140 states. [2018-10-01 00:06:58,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:06:58,125 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2018-10-01 00:06:58,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-01 00:06:58,126 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 341 [2018-10-01 00:06:58,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:06:58,127 INFO L225 Difference]: With dead ends: 351 [2018-10-01 00:06:58,127 INFO L226 Difference]: Without dead ends: 350 [2018-10-01 00:06:58,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13867 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=14489, Invalid=28567, Unknown=0, NotChecked=0, Total=43056 [2018-10-01 00:06:58,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-10-01 00:06:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2018-10-01 00:06:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-01 00:06:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-10-01 00:06:58,226 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 341 [2018-10-01 00:06:58,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:06:58,226 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-10-01 00:06:58,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-10-01 00:06:58,226 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-10-01 00:06:58,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-01 00:06:58,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:06:58,227 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1, 1] [2018-10-01 00:06:58,228 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:06:58,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:06:58,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1914538969, now seen corresponding path program 68 times [2018-10-01 00:06:58,228 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:06:58,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:06:58,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:58,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:06:58,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:07:00,774 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:00,774 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:07:00,775 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:07:00,783 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:07:01,010 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:07:01,010 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:07:01,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:07:01,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:07:01,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:07:01,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:07:01,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:07:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:04,448 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:07:04,449 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 141 [2018-10-01 00:07:04,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-10-01 00:07:04,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-10-01 00:07:04,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7457, Invalid=12565, Unknown=0, NotChecked=0, Total=20022 [2018-10-01 00:07:04,451 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 142 states. [2018-10-01 00:07:09,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:07:09,247 INFO L93 Difference]: Finished difference Result 356 states and 356 transitions. [2018-10-01 00:07:09,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-01 00:07:09,248 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 346 [2018-10-01 00:07:09,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:07:09,249 INFO L225 Difference]: With dead ends: 356 [2018-10-01 00:07:09,249 INFO L226 Difference]: Without dead ends: 355 [2018-10-01 00:07:09,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14278 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=14909, Invalid=29401, Unknown=0, NotChecked=0, Total=44310 [2018-10-01 00:07:09,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-10-01 00:07:09,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 352. [2018-10-01 00:07:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-10-01 00:07:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 352 transitions. [2018-10-01 00:07:09,352 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 352 transitions. Word has length 346 [2018-10-01 00:07:09,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:07:09,352 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 352 transitions. [2018-10-01 00:07:09,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-10-01 00:07:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 352 transitions. [2018-10-01 00:07:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-01 00:07:09,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:07:09,354 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1, 1] [2018-10-01 00:07:09,354 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:07:09,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:07:09,354 INFO L82 PathProgramCache]: Analyzing trace with hash 116568017, now seen corresponding path program 69 times [2018-10-01 00:07:09,354 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:07:09,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:07:09,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:09,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:07:09,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:07:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:12,004 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:07:12,005 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:07:12,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:07:12,629 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-10-01 00:07:12,629 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:07:12,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:07:12,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:07:12,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:07:12,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:07:12,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:07:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:16,146 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:07:16,146 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 143 [2018-10-01 00:07:16,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-10-01 00:07:16,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-10-01 00:07:16,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7670, Invalid=12922, Unknown=0, NotChecked=0, Total=20592 [2018-10-01 00:07:16,149 INFO L87 Difference]: Start difference. First operand 352 states and 352 transitions. Second operand 144 states. [2018-10-01 00:07:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:07:21,063 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2018-10-01 00:07:21,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-01 00:07:21,063 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 351 [2018-10-01 00:07:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:07:21,064 INFO L225 Difference]: With dead ends: 361 [2018-10-01 00:07:21,064 INFO L226 Difference]: Without dead ends: 360 [2018-10-01 00:07:21,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14695 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=15335, Invalid=30247, Unknown=0, NotChecked=0, Total=45582 [2018-10-01 00:07:21,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-10-01 00:07:21,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 357. [2018-10-01 00:07:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-10-01 00:07:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2018-10-01 00:07:21,170 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 351 [2018-10-01 00:07:21,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:07:21,170 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2018-10-01 00:07:21,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-10-01 00:07:21,170 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2018-10-01 00:07:21,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-10-01 00:07:21,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:07:21,171 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1, 1] [2018-10-01 00:07:21,172 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:07:21,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:07:21,172 INFO L82 PathProgramCache]: Analyzing trace with hash -2014892441, now seen corresponding path program 70 times [2018-10-01 00:07:21,172 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:07:21,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:07:21,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:21,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:07:21,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:07:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:24,215 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:07:24,215 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:07:24,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:07:24,477 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:07:24,478 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:07:24,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:07:24,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:07:24,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:07:24,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:07:24,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:07:27,819 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:27,840 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:07:27,840 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 145 [2018-10-01 00:07:27,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-10-01 00:07:27,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-10-01 00:07:27,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7886, Invalid=13284, Unknown=0, NotChecked=0, Total=21170 [2018-10-01 00:07:27,843 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 146 states. [2018-10-01 00:07:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:07:32,830 INFO L93 Difference]: Finished difference Result 366 states and 366 transitions. [2018-10-01 00:07:32,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-01 00:07:32,830 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 356 [2018-10-01 00:07:32,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:07:32,832 INFO L225 Difference]: With dead ends: 366 [2018-10-01 00:07:32,832 INFO L226 Difference]: Without dead ends: 365 [2018-10-01 00:07:32,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15118 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=15767, Invalid=31105, Unknown=0, NotChecked=0, Total=46872 [2018-10-01 00:07:32,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-01 00:07:32,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2018-10-01 00:07:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-10-01 00:07:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 362 transitions. [2018-10-01 00:07:32,941 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 362 transitions. Word has length 356 [2018-10-01 00:07:32,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:07:32,941 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 362 transitions. [2018-10-01 00:07:32,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-10-01 00:07:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 362 transitions. [2018-10-01 00:07:32,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-10-01 00:07:32,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:07:32,942 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1, 1] [2018-10-01 00:07:32,943 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:07:32,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:07:32,943 INFO L82 PathProgramCache]: Analyzing trace with hash -2113380975, now seen corresponding path program 71 times [2018-10-01 00:07:32,943 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:07:32,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:07:32,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:32,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:07:32,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:07:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:35,952 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:07:35,952 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:07:35,959 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:07:36,478 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-10-01 00:07:36,478 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:07:36,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:07:36,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:07:36,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:07:36,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:07:36,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:07:40,178 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:40,201 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:07:40,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 147 [2018-10-01 00:07:40,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-10-01 00:07:40,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-10-01 00:07:40,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8105, Invalid=13651, Unknown=0, NotChecked=0, Total=21756 [2018-10-01 00:07:40,204 INFO L87 Difference]: Start difference. First operand 362 states and 362 transitions. Second operand 148 states. [2018-10-01 00:07:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:07:45,532 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2018-10-01 00:07:45,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-01 00:07:45,532 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 361 [2018-10-01 00:07:45,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:07:45,534 INFO L225 Difference]: With dead ends: 371 [2018-10-01 00:07:45,534 INFO L226 Difference]: Without dead ends: 370 [2018-10-01 00:07:45,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15547 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=16205, Invalid=31975, Unknown=0, NotChecked=0, Total=48180 [2018-10-01 00:07:45,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-10-01 00:07:45,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 367. [2018-10-01 00:07:45,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-01 00:07:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2018-10-01 00:07:45,649 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 361 [2018-10-01 00:07:45,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:07:45,649 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2018-10-01 00:07:45,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-10-01 00:07:45,649 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2018-10-01 00:07:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-01 00:07:45,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:07:45,650 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1, 1] [2018-10-01 00:07:45,651 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:07:45,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:07:45,651 INFO L82 PathProgramCache]: Analyzing trace with hash 804788391, now seen corresponding path program 72 times [2018-10-01 00:07:45,651 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:07:45,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:07:45,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:45,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:07:45,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:07:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:48,591 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:07:48,591 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:07:48,597 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:07:49,251 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-10-01 00:07:49,252 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:07:49,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:07:49,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-10-01 00:07:49,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:07:49,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:07:49,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:07:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:52,759 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:07:52,759 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 149 [2018-10-01 00:07:52,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-10-01 00:07:52,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-10-01 00:07:52,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8327, Invalid=14023, Unknown=0, NotChecked=0, Total=22350 [2018-10-01 00:07:52,763 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 150 states. [2018-10-01 00:07:58,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:07:58,074 INFO L93 Difference]: Finished difference Result 376 states and 376 transitions. [2018-10-01 00:07:58,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-01 00:07:58,074 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 366 [2018-10-01 00:07:58,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:07:58,076 INFO L225 Difference]: With dead ends: 376 [2018-10-01 00:07:58,076 INFO L226 Difference]: Without dead ends: 375 [2018-10-01 00:07:58,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15982 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=16649, Invalid=32857, Unknown=0, NotChecked=0, Total=49506 [2018-10-01 00:07:58,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-01 00:07:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2018-10-01 00:07:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-10-01 00:07:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 372 transitions. [2018-10-01 00:07:58,192 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 372 transitions. Word has length 366 [2018-10-01 00:07:58,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:07:58,192 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 372 transitions. [2018-10-01 00:07:58,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-10-01 00:07:58,192 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 372 transitions. [2018-10-01 00:07:58,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-10-01 00:07:58,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:07:58,194 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1, 1] [2018-10-01 00:07:58,194 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:07:58,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:07:58,194 INFO L82 PathProgramCache]: Analyzing trace with hash 523230033, now seen corresponding path program 73 times [2018-10-01 00:07:58,194 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:07:58,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:07:58,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:58,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:07:58,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:08:01,479 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:01,479 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:08:01,479 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:08:01,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:08:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:08:01,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:08:01,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:08:01,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:08:01,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:08:01,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:08:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:05,533 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:08:05,534 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 151 [2018-10-01 00:08:05,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-10-01 00:08:05,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-10-01 00:08:05,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8552, Invalid=14400, Unknown=0, NotChecked=0, Total=22952 [2018-10-01 00:08:05,537 INFO L87 Difference]: Start difference. First operand 372 states and 372 transitions. Second operand 152 states. [2018-10-01 00:08:11,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:08:11,135 INFO L93 Difference]: Finished difference Result 381 states and 381 transitions. [2018-10-01 00:08:11,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-01 00:08:11,136 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 371 [2018-10-01 00:08:11,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:08:11,137 INFO L225 Difference]: With dead ends: 381 [2018-10-01 00:08:11,137 INFO L226 Difference]: Without dead ends: 380 [2018-10-01 00:08:11,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16423 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=17099, Invalid=33751, Unknown=0, NotChecked=0, Total=50850 [2018-10-01 00:08:11,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-01 00:08:11,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 377. [2018-10-01 00:08:11,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-10-01 00:08:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2018-10-01 00:08:11,253 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 371 [2018-10-01 00:08:11,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:08:11,253 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2018-10-01 00:08:11,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-10-01 00:08:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2018-10-01 00:08:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-10-01 00:08:11,254 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:08:11,255 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1, 1] [2018-10-01 00:08:11,255 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:08:11,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:08:11,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1217999591, now seen corresponding path program 74 times [2018-10-01 00:08:11,255 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:08:11,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:08:11,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:11,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:08:11,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:08:14,220 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:14,221 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:08:14,221 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:08:14,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:08:14,469 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:08:14,469 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:08:14,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:08:14,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:08:14,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:08:14,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:08:14,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:08:18,110 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:18,132 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:08:18,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 153 [2018-10-01 00:08:18,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-10-01 00:08:18,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-10-01 00:08:18,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8780, Invalid=14782, Unknown=0, NotChecked=0, Total=23562 [2018-10-01 00:08:18,137 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 154 states. [2018-10-01 00:08:23,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:08:23,707 INFO L93 Difference]: Finished difference Result 386 states and 386 transitions. [2018-10-01 00:08:23,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-01 00:08:23,708 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 376 [2018-10-01 00:08:23,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:08:23,709 INFO L225 Difference]: With dead ends: 386 [2018-10-01 00:08:23,709 INFO L226 Difference]: Without dead ends: 385 [2018-10-01 00:08:23,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16870 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=17555, Invalid=34657, Unknown=0, NotChecked=0, Total=52212 [2018-10-01 00:08:23,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-10-01 00:08:23,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 382. [2018-10-01 00:08:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-01 00:08:23,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 382 transitions. [2018-10-01 00:08:23,831 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 382 transitions. Word has length 376 [2018-10-01 00:08:23,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:08:23,831 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 382 transitions. [2018-10-01 00:08:23,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-10-01 00:08:23,832 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 382 transitions. [2018-10-01 00:08:23,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-10-01 00:08:23,833 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:08:23,833 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1, 1] [2018-10-01 00:08:23,833 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:08:23,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:08:23,834 INFO L82 PathProgramCache]: Analyzing trace with hash 241510673, now seen corresponding path program 75 times [2018-10-01 00:08:23,834 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:08:23,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:08:23,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:23,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:08:23,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:08:27,255 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:27,255 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:08:27,255 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:08:27,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:08:27,961 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-10-01 00:08:27,961 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:08:27,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:08:27,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:08:27,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:08:27,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:08:27,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:08:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:31,981 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:08:31,981 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 155 [2018-10-01 00:08:31,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-10-01 00:08:31,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-10-01 00:08:31,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9011, Invalid=15169, Unknown=0, NotChecked=0, Total=24180 [2018-10-01 00:08:31,984 INFO L87 Difference]: Start difference. First operand 382 states and 382 transitions. Second operand 156 states. [2018-10-01 00:08:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:08:37,725 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2018-10-01 00:08:37,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-01 00:08:37,725 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 381 [2018-10-01 00:08:37,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:08:37,727 INFO L225 Difference]: With dead ends: 391 [2018-10-01 00:08:37,727 INFO L226 Difference]: Without dead ends: 390 [2018-10-01 00:08:37,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17323 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=18017, Invalid=35575, Unknown=0, NotChecked=0, Total=53592 [2018-10-01 00:08:37,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-10-01 00:08:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 387. [2018-10-01 00:08:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-01 00:08:37,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 387 transitions. [2018-10-01 00:08:37,854 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 387 transitions. Word has length 381 [2018-10-01 00:08:37,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:08:37,854 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 387 transitions. [2018-10-01 00:08:37,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-10-01 00:08:37,854 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 387 transitions. [2018-10-01 00:08:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-10-01 00:08:37,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:08:37,856 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1, 1] [2018-10-01 00:08:37,856 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:08:37,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:08:37,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1062108455, now seen corresponding path program 76 times [2018-10-01 00:08:37,856 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:08:37,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:08:37,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:37,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:08:37,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:08:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:41,258 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:08:41,258 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:08:41,265 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:08:41,536 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:08:41,537 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:08:41,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:08:41,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:08:41,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:08:41,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:08:41,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:08:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:45,496 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:08:45,496 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 157 [2018-10-01 00:08:45,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-10-01 00:08:45,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-10-01 00:08:45,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9245, Invalid=15561, Unknown=0, NotChecked=0, Total=24806 [2018-10-01 00:08:45,499 INFO L87 Difference]: Start difference. First operand 387 states and 387 transitions. Second operand 158 states. [2018-10-01 00:08:51,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:08:51,381 INFO L93 Difference]: Finished difference Result 396 states and 396 transitions. [2018-10-01 00:08:51,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-01 00:08:51,381 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 386 [2018-10-01 00:08:51,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:08:51,382 INFO L225 Difference]: With dead ends: 396 [2018-10-01 00:08:51,383 INFO L226 Difference]: Without dead ends: 395 [2018-10-01 00:08:51,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17782 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=18485, Invalid=36505, Unknown=0, NotChecked=0, Total=54990 [2018-10-01 00:08:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-01 00:08:51,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 392. [2018-10-01 00:08:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-01 00:08:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 392 transitions. [2018-10-01 00:08:51,503 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 392 transitions. Word has length 386 [2018-10-01 00:08:51,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:08:51,503 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 392 transitions. [2018-10-01 00:08:51,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-10-01 00:08:51,504 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 392 transitions. [2018-10-01 00:08:51,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-10-01 00:08:51,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:08:51,505 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1, 1] [2018-10-01 00:08:51,505 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:08:51,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:08:51,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1264302383, now seen corresponding path program 77 times [2018-10-01 00:08:51,506 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:08:51,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:08:51,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:51,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:08:51,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:08:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:54,796 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:08:54,796 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:08:54,803 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:08:55,474 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2018-10-01 00:08:55,474 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:08:55,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:08:55,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:08:55,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:08:55,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:08:55,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:08:59,486 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:59,508 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:08:59,508 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 159 [2018-10-01 00:08:59,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-10-01 00:08:59,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-10-01 00:08:59,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9482, Invalid=15958, Unknown=0, NotChecked=0, Total=25440 [2018-10-01 00:08:59,512 INFO L87 Difference]: Start difference. First operand 392 states and 392 transitions. Second operand 160 states. [2018-10-01 00:09:05,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:09:05,523 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2018-10-01 00:09:05,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-01 00:09:05,523 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 391 [2018-10-01 00:09:05,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:09:05,524 INFO L225 Difference]: With dead ends: 401 [2018-10-01 00:09:05,525 INFO L226 Difference]: Without dead ends: 400 [2018-10-01 00:09:05,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18247 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=18959, Invalid=37447, Unknown=0, NotChecked=0, Total=56406 [2018-10-01 00:09:05,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-10-01 00:09:05,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 397. [2018-10-01 00:09:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-10-01 00:09:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2018-10-01 00:09:05,657 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 391 [2018-10-01 00:09:05,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:09:05,657 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2018-10-01 00:09:05,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-10-01 00:09:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2018-10-01 00:09:05,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-10-01 00:09:05,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:09:05,659 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1, 1] [2018-10-01 00:09:05,659 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:09:05,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:09:05,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1822160743, now seen corresponding path program 78 times [2018-10-01 00:09:05,659 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:09:05,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:09:05,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:05,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:09:05,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:09:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:08,977 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:09:08,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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:09:08,983 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:09:09,757 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2018-10-01 00:09:09,757 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:09:09,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:09:09,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:09:09,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:09:09,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:09:09,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:09:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:14,086 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:09:14,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 161 [2018-10-01 00:09:14,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-10-01 00:09:14,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-10-01 00:09:14,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9722, Invalid=16360, Unknown=0, NotChecked=0, Total=26082 [2018-10-01 00:09:14,090 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 162 states. [2018-10-01 00:09:20,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:09:20,108 INFO L93 Difference]: Finished difference Result 406 states and 406 transitions. [2018-10-01 00:09:20,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-01 00:09:20,108 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 396 [2018-10-01 00:09:20,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:09:20,110 INFO L225 Difference]: With dead ends: 406 [2018-10-01 00:09:20,110 INFO L226 Difference]: Without dead ends: 405 [2018-10-01 00:09:20,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18718 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=19439, Invalid=38401, Unknown=0, NotChecked=0, Total=57840 [2018-10-01 00:09:20,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-10-01 00:09:20,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2018-10-01 00:09:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-10-01 00:09:20,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 402 transitions. [2018-10-01 00:09:20,243 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 402 transitions. Word has length 396 [2018-10-01 00:09:20,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:09:20,243 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 402 transitions. [2018-10-01 00:09:20,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-10-01 00:09:20,243 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 402 transitions. [2018-10-01 00:09:20,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-10-01 00:09:20,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:09:20,245 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1, 1] [2018-10-01 00:09:20,245 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:09:20,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:09:20,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1810445457, now seen corresponding path program 79 times [2018-10-01 00:09:20,246 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:09:20,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:09:20,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:20,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:09:20,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:09:23,912 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:23,912 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:09:23,913 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:09:23,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:09:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:09:24,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:09:24,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-10-01 00:09:24,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:09:24,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:09:24,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:09:28,563 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:28,585 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:09:28,585 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 163 [2018-10-01 00:09:28,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-10-01 00:09:28,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-10-01 00:09:28,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9965, Invalid=16767, Unknown=0, NotChecked=0, Total=26732 [2018-10-01 00:09:28,589 INFO L87 Difference]: Start difference. First operand 402 states and 402 transitions. Second operand 164 states. [2018-10-01 00:09:35,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:09:35,006 INFO L93 Difference]: Finished difference Result 411 states and 411 transitions. [2018-10-01 00:09:35,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-01 00:09:35,007 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 401 [2018-10-01 00:09:35,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:09:35,008 INFO L225 Difference]: With dead ends: 411 [2018-10-01 00:09:35,008 INFO L226 Difference]: Without dead ends: 410 [2018-10-01 00:09:35,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19195 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=19925, Invalid=39367, Unknown=0, NotChecked=0, Total=59292 [2018-10-01 00:09:35,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-10-01 00:09:35,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 407. [2018-10-01 00:09:35,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-10-01 00:09:35,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 407 transitions. [2018-10-01 00:09:35,150 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 407 transitions. Word has length 401 [2018-10-01 00:09:35,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:09:35,150 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 407 transitions. [2018-10-01 00:09:35,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-10-01 00:09:35,150 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 407 transitions. [2018-10-01 00:09:35,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-10-01 00:09:35,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:09:35,152 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1, 1] [2018-10-01 00:09:35,152 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:09:35,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:09:35,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1409655207, now seen corresponding path program 80 times [2018-10-01 00:09:35,153 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:09:35,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:09:35,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:35,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:09:35,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:09:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:38,966 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:09:38,966 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:09:38,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:09:39,236 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:09:39,236 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:09:39,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:09:39,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:09:39,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:09:39,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:09:39,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:09:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:43,578 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:09:43,578 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 165 [2018-10-01 00:09:43,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-10-01 00:09:43,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-10-01 00:09:43,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10211, Invalid=17179, Unknown=0, NotChecked=0, Total=27390 [2018-10-01 00:09:43,582 INFO L87 Difference]: Start difference. First operand 407 states and 407 transitions. Second operand 166 states. [2018-10-01 00:09:49,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:09:49,929 INFO L93 Difference]: Finished difference Result 416 states and 416 transitions. [2018-10-01 00:09:49,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-01 00:09:49,929 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 406 [2018-10-01 00:09:49,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:09:49,931 INFO L225 Difference]: With dead ends: 416 [2018-10-01 00:09:49,931 INFO L226 Difference]: Without dead ends: 415 [2018-10-01 00:09:49,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19678 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=20417, Invalid=40345, Unknown=0, NotChecked=0, Total=60762 [2018-10-01 00:09:49,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-10-01 00:09:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 412. [2018-10-01 00:09:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-10-01 00:09:50,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 412 transitions. [2018-10-01 00:09:50,076 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 412 transitions. Word has length 406 [2018-10-01 00:09:50,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:09:50,077 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 412 transitions. [2018-10-01 00:09:50,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-10-01 00:09:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 412 transitions. [2018-10-01 00:09:50,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-10-01 00:09:50,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:09:50,078 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1, 1] [2018-10-01 00:09:50,079 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:09:50,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:09:50,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1127215697, now seen corresponding path program 81 times [2018-10-01 00:09:50,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:09:50,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:09:50,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:50,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:09:50,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:09:53,869 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:53,869 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:09:53,869 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:09:53,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:09:54,721 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2018-10-01 00:09:54,721 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:09:54,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:09:54,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:09:54,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:09:54,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:09:54,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:09:59,195 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:59,218 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:09:59,218 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 167 [2018-10-01 00:09:59,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-10-01 00:09:59,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-10-01 00:09:59,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10460, Invalid=17596, Unknown=0, NotChecked=0, Total=28056 [2018-10-01 00:09:59,221 INFO L87 Difference]: Start difference. First operand 412 states and 412 transitions. Second operand 168 states. [2018-10-01 00:10:05,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:10:05,784 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2018-10-01 00:10:05,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-01 00:10:05,785 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 411 [2018-10-01 00:10:05,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:10:05,786 INFO L225 Difference]: With dead ends: 421 [2018-10-01 00:10:05,786 INFO L226 Difference]: Without dead ends: 420 [2018-10-01 00:10:05,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20167 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=20915, Invalid=41335, Unknown=0, NotChecked=0, Total=62250 [2018-10-01 00:10:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-10-01 00:10:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 417. [2018-10-01 00:10:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-10-01 00:10:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 417 transitions. [2018-10-01 00:10:05,935 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 417 transitions. Word has length 411 [2018-10-01 00:10:05,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:10:05,936 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 417 transitions. [2018-10-01 00:10:05,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-10-01 00:10:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 417 transitions. [2018-10-01 00:10:05,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-10-01 00:10:05,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:10:05,937 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1, 1] [2018-10-01 00:10:05,938 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:10:05,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:10:05,938 INFO L82 PathProgramCache]: Analyzing trace with hash -468747289, now seen corresponding path program 82 times [2018-10-01 00:10:05,938 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:10:05,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:10:05,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:10:05,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:10:05,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:10:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:10:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:10:09,887 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:10:09,888 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:10:09,896 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:10:10,192 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:10:10,192 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:10:10,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:10:10,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:10:10,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:10:10,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:10:10,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:10:14,689 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:10:14,710 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:10:14,710 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 169 [2018-10-01 00:10:14,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-10-01 00:10:14,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-10-01 00:10:14,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10712, Invalid=18018, Unknown=0, NotChecked=0, Total=28730 [2018-10-01 00:10:14,714 INFO L87 Difference]: Start difference. First operand 417 states and 417 transitions. Second operand 170 states. [2018-10-01 00:10:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:10:21,393 INFO L93 Difference]: Finished difference Result 426 states and 426 transitions. [2018-10-01 00:10:21,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-01 00:10:21,394 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 416 [2018-10-01 00:10:21,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:10:21,395 INFO L225 Difference]: With dead ends: 426 [2018-10-01 00:10:21,395 INFO L226 Difference]: Without dead ends: 425 [2018-10-01 00:10:21,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20662 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=21419, Invalid=42337, Unknown=0, NotChecked=0, Total=63756 [2018-10-01 00:10:21,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-10-01 00:10:21,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2018-10-01 00:10:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-10-01 00:10:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 422 transitions. [2018-10-01 00:10:21,533 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 422 transitions. Word has length 416 [2018-10-01 00:10:21,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:10:21,533 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 422 transitions. [2018-10-01 00:10:21,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-10-01 00:10:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 422 transitions. [2018-10-01 00:10:21,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2018-10-01 00:10:21,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:10:21,535 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1, 1] [2018-10-01 00:10:21,536 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:10:21,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:10:21,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1099661295, now seen corresponding path program 83 times [2018-10-01 00:10:21,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:10:21,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:10:21,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:10:21,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:10:21,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:10:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:10:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:10:25,640 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:10:25,640 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:10:25,648 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:10:26,538 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2018-10-01 00:10:26,538 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:10:26,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:10:26,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:10:26,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:10:26,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:10:26,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:10:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:10:31,228 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:10:31,229 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 171 [2018-10-01 00:10:31,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-10-01 00:10:31,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-10-01 00:10:31,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10967, Invalid=18445, Unknown=0, NotChecked=0, Total=29412 [2018-10-01 00:10:31,232 INFO L87 Difference]: Start difference. First operand 422 states and 422 transitions. Second operand 172 states. [2018-10-01 00:10:38,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:10:38,235 INFO L93 Difference]: Finished difference Result 431 states and 431 transitions. [2018-10-01 00:10:38,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-01 00:10:38,235 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 421 [2018-10-01 00:10:38,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:10:38,237 INFO L225 Difference]: With dead ends: 431 [2018-10-01 00:10:38,237 INFO L226 Difference]: Without dead ends: 430 [2018-10-01 00:10:38,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21163 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=21929, Invalid=43351, Unknown=0, NotChecked=0, Total=65280 [2018-10-01 00:10:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-01 00:10:38,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 427. [2018-10-01 00:10:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-10-01 00:10:38,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 427 transitions. [2018-10-01 00:10:38,394 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 427 transitions. Word has length 421 [2018-10-01 00:10:38,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:10:38,394 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 427 transitions. [2018-10-01 00:10:38,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-10-01 00:10:38,394 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 427 transitions. [2018-10-01 00:10:38,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-10-01 00:10:38,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:10:38,396 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 85, 84, 84, 1, 1, 1] [2018-10-01 00:10:38,397 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:10:38,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:10:38,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1237481945, now seen corresponding path program 84 times [2018-10-01 00:10:38,397 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:10:38,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:10:38,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:10:38,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:10:38,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:10:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:10:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:10:42,223 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:10:42,224 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:10:42,230 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:10:43,168 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2018-10-01 00:10:43,168 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:10:43,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:10:43,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:10:43,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:10:43,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:10:43,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:10:47,687 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:10:47,709 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:10:47,710 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 173 [2018-10-01 00:10:47,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-10-01 00:10:47,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-10-01 00:10:47,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11225, Invalid=18877, Unknown=0, NotChecked=0, Total=30102 [2018-10-01 00:10:47,714 INFO L87 Difference]: Start difference. First operand 427 states and 427 transitions. Second operand 174 states. [2018-10-01 00:10:54,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:10:54,960 INFO L93 Difference]: Finished difference Result 436 states and 436 transitions. [2018-10-01 00:10:54,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-01 00:10:54,960 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 426 [2018-10-01 00:10:54,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:10:54,961 INFO L225 Difference]: With dead ends: 436 [2018-10-01 00:10:54,961 INFO L226 Difference]: Without dead ends: 435 [2018-10-01 00:10:54,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21670 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=22445, Invalid=44377, Unknown=0, NotChecked=0, Total=66822 [2018-10-01 00:10:54,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-10-01 00:10:55,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 432. [2018-10-01 00:10:55,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-10-01 00:10:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 432 transitions. [2018-10-01 00:10:55,121 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 432 transitions. Word has length 426 [2018-10-01 00:10:55,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:10:55,121 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 432 transitions. [2018-10-01 00:10:55,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-10-01 00:10:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 432 transitions. [2018-10-01 00:10:55,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-10-01 00:10:55,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:10:55,123 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 86, 85, 85, 1, 1, 1] [2018-10-01 00:10:55,123 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:10:55,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:10:55,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1766662703, now seen corresponding path program 85 times [2018-10-01 00:10:55,123 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:10:55,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:10:55,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:10:55,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:10:55,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:10:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:10:59,186 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:10:59,187 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:10:59,187 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:10:59,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:10:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:10:59,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:10:59,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:10:59,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:10:59,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:10:59,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:11:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:11:04,405 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:11:04,406 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 175 [2018-10-01 00:11:04,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-10-01 00:11:04,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-10-01 00:11:04,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11486, Invalid=19314, Unknown=0, NotChecked=0, Total=30800 [2018-10-01 00:11:04,408 INFO L87 Difference]: Start difference. First operand 432 states and 432 transitions. Second operand 176 states. [2018-10-01 00:11:11,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:11:11,523 INFO L93 Difference]: Finished difference Result 441 states and 441 transitions. [2018-10-01 00:11:11,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-01 00:11:11,524 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 431 [2018-10-01 00:11:11,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:11:11,525 INFO L225 Difference]: With dead ends: 441 [2018-10-01 00:11:11,525 INFO L226 Difference]: Without dead ends: 440 [2018-10-01 00:11:11,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22183 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=22967, Invalid=45415, Unknown=0, NotChecked=0, Total=68382 [2018-10-01 00:11:11,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-10-01 00:11:11,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 437. [2018-10-01 00:11:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-10-01 00:11:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 437 transitions. [2018-10-01 00:11:11,692 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 437 transitions. Word has length 431 [2018-10-01 00:11:11,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:11:11,692 INFO L480 AbstractCegarLoop]: Abstraction has 437 states and 437 transitions. [2018-10-01 00:11:11,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-10-01 00:11:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 437 transitions. [2018-10-01 00:11:11,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-10-01 00:11:11,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:11:11,694 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 87, 86, 86, 1, 1, 1] [2018-10-01 00:11:11,694 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:11:11,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:11:11,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1326694503, now seen corresponding path program 86 times [2018-10-01 00:11:11,695 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:11:11,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:11:11,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:11:11,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:11:11,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:11:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:11:15,925 INFO L134 CoverageAnalysis]: Checked inductivity of 18619 backedges. 0 proven. 18619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:11:15,926 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:11:15,926 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:11:15,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:11:16,219 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:11:16,219 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:11:16,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:11:16,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:11:16,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:11:16,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:11:16,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:11:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 18619 backedges. 0 proven. 18619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:11:21,272 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:11:21,273 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 177 [2018-10-01 00:11:21,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-10-01 00:11:21,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-10-01 00:11:21,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11750, Invalid=19756, Unknown=0, NotChecked=0, Total=31506 [2018-10-01 00:11:21,277 INFO L87 Difference]: Start difference. First operand 437 states and 437 transitions. Second operand 178 states. [2018-10-01 00:11:28,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:11:28,324 INFO L93 Difference]: Finished difference Result 446 states and 446 transitions. [2018-10-01 00:11:28,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-01 00:11:28,324 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 436 [2018-10-01 00:11:28,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:11:28,326 INFO L225 Difference]: With dead ends: 446 [2018-10-01 00:11:28,326 INFO L226 Difference]: Without dead ends: 445 [2018-10-01 00:11:28,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22702 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=23495, Invalid=46465, Unknown=0, NotChecked=0, Total=69960 [2018-10-01 00:11:28,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-10-01 00:11:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 442. [2018-10-01 00:11:28,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-10-01 00:11:28,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 442 transitions. [2018-10-01 00:11:28,494 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 442 transitions. Word has length 436 [2018-10-01 00:11:28,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:11:28,494 INFO L480 AbstractCegarLoop]: Abstraction has 442 states and 442 transitions. [2018-10-01 00:11:28,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-10-01 00:11:28,494 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 442 transitions. [2018-10-01 00:11:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-10-01 00:11:28,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:11:28,496 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 88, 87, 87, 1, 1, 1] [2018-10-01 00:11:28,496 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:11:28,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:11:28,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2045184913, now seen corresponding path program 87 times [2018-10-01 00:11:28,497 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:11:28,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:11:28,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:11:28,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:11:28,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:11:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:11:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 19053 backedges. 0 proven. 19053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:11:32,573 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:11:32,573 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:11:32,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:11:33,521 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2018-10-01 00:11:33,522 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:11:33,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:11:33,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:11:33,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:11:33,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:11:33,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:11:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 19053 backedges. 0 proven. 19053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:11:38,424 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:11:38,424 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 179 [2018-10-01 00:11:38,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-10-01 00:11:38,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-10-01 00:11:38,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12017, Invalid=20203, Unknown=0, NotChecked=0, Total=32220 [2018-10-01 00:11:38,428 INFO L87 Difference]: Start difference. First operand 442 states and 442 transitions. Second operand 180 states. [2018-10-01 00:11:45,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:11:45,783 INFO L93 Difference]: Finished difference Result 451 states and 451 transitions. [2018-10-01 00:11:45,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-01 00:11:45,784 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 441 [2018-10-01 00:11:45,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:11:45,785 INFO L225 Difference]: With dead ends: 451 [2018-10-01 00:11:45,785 INFO L226 Difference]: Without dead ends: 450 [2018-10-01 00:11:45,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23227 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=24029, Invalid=47527, Unknown=0, NotChecked=0, Total=71556 [2018-10-01 00:11:45,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-10-01 00:11:45,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 447. [2018-10-01 00:11:45,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-10-01 00:11:45,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 447 transitions. [2018-10-01 00:11:45,961 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 447 transitions. Word has length 441 [2018-10-01 00:11:45,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:11:45,961 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 447 transitions. [2018-10-01 00:11:45,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-10-01 00:11:45,962 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 447 transitions. [2018-10-01 00:11:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-10-01 00:11:45,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:11:45,963 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 89, 88, 88, 1, 1, 1] [2018-10-01 00:11:45,964 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:11:45,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:11:45,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1578511015, now seen corresponding path program 88 times [2018-10-01 00:11:45,964 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:11:45,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:11:45,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:11:45,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:11:45,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:11:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:11:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 19492 backedges. 0 proven. 19492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:11:50,071 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:11:50,071 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:11:50,077 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:11:50,396 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:11:50,396 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:11:50,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:11:50,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:11:50,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:11:50,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:11:50,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:11:55,323 INFO L134 CoverageAnalysis]: Checked inductivity of 19492 backedges. 0 proven. 19492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:11:55,346 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:11:55,346 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 181 [2018-10-01 00:11:55,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-10-01 00:11:55,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-10-01 00:11:55,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12287, Invalid=20655, Unknown=0, NotChecked=0, Total=32942 [2018-10-01 00:11:55,349 INFO L87 Difference]: Start difference. First operand 447 states and 447 transitions. Second operand 182 states. [2018-10-01 00:12:02,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:12:02,500 INFO L93 Difference]: Finished difference Result 456 states and 456 transitions. [2018-10-01 00:12:02,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-01 00:12:02,500 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 446 [2018-10-01 00:12:02,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:12:02,502 INFO L225 Difference]: With dead ends: 456 [2018-10-01 00:12:02,502 INFO L226 Difference]: Without dead ends: 455 [2018-10-01 00:12:02,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23758 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=24569, Invalid=48601, Unknown=0, NotChecked=0, Total=73170 [2018-10-01 00:12:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-10-01 00:12:02,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 452. [2018-10-01 00:12:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-10-01 00:12:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 452 transitions. [2018-10-01 00:12:02,680 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 452 transitions. Word has length 446 [2018-10-01 00:12:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:12:02,680 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 452 transitions. [2018-10-01 00:12:02,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-10-01 00:12:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 452 transitions. [2018-10-01 00:12:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-10-01 00:12:02,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:12:02,682 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 89, 89, 1, 1, 1] [2018-10-01 00:12:02,682 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:12:02,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:12:02,683 INFO L82 PathProgramCache]: Analyzing trace with hash -888338095, now seen corresponding path program 89 times [2018-10-01 00:12:02,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:12:02,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:12:02,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:12:02,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:12:02,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:12:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:12:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 19936 backedges. 0 proven. 19936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:12:06,962 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:12:06,962 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:12:06,969 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:12:07,792 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2018-10-01 00:12:07,793 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:12:07,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:12:07,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-10-01 00:12:07,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:12:07,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:12:07,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:12:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 19936 backedges. 0 proven. 19936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:12:12,824 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:12:12,824 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 183 [2018-10-01 00:12:12,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-10-01 00:12:12,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-10-01 00:12:12,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12560, Invalid=21112, Unknown=0, NotChecked=0, Total=33672 [2018-10-01 00:12:12,828 INFO L87 Difference]: Start difference. First operand 452 states and 452 transitions. Second operand 184 states. [2018-10-01 00:12:20,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:12:20,004 INFO L93 Difference]: Finished difference Result 461 states and 461 transitions. [2018-10-01 00:12:20,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-01 00:12:20,004 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 451 [2018-10-01 00:12:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:12:20,006 INFO L225 Difference]: With dead ends: 461 [2018-10-01 00:12:20,006 INFO L226 Difference]: Without dead ends: 460 [2018-10-01 00:12:20,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24295 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=25115, Invalid=49687, Unknown=0, NotChecked=0, Total=74802 [2018-10-01 00:12:20,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-10-01 00:12:20,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 457. [2018-10-01 00:12:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-10-01 00:12:20,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 457 transitions. [2018-10-01 00:12:20,186 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 457 transitions. Word has length 451 [2018-10-01 00:12:20,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:12:20,187 INFO L480 AbstractCegarLoop]: Abstraction has 457 states and 457 transitions. [2018-10-01 00:12:20,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-10-01 00:12:20,187 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 457 transitions. [2018-10-01 00:12:20,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2018-10-01 00:12:20,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:12:20,189 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 90, 90, 1, 1, 1] [2018-10-01 00:12:20,189 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:12:20,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:12:20,189 INFO L82 PathProgramCache]: Analyzing trace with hash -37174041, now seen corresponding path program 90 times [2018-10-01 00:12:20,189 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:12:20,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:12:20,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:12:20,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:12:20,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:12:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:12:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 20385 backedges. 0 proven. 20385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:12:24,493 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:12:24,493 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:12:24,503 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:12:25,543 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2018-10-01 00:12:25,543 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:12:25,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:12:25,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:12:25,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:12:25,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:12:25,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:12:30,698 INFO L134 CoverageAnalysis]: Checked inductivity of 20385 backedges. 0 proven. 20385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:12:30,722 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:12:30,722 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 185 [2018-10-01 00:12:30,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-10-01 00:12:30,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-10-01 00:12:30,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12836, Invalid=21574, Unknown=0, NotChecked=0, Total=34410 [2018-10-01 00:12:30,726 INFO L87 Difference]: Start difference. First operand 457 states and 457 transitions. Second operand 186 states. [2018-10-01 00:12:38,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:12:38,237 INFO L93 Difference]: Finished difference Result 466 states and 466 transitions. [2018-10-01 00:12:38,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-01 00:12:38,238 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 456 [2018-10-01 00:12:38,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:12:38,239 INFO L225 Difference]: With dead ends: 466 [2018-10-01 00:12:38,239 INFO L226 Difference]: Without dead ends: 465 [2018-10-01 00:12:38,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24838 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=25667, Invalid=50785, Unknown=0, NotChecked=0, Total=76452 [2018-10-01 00:12:38,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-10-01 00:12:38,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 462. [2018-10-01 00:12:38,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-10-01 00:12:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 462 transitions. [2018-10-01 00:12:38,412 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 462 transitions. Word has length 456 [2018-10-01 00:12:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:12:38,412 INFO L480 AbstractCegarLoop]: Abstraction has 462 states and 462 transitions. [2018-10-01 00:12:38,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-10-01 00:12:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 462 transitions. [2018-10-01 00:12:38,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-10-01 00:12:38,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:12:38,414 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 92, 91, 91, 1, 1, 1] [2018-10-01 00:12:38,414 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:12:38,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:12:38,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1646319377, now seen corresponding path program 91 times [2018-10-01 00:12:38,415 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:12:38,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:12:38,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:12:38,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:12:38,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:12:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:12:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 20839 backedges. 0 proven. 20839 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:12:42,661 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:12:42,661 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:12:42,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:12:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:12:42,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:12:42,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-10-01 00:12:42,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:12:42,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:12:42,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:12:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 20839 backedges. 0 proven. 20839 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:12:48,325 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:12:48,325 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 187 [2018-10-01 00:12:48,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-10-01 00:12:48,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-10-01 00:12:48,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13115, Invalid=22041, Unknown=0, NotChecked=0, Total=35156 [2018-10-01 00:12:48,328 INFO L87 Difference]: Start difference. First operand 462 states and 462 transitions. Second operand 188 states. [2018-10-01 00:12:56,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:12:56,029 INFO L93 Difference]: Finished difference Result 471 states and 471 transitions. [2018-10-01 00:12:56,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-01 00:12:56,029 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 461 [2018-10-01 00:12:56,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:12:56,031 INFO L225 Difference]: With dead ends: 471 [2018-10-01 00:12:56,031 INFO L226 Difference]: Without dead ends: 470 [2018-10-01 00:12:56,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25387 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=26225, Invalid=51895, Unknown=0, NotChecked=0, Total=78120 [2018-10-01 00:12:56,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-10-01 00:12:56,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 467. [2018-10-01 00:12:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-10-01 00:12:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 467 transitions. [2018-10-01 00:12:56,221 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 467 transitions. Word has length 461 [2018-10-01 00:12:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:12:56,221 INFO L480 AbstractCegarLoop]: Abstraction has 467 states and 467 transitions. [2018-10-01 00:12:56,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-10-01 00:12:56,221 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 467 transitions. [2018-10-01 00:12:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-01 00:12:56,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:12:56,223 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 93, 92, 92, 1, 1, 1] [2018-10-01 00:12:56,223 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:12:56,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:12:56,223 INFO L82 PathProgramCache]: Analyzing trace with hash -206598361, now seen corresponding path program 92 times [2018-10-01 00:12:56,224 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:12:56,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:12:56,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:12:56,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:12:56,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:12:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:13:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 21298 backedges. 0 proven. 21298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:13:00,780 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:13:00,780 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:13:00,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:13:01,085 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:13:01,085 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:13:01,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:13:01,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:13:01,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:13:01,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:13:01,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:13:06,374 INFO L134 CoverageAnalysis]: Checked inductivity of 21298 backedges. 0 proven. 21298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:13:06,396 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:13:06,396 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 189 [2018-10-01 00:13:06,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-10-01 00:13:06,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-10-01 00:13:06,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13397, Invalid=22513, Unknown=0, NotChecked=0, Total=35910 [2018-10-01 00:13:06,399 INFO L87 Difference]: Start difference. First operand 467 states and 467 transitions. Second operand 190 states. [2018-10-01 00:13:14,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:13:14,244 INFO L93 Difference]: Finished difference Result 476 states and 476 transitions. [2018-10-01 00:13:14,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-01 00:13:14,245 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 466 [2018-10-01 00:13:14,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:13:14,246 INFO L225 Difference]: With dead ends: 476 [2018-10-01 00:13:14,246 INFO L226 Difference]: Without dead ends: 475 [2018-10-01 00:13:14,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25942 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=26789, Invalid=53017, Unknown=0, NotChecked=0, Total=79806 [2018-10-01 00:13:14,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-10-01 00:13:14,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 472. [2018-10-01 00:13:14,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-10-01 00:13:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 472 transitions. [2018-10-01 00:13:14,443 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 472 transitions. Word has length 466 [2018-10-01 00:13:14,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:13:14,443 INFO L480 AbstractCegarLoop]: Abstraction has 472 states and 472 transitions. [2018-10-01 00:13:14,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-10-01 00:13:14,443 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 472 transitions. [2018-10-01 00:13:14,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-10-01 00:13:14,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:13:14,445 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 94, 93, 93, 1, 1, 1] [2018-10-01 00:13:14,446 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:13:14,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:13:14,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1277064401, now seen corresponding path program 93 times [2018-10-01 00:13:14,447 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:13:14,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:13:14,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:13:14,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:13:14,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:13:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:13:18,989 INFO L134 CoverageAnalysis]: Checked inductivity of 21762 backedges. 0 proven. 21762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:13:18,989 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:13:18,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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:13:18,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:13:20,083 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2018-10-01 00:13:20,084 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:13:20,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:13:20,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:13:20,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:13:20,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:13:20,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:13:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 21762 backedges. 0 proven. 21762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:13:25,538 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:13:25,539 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 191 [2018-10-01 00:13:25,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-10-01 00:13:25,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-10-01 00:13:25,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13682, Invalid=22990, Unknown=0, NotChecked=0, Total=36672 [2018-10-01 00:13:25,544 INFO L87 Difference]: Start difference. First operand 472 states and 472 transitions. Second operand 192 states. [2018-10-01 00:13:33,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:13:33,511 INFO L93 Difference]: Finished difference Result 481 states and 481 transitions. [2018-10-01 00:13:33,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-01 00:13:33,511 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 471 [2018-10-01 00:13:33,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:13:33,513 INFO L225 Difference]: With dead ends: 481 [2018-10-01 00:13:33,513 INFO L226 Difference]: Without dead ends: 480 [2018-10-01 00:13:33,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26503 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=27359, Invalid=54151, Unknown=0, NotChecked=0, Total=81510 [2018-10-01 00:13:33,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-10-01 00:13:33,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 477. [2018-10-01 00:13:33,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-10-01 00:13:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 477 transitions. [2018-10-01 00:13:33,713 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 477 transitions. Word has length 471 [2018-10-01 00:13:33,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:13:33,713 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 477 transitions. [2018-10-01 00:13:33,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-10-01 00:13:33,713 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 477 transitions. [2018-10-01 00:13:33,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2018-10-01 00:13:33,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:13:33,715 INFO L375 BasicCegarLoop]: trace histogram [95, 95, 95, 94, 94, 1, 1, 1] [2018-10-01 00:13:33,715 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:13:33,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:13:33,716 INFO L82 PathProgramCache]: Analyzing trace with hash -263288473, now seen corresponding path program 94 times [2018-10-01 00:13:33,716 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:13:33,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:13:33,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:13:33,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:13:33,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:13:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:13:38,367 INFO L134 CoverageAnalysis]: Checked inductivity of 22231 backedges. 0 proven. 22231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:13:38,367 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:13:38,367 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:13:38,374 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:13:38,719 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:13:38,719 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:13:38,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:13:38,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:13:38,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:13:38,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:13:38,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:13:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 22231 backedges. 0 proven. 22231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:13:44,170 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:13:44,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 193 [2018-10-01 00:13:44,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-10-01 00:13:44,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-10-01 00:13:44,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13970, Invalid=23472, Unknown=0, NotChecked=0, Total=37442 [2018-10-01 00:13:44,175 INFO L87 Difference]: Start difference. First operand 477 states and 477 transitions. Second operand 194 states. [2018-10-01 00:13:52,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:13:52,059 INFO L93 Difference]: Finished difference Result 486 states and 486 transitions. [2018-10-01 00:13:52,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-01 00:13:52,059 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 476 [2018-10-01 00:13:52,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:13:52,061 INFO L225 Difference]: With dead ends: 486 [2018-10-01 00:13:52,061 INFO L226 Difference]: Without dead ends: 485 [2018-10-01 00:13:52,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27070 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=27935, Invalid=55297, Unknown=0, NotChecked=0, Total=83232 [2018-10-01 00:13:52,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-10-01 00:13:52,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 482. [2018-10-01 00:13:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-10-01 00:13:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 482 transitions. [2018-10-01 00:13:52,266 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 482 transitions. Word has length 476 [2018-10-01 00:13:52,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:13:52,267 INFO L480 AbstractCegarLoop]: Abstraction has 482 states and 482 transitions. [2018-10-01 00:13:52,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-10-01 00:13:52,267 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 482 transitions. [2018-10-01 00:13:52,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2018-10-01 00:13:52,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:13:52,269 INFO L375 BasicCegarLoop]: trace histogram [96, 96, 96, 95, 95, 1, 1, 1] [2018-10-01 00:13:52,269 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:13:52,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:13:52,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1962810735, now seen corresponding path program 95 times [2018-10-01 00:13:52,270 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:13:52,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:13:52,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:13:52,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:13:52,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:13:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:13:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 22705 backedges. 0 proven. 22705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:13:57,101 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:13:57,101 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:13:57,110 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:13:57,934 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2018-10-01 00:13:57,934 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:13:57,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:13:57,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:13:57,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:13:57,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:13:57,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:14:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 22705 backedges. 0 proven. 22705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:14:03,514 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:14:03,514 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 195 [2018-10-01 00:14:03,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-10-01 00:14:03,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-10-01 00:14:03,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14261, Invalid=23959, Unknown=0, NotChecked=0, Total=38220 [2018-10-01 00:14:03,519 INFO L87 Difference]: Start difference. First operand 482 states and 482 transitions. Second operand 196 states. [2018-10-01 00:14:11,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:14:11,639 INFO L93 Difference]: Finished difference Result 491 states and 491 transitions. [2018-10-01 00:14:11,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-01 00:14:11,640 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 481 [2018-10-01 00:14:11,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:14:11,641 INFO L225 Difference]: With dead ends: 491 [2018-10-01 00:14:11,641 INFO L226 Difference]: Without dead ends: 490 [2018-10-01 00:14:11,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27643 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=28517, Invalid=56455, Unknown=0, NotChecked=0, Total=84972 [2018-10-01 00:14:11,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-10-01 00:14:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 487. [2018-10-01 00:14:11,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-10-01 00:14:11,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 487 transitions. [2018-10-01 00:14:11,841 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 487 transitions. Word has length 481 [2018-10-01 00:14:11,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:14:11,842 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 487 transitions. [2018-10-01 00:14:11,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-10-01 00:14:11,842 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 487 transitions. [2018-10-01 00:14:11,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2018-10-01 00:14:11,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:14:11,844 INFO L375 BasicCegarLoop]: trace histogram [97, 97, 97, 96, 96, 1, 1, 1] [2018-10-01 00:14:11,844 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:14:11,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:14:11,844 INFO L82 PathProgramCache]: Analyzing trace with hash -819350617, now seen corresponding path program 96 times [2018-10-01 00:14:11,844 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:14:11,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:14:11,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:14:11,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:14:11,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:14:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:14:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 23184 backedges. 0 proven. 23184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:14:16,579 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:14:16,579 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:14:16,617 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:14:17,779 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2018-10-01 00:14:17,779 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:14:17,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:14:17,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-01 00:14:17,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:14:17,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-01 00:14:17,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:14:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 23184 backedges. 0 proven. 23184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:14:23,642 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:14:23,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 197 [2018-10-01 00:14:23,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-10-01 00:14:23,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-10-01 00:14:23,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14555, Invalid=24451, Unknown=0, NotChecked=0, Total=39006 [2018-10-01 00:14:23,647 INFO L87 Difference]: Start difference. First operand 487 states and 487 transitions. Second operand 198 states. [2018-10-01 00:14:32,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:14:32,240 INFO L93 Difference]: Finished difference Result 496 states and 496 transitions. [2018-10-01 00:14:32,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-01 00:14:32,241 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 486 [2018-10-01 00:14:32,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:14:32,242 INFO L225 Difference]: With dead ends: 496 [2018-10-01 00:14:32,242 INFO L226 Difference]: Without dead ends: 495 [2018-10-01 00:14:32,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28222 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=29105, Invalid=57625, Unknown=0, NotChecked=0, Total=86730 [2018-10-01 00:14:32,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-10-01 00:14:32,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 492. [2018-10-01 00:14:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-10-01 00:14:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 492 transitions. [2018-10-01 00:14:32,457 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 492 transitions. Word has length 486 [2018-10-01 00:14:32,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:14:32,458 INFO L480 AbstractCegarLoop]: Abstraction has 492 states and 492 transitions. [2018-10-01 00:14:32,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-10-01 00:14:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 492 transitions. [2018-10-01 00:14:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2018-10-01 00:14:32,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:14:32,460 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 98, 97, 97, 1, 1, 1] [2018-10-01 00:14:32,460 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:14:32,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:14:32,460 INFO L82 PathProgramCache]: Analyzing trace with hash -708370351, now seen corresponding path program 97 times [2018-10-01 00:14:32,460 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:14:32,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:14:32,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:14:32,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:14:32,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:14:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-01 00:14:34,379 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-01 00:14:34,385 WARN L206 ceAbstractionStarter]: Timeout [2018-10-01 00:14:34,385 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:14:34 BoogieIcfgContainer [2018-10-01 00:14:34,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:14:34,386 INFO L168 Benchmark]: Toolchain (without parser) took 777424.61 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.7 GB). Free memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-01 00:14:34,386 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:14:34,387 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:14:34,387 INFO L168 Benchmark]: Boogie Preprocessor took 33.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:14:34,387 INFO L168 Benchmark]: RCFGBuilder took 448.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-01 00:14:34,387 INFO L168 Benchmark]: TraceAbstraction took 776862.12 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.7 GB). Free memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-01 00:14:34,389 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.23 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 74.57 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 33.28 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 448.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 776862.12 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.7 GB). Free memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 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 492 with TraceHistMax 98, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - 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 492 with TraceHistMax 98, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 2 error locations. TIMEOUT Result, 776.7s OverallTime, 100 OverallIterations, 98 TraceHistogramMax, 325.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 318 SDtfs, 28435 SDslu, 3994 SDs, 0 SdLazy, 41169 SolverSat, 14300 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33467 GetRequests, 19012 SyntacticMatches, 0 SemanticMatches, 14455 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926352 ImplicationChecksByTransitivity, 609.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=492occurred in iteration=99, 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: 7.1s AutomataMinimizationTime, 99 MinimizatonAttempts, 296 StatesRemovedByMinimization, 98 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 4.0s SsaConstructionTime, 29.5s SatisfiabilityAnalysisTime, 394.3s InterpolantComputationTime, 47732 NumberOfCodeBlocks, 47732 NumberOfCodeBlocksAsserted, 2611 NumberOfCheckSat, 47537 ConstructedInterpolants, 0 QuantifiedInterpolants, 123672957 SizeOfPredicates, 1042 NumberOfNonLiveVariables, 101520 ConjunctsInSsa, 15764 ConjunctsInUnsatCore, 195 InterpolantComputations, 3 PerfectInterpolantSequences, 2/1511650 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-10-01_00-14-34-398.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-10-01_00-14-34-398.csv Completed graceful shutdown