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-d19836b [2018-09-26 21:32:19,747 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:32:19,749 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:32:19,768 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:32:19,768 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:32:19,769 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:32:19,770 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:32:19,773 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:32:19,774 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:32:19,775 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:32:19,778 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:32:19,778 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:32:19,779 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:32:19,780 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:32:19,781 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:32:19,782 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:32:19,783 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:32:19,785 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:32:19,787 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:32:19,788 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:32:19,789 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:32:19,790 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:32:19,793 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:32:19,793 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:32:19,793 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:32:19,794 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:32:19,795 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:32:19,796 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:32:19,797 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:32:19,798 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:32:19,798 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:32:19,799 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:32:19,799 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:32:19,799 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:32:19,800 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:32:19,801 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:32:19,801 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-26 21:32:19,816 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:32:19,817 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:32:19,817 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:32:19,818 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:32:19,818 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:32:19,818 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:32:19,819 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:32:19,819 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:32:19,819 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:32:19,819 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:32:19,819 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:32:19,820 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:32:19,820 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:32:19,820 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:32:19,820 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:32:19,820 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:32:19,821 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:32:19,821 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:32:19,821 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:32:19,821 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:32:19,821 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:32:19,822 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:32:19,822 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:32:19,822 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:32:19,822 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:32:19,822 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:32:19,823 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:32:19,823 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:32:19,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:32:19,823 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:32:19,873 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:32:19,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:32:19,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:32:19,891 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:32:19,892 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:32:19,893 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl [2018-09-26 21:32:19,893 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl' [2018-09-26 21:32:19,947 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:32:19,950 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:32:19,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:32:19,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:32:19,952 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:32:19,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:19" (1/1) ... [2018-09-26 21:32:19,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:19" (1/1) ... [2018-09-26 21:32:20,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:32:20,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:32:20,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:32:20,009 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:32:20,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:19" (1/1) ... [2018-09-26 21:32:20,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:19" (1/1) ... [2018-09-26 21:32:20,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:19" (1/1) ... [2018-09-26 21:32:20,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:19" (1/1) ... [2018-09-26 21:32:20,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:19" (1/1) ... [2018-09-26 21:32:20,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:19" (1/1) ... [2018-09-26 21:32:20,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:19" (1/1) ... [2018-09-26 21:32:20,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:32:20,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:32:20,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:32:20,034 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:32:20,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:32:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:32:20,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:32:20,444 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:32:20,445 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:32:20 BoogieIcfgContainer [2018-09-26 21:32:20,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:32:20,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:32:20,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:32:20,450 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:32:20,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:19" (1/2) ... [2018-09-26 21:32:20,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a0549a and model type PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:32:20, skipping insertion in model container [2018-09-26 21:32:20,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:32:20" (2/2) ... [2018-09-26 21:32:20,454 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement.bpl [2018-09-26 21:32:20,464 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:32:20,473 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-09-26 21:32:20,543 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:32:20,544 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:32:20,544 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:32:20,544 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:32:20,544 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:32:20,545 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:32:20,545 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:32:20,545 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:32:20,545 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:32:20,580 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-09-26 21:32:20,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 21:32:20,589 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:20,590 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 21:32:20,592 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:20,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:20,607 INFO L82 PathProgramCache]: Analyzing trace with hash 28694788, now seen corresponding path program 1 times [2018-09-26 21:32:20,610 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:20,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:20,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:20,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:20,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:20,841 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:32:20,842 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:32:20,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:32:20,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:32:20,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 21:32:20,862 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2018-09-26 21:32:20,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:20,964 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-09-26 21:32:20,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:32:20,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-09-26 21:32:20,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:20,978 INFO L225 Difference]: With dead ends: 24 [2018-09-26 21:32:20,978 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 21:32:20,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:32:20,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 21:32:21,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-09-26 21:32:21,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 21:32:21,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-09-26 21:32:21,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2018-09-26 21:32:21,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:21,014 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-09-26 21:32:21,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:32:21,015 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-09-26 21:32:21,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 21:32:21,015 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:21,015 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 21:32:21,016 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:21,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:21,016 INFO L82 PathProgramCache]: Analyzing trace with hash 889538471, now seen corresponding path program 1 times [2018-09-26 21:32:21,016 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:21,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:21,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:21,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:21,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:21,116 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:32:21,116 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:32:21,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:32:21,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:32:21,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 21:32:21,119 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-09-26 21:32:21,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:21,332 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-09-26 21:32:21,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:32:21,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-26 21:32:21,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:21,334 INFO L225 Difference]: With dead ends: 18 [2018-09-26 21:32:21,334 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 21:32:21,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:32:21,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 21:32:21,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-09-26 21:32:21,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 21:32:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-09-26 21:32:21,340 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2018-09-26 21:32:21,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:21,341 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-09-26 21:32:21,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:32:21,341 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-09-26 21:32:21,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 21:32:21,342 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:21,342 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:32:21,342 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:21,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:21,343 INFO L82 PathProgramCache]: Analyzing trace with hash 473213613, now seen corresponding path program 1 times [2018-09-26 21:32:21,343 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:21,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:21,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:21,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:21,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:21,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:21,422 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:32:21,422 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:32:21,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:32:21,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:32:21,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:32:21,423 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 3 states. [2018-09-26 21:32:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:21,472 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-09-26 21:32:21,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:32:21,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-09-26 21:32:21,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:21,473 INFO L225 Difference]: With dead ends: 19 [2018-09-26 21:32:21,473 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 21:32:21,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:32:21,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 21:32:21,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 21:32:21,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 21:32:21,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-26 21:32:21,479 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-09-26 21:32:21,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:21,480 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-26 21:32:21,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:32:21,480 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-26 21:32:21,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:32:21,480 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:21,481 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 21:32:21,481 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:21,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:21,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1846021201, now seen corresponding path program 1 times [2018-09-26 21:32:21,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:21,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:21,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:21,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:21,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:21,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:21,764 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:21,764 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:21,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:21,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:21,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:21,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:21,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:21,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:22,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:22,101 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:22,102 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-09-26 21:32:22,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:32:22,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:32:22,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:32:22,104 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2018-09-26 21:32:22,226 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-26 21:32:22,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:22,402 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 21:32:22,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 21:32:22,403 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-09-26 21:32:22,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:22,404 INFO L225 Difference]: With dead ends: 21 [2018-09-26 21:32:22,404 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 21:32:22,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-09-26 21:32:22,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 21:32:22,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-09-26 21:32:22,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 21:32:22,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 21:32:22,411 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2018-09-26 21:32:22,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:22,411 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 21:32:22,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:32:22,412 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 21:32:22,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:32:22,413 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:22,413 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1] [2018-09-26 21:32:22,413 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:22,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:22,414 INFO L82 PathProgramCache]: Analyzing trace with hash 506962407, now seen corresponding path program 2 times [2018-09-26 21:32:22,414 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:22,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:22,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:22,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:22,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:22,527 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:22,528 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:22,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:22,586 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:22,586 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:22,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:22,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:22,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:22,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:22,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:22,902 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:22,902 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-09-26 21:32:22,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:32:22,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:32:22,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-09-26 21:32:22,904 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-09-26 21:32:23,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:23,323 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-26 21:32:23,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 21:32:23,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-26 21:32:23,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:23,326 INFO L225 Difference]: With dead ends: 26 [2018-09-26 21:32:23,326 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 21:32:23,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-09-26 21:32:23,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 21:32:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-09-26 21:32:23,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 21:32:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-26 21:32:23,333 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2018-09-26 21:32:23,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:23,334 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-26 21:32:23,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:32:23,335 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-26 21:32:23,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 21:32:23,335 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:23,335 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1] [2018-09-26 21:32:23,336 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:23,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:23,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1970543121, now seen corresponding path program 3 times [2018-09-26 21:32:23,336 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:23,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:23,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:23,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:23,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:23,528 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:23,528 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:23,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:32:23,575 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-26 21:32:23,576 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:23,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:23,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:23,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:23,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:23,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:23,757 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:23,757 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-09-26 21:32:23,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 21:32:23,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 21:32:23,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-09-26 21:32:23,759 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2018-09-26 21:32:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:24,007 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 21:32:24,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 21:32:24,008 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 21:32:24,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:24,009 INFO L225 Difference]: With dead ends: 31 [2018-09-26 21:32:24,009 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 21:32:24,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:32:24,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 21:32:24,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-09-26 21:32:24,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 21:32:24,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 21:32:24,016 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2018-09-26 21:32:24,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:24,017 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 21:32:24,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 21:32:24,017 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 21:32:24,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 21:32:24,018 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:24,018 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1] [2018-09-26 21:32:24,019 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:24,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:24,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1357786151, now seen corresponding path program 4 times [2018-09-26 21:32:24,019 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:24,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:24,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:24,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:24,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:24,201 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:24,201 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:24,201 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:24,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:32:24,258 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:32:24,258 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:24,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:24,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:24,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:24,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:24,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:24,442 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:24,443 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-26 21:32:24,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:32:24,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:32:24,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-26 21:32:24,444 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-09-26 21:32:24,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:24,680 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-26 21:32:24,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:32:24,680 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-09-26 21:32:24,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:24,681 INFO L225 Difference]: With dead ends: 36 [2018-09-26 21:32:24,682 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 21:32:24,682 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-09-26 21:32:24,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 21:32:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-09-26 21:32:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 21:32:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-26 21:32:24,690 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2018-09-26 21:32:24,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:24,690 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-26 21:32:24,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:32:24,691 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-26 21:32:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 21:32:24,692 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:24,692 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1] [2018-09-26 21:32:24,692 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:24,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:24,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1853487057, now seen corresponding path program 5 times [2018-09-26 21:32:24,693 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:24,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:24,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:24,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:24,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:25,020 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:25,020 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:25,029 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:32:25,067 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-26 21:32:25,068 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:25,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:25,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:25,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:25,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:25,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:25,271 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:25,271 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-09-26 21:32:25,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:32:25,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:32:25,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:32:25,273 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 16 states. [2018-09-26 21:32:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:25,826 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 21:32:25,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 21:32:25,827 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-09-26 21:32:25,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:25,829 INFO L225 Difference]: With dead ends: 41 [2018-09-26 21:32:25,829 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 21:32:25,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-09-26 21:32:25,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 21:32:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-09-26 21:32:25,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 21:32:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 21:32:25,837 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2018-09-26 21:32:25,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:25,838 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 21:32:25,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:32:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 21:32:25,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 21:32:25,839 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:25,839 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1] [2018-09-26 21:32:25,840 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:25,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:25,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1716722073, now seen corresponding path program 6 times [2018-09-26 21:32:25,840 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:25,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:25,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:25,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:25,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:26,263 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:26,264 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:26,281 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:32:26,347 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-26 21:32:26,348 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:26,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:26,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:26,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:26,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:26,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:26,607 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:26,607 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-09-26 21:32:26,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:32:26,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:32:26,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-09-26 21:32:26,609 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 18 states. [2018-09-26 21:32:26,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:26,987 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-26 21:32:26,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:32:26,988 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-09-26 21:32:26,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:26,989 INFO L225 Difference]: With dead ends: 46 [2018-09-26 21:32:26,989 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 21:32:26,990 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-09-26 21:32:26,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 21:32:26,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-09-26 21:32:26,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 21:32:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-26 21:32:26,998 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2018-09-26 21:32:26,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:26,998 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-26 21:32:26,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 21:32:26,999 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-26 21:32:27,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 21:32:27,000 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:27,000 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1] [2018-09-26 21:32:27,000 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:27,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:27,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1089100399, now seen corresponding path program 7 times [2018-09-26 21:32:27,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:27,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:27,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:27,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:27,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:27,201 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:27,202 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:27,202 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:27,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:27,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:27,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:27,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:27,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:27,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:27,473 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:27,473 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-09-26 21:32:27,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 21:32:27,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 21:32:27,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-09-26 21:32:27,474 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 20 states. [2018-09-26 21:32:27,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:27,798 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 21:32:27,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:32:27,805 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2018-09-26 21:32:27,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:27,806 INFO L225 Difference]: With dead ends: 51 [2018-09-26 21:32:27,806 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 21:32:27,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=487, Unknown=0, NotChecked=0, Total=756 [2018-09-26 21:32:27,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 21:32:27,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-09-26 21:32:27,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 21:32:27,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 21:32:27,815 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 41 [2018-09-26 21:32:27,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:27,815 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 21:32:27,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 21:32:27,815 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 21:32:27,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 21:32:27,817 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:27,817 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1] [2018-09-26 21:32:27,817 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:27,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:27,818 INFO L82 PathProgramCache]: Analyzing trace with hash -268971865, now seen corresponding path program 8 times [2018-09-26 21:32:27,818 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:27,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:27,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:27,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:27,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:28,115 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:28,116 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:28,116 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:28,124 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:28,176 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:28,177 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:28,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:28,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:28,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:28,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:28,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:28,584 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:28,605 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:28,606 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-09-26 21:32:28,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 21:32:28,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 21:32:28,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-09-26 21:32:28,607 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 22 states. [2018-09-26 21:32:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:29,188 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-26 21:32:29,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:32:29,190 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-09-26 21:32:29,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:29,191 INFO L225 Difference]: With dead ends: 56 [2018-09-26 21:32:29,191 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 21:32:29,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=329, Invalid=601, Unknown=0, NotChecked=0, Total=930 [2018-09-26 21:32:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 21:32:29,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-09-26 21:32:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 21:32:29,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-26 21:32:29,201 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 46 [2018-09-26 21:32:29,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:29,202 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-26 21:32:29,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 21:32:29,202 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-26 21:32:29,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-26 21:32:29,203 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:29,203 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1] [2018-09-26 21:32:29,203 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:29,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:29,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2109529263, now seen corresponding path program 9 times [2018-09-26 21:32:29,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:29,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:29,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:29,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:29,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:29,441 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:29,441 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:29,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:32:29,503 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-26 21:32:29,504 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:29,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:29,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:29,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:29,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:29,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:29,759 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:29,779 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:29,780 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-09-26 21:32:29,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 21:32:29,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 21:32:29,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-09-26 21:32:29,781 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 24 states. [2018-09-26 21:32:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:30,389 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-09-26 21:32:30,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:32:30,389 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2018-09-26 21:32:30,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:30,390 INFO L225 Difference]: With dead ends: 61 [2018-09-26 21:32:30,390 INFO L226 Difference]: Without dead ends: 60 [2018-09-26 21:32:30,391 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-09-26 21:32:30,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-26 21:32:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-09-26 21:32:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 21:32:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 21:32:30,401 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 51 [2018-09-26 21:32:30,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:30,401 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 21:32:30,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 21:32:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 21:32:30,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 21:32:30,402 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:30,402 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1] [2018-09-26 21:32:30,403 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:30,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:30,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1236079897, now seen corresponding path program 10 times [2018-09-26 21:32:30,403 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:30,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:30,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:30,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:30,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:30,847 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:30,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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:30,856 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:32:30,899 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:32:30,899 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:30,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:30,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:30,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:30,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:30,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:31,217 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:31,218 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-09-26 21:32:31,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 21:32:31,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 21:32:31,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2018-09-26 21:32:31,219 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2018-09-26 21:32:31,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:31,673 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-26 21:32:31,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 21:32:31,673 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-09-26 21:32:31,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:31,674 INFO L225 Difference]: With dead ends: 66 [2018-09-26 21:32:31,674 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 21:32:31,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=467, Invalid=865, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 21:32:31,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 21:32:31,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-09-26 21:32:31,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-26 21:32:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-26 21:32:31,685 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 56 [2018-09-26 21:32:31,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:31,686 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-26 21:32:31,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 21:32:31,686 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-26 21:32:31,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-26 21:32:31,687 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:31,687 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1] [2018-09-26 21:32:31,687 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:31,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:31,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1207857425, now seen corresponding path program 11 times [2018-09-26 21:32:31,688 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:31,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:31,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:31,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:31,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:32,020 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:32,021 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:32,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:32,029 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:32:32,112 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-26 21:32:32,112 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:32,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:32,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:32,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:32,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:32,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:32,463 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:32,463 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-09-26 21:32:32,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 21:32:32,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 21:32:32,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2018-09-26 21:32:32,465 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 28 states. [2018-09-26 21:32:33,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:33,020 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-26 21:32:33,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 21:32:33,020 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-09-26 21:32:33,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:33,021 INFO L225 Difference]: With dead ends: 71 [2018-09-26 21:32:33,021 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 21:32:33,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=545, Invalid=1015, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 21:32:33,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 21:32:33,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-09-26 21:32:33,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 21:32:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-26 21:32:33,033 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 61 [2018-09-26 21:32:33,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:33,033 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-26 21:32:33,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 21:32:33,034 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-26 21:32:33,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 21:32:33,034 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:33,035 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1] [2018-09-26 21:32:33,035 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:33,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:33,035 INFO L82 PathProgramCache]: Analyzing trace with hash -96324313, now seen corresponding path program 12 times [2018-09-26 21:32:33,035 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:33,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:33,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:33,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:33,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:34,278 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:34,278 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:34,289 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:32:34,351 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-26 21:32:34,351 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:34,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:34,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:34,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:34,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:34,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:34,623 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:34,624 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-09-26 21:32:34,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 21:32:34,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 21:32:34,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2018-09-26 21:32:34,625 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 30 states. [2018-09-26 21:32:35,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:35,110 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-26 21:32:35,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:32:35,110 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2018-09-26 21:32:35,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:35,111 INFO L225 Difference]: With dead ends: 76 [2018-09-26 21:32:35,111 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 21:32:35,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=629, Invalid=1177, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 21:32:35,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 21:32:35,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-09-26 21:32:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-26 21:32:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-26 21:32:35,125 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 66 [2018-09-26 21:32:35,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:35,125 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-26 21:32:35,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 21:32:35,125 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-26 21:32:35,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-26 21:32:35,126 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:35,126 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1] [2018-09-26 21:32:35,126 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:35,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:35,127 INFO L82 PathProgramCache]: Analyzing trace with hash -716992815, now seen corresponding path program 13 times [2018-09-26 21:32:35,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:35,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:35,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:35,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:35,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:36,135 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:36,136 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:36,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:36,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:36,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:36,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:36,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:36,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:36,577 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:36,597 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:36,598 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-09-26 21:32:36,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 21:32:36,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 21:32:36,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-09-26 21:32:36,599 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 32 states. [2018-09-26 21:32:37,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:37,102 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-26 21:32:37,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 21:32:37,102 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-09-26 21:32:37,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:37,103 INFO L225 Difference]: With dead ends: 81 [2018-09-26 21:32:37,103 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 21:32:37,104 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-09-26 21:32:37,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 21:32:37,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-09-26 21:32:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 21:32:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 21:32:37,116 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 71 [2018-09-26 21:32:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:37,116 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 21:32:37,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 21:32:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 21:32:37,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 21:32:37,117 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:37,117 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1] [2018-09-26 21:32:37,118 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:37,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:37,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1270239385, now seen corresponding path program 14 times [2018-09-26 21:32:37,118 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:37,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:37,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:37,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:37,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:37,425 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:37,425 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:37,425 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:37,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:37,494 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:37,495 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:37,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:37,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:37,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:37,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:37,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:37,868 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:37,868 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-09-26 21:32:37,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 21:32:37,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 21:32:37,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 21:32:37,869 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 34 states. [2018-09-26 21:32:38,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:38,592 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-26 21:32:38,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 21:32:38,592 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 76 [2018-09-26 21:32:38,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:38,593 INFO L225 Difference]: With dead ends: 86 [2018-09-26 21:32:38,594 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 21:32:38,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=815, Invalid=1537, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 21:32:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 21:32:38,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-09-26 21:32:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-26 21:32:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-26 21:32:38,605 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 76 [2018-09-26 21:32:38,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:38,606 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-26 21:32:38,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 21:32:38,606 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-26 21:32:38,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-26 21:32:38,607 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:38,607 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1] [2018-09-26 21:32:38,607 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:38,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:38,607 INFO L82 PathProgramCache]: Analyzing trace with hash -468812655, now seen corresponding path program 15 times [2018-09-26 21:32:38,607 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:38,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:38,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:38,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:38,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:38,926 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:38,926 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:38,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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:38,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:32:39,031 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-26 21:32:39,031 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:39,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:39,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:39,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:39,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:39,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:39,655 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:39,656 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-09-26 21:32:39,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 21:32:39,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 21:32:39,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 21:32:39,657 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 36 states. [2018-09-26 21:32:40,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:40,208 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-26 21:32:40,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 21:32:40,208 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 81 [2018-09-26 21:32:40,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:40,209 INFO L225 Difference]: With dead ends: 91 [2018-09-26 21:32:40,210 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 21:32:40,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=917, Invalid=1735, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 21:32:40,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 21:32:40,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-09-26 21:32:40,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 21:32:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-26 21:32:40,224 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 81 [2018-09-26 21:32:40,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:40,225 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-26 21:32:40,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 21:32:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-26 21:32:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 21:32:40,226 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:40,226 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1] [2018-09-26 21:32:40,226 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:40,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:40,226 INFO L82 PathProgramCache]: Analyzing trace with hash 132995495, now seen corresponding path program 16 times [2018-09-26 21:32:40,226 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:40,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:40,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:40,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:40,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:40,645 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:40,645 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:40,653 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:32:40,732 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:32:40,733 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:40,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:40,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:40,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:40,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:40,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:41,188 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:41,188 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-09-26 21:32:41,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 21:32:41,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 21:32:41,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 21:32:41,189 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 38 states. [2018-09-26 21:32:41,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:41,779 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-26 21:32:41,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 21:32:41,780 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2018-09-26 21:32:41,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:41,781 INFO L225 Difference]: With dead ends: 96 [2018-09-26 21:32:41,781 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 21:32:41,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1025, Invalid=1945, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 21:32:41,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 21:32:41,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-09-26 21:32:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-26 21:32:41,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-26 21:32:41,792 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 86 [2018-09-26 21:32:41,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:41,792 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-26 21:32:41,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 21:32:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-26 21:32:41,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-26 21:32:41,793 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:41,793 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1] [2018-09-26 21:32:41,793 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:41,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:41,793 INFO L82 PathProgramCache]: Analyzing trace with hash -480560559, now seen corresponding path program 17 times [2018-09-26 21:32:41,794 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:41,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:41,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:41,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:41,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:42,352 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:42,352 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:42,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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:42,360 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:32:42,442 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-26 21:32:42,443 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:42,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:42,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:42,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:42,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:42,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:42,823 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:42,823 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-09-26 21:32:42,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 21:32:42,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 21:32:42,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 21:32:42,825 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 40 states. [2018-09-26 21:32:43,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:43,430 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-26 21:32:43,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 21:32:43,431 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 91 [2018-09-26 21:32:43,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:43,432 INFO L225 Difference]: With dead ends: 101 [2018-09-26 21:32:43,432 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 21:32:43,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1139, Invalid=2167, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 21:32:43,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 21:32:43,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-09-26 21:32:43,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 21:32:43,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-26 21:32:43,445 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 91 [2018-09-26 21:32:43,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:43,446 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-26 21:32:43,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 21:32:43,446 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-26 21:32:43,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 21:32:43,447 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:43,447 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1] [2018-09-26 21:32:43,448 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:43,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:43,448 INFO L82 PathProgramCache]: Analyzing trace with hash -2085538841, now seen corresponding path program 18 times [2018-09-26 21:32:43,448 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:43,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:43,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:43,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:43,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:43,868 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:43,868 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:43,876 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:32:44,055 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-26 21:32:44,056 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:44,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:44,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:44,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:44,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:44,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:44,687 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:44,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-09-26 21:32:44,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 21:32:44,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 21:32:44,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 21:32:44,689 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 42 states. [2018-09-26 21:32:45,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:45,410 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-26 21:32:45,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 21:32:45,410 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2018-09-26 21:32:45,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:45,412 INFO L225 Difference]: With dead ends: 106 [2018-09-26 21:32:45,412 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 21:32:45,414 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-09-26 21:32:45,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 21:32:45,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2018-09-26 21:32:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-26 21:32:45,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-09-26 21:32:45,428 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 96 [2018-09-26 21:32:45,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:45,429 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-09-26 21:32:45,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 21:32:45,429 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-09-26 21:32:45,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-26 21:32:45,429 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:45,430 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1] [2018-09-26 21:32:45,430 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:45,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:45,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1222260719, now seen corresponding path program 19 times [2018-09-26 21:32:45,430 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:45,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:45,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:45,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:45,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:46,591 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:46,591 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:46,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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:46,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:46,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:46,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:46,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:46,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:46,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:47,061 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:47,082 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:47,082 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-09-26 21:32:47,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 21:32:47,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 21:32:47,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 21:32:47,083 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 44 states. [2018-09-26 21:32:47,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:47,766 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-26 21:32:47,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:32:47,768 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 101 [2018-09-26 21:32:47,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:47,769 INFO L225 Difference]: With dead ends: 111 [2018-09-26 21:32:47,769 INFO L226 Difference]: Without dead ends: 110 [2018-09-26 21:32:47,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1385, Invalid=2647, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 21:32:47,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-26 21:32:47,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2018-09-26 21:32:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 21:32:47,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-09-26 21:32:47,782 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 101 [2018-09-26 21:32:47,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:47,782 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-09-26 21:32:47,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 21:32:47,783 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-09-26 21:32:47,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 21:32:47,783 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:47,783 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1, 1] [2018-09-26 21:32:47,784 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:47,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:47,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1629044263, now seen corresponding path program 20 times [2018-09-26 21:32:47,784 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:47,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:47,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:47,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:47,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:48,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:48,210 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:48,210 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:48,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:48,303 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:48,304 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:48,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:48,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:48,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:48,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:48,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:50,467 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:50,467 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-09-26 21:32:50,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 21:32:50,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 21:32:50,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 21:32:50,469 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 46 states. [2018-09-26 21:32:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:51,230 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-09-26 21:32:51,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 21:32:51,230 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 106 [2018-09-26 21:32:51,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:51,231 INFO L225 Difference]: With dead ends: 116 [2018-09-26 21:32:51,231 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 21:32:51,232 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-09-26 21:32:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 21:32:51,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2018-09-26 21:32:51,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-26 21:32:51,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-09-26 21:32:51,244 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 106 [2018-09-26 21:32:51,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:51,245 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-09-26 21:32:51,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 21:32:51,245 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-09-26 21:32:51,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-26 21:32:51,245 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:51,246 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1, 1] [2018-09-26 21:32:51,246 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:51,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:51,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2020222417, now seen corresponding path program 21 times [2018-09-26 21:32:51,246 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:51,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:51,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:51,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:51,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:51,671 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:51,671 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:51,679 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:32:51,804 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-26 21:32:51,804 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:51,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:51,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-09-26 21:32:51,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:51,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:51,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:52,452 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:52,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-09-26 21:32:52,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 21:32:52,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 21:32:52,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 21:32:52,454 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 48 states. [2018-09-26 21:32:53,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:53,377 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-09-26 21:32:53,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 21:32:53,378 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 111 [2018-09-26 21:32:53,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:53,379 INFO L225 Difference]: With dead ends: 121 [2018-09-26 21:32:53,379 INFO L226 Difference]: Without dead ends: 120 [2018-09-26 21:32:53,380 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-09-26 21:32:53,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-09-26 21:32:53,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-09-26 21:32:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 21:32:53,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-26 21:32:53,396 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 111 [2018-09-26 21:32:53,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:53,396 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-26 21:32:53,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 21:32:53,397 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-26 21:32:53,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 21:32:53,397 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:53,397 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1] [2018-09-26 21:32:53,398 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:53,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:53,398 INFO L82 PathProgramCache]: Analyzing trace with hash -995526553, now seen corresponding path program 22 times [2018-09-26 21:32:53,398 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:53,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:53,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:53,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:53,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:53,910 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:53,911 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:53,918 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:32:53,999 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:32:53,999 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:54,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:54,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:54,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:54,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:54,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:54,746 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:54,746 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-09-26 21:32:54,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 21:32:54,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 21:32:54,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=902, Invalid=1548, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 21:32:54,748 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 50 states. [2018-09-26 21:32:55,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:55,700 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-09-26 21:32:55,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 21:32:55,701 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 116 [2018-09-26 21:32:55,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:55,702 INFO L225 Difference]: With dead ends: 126 [2018-09-26 21:32:55,702 INFO L226 Difference]: Without dead ends: 125 [2018-09-26 21:32:55,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1799, Invalid=3457, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 21:32:55,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-26 21:32:55,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-09-26 21:32:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-09-26 21:32:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-09-26 21:32:55,718 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 116 [2018-09-26 21:32:55,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:55,718 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-09-26 21:32:55,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 21:32:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-09-26 21:32:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-26 21:32:55,719 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:55,719 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1, 1] [2018-09-26 21:32:55,719 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:55,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:55,719 INFO L82 PathProgramCache]: Analyzing trace with hash 891573137, now seen corresponding path program 23 times [2018-09-26 21:32:55,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:55,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:55,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:55,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:55,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:56,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:56,307 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:56,307 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:56,315 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:32:56,448 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-26 21:32:56,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:56,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:56,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:56,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:56,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:56,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:56,977 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:56,977 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-09-26 21:32:56,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 21:32:56,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 21:32:56,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 21:32:56,979 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 52 states. [2018-09-26 21:32:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:57,972 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-26 21:32:57,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 21:32:57,973 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 121 [2018-09-26 21:32:57,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:57,974 INFO L225 Difference]: With dead ends: 131 [2018-09-26 21:32:57,974 INFO L226 Difference]: Without dead ends: 130 [2018-09-26 21:32:57,975 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-09-26 21:32:57,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-26 21:32:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2018-09-26 21:32:57,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 21:32:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-09-26 21:32:57,990 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 121 [2018-09-26 21:32:57,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:57,990 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-09-26 21:32:57,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 21:32:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-09-26 21:32:57,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 21:32:57,991 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:57,991 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1, 1] [2018-09-26 21:32:57,991 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:57,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:57,991 INFO L82 PathProgramCache]: Analyzing trace with hash -35265881, now seen corresponding path program 24 times [2018-09-26 21:32:57,991 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:57,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:57,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:57,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:57,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:58,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:58,714 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:58,714 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:58,722 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:32:58,856 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-26 21:32:58,857 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:58,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:58,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:58,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:58,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:58,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:59,443 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:59,444 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-09-26 21:32:59,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 21:32:59,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 21:32:59,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 21:32:59,445 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 54 states. [2018-09-26 21:33:00,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:00,521 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-09-26 21:33:00,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 21:33:00,521 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 126 [2018-09-26 21:33:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:00,522 INFO L225 Difference]: With dead ends: 136 [2018-09-26 21:33:00,522 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 21:33:00,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2105, Invalid=4057, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 21:33:00,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 21:33:00,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2018-09-26 21:33:00,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-09-26 21:33:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-09-26 21:33:00,544 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 126 [2018-09-26 21:33:00,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:00,544 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-09-26 21:33:00,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 21:33:00,544 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-09-26 21:33:00,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-09-26 21:33:00,545 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:00,545 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1, 1] [2018-09-26 21:33:00,545 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:00,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:00,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1336913583, now seen corresponding path program 25 times [2018-09-26 21:33:00,546 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:00,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:00,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:00,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:00,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:01,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:01,191 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:01,191 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:01,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:01,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:01,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-09-26 21:33:01,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:01,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:01,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:01,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:01,919 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:01,919 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-09-26 21:33:01,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 21:33:01,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 21:33:01,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1136, Invalid=1944, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 21:33:01,920 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 56 states. [2018-09-26 21:33:02,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:02,960 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-09-26 21:33:02,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 21:33:02,961 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 131 [2018-09-26 21:33:02,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:02,962 INFO L225 Difference]: With dead ends: 141 [2018-09-26 21:33:02,962 INFO L226 Difference]: Without dead ends: 140 [2018-09-26 21:33:02,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2267, Invalid=4375, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 21:33:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-09-26 21:33:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2018-09-26 21:33:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 21:33:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-26 21:33:02,986 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 131 [2018-09-26 21:33:02,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:02,986 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-26 21:33:02,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 21:33:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-26 21:33:02,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 21:33:02,987 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:02,987 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1, 1] [2018-09-26 21:33:02,988 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:02,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:02,988 INFO L82 PathProgramCache]: Analyzing trace with hash -950895385, now seen corresponding path program 26 times [2018-09-26 21:33:02,988 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:02,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:02,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:02,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:02,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:05,152 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:05,152 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:05,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:33:05,241 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:33:05,242 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:05,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:05,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-09-26 21:33:05,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:05,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:05,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:07,024 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:07,024 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-09-26 21:33:07,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 21:33:07,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 21:33:07,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1220, Invalid=2086, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 21:33:07,025 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 58 states. [2018-09-26 21:33:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:08,168 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-09-26 21:33:08,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 21:33:08,168 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 136 [2018-09-26 21:33:08,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:08,169 INFO L225 Difference]: With dead ends: 146 [2018-09-26 21:33:08,169 INFO L226 Difference]: Without dead ends: 145 [2018-09-26 21:33:08,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2182 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2435, Invalid=4705, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 21:33:08,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-26 21:33:08,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2018-09-26 21:33:08,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-09-26 21:33:08,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-09-26 21:33:08,198 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 136 [2018-09-26 21:33:08,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:08,199 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-09-26 21:33:08,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 21:33:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-09-26 21:33:08,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-09-26 21:33:08,200 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:08,200 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1, 1] [2018-09-26 21:33:08,200 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:08,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:08,200 INFO L82 PathProgramCache]: Analyzing trace with hash 568991505, now seen corresponding path program 27 times [2018-09-26 21:33:08,201 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:08,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:08,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:08,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:08,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:08,791 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:08,791 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:08,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:33:08,959 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-26 21:33:08,960 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:08,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:08,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:08,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:08,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:08,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:09,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:09,718 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:09,718 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-09-26 21:33:09,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 21:33:09,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 21:33:09,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1307, Invalid=2233, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 21:33:09,720 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 60 states. [2018-09-26 21:33:10,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:10,987 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-26 21:33:10,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 21:33:10,988 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 141 [2018-09-26 21:33:10,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:10,989 INFO L225 Difference]: With dead ends: 151 [2018-09-26 21:33:10,989 INFO L226 Difference]: Without dead ends: 150 [2018-09-26 21:33:10,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2609, Invalid=5047, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 21:33:10,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-26 21:33:11,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2018-09-26 21:33:11,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 21:33:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-09-26 21:33:11,018 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 141 [2018-09-26 21:33:11,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:11,018 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-09-26 21:33:11,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 21:33:11,019 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-09-26 21:33:11,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 21:33:11,019 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:11,020 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1, 1] [2018-09-26 21:33:11,020 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:11,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:11,020 INFO L82 PathProgramCache]: Analyzing trace with hash -2039265497, now seen corresponding path program 28 times [2018-09-26 21:33:11,020 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:11,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:11,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:11,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:11,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:12,111 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:12,111 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:12,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:33:12,216 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:33:12,216 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:12,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:12,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:12,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:12,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:12,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:12,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:12,958 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:12,959 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-09-26 21:33:12,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 21:33:12,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 21:33:12,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1397, Invalid=2385, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 21:33:12,960 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 62 states. [2018-09-26 21:33:14,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:14,237 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-09-26 21:33:14,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 21:33:14,237 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 146 [2018-09-26 21:33:14,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:14,238 INFO L225 Difference]: With dead ends: 156 [2018-09-26 21:33:14,238 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 21:33:14,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2789, Invalid=5401, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 21:33:14,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 21:33:14,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2018-09-26 21:33:14,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-09-26 21:33:14,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-09-26 21:33:14,268 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 146 [2018-09-26 21:33:14,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:14,269 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-09-26 21:33:14,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 21:33:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-09-26 21:33:14,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-26 21:33:14,270 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:14,270 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1, 1] [2018-09-26 21:33:14,270 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:14,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:14,270 INFO L82 PathProgramCache]: Analyzing trace with hash -152191791, now seen corresponding path program 29 times [2018-09-26 21:33:14,270 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:14,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:14,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:14,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:14,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:15,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:15,320 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:15,320 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:15,328 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:33:15,488 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-26 21:33:15,489 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:15,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:15,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-09-26 21:33:15,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:15,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:15,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:16,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:16,587 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:16,587 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-09-26 21:33:16,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 21:33:16,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 21:33:16,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=2542, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 21:33:16,588 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 64 states. [2018-09-26 21:33:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:17,881 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-09-26 21:33:17,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 21:33:17,881 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 151 [2018-09-26 21:33:17,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:17,882 INFO L225 Difference]: With dead ends: 161 [2018-09-26 21:33:17,882 INFO L226 Difference]: Without dead ends: 160 [2018-09-26 21:33:17,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2695 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2975, Invalid=5767, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 21:33:17,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-26 21:33:17,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2018-09-26 21:33:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 21:33:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-26 21:33:17,909 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 151 [2018-09-26 21:33:17,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:17,910 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-26 21:33:17,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 21:33:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-26 21:33:17,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 21:33:17,911 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:17,911 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1, 1] [2018-09-26 21:33:17,911 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:17,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:17,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1949548185, now seen corresponding path program 30 times [2018-09-26 21:33:17,912 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:17,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:17,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:17,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:17,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:18,794 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:18,794 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:18,803 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:33:18,971 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-26 21:33:18,971 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:18,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:18,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:18,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:18,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:18,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:19,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:19,894 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:19,894 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-09-26 21:33:19,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 21:33:19,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 21:33:19,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1586, Invalid=2704, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 21:33:19,896 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 66 states. [2018-09-26 21:33:21,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:21,424 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-09-26 21:33:21,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 21:33:21,424 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 156 [2018-09-26 21:33:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:21,428 INFO L225 Difference]: With dead ends: 166 [2018-09-26 21:33:21,429 INFO L226 Difference]: Without dead ends: 165 [2018-09-26 21:33:21,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2878 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3167, Invalid=6145, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 21:33:21,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-26 21:33:21,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2018-09-26 21:33:21,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-26 21:33:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-09-26 21:33:21,469 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 156 [2018-09-26 21:33:21,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:21,469 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-09-26 21:33:21,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 21:33:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-09-26 21:33:21,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-09-26 21:33:21,470 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:21,471 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1, 1] [2018-09-26 21:33:21,471 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:21,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:21,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1856558447, now seen corresponding path program 31 times [2018-09-26 21:33:21,472 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:21,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:21,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:21,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:21,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:22,630 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:22,630 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:22,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:22,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:22,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:22,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:22,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:22,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:23,617 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:23,617 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-09-26 21:33:23,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 21:33:23,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 21:33:23,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1685, Invalid=2871, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 21:33:23,620 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 68 states. [2018-09-26 21:33:24,574 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-26 21:33:26,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:26,044 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-26 21:33:26,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 21:33:26,044 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 161 [2018-09-26 21:33:26,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:26,045 INFO L225 Difference]: With dead ends: 171 [2018-09-26 21:33:26,045 INFO L226 Difference]: Without dead ends: 170 [2018-09-26 21:33:26,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3067 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3365, Invalid=6535, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 21:33:26,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-26 21:33:26,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2018-09-26 21:33:26,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 21:33:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-09-26 21:33:26,080 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 161 [2018-09-26 21:33:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:26,081 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-09-26 21:33:26,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 21:33:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-09-26 21:33:26,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 21:33:26,082 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:26,082 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1, 1] [2018-09-26 21:33:26,082 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:26,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:26,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1390504871, now seen corresponding path program 32 times [2018-09-26 21:33:26,083 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:26,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:26,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:26,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:26,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:27,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:27,243 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:27,243 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:27,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:33:27,360 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:33:27,361 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:27,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:27,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:27,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:27,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:27,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:28,259 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:28,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-09-26 21:33:28,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 21:33:28,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 21:33:28,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1787, Invalid=3043, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 21:33:28,261 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 70 states. [2018-09-26 21:33:29,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:29,721 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-09-26 21:33:29,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 21:33:29,722 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 166 [2018-09-26 21:33:29,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:29,723 INFO L225 Difference]: With dead ends: 176 [2018-09-26 21:33:29,723 INFO L226 Difference]: Without dead ends: 175 [2018-09-26 21:33:29,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3262 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3569, Invalid=6937, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 21:33:29,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-26 21:33:29,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2018-09-26 21:33:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-09-26 21:33:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-09-26 21:33:29,759 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 166 [2018-09-26 21:33:29,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:29,759 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-09-26 21:33:29,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 21:33:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-09-26 21:33:29,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-09-26 21:33:29,760 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:29,760 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1, 1] [2018-09-26 21:33:29,761 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:29,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:29,761 INFO L82 PathProgramCache]: Analyzing trace with hash 136472657, now seen corresponding path program 33 times [2018-09-26 21:33:29,761 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:29,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:29,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:29,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:29,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:30,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:30,911 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:30,911 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:30,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:33:31,112 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-26 21:33:31,112 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:31,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:31,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:31,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:31,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:31,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:31,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:32,005 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:32,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-09-26 21:33:32,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 21:33:32,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 21:33:32,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=3220, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 21:33:32,006 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 72 states. [2018-09-26 21:33:33,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:33,467 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-09-26 21:33:33,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 21:33:33,468 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 171 [2018-09-26 21:33:33,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:33,469 INFO L225 Difference]: With dead ends: 181 [2018-09-26 21:33:33,469 INFO L226 Difference]: Without dead ends: 180 [2018-09-26 21:33:33,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3779, Invalid=7351, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 21:33:33,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-09-26 21:33:33,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2018-09-26 21:33:33,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 21:33:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-26 21:33:33,497 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 171 [2018-09-26 21:33:33,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:33,497 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-26 21:33:33,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 21:33:33,498 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-26 21:33:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 21:33:33,498 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:33,499 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1, 1] [2018-09-26 21:33:33,499 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:33,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:33,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1036597785, now seen corresponding path program 34 times [2018-09-26 21:33:33,499 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:33,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:33,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:33,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:33,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:34,506 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:34,506 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:34,514 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:33:34,635 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:33:34,636 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:34,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:34,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:34,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33: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-09-26 21:33:34,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:36,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:36,084 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:36,084 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-09-26 21:33:36,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 21:33:36,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 21:33:36,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2000, Invalid=3402, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 21:33:36,086 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 74 states. [2018-09-26 21:33:37,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:37,622 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-09-26 21:33:37,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 21:33:37,622 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 176 [2018-09-26 21:33:37,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:37,623 INFO L225 Difference]: With dead ends: 186 [2018-09-26 21:33:37,623 INFO L226 Difference]: Without dead ends: 185 [2018-09-26 21:33:37,624 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-09-26 21:33:37,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-09-26 21:33:37,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-09-26 21:33:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-26 21:33:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-09-26 21:33:37,651 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 176 [2018-09-26 21:33:37,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:37,651 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-09-26 21:33:37,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 21:33:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-09-26 21:33:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-09-26 21:33:37,653 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:37,653 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1, 1] [2018-09-26 21:33:37,653 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:37,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:37,653 INFO L82 PathProgramCache]: Analyzing trace with hash -414484975, now seen corresponding path program 35 times [2018-09-26 21:33:37,654 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:37,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:37,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:37,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:37,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:38,576 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:38,576 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:38,584 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:33:38,770 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-26 21:33:38,771 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:38,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:38,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:38,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:38,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:38,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:39,936 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:39,937 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-09-26 21:33:39,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 21:33:39,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 21:33:39,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2111, Invalid=3589, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 21:33:39,938 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 76 states. [2018-09-26 21:33:41,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:41,688 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-09-26 21:33:41,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 21:33:41,688 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 181 [2018-09-26 21:33:41,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:41,689 INFO L225 Difference]: With dead ends: 191 [2018-09-26 21:33:41,689 INFO L226 Difference]: Without dead ends: 190 [2018-09-26 21:33:41,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3883 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4217, Invalid=8215, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 21:33:41,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-26 21:33:41,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2018-09-26 21:33:41,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-26 21:33:41,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-09-26 21:33:41,722 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 181 [2018-09-26 21:33:41,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:41,723 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-09-26 21:33:41,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 21:33:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-09-26 21:33:41,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-26 21:33:41,723 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:41,723 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1, 1] [2018-09-26 21:33:41,724 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:41,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:41,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1800425511, now seen corresponding path program 36 times [2018-09-26 21:33:41,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:41,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:41,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:41,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:41,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:42,681 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:42,681 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:42,688 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:33:42,916 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-26 21:33:42,916 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:42,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:42,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:42,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:43,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:43,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:44,994 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:44,994 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-09-26 21:33:44,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 21:33:44,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 21:33:44,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2225, Invalid=3781, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 21:33:44,996 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 78 states. [2018-09-26 21:33:46,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:46,888 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-09-26 21:33:46,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 21:33:46,888 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 186 [2018-09-26 21:33:46,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:46,889 INFO L225 Difference]: With dead ends: 196 [2018-09-26 21:33:46,889 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 21:33:46,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4445, Invalid=8665, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 21:33:46,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 21:33:46,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2018-09-26 21:33:46,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-09-26 21:33:46,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-09-26 21:33:46,931 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 186 [2018-09-26 21:33:46,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:46,931 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-09-26 21:33:46,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 21:33:46,931 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-09-26 21:33:46,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-26 21:33:46,932 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:46,932 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1, 1] [2018-09-26 21:33:46,933 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:46,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:46,933 INFO L82 PathProgramCache]: Analyzing trace with hash -271690799, now seen corresponding path program 37 times [2018-09-26 21:33:46,933 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:46,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:46,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:46,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:46,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:48,184 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:48,184 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:48,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:48,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:48,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:48,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:48,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:48,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:49,491 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:49,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-09-26 21:33:49,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 21:33:49,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 21:33:49,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2342, Invalid=3978, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 21:33:49,493 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 80 states. [2018-09-26 21:33:51,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:51,412 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-09-26 21:33:51,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 21:33:51,412 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 191 [2018-09-26 21:33:51,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:51,413 INFO L225 Difference]: With dead ends: 201 [2018-09-26 21:33:51,413 INFO L226 Difference]: Without dead ends: 200 [2018-09-26 21:33:51,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4327 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4679, Invalid=9127, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 21:33:51,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-26 21:33:51,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2018-09-26 21:33:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 21:33:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-26 21:33:51,456 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 191 [2018-09-26 21:33:51,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:51,457 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-26 21:33:51,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 21:33:51,457 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-26 21:33:51,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 21:33:51,457 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:51,458 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1, 1] [2018-09-26 21:33:51,458 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:51,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:51,458 INFO L82 PathProgramCache]: Analyzing trace with hash -894301593, now seen corresponding path program 38 times [2018-09-26 21:33:51,458 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:51,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:51,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:51,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:51,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:52,483 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:52,483 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:52,497 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:33:52,657 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:33:52,657 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:52,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:52,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:52,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:52,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:52,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:53,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:53,861 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:53,861 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-09-26 21:33:53,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 21:33:53,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 21:33:53,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2462, Invalid=4180, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 21:33:53,862 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 82 states. [2018-09-26 21:33:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:55,786 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-09-26 21:33:55,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 21:33:55,786 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 196 [2018-09-26 21:33:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:55,787 INFO L225 Difference]: With dead ends: 206 [2018-09-26 21:33:55,787 INFO L226 Difference]: Without dead ends: 205 [2018-09-26 21:33:55,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4558 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4919, Invalid=9601, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 21:33:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-09-26 21:33:55,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2018-09-26 21:33:55,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-26 21:33:55,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-09-26 21:33:55,820 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 196 [2018-09-26 21:33:55,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:55,821 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-09-26 21:33:55,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 21:33:55,821 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-09-26 21:33:55,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-26 21:33:55,822 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:55,822 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1, 1] [2018-09-26 21:33:55,822 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:55,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:55,823 INFO L82 PathProgramCache]: Analyzing trace with hash -676920943, now seen corresponding path program 39 times [2018-09-26 21:33:55,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:55,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:55,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:55,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:55,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:57,010 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:57,010 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:57,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:33:57,316 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-26 21:33:57,317 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:57,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:57,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:57,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:57,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:57,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:58,551 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:58,551 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-09-26 21:33:58,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 21:33:58,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 21:33:58,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2585, Invalid=4387, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 21:33:58,553 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 84 states. [2018-09-26 21:34:00,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:00,442 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-09-26 21:34:00,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 21:34:00,442 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 201 [2018-09-26 21:34:00,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:00,443 INFO L225 Difference]: With dead ends: 211 [2018-09-26 21:34:00,443 INFO L226 Difference]: Without dead ends: 210 [2018-09-26 21:34:00,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4795 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5165, Invalid=10087, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 21:34:00,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-09-26 21:34:00,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2018-09-26 21:34:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-26 21:34:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-09-26 21:34:00,478 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 201 [2018-09-26 21:34:00,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:00,478 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-09-26 21:34:00,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 21:34:00,478 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-09-26 21:34:00,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-26 21:34:00,479 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:00,479 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1, 1] [2018-09-26 21:34:00,479 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:34:00,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:00,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2015365977, now seen corresponding path program 40 times [2018-09-26 21:34:00,480 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:00,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:00,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:00,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:00,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:01,891 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:01,891 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:01,900 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:34:02,048 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:34:02,049 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:02,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:02,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:02,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:02,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-09-26 21:34:02,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:03,362 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:03,362 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-09-26 21:34:03,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 21:34:03,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 21:34:03,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2711, Invalid=4599, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 21:34:03,364 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 86 states. [2018-09-26 21:34:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:05,355 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-09-26 21:34:05,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 21:34:05,356 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 206 [2018-09-26 21:34:05,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:05,357 INFO L225 Difference]: With dead ends: 216 [2018-09-26 21:34:05,357 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 21:34:05,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5038 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5417, Invalid=10585, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 21:34:05,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 21:34:05,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2018-09-26 21:34:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-09-26 21:34:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-09-26 21:34:05,394 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 206 [2018-09-26 21:34:05,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:05,394 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-09-26 21:34:05,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 21:34:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-09-26 21:34:05,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-09-26 21:34:05,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:05,395 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1, 1] [2018-09-26 21:34:05,396 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:34:05,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:05,396 INFO L82 PathProgramCache]: Analyzing trace with hash 164724561, now seen corresponding path program 41 times [2018-09-26 21:34:05,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:05,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:05,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:05,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:05,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:07,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:07,218 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:07,219 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:07,226 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:34:07,470 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-26 21:34:07,471 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:07,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:07,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:07,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:07,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-09-26 21:34:07,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:08,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:08,852 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:08,853 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-09-26 21:34:08,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 21:34:08,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 21:34:08,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2840, Invalid=4816, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 21:34:08,855 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 88 states. [2018-09-26 21:34:10,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:10,922 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-09-26 21:34:10,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 21:34:10,922 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 211 [2018-09-26 21:34:10,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:10,923 INFO L225 Difference]: With dead ends: 221 [2018-09-26 21:34:10,923 INFO L226 Difference]: Without dead ends: 220 [2018-09-26 21:34:10,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5287 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5675, Invalid=11095, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 21:34:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-09-26 21:34:11,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2018-09-26 21:34:11,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-26 21:34:11,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-09-26 21:34:11,072 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 211 [2018-09-26 21:34:11,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:11,073 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-09-26 21:34:11,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 21:34:11,073 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-09-26 21:34:11,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-26 21:34:11,073 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:11,074 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1, 1] [2018-09-26 21:34:11,074 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:34:11,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:11,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1252127001, now seen corresponding path program 42 times [2018-09-26 21:34:11,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:11,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:11,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:11,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:11,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:12,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:12,465 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:12,465 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:12,472 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:34:12,745 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-26 21:34:12,745 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:12,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:12,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:12,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:12,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:12,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:14,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:14,096 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:14,096 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 89 [2018-09-26 21:34:14,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 21:34:14,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 21:34:14,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=5038, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 21:34:14,098 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 90 states. [2018-09-26 21:34:16,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:16,263 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-09-26 21:34:16,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 21:34:16,263 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 216 [2018-09-26 21:34:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:16,264 INFO L225 Difference]: With dead ends: 226 [2018-09-26 21:34:16,264 INFO L226 Difference]: Without dead ends: 225 [2018-09-26 21:34:16,266 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-09-26 21:34:16,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-26 21:34:16,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2018-09-26 21:34:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-09-26 21:34:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-09-26 21:34:16,303 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 216 [2018-09-26 21:34:16,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:16,304 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-09-26 21:34:16,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 21:34:16,304 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-09-26 21:34:16,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-09-26 21:34:16,305 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:16,305 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1, 1] [2018-09-26 21:34:16,305 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:34:16,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:16,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1716112657, now seen corresponding path program 43 times [2018-09-26 21:34:16,306 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:16,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:16,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:16,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:16,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:17,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:17,591 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:17,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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:17,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:34:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:17,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:17,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:17,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:17,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:17,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:19,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:19,722 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:19,723 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 91 [2018-09-26 21:34:19,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 21:34:19,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 21:34:19,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3107, Invalid=5265, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 21:34:19,724 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 92 states. [2018-09-26 21:34:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:22,158 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-09-26 21:34:22,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 21:34:22,159 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 221 [2018-09-26 21:34:22,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:22,160 INFO L225 Difference]: With dead ends: 231 [2018-09-26 21:34:22,160 INFO L226 Difference]: Without dead ends: 230 [2018-09-26 21:34:22,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5803 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6209, Invalid=12151, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 21:34:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-26 21:34:22,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2018-09-26 21:34:22,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-26 21:34:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-09-26 21:34:22,219 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 221 [2018-09-26 21:34:22,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:22,219 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-09-26 21:34:22,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 21:34:22,219 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-09-26 21:34:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-26 21:34:22,220 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:22,221 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1, 1] [2018-09-26 21:34:22,221 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:34:22,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:22,221 INFO L82 PathProgramCache]: Analyzing trace with hash 279992615, now seen corresponding path program 44 times [2018-09-26 21:34:22,221 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:22,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:22,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:22,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:34:22,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:23,671 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:23,671 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:23,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:34:23,834 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:34:23,834 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:23,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:23,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:23,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:23,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:23,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:25,294 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:25,294 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 93 [2018-09-26 21:34:25,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 21:34:25,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 21:34:25,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3245, Invalid=5497, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 21:34:25,296 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 94 states. [2018-09-26 21:34:27,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:27,829 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-09-26 21:34:27,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 21:34:27,830 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 226 [2018-09-26 21:34:27,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:27,831 INFO L225 Difference]: With dead ends: 236 [2018-09-26 21:34:27,831 INFO L226 Difference]: Without dead ends: 235 [2018-09-26 21:34:27,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6070 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6485, Invalid=12697, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 21:34:27,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-26 21:34:27,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-09-26 21:34:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-09-26 21:34:27,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-09-26 21:34:27,890 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 226 [2018-09-26 21:34:27,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:27,890 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-09-26 21:34:27,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 21:34:27,890 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-09-26 21:34:27,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-09-26 21:34:27,891 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:27,892 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1, 1] [2018-09-26 21:34:27,892 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:34:27,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:27,892 INFO L82 PathProgramCache]: Analyzing trace with hash 34335441, now seen corresponding path program 45 times [2018-09-26 21:34:27,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:27,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:27,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:27,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:27,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:29,203 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:29,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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:29,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:34:29,519 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-26 21:34:29,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:29,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:29,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:29,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:29,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:29,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:31,205 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:31,205 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2018-09-26 21:34:31,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 21:34:31,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 21:34:31,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3386, Invalid=5734, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 21:34:31,208 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 96 states. [2018-09-26 21:34:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:34,121 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-09-26 21:34:34,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 21:34:34,121 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 231 [2018-09-26 21:34:34,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:34,123 INFO L225 Difference]: With dead ends: 241 [2018-09-26 21:34:34,123 INFO L226 Difference]: Without dead ends: 240 [2018-09-26 21:34:34,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6343 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6767, Invalid=13255, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 21:34:34,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-09-26 21:34:34,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2018-09-26 21:34:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-26 21:34:34,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-09-26 21:34:34,190 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 231 [2018-09-26 21:34:34,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:34,190 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-09-26 21:34:34,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 21:34:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-09-26 21:34:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-26 21:34:34,191 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:34,192 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1, 1] [2018-09-26 21:34:34,192 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:34:34,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:34,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1113248615, now seen corresponding path program 46 times [2018-09-26 21:34:34,192 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:34,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:34,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:34,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:34,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:35,576 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:35,576 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:35,583 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:34:35,753 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:34:35,753 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:35,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:35,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:35,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:35,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:35,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:37,663 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:37,663 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 97 [2018-09-26 21:34:37,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 21:34:37,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 21:34:37,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3530, Invalid=5976, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 21:34:37,665 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 98 states. [2018-09-26 21:34:40,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:40,318 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-09-26 21:34:40,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 21:34:40,318 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 236 [2018-09-26 21:34:40,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:40,319 INFO L225 Difference]: With dead ends: 246 [2018-09-26 21:34:40,319 INFO L226 Difference]: Without dead ends: 245 [2018-09-26 21:34:40,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6622 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7055, Invalid=13825, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 21:34:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-26 21:34:40,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2018-09-26 21:34:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-09-26 21:34:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-09-26 21:34:40,372 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 236 [2018-09-26 21:34:40,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:40,372 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-09-26 21:34:40,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 21:34:40,372 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-09-26 21:34:40,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-09-26 21:34:40,373 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:40,373 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1, 1] [2018-09-26 21:34:40,374 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:34:40,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:40,374 INFO L82 PathProgramCache]: Analyzing trace with hash -418129775, now seen corresponding path program 47 times [2018-09-26 21:34:40,374 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:40,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:40,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:40,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:40,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:41,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:41,969 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:41,969 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:41,976 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:34:42,280 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-26 21:34:42,280 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:42,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:42,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:42,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:42,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:42,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:43,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:43,968 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:43,968 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 99 [2018-09-26 21:34:43,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 21:34:43,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 21:34:43,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3677, Invalid=6223, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 21:34:43,970 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 100 states. [2018-09-26 21:34:46,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:46,691 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-09-26 21:34:46,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 21:34:46,692 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 241 [2018-09-26 21:34:46,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:46,693 INFO L225 Difference]: With dead ends: 251 [2018-09-26 21:34:46,693 INFO L226 Difference]: Without dead ends: 250 [2018-09-26 21:34:46,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6907 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7349, Invalid=14407, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 21:34:46,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-26 21:34:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2018-09-26 21:34:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-09-26 21:34:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-09-26 21:34:46,749 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 241 [2018-09-26 21:34:46,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:46,750 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-09-26 21:34:46,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 21:34:46,750 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-09-26 21:34:46,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-09-26 21:34:46,751 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:46,751 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1, 1] [2018-09-26 21:34:46,751 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:34:46,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:46,751 INFO L82 PathProgramCache]: Analyzing trace with hash 501317031, now seen corresponding path program 48 times [2018-09-26 21:34:46,752 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:46,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:46,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:46,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:46,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:48,604 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:48,604 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:48,612 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:34:48,994 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-26 21:34:48,994 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:49,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:49,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:49,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:49,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:49,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:51,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:51,047 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:51,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 101 [2018-09-26 21:34:51,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 21:34:51,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 21:34:51,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3827, Invalid=6475, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 21:34:51,050 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 102 states. [2018-09-26 21:34:54,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:54,092 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-09-26 21:34:54,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 21:34:54,093 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 246 [2018-09-26 21:34:54,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:54,094 INFO L225 Difference]: With dead ends: 256 [2018-09-26 21:34:54,094 INFO L226 Difference]: Without dead ends: 255 [2018-09-26 21:34:54,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7198 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7649, Invalid=15001, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 21:34:54,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-09-26 21:34:54,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2018-09-26 21:34:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-09-26 21:34:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-09-26 21:34:54,146 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 246 [2018-09-26 21:34:54,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:54,147 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-09-26 21:34:54,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 21:34:54,147 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-09-26 21:34:54,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-09-26 21:34:54,148 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:54,148 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1, 1] [2018-09-26 21:34:54,149 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:34:54,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:54,149 INFO L82 PathProgramCache]: Analyzing trace with hash -732064175, now seen corresponding path program 49 times [2018-09-26 21:34:54,149 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:54,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:54,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:54,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:54,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:55,758 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:55,758 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:55,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:34:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:55,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:55,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:55,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:55,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-09-26 21:34:55,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:58,088 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:58,088 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 103 [2018-09-26 21:34:58,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 21:34:58,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 21:34:58,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3980, Invalid=6732, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 21:34:58,091 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 104 states. [2018-09-26 21:35:00,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:00,874 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-09-26 21:35:00,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 21:35:00,874 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 251 [2018-09-26 21:35:00,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:00,875 INFO L225 Difference]: With dead ends: 261 [2018-09-26 21:35:00,876 INFO L226 Difference]: Without dead ends: 260 [2018-09-26 21:35:00,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7495 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7955, Invalid=15607, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 21:35:00,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-09-26 21:35:00,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2018-09-26 21:35:00,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-26 21:35:00,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-09-26 21:35:00,940 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 251 [2018-09-26 21:35:00,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:00,940 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-09-26 21:35:00,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 21:35:00,940 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-09-26 21:35:00,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-26 21:35:00,942 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:00,942 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1, 1] [2018-09-26 21:35:00,942 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:35:00,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:00,943 INFO L82 PathProgramCache]: Analyzing trace with hash -506963993, now seen corresponding path program 50 times [2018-09-26 21:35:00,943 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:00,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:00,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:00,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:35:00,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:02,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:02,446 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:02,446 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:35:02,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:35:02,632 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:35:02,633 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:02,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:02,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:02,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:02,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-09-26 21:35:02,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:04,619 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:04,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 105 [2018-09-26 21:35:04,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 21:35:04,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 21:35:04,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4136, Invalid=6994, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 21:35:04,622 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 106 states. [2018-09-26 21:35:07,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:07,607 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2018-09-26 21:35:07,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 21:35:07,607 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 256 [2018-09-26 21:35:07,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:07,608 INFO L225 Difference]: With dead ends: 266 [2018-09-26 21:35:07,609 INFO L226 Difference]: Without dead ends: 265 [2018-09-26 21:35:07,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7798 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8267, Invalid=16225, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 21:35:07,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-09-26 21:35:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2018-09-26 21:35:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-09-26 21:35:07,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2018-09-26 21:35:07,659 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 256 [2018-09-26 21:35:07,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:07,660 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2018-09-26 21:35:07,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 21:35:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2018-09-26 21:35:07,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-09-26 21:35:07,661 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:07,661 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1, 1] [2018-09-26 21:35:07,661 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:35:07,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:07,661 INFO L82 PathProgramCache]: Analyzing trace with hash -35314671, now seen corresponding path program 51 times [2018-09-26 21:35:07,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:07,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:07,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:07,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:07,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:09,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:09,324 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:09,324 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:35:09,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:35:09,742 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-09-26 21:35:09,742 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:09,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:09,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:09,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:09,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:09,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:11,672 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:11,672 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 107 [2018-09-26 21:35:11,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 21:35:11,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 21:35:11,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4295, Invalid=7261, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 21:35:11,673 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 108 states. [2018-09-26 21:35:15,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:15,050 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-09-26 21:35:15,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 21:35:15,050 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 261 [2018-09-26 21:35:15,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:15,051 INFO L225 Difference]: With dead ends: 271 [2018-09-26 21:35:15,051 INFO L226 Difference]: Without dead ends: 270 [2018-09-26 21:35:15,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8107 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8585, Invalid=16855, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 21:35:15,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-09-26 21:35:15,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2018-09-26 21:35:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-09-26 21:35:15,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-09-26 21:35:15,110 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 261 [2018-09-26 21:35:15,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:15,110 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-09-26 21:35:15,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 21:35:15,110 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-09-26 21:35:15,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-09-26 21:35:15,111 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:15,111 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1, 1] [2018-09-26 21:35:15,111 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:35:15,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:15,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2006147623, now seen corresponding path program 52 times [2018-09-26 21:35:15,112 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:15,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:15,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:15,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:15,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:16,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:16,702 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:16,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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:35:16,711 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:35:16,902 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:35:16,902 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:16,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:16,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:16,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:16,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:16,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:19,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:19,218 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:19,218 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 109 [2018-09-26 21:35:19,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 21:35:19,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 21:35:19,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4457, Invalid=7533, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 21:35:19,220 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 110 states. [2018-09-26 21:35:22,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:22,278 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-09-26 21:35:22,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 21:35:22,279 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 266 [2018-09-26 21:35:22,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:22,280 INFO L225 Difference]: With dead ends: 276 [2018-09-26 21:35:22,280 INFO L226 Difference]: Without dead ends: 275 [2018-09-26 21:35:22,281 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-09-26 21:35:22,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-09-26 21:35:22,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2018-09-26 21:35:22,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-09-26 21:35:22,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-09-26 21:35:22,361 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 266 [2018-09-26 21:35:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:22,361 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-09-26 21:35:22,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 21:35:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-09-26 21:35:22,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-09-26 21:35:22,363 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:22,363 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1, 1] [2018-09-26 21:35:22,363 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:35:22,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:22,363 INFO L82 PathProgramCache]: Analyzing trace with hash -861503023, now seen corresponding path program 53 times [2018-09-26 21:35:22,364 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:22,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:22,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:22,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:22,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:24,342 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:24,342 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:35:24,353 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:35:24,698 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-09-26 21:35:24,699 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:24,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:24,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:24,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:24,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:24,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:26,721 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:26,722 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 111 [2018-09-26 21:35:26,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 21:35:26,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 21:35:26,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4622, Invalid=7810, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 21:35:26,724 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 112 states. [2018-09-26 21:35:30,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:30,113 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-09-26 21:35:30,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 21:35:30,113 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 271 [2018-09-26 21:35:30,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:30,115 INFO L225 Difference]: With dead ends: 281 [2018-09-26 21:35:30,115 INFO L226 Difference]: Without dead ends: 280 [2018-09-26 21:35:30,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8743 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9239, Invalid=18151, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 21:35:30,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-09-26 21:35:30,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2018-09-26 21:35:30,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-26 21:35:30,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-09-26 21:35:30,185 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 271 [2018-09-26 21:35:30,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:30,185 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-09-26 21:35:30,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 21:35:30,186 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-09-26 21:35:30,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-26 21:35:30,187 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:30,187 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1, 1] [2018-09-26 21:35:30,187 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:35:30,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:30,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1278829465, now seen corresponding path program 54 times [2018-09-26 21:35:30,188 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:30,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:30,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:30,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:30,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:31,879 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:31,880 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:31,880 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:35:31,887 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:35:32,325 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-09-26 21:35:32,326 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:32,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:32,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:32,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:32,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:32,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:34,685 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:34,707 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:34,707 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 113 [2018-09-26 21:35:34,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 21:35:34,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 21:35:34,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4790, Invalid=8092, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 21:35:34,709 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 114 states. [2018-09-26 21:35:37,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:37,879 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2018-09-26 21:35:37,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 21:35:37,879 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 276 [2018-09-26 21:35:37,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:37,881 INFO L225 Difference]: With dead ends: 286 [2018-09-26 21:35:37,881 INFO L226 Difference]: Without dead ends: 285 [2018-09-26 21:35:37,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9070 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9575, Invalid=18817, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 21:35:37,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-09-26 21:35:37,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2018-09-26 21:35:37,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-09-26 21:35:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2018-09-26 21:35:37,945 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 276 [2018-09-26 21:35:37,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:37,945 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2018-09-26 21:35:37,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 21:35:37,945 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2018-09-26 21:35:37,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-09-26 21:35:37,946 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:37,946 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1, 1] [2018-09-26 21:35:37,947 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:35:37,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:37,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1633833071, now seen corresponding path program 55 times [2018-09-26 21:35:37,947 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:37,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:37,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:37,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:37,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:39,756 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:39,756 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:35:39,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:35:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:39,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:39,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:39,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:39,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:39,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:42,108 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:42,108 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 115 [2018-09-26 21:35:42,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 21:35:42,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 21:35:42,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4961, Invalid=8379, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 21:35:42,110 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 116 states. [2018-09-26 21:35:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:45,559 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-09-26 21:35:45,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 21:35:45,559 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 281 [2018-09-26 21:35:45,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:45,560 INFO L225 Difference]: With dead ends: 291 [2018-09-26 21:35:45,561 INFO L226 Difference]: Without dead ends: 290 [2018-09-26 21:35:45,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9403 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9917, Invalid=19495, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 21:35:45,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-09-26 21:35:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2018-09-26 21:35:45,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-09-26 21:35:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-09-26 21:35:45,636 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 281 [2018-09-26 21:35:45,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:45,636 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-09-26 21:35:45,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 21:35:45,636 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-09-26 21:35:45,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-09-26 21:35:45,637 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:45,637 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1, 1] [2018-09-26 21:35:45,637 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:35:45,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:45,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1780087129, now seen corresponding path program 56 times [2018-09-26 21:35:45,638 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:45,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:45,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:45,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:35:45,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:47,381 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:47,381 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:35:47,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:35:47,572 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:35:47,573 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:47,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:47,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:47,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:47,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:47,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:49,889 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:49,911 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:49,911 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 117 [2018-09-26 21:35:49,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 21:35:49,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 21:35:49,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5135, Invalid=8671, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 21:35:49,914 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 118 states. [2018-09-26 21:35:53,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:53,218 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2018-09-26 21:35:53,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 21:35:53,218 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 286 [2018-09-26 21:35:53,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:53,219 INFO L225 Difference]: With dead ends: 296 [2018-09-26 21:35:53,219 INFO L226 Difference]: Without dead ends: 295 [2018-09-26 21:35:53,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9742 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10265, Invalid=20185, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 21:35:53,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-09-26 21:35:53,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2018-09-26 21:35:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-09-26 21:35:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2018-09-26 21:35:53,295 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 286 [2018-09-26 21:35:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:53,295 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2018-09-26 21:35:53,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 21:35:53,295 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2018-09-26 21:35:53,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-09-26 21:35:53,297 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:53,297 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1, 1] [2018-09-26 21:35:53,297 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:35:53,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:53,298 INFO L82 PathProgramCache]: Analyzing trace with hash -2033799855, now seen corresponding path program 57 times [2018-09-26 21:35:53,298 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:53,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:53,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:53,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:53,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:55,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:55,206 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:55,206 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:35:55,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:35:55,657 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-09-26 21:35:55,657 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:55,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:55,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:55,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:55,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:55,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:57,937 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:57,938 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 119 [2018-09-26 21:35:57,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 21:35:57,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 21:35:57,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5312, Invalid=8968, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 21:35:57,940 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 120 states. [2018-09-26 21:36:01,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:36:01,451 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-09-26 21:36:01,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 21:36:01,451 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 291 [2018-09-26 21:36:01,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:36:01,453 INFO L225 Difference]: With dead ends: 301 [2018-09-26 21:36:01,453 INFO L226 Difference]: Without dead ends: 300 [2018-09-26 21:36:01,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10087 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10619, Invalid=20887, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 21:36:01,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-09-26 21:36:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2018-09-26 21:36:01,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-09-26 21:36:01,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-09-26 21:36:01,521 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 291 [2018-09-26 21:36:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:36:01,522 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-09-26 21:36:01,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 21:36:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-09-26 21:36:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-26 21:36:01,523 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:36:01,523 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1, 1] [2018-09-26 21:36:01,524 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:36:01,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:36:01,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2005557017, now seen corresponding path program 58 times [2018-09-26 21:36:01,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:36:01,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:36:01,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:36:01,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:36:01,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:36:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:36:03,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:36:03,382 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:36:03,382 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:36:03,390 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:36:03,602 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:36:03,602 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:36:03,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:36:03,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:36:03,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:36:03,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:36:03,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:36:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:36:06,004 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:36:06,004 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 121 [2018-09-26 21:36:06,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 21:36:06,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 21:36:06,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5492, Invalid=9270, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 21:36:06,006 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 122 states. [2018-09-26 21:36:09,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:36:09,523 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2018-09-26 21:36:09,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 21:36:09,524 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 296 [2018-09-26 21:36:09,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:36:09,525 INFO L225 Difference]: With dead ends: 306 [2018-09-26 21:36:09,525 INFO L226 Difference]: Without dead ends: 305 [2018-09-26 21:36:09,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10438 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10979, Invalid=21601, Unknown=0, NotChecked=0, Total=32580 [2018-09-26 21:36:09,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-09-26 21:36:09,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2018-09-26 21:36:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-09-26 21:36:09,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-09-26 21:36:09,607 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 296 [2018-09-26 21:36:09,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:36:09,607 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-09-26 21:36:09,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 21:36:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-09-26 21:36:09,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-09-26 21:36:09,608 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:36:09,609 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1, 1] [2018-09-26 21:36:09,609 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:36:09,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:36:09,609 INFO L82 PathProgramCache]: Analyzing trace with hash 220035857, now seen corresponding path program 59 times [2018-09-26 21:36:09,609 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:36:09,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:36:09,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:36:09,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:36:09,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:36:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:36:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:36:11,527 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:36:11,527 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:36:11,535 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:36:11,957 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-09-26 21:36:11,957 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:36:11,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:36:11,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:36:11,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:36:11,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:36:11,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:36:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:36:14,360 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:36:14,361 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 123 [2018-09-26 21:36:14,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 21:36:14,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 21:36:14,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5675, Invalid=9577, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 21:36:14,363 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 124 states. [2018-09-26 21:36:17,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:36:17,995 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-09-26 21:36:18,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 21:36:18,002 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 301 [2018-09-26 21:36:18,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:36:18,003 INFO L225 Difference]: With dead ends: 311 [2018-09-26 21:36:18,003 INFO L226 Difference]: Without dead ends: 310 [2018-09-26 21:36:18,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10795 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=11345, Invalid=22327, Unknown=0, NotChecked=0, Total=33672 [2018-09-26 21:36:18,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-09-26 21:36:18,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 307. [2018-09-26 21:36:18,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-09-26 21:36:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-09-26 21:36:18,081 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 301 [2018-09-26 21:36:18,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:36:18,081 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-09-26 21:36:18,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 21:36:18,081 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-09-26 21:36:18,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-09-26 21:36:18,082 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:36:18,082 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1, 1] [2018-09-26 21:36:18,083 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:36:18,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:36:18,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1594266841, now seen corresponding path program 60 times [2018-09-26 21:36:18,083 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:36:18,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:36:18,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:36:18,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:36:18,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:36:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-26 21:36:18,154 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:919) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-09-26 21:36:18,158 INFO L168 Benchmark]: Toolchain (without parser) took 238210.52 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.2 GB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -751.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-09-26 21:36:18,159 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:36:18,160 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:36:18,160 INFO L168 Benchmark]: Boogie Preprocessor took 24.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:36:18,160 INFO L168 Benchmark]: RCFGBuilder took 411.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-26 21:36:18,161 INFO L168 Benchmark]: TraceAbstraction took 237711.13 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.2 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-09-26 21:36:18,163 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.38 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 24.30 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 411.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 237711.13 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.2 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-36-18-173.csv Completed graceful shutdown