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/20170304-DifficultPathPrograms/invert_string.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-bd42740 [2018-09-23 21:27:11,026 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 21:27:11,028 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 21:27:11,045 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 21:27:11,045 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 21:27:11,047 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 21:27:11,048 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 21:27:11,050 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 21:27:11,053 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 21:27:11,054 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 21:27:11,055 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 21:27:11,055 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 21:27:11,062 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 21:27:11,063 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 21:27:11,067 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 21:27:11,068 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 21:27:11,068 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 21:27:11,071 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 21:27:11,073 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 21:27:11,074 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 21:27:11,075 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 21:27:11,076 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 21:27:11,079 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 21:27:11,079 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 21:27:11,079 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 21:27:11,080 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 21:27:11,081 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 21:27:11,081 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 21:27:11,082 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 21:27:11,084 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 21:27:11,084 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 21:27:11,085 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 21:27:11,085 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 21:27:11,085 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 21:27:11,090 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 21:27:11,090 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 21:27:11,091 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-23 21:27:11,105 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 21:27:11,105 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 21:27:11,106 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 21:27:11,106 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 21:27:11,107 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 21:27:11,107 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 21:27:11,107 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 21:27:11,107 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 21:27:11,107 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 21:27:11,108 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 21:27:11,108 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 21:27:11,108 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 21:27:11,108 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 21:27:11,108 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 21:27:11,109 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 21:27:11,109 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 21:27:11,109 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 21:27:11,109 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 21:27:11,109 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 21:27:11,110 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 21:27:11,110 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 21:27:11,110 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 21:27:11,110 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 21:27:11,110 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 21:27:11,111 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 21:27:11,111 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 21:27:11,111 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 21:27:11,111 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 21:27:11,111 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 21:27:11,112 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 21:27:11,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 21:27:11,184 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 21:27:11,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 21:27:11,193 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 21:27:11,194 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 21:27:11,195 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl [2018-09-23 21:27:11,195 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2018-09-23 21:27:11,265 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 21:27:11,270 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 21:27:11,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 21:27:11,271 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 21:27:11,272 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 21:27:11,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:27:11" (1/1) ... [2018-09-23 21:27:11,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:27:11" (1/1) ... [2018-09-23 21:27:11,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 21:27:11,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 21:27:11,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 21:27:11,316 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 21:27:11,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:27:11" (1/1) ... [2018-09-23 21:27:11,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:27:11" (1/1) ... [2018-09-23 21:27:11,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:27:11" (1/1) ... [2018-09-23 21:27:11,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:27:11" (1/1) ... [2018-09-23 21:27:11,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:27:11" (1/1) ... [2018-09-23 21:27:11,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:27:11" (1/1) ... [2018-09-23 21:27:11,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:27:11" (1/1) ... [2018-09-23 21:27:11,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 21:27:11,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 21:27:11,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 21:27:11,342 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 21:27:11,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:27:11" (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-23 21:27:11,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-23 21:27:11,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-23 21:27:11,700 INFO L354 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-23 21:27:11,700 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 09:27:11 BoogieIcfgContainer [2018-09-23 21:27:11,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 21:27:11,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 21:27:11,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 21:27:11,705 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 21:27:11,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:27:11" (1/2) ... [2018-09-23 21:27:11,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a8f904 and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 09:27:11, skipping insertion in model container [2018-09-23 21:27:11,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 09:27:11" (2/2) ... [2018-09-23 21:27:11,709 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2018-09-23 21:27:11,720 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 21:27:11,729 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-23 21:27:11,783 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 21:27:11,784 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 21:27:11,784 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 21:27:11,784 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 21:27:11,785 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 21:27:11,785 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 21:27:11,785 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 21:27:11,785 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 21:27:11,785 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 21:27:11,801 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-09-23 21:27:11,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-23 21:27:11,808 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:11,809 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-23 21:27:11,811 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:11,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:11,818 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-09-23 21:27:11,820 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:11,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:11,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:11,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:27:11,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:12,120 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-23 21:27:12,123 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:27:12,123 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:27:12,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 21:27:12,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 21:27:12,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-23 21:27:12,153 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2018-09-23 21:27:12,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:12,483 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-09-23 21:27:12,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-23 21:27:12,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-23 21:27:12,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:12,498 INFO L225 Difference]: With dead ends: 15 [2018-09-23 21:27:12,499 INFO L226 Difference]: Without dead ends: 9 [2018-09-23 21:27:12,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-23 21:27:12,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-23 21:27:12,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-23 21:27:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-23 21:27:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-09-23 21:27:12,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-09-23 21:27:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:12,542 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-09-23 21:27:12,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 21:27:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-09-23 21:27:12,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:27:12,543 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:12,543 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-23 21:27:12,543 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:12,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:12,544 INFO L82 PathProgramCache]: Analyzing trace with hash 198621957, now seen corresponding path program 1 times [2018-09-23 21:27:12,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:12,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:12,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:12,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:27:12,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:12,646 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:12,646 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-23 21:27:12,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:27:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:12,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:12,744 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:12,744 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-09-23 21:27:12,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 21:27:12,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 21:27:12,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-23 21:27:12,746 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-09-23 21:27:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:12,832 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-09-23 21:27:12,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-23 21:27:12,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-09-23 21:27:12,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:12,836 INFO L225 Difference]: With dead ends: 13 [2018-09-23 21:27:12,837 INFO L226 Difference]: Without dead ends: 11 [2018-09-23 21:27:12,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-23 21:27:12,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-23 21:27:12,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-23 21:27:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-23 21:27:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-09-23 21:27:12,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-09-23 21:27:12,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:12,848 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-09-23 21:27:12,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 21:27:12,848 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-09-23 21:27:12,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-23 21:27:12,849 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:12,849 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-09-23 21:27:12,849 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:12,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:12,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2018-09-23 21:27:12,850 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:12,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:12,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:12,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:27:12,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:13,098 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-23 21:27:13,098 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:13,099 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:27:13,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:27:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:13,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:13,347 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 8 treesize of output 7 [2018-09-23 21:27:13,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:27:13,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:27:13,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 21:27:13,544 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-23 21:27:13,573 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:13,573 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-09-23 21:27:13,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-23 21:27:13,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-23 21:27:13,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-23 21:27:13,575 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 10 states. [2018-09-23 21:27:13,738 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-09-23 21:27:13,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:13,941 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-09-23 21:27:13,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-23 21:27:13,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-09-23 21:27:13,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:13,942 INFO L225 Difference]: With dead ends: 19 [2018-09-23 21:27:13,943 INFO L226 Difference]: Without dead ends: 13 [2018-09-23 21:27:13,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-09-23 21:27:13,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-23 21:27:13,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-23 21:27:13,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-23 21:27:13,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-09-23 21:27:13,955 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-09-23 21:27:13,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:13,956 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-09-23 21:27:13,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-23 21:27:13,957 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-09-23 21:27:13,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:27:13,957 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:13,958 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-09-23 21:27:13,958 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:13,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:13,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1765270407, now seen corresponding path program 2 times [2018-09-23 21:27:13,959 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:13,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:13,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:13,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:27:13,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:14,084 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:14,084 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:27:14,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:27:14,128 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:27:14,129 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:27:14,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:14,162 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:14,162 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-09-23 21:27:14,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-23 21:27:14,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-23 21:27:14,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-23 21:27:14,163 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2018-09-23 21:27:14,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:14,518 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-09-23 21:27:14,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-23 21:27:14,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-09-23 21:27:14,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:14,520 INFO L225 Difference]: With dead ends: 17 [2018-09-23 21:27:14,520 INFO L226 Difference]: Without dead ends: 15 [2018-09-23 21:27:14,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:27:14,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-23 21:27:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-23 21:27:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-23 21:27:14,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-09-23 21:27:14,526 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-09-23 21:27:14,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:14,526 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-09-23 21:27:14,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-23 21:27:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-09-23 21:27:14,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-23 21:27:14,527 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:14,527 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-09-23 21:27:14,528 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:14,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:14,528 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 3 times [2018-09-23 21:27:14,528 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:14,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:14,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:14,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:27:14,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:14,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:14,704 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:14,704 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-23 21:27:14,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:27:14,743 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-23 21:27:14,744 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:27:14,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:14,823 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 8 treesize of output 7 [2018-09-23 21:27:14,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:27:14,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:27:14,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 21:27:14,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-09-23 21:27:14,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:27:14,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:27:14,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-09-23 21:27:14,917 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:14,938 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:14,938 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-23 21:27:14,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-23 21:27:14,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-23 21:27:14,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-09-23 21:27:14,940 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 13 states. [2018-09-23 21:27:15,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:15,426 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-09-23 21:27:15,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 21:27:15,426 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-09-23 21:27:15,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:15,427 INFO L225 Difference]: With dead ends: 25 [2018-09-23 21:27:15,427 INFO L226 Difference]: Without dead ends: 17 [2018-09-23 21:27:15,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-09-23 21:27:15,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-23 21:27:15,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-23 21:27:15,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-23 21:27:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-09-23 21:27:15,435 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-09-23 21:27:15,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:15,435 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-09-23 21:27:15,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-23 21:27:15,436 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-09-23 21:27:15,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:27:15,436 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:15,437 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2018-09-23 21:27:15,437 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:15,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:15,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1096334355, now seen corresponding path program 4 times [2018-09-23 21:27:15,437 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:15,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:15,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:15,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:27:15,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:15,524 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:15,524 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-23 21:27:15,543 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 21:27:15,569 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 21:27:15,570 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:27:15,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:15,724 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 8 treesize of output 7 [2018-09-23 21:27:15,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:27:15,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:27:15,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:27:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-23 21:27:15,791 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:15,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-09-23 21:27:15,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-23 21:27:15,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-23 21:27:15,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-23 21:27:15,793 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2018-09-23 21:27:16,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:16,024 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-09-23 21:27:16,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 21:27:16,025 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-23 21:27:16,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:16,026 INFO L225 Difference]: With dead ends: 21 [2018-09-23 21:27:16,026 INFO L226 Difference]: Without dead ends: 19 [2018-09-23 21:27:16,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-09-23 21:27:16,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-23 21:27:16,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-23 21:27:16,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-23 21:27:16,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-09-23 21:27:16,034 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-09-23 21:27:16,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:16,034 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-09-23 21:27:16,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-23 21:27:16,034 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-09-23 21:27:16,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-23 21:27:16,035 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:16,035 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-09-23 21:27:16,036 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:16,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:16,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1310275289, now seen corresponding path program 5 times [2018-09-23 21:27:16,036 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:16,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:16,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:16,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:27:16,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:16,194 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:16,195 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-23 21:27:16,204 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 21:27:16,221 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-09-23 21:27:16,221 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:27:16,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:16,464 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 8 treesize of output 7 [2018-09-23 21:27:16,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:27:16,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:27:16,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:27:16,503 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:16,524 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:16,524 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-09-23 21:27:16,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-23 21:27:16,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-23 21:27:16,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-09-23 21:27:16,526 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 16 states. [2018-09-23 21:27:16,788 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-09-23 21:27:17,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:17,530 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-09-23 21:27:17,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-23 21:27:17,530 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-23 21:27:17,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:17,531 INFO L225 Difference]: With dead ends: 35 [2018-09-23 21:27:17,531 INFO L226 Difference]: Without dead ends: 23 [2018-09-23 21:27:17,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2018-09-23 21:27:17,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-23 21:27:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-23 21:27:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-23 21:27:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-09-23 21:27:17,542 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2018-09-23 21:27:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:17,542 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-09-23 21:27:17,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-23 21:27:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-09-23 21:27:17,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-23 21:27:17,543 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:17,543 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-09-23 21:27:17,544 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:17,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:17,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1731406235, now seen corresponding path program 6 times [2018-09-23 21:27:17,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:17,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:17,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:17,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:27:17,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:17,822 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:17,822 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:17,822 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-23 21:27:17,830 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 21:27:17,857 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-09-23 21:27:17,857 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:27:17,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:18,035 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 8 treesize of output 7 [2018-09-23 21:27:18,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:27:18,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:27:18,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 21:27:18,129 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:18,151 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:18,151 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-09-23 21:27:18,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-23 21:27:18,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-23 21:27:18,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-09-23 21:27:18,153 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 19 states. [2018-09-23 21:27:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:19,158 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-09-23 21:27:19,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 21:27:19,159 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2018-09-23 21:27:19,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:19,160 INFO L225 Difference]: With dead ends: 37 [2018-09-23 21:27:19,160 INFO L226 Difference]: Without dead ends: 25 [2018-09-23 21:27:19,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2018-09-23 21:27:19,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-23 21:27:19,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-23 21:27:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-23 21:27:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-09-23 21:27:19,169 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-09-23 21:27:19,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:19,169 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-09-23 21:27:19,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-23 21:27:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-09-23 21:27:19,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-23 21:27:19,170 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:19,171 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1] [2018-09-23 21:27:19,171 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:19,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:19,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1774380245, now seen corresponding path program 7 times [2018-09-23 21:27:19,171 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:19,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:19,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:19,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:27:19,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:19,287 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:19,287 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:27:19,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:27:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:19,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:19,357 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:19,357 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-09-23 21:27:19,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 21:27:19,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 21:27:19,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-09-23 21:27:19,358 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 9 states. [2018-09-23 21:27:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:19,631 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-09-23 21:27:19,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 21:27:19,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-09-23 21:27:19,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:19,632 INFO L225 Difference]: With dead ends: 29 [2018-09-23 21:27:19,632 INFO L226 Difference]: Without dead ends: 27 [2018-09-23 21:27:19,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-23 21:27:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-23 21:27:19,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-23 21:27:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-23 21:27:19,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-09-23 21:27:19,643 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-09-23 21:27:19,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:19,644 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-09-23 21:27:19,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 21:27:19,644 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-09-23 21:27:19,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-23 21:27:19,644 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:19,645 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-09-23 21:27:19,645 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:19,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:19,645 INFO L82 PathProgramCache]: Analyzing trace with hash 77451279, now seen corresponding path program 8 times [2018-09-23 21:27:19,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:19,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:19,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:19,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:27:19,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:20,075 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:20,075 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-23 21:27:20,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:27:20,118 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:27:20,118 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:27:20,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:20,535 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 8 treesize of output 7 [2018-09-23 21:27:20,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:27:20,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:27:20,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 21:27:20,568 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:20,589 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:20,589 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-09-23 21:27:20,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-23 21:27:20,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-23 21:27:20,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-09-23 21:27:20,590 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 22 states. [2018-09-23 21:27:20,823 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-09-23 21:27:21,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:21,153 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-09-23 21:27:21,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 21:27:21,154 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2018-09-23 21:27:21,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:21,155 INFO L225 Difference]: With dead ends: 43 [2018-09-23 21:27:21,155 INFO L226 Difference]: Without dead ends: 29 [2018-09-23 21:27:21,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2018-09-23 21:27:21,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-23 21:27:21,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-23 21:27:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-23 21:27:21,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-09-23 21:27:21,164 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-09-23 21:27:21,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:21,164 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-09-23 21:27:21,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-23 21:27:21,165 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-09-23 21:27:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-23 21:27:21,165 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:21,165 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1] [2018-09-23 21:27:21,166 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:21,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:21,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1980325449, now seen corresponding path program 9 times [2018-09-23 21:27:21,166 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:21,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:21,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:21,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:27:21,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:21,309 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:21,309 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:21,309 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-23 21:27:21,321 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:27:21,345 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-23 21:27:21,346 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:27:21,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:21,422 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 8 treesize of output 7 [2018-09-23 21:27:21,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:27:21,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:27:21,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:27:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-23 21:27:21,472 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:21,472 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-09-23 21:27:21,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-23 21:27:21,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-23 21:27:21,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-09-23 21:27:21,473 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 16 states. [2018-09-23 21:27:22,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:22,113 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-09-23 21:27:22,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 21:27:22,113 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-23 21:27:22,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:22,114 INFO L225 Difference]: With dead ends: 33 [2018-09-23 21:27:22,114 INFO L226 Difference]: Without dead ends: 31 [2018-09-23 21:27:22,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2018-09-23 21:27:22,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-23 21:27:22,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-23 21:27:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-23 21:27:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-09-23 21:27:22,131 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-09-23 21:27:22,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:22,132 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-09-23 21:27:22,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-23 21:27:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-09-23 21:27:22,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-23 21:27:22,133 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:22,133 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2018-09-23 21:27:22,133 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:22,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:22,133 INFO L82 PathProgramCache]: Analyzing trace with hash 422296707, now seen corresponding path program 10 times [2018-09-23 21:27:22,133 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:22,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:22,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:22,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:27:22,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:22,470 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:22,471 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-23 21:27:22,485 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 21:27:22,499 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 21:27:22,499 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:27:22,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:22,691 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 8 treesize of output 7 [2018-09-23 21:27:22,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:27:22,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:27:22,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:27:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-23 21:27:22,751 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:22,751 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 23 [2018-09-23 21:27:22,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-23 21:27:22,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-23 21:27:22,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-09-23 21:27:22,752 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 23 states. [2018-09-23 21:27:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:23,580 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-09-23 21:27:23,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-23 21:27:23,581 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-09-23 21:27:23,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:23,582 INFO L225 Difference]: With dead ends: 53 [2018-09-23 21:27:23,582 INFO L226 Difference]: Without dead ends: 35 [2018-09-23 21:27:23,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2018-09-23 21:27:23,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-23 21:27:23,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-23 21:27:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-23 21:27:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-09-23 21:27:23,594 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-09-23 21:27:23,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:23,594 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-09-23 21:27:23,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-23 21:27:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-09-23 21:27:23,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-23 21:27:23,595 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:23,596 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-09-23 21:27:23,596 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:23,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:23,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1553862921, now seen corresponding path program 11 times [2018-09-23 21:27:23,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:23,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:23,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:23,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:27:23,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:23,891 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:23,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 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-23 21:27:23,900 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 21:27:23,931 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-09-23 21:27:23,931 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:27:23,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:24,363 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 8 treesize of output 7 [2018-09-23 21:27:24,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:27:24,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:27:24,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:27:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 20 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:24,468 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:24,468 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-09-23 21:27:24,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-23 21:27:24,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-23 21:27:24,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2018-09-23 21:27:24,470 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 32 states. [2018-09-23 21:27:26,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:26,263 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-09-23 21:27:26,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-23 21:27:26,264 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 34 [2018-09-23 21:27:26,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:26,265 INFO L225 Difference]: With dead ends: 59 [2018-09-23 21:27:26,265 INFO L226 Difference]: Without dead ends: 39 [2018-09-23 21:27:26,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=313, Invalid=2549, Unknown=0, NotChecked=0, Total=2862 [2018-09-23 21:27:26,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-23 21:27:26,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-23 21:27:26,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-23 21:27:26,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-09-23 21:27:26,277 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-09-23 21:27:26,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:26,278 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-09-23 21:27:26,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-23 21:27:26,278 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-09-23 21:27:26,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-23 21:27:26,279 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:26,279 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2018-09-23 21:27:26,279 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:26,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:26,279 INFO L82 PathProgramCache]: Analyzing trace with hash -783980693, now seen corresponding path program 12 times [2018-09-23 21:27:26,279 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:26,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:26,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:26,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:27:26,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:26,628 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:26,628 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:27:26,635 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 21:27:26,695 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-09-23 21:27:26,696 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:27:26,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:27,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 8 treesize of output 7 [2018-09-23 21:27:27,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:27:27,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:27:27,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 21:27:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:27,066 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:27,066 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 30 [2018-09-23 21:27:27,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-23 21:27:27,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-23 21:27:27,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2018-09-23 21:27:27,068 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 31 states. [2018-09-23 21:27:27,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:27,790 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-09-23 21:27:27,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-23 21:27:27,790 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 38 [2018-09-23 21:27:27,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:27,791 INFO L225 Difference]: With dead ends: 61 [2018-09-23 21:27:27,791 INFO L226 Difference]: Without dead ends: 41 [2018-09-23 21:27:27,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=187, Invalid=1535, Unknown=0, NotChecked=0, Total=1722 [2018-09-23 21:27:27,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-23 21:27:27,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-23 21:27:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-23 21:27:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-09-23 21:27:27,807 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-09-23 21:27:27,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:27,807 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-09-23 21:27:27,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-23 21:27:27,808 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-09-23 21:27:27,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-23 21:27:27,808 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:27,808 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1] [2018-09-23 21:27:27,809 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:27,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:27,809 INFO L82 PathProgramCache]: Analyzing trace with hash 830172837, now seen corresponding path program 13 times [2018-09-23 21:27:27,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:27,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:27,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:27,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:27:27,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 72 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:28,014 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:28,015 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:27:28,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:27:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:28,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 72 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:28,083 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:28,083 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 12 [2018-09-23 21:27:28,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-23 21:27:28,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-23 21:27:28,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-09-23 21:27:28,084 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 13 states. [2018-09-23 21:27:28,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:28,218 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-09-23 21:27:28,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-23 21:27:28,218 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-09-23 21:27:28,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:28,219 INFO L225 Difference]: With dead ends: 45 [2018-09-23 21:27:28,219 INFO L226 Difference]: Without dead ends: 43 [2018-09-23 21:27:28,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-23 21:27:28,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-23 21:27:28,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-23 21:27:28,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-23 21:27:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-09-23 21:27:28,235 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-09-23 21:27:28,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:28,235 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-09-23 21:27:28,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-23 21:27:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-09-23 21:27:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-23 21:27:28,236 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:28,236 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-09-23 21:27:28,236 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:28,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:28,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1067768353, now seen corresponding path program 14 times [2018-09-23 21:27:28,237 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:28,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:28,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:28,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:27:28,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:29,216 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:29,216 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:29,217 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-23 21:27:29,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:27:29,248 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:27:29,248 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:27:29,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:29,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 21:27:29,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:27:29,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:27:29,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 21:27:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:29,804 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:29,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 33 [2018-09-23 21:27:29,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-23 21:27:29,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-23 21:27:29,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2018-09-23 21:27:29,806 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 34 states. [2018-09-23 21:27:30,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:30,783 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-09-23 21:27:30,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-23 21:27:30,784 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 42 [2018-09-23 21:27:30,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:30,785 INFO L225 Difference]: With dead ends: 67 [2018-09-23 21:27:30,785 INFO L226 Difference]: Without dead ends: 45 [2018-09-23 21:27:30,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2018-09-23 21:27:30,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-23 21:27:30,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-23 21:27:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-23 21:27:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-09-23 21:27:30,801 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-09-23 21:27:30,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:30,801 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-09-23 21:27:30,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-23 21:27:30,802 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-09-23 21:27:30,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-23 21:27:30,802 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:30,802 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1] [2018-09-23 21:27:30,803 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:30,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:30,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2070347801, now seen corresponding path program 15 times [2018-09-23 21:27:30,803 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:30,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:30,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:30,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:27:30,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 90 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:30,974 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:30,974 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:27:30,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:27:31,013 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-23 21:27:31,013 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:27:31,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:31,188 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 8 treesize of output 7 [2018-09-23 21:27:31,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:27:31,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:27:31,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:27:31,221 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-23 21:27:31,241 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:31,241 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-09-23 21:27:31,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-23 21:27:31,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-23 21:27:31,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2018-09-23 21:27:31,242 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 24 states. [2018-09-23 21:27:31,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:31,742 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-09-23 21:27:31,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-23 21:27:31,743 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-09-23 21:27:31,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:31,744 INFO L225 Difference]: With dead ends: 49 [2018-09-23 21:27:31,744 INFO L226 Difference]: Without dead ends: 47 [2018-09-23 21:27:31,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=228, Invalid=1032, Unknown=0, NotChecked=0, Total=1260 [2018-09-23 21:27:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-23 21:27:31,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-23 21:27:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-23 21:27:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-09-23 21:27:31,759 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-09-23 21:27:31,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:31,759 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-09-23 21:27:31,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-23 21:27:31,759 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-09-23 21:27:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-23 21:27:31,760 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:31,760 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2018-09-23 21:27:31,760 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:31,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:31,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431059, now seen corresponding path program 16 times [2018-09-23 21:27:31,761 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:31,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:31,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:31,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:27:31,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:32,445 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:32,445 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-23 21:27:32,453 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 21:27:32,483 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 21:27:32,484 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:27:32,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:32,776 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 8 treesize of output 7 [2018-09-23 21:27:32,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:27:32,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:27:32,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:27:32,822 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-23 21:27:32,844 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:32,844 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 35 [2018-09-23 21:27:32,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-23 21:27:32,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-23 21:27:32,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2018-09-23 21:27:32,846 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 35 states. [2018-09-23 21:27:34,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:34,188 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-09-23 21:27:34,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-23 21:27:34,188 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 46 [2018-09-23 21:27:34,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:34,189 INFO L225 Difference]: With dead ends: 77 [2018-09-23 21:27:34,189 INFO L226 Difference]: Without dead ends: 51 [2018-09-23 21:27:34,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=205, Invalid=2245, Unknown=0, NotChecked=0, Total=2450 [2018-09-23 21:27:34,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-23 21:27:34,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-23 21:27:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-23 21:27:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-09-23 21:27:34,210 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2018-09-23 21:27:34,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:34,210 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-09-23 21:27:34,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-23 21:27:34,211 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-09-23 21:27:34,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-23 21:27:34,211 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:34,211 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2018-09-23 21:27:34,212 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:34,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:34,212 INFO L82 PathProgramCache]: Analyzing trace with hash -2051967801, now seen corresponding path program 17 times [2018-09-23 21:27:34,212 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:34,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:34,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:34,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:27:34,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:34,757 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:34,757 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:34,757 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-23 21:27:34,765 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 21:27:34,813 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-23 21:27:34,813 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:27:34,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:35,520 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 8 treesize of output 7 [2018-09-23 21:27:35,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:27:35,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:27:35,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:27:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 72 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:35,604 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:35,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 47 [2018-09-23 21:27:35,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-23 21:27:35,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-23 21:27:35,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2034, Unknown=0, NotChecked=0, Total=2256 [2018-09-23 21:27:35,607 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 48 states. [2018-09-23 21:27:37,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:37,721 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-09-23 21:27:37,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-23 21:27:37,721 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 50 [2018-09-23 21:27:37,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:37,722 INFO L225 Difference]: With dead ends: 83 [2018-09-23 21:27:37,722 INFO L226 Difference]: Without dead ends: 55 [2018-09-23 21:27:37,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=567, Invalid=5439, Unknown=0, NotChecked=0, Total=6006 [2018-09-23 21:27:37,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-23 21:27:37,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-23 21:27:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-23 21:27:37,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-09-23 21:27:37,742 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2018-09-23 21:27:37,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:37,743 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-09-23 21:27:37,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-23 21:27:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-09-23 21:27:37,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-23 21:27:37,743 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:37,744 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2018-09-23 21:27:37,744 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:37,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:37,744 INFO L82 PathProgramCache]: Analyzing trace with hash 75236667, now seen corresponding path program 18 times [2018-09-23 21:27:37,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:37,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:37,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:37,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:27:37,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:38,224 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:38,224 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:27:38,233 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 21:27:38,279 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-23 21:27:38,280 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:27:38,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:39,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 8 treesize of output 7 [2018-09-23 21:27:39,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:27:39,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:27:39,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:27:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-09-23 21:27:39,092 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:39,092 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15] total 41 [2018-09-23 21:27:39,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-23 21:27:39,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-23 21:27:39,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1538, Unknown=0, NotChecked=0, Total=1640 [2018-09-23 21:27:39,094 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 41 states. [2018-09-23 21:27:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:40,551 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-09-23 21:27:40,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-23 21:27:40,551 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 54 [2018-09-23 21:27:40,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:40,552 INFO L225 Difference]: With dead ends: 89 [2018-09-23 21:27:40,552 INFO L226 Difference]: Without dead ends: 59 [2018-09-23 21:27:40,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=239, Invalid=3067, Unknown=0, NotChecked=0, Total=3306 [2018-09-23 21:27:40,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-23 21:27:40,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-23 21:27:40,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-23 21:27:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-09-23 21:27:40,577 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-09-23 21:27:40,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:40,577 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-09-23 21:27:40,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-23 21:27:40,577 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-09-23 21:27:40,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-23 21:27:40,578 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:40,578 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2018-09-23 21:27:40,578 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:40,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:40,579 INFO L82 PathProgramCache]: Analyzing trace with hash 361552815, now seen corresponding path program 19 times [2018-09-23 21:27:40,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:40,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:40,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:40,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:27:40,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:41,298 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:41,298 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-23 21:27:41,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:27:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:41,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:41,940 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 8 treesize of output 7 [2018-09-23 21:27:41,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:27:41,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:27:41,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 21:27:41,997 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:42,017 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:42,018 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 45 [2018-09-23 21:27:42,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-23 21:27:42,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-23 21:27:42,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2018-09-23 21:27:42,019 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 46 states. [2018-09-23 21:27:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:43,459 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-09-23 21:27:43,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-23 21:27:43,460 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 58 [2018-09-23 21:27:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:43,461 INFO L225 Difference]: With dead ends: 91 [2018-09-23 21:27:43,461 INFO L226 Difference]: Without dead ends: 61 [2018-09-23 21:27:43,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=282, Invalid=3500, Unknown=0, NotChecked=0, Total=3782 [2018-09-23 21:27:43,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-23 21:27:43,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-23 21:27:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-23 21:27:43,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-09-23 21:27:43,484 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-09-23 21:27:43,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:43,484 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-09-23 21:27:43,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-23 21:27:43,484 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-09-23 21:27:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-23 21:27:43,485 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:43,485 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 1, 1, 1, 1] [2018-09-23 21:27:43,485 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:43,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:43,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1210122729, now seen corresponding path program 20 times [2018-09-23 21:27:43,485 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:43,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:43,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:43,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:27:43,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 182 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:44,211 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:44,211 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-23 21:27:44,220 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:27:44,256 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:27:44,256 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:27:44,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 182 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:44,289 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:44,289 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 17 [2018-09-23 21:27:44,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-23 21:27:44,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-23 21:27:44,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-09-23 21:27:44,290 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 18 states. [2018-09-23 21:27:44,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:44,519 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-09-23 21:27:44,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-23 21:27:44,521 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-09-23 21:27:44,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:44,522 INFO L225 Difference]: With dead ends: 65 [2018-09-23 21:27:44,522 INFO L226 Difference]: Without dead ends: 63 [2018-09-23 21:27:44,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-23 21:27:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-23 21:27:44,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-23 21:27:44,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-23 21:27:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-09-23 21:27:44,542 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-09-23 21:27:44,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:44,543 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-09-23 21:27:44,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-23 21:27:44,543 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-09-23 21:27:44,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-23 21:27:44,543 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:44,543 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1] [2018-09-23 21:27:44,543 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:44,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:44,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1008142301, now seen corresponding path program 21 times [2018-09-23 21:27:44,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:44,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:44,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:44,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:27:44,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:45,298 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:45,298 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:45,298 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-23 21:27:45,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:27:45,369 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-09-23 21:27:45,369 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:27:45,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:45,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 21:27:45,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:27:45,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:27:45,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:27:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-09-23 21:27:46,008 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:46,008 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17] total 47 [2018-09-23 21:27:46,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-23 21:27:46,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-23 21:27:46,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=2044, Unknown=0, NotChecked=0, Total=2162 [2018-09-23 21:27:46,010 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 47 states. [2018-09-23 21:27:47,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:47,949 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-09-23 21:27:47,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-23 21:27:47,949 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 62 [2018-09-23 21:27:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:47,950 INFO L225 Difference]: With dead ends: 101 [2018-09-23 21:27:47,950 INFO L226 Difference]: Without dead ends: 67 [2018-09-23 21:27:47,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=273, Invalid=4017, Unknown=0, NotChecked=0, Total=4290 [2018-09-23 21:27:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-23 21:27:47,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-23 21:27:47,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-23 21:27:47,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-09-23 21:27:47,980 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2018-09-23 21:27:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:47,980 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-09-23 21:27:47,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-23 21:27:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-09-23 21:27:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-23 21:27:47,981 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:47,981 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2018-09-23 21:27:47,982 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:47,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1978312041, now seen corresponding path program 22 times [2018-09-23 21:27:47,982 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:47,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:47,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:47,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:27:47,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:49,382 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:49,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 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-23 21:27:49,390 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 21:27:49,414 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 21:27:49,415 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:27:49,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:50,092 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 8 treesize of output 7 [2018-09-23 21:27:50,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:27:50,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:27:50,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:27:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-09-23 21:27:50,175 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:50,175 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 18] total 50 [2018-09-23 21:27:50,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-23 21:27:50,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-23 21:27:50,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2324, Unknown=0, NotChecked=0, Total=2450 [2018-09-23 21:27:50,177 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 50 states. [2018-09-23 21:27:52,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:52,252 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-09-23 21:27:52,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-23 21:27:52,252 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 66 [2018-09-23 21:27:52,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:52,253 INFO L225 Difference]: With dead ends: 107 [2018-09-23 21:27:52,253 INFO L226 Difference]: Without dead ends: 71 [2018-09-23 21:27:52,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=290, Invalid=4540, Unknown=0, NotChecked=0, Total=4830 [2018-09-23 21:27:52,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-23 21:27:52,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-23 21:27:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-23 21:27:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-09-23 21:27:52,276 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 66 [2018-09-23 21:27:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:52,276 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-09-23 21:27:52,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-23 21:27:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-09-23 21:27:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-23 21:27:52,277 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:52,277 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1] [2018-09-23 21:27:52,277 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:52,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:52,277 INFO L82 PathProgramCache]: Analyzing trace with hash 303497995, now seen corresponding path program 23 times [2018-09-23 21:27:52,277 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:52,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:52,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:52,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:27:52,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:27:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:53,624 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:27:53,624 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:27:53,631 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 21:27:53,724 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-09-23 21:27:53,724 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:27:53,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:27:55,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 8 treesize of output 7 [2018-09-23 21:27:55,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:27:55,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:27:55,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:27:55,395 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 182 proven. 362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:27:55,415 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:27:55,415 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 67 [2018-09-23 21:27:55,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-23 21:27:55,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-23 21:27:55,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=4119, Unknown=0, NotChecked=0, Total=4556 [2018-09-23 21:27:55,417 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 68 states. [2018-09-23 21:27:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:27:58,649 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-09-23 21:27:58,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-23 21:27:58,649 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 70 [2018-09-23 21:27:58,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:27:58,650 INFO L225 Difference]: With dead ends: 113 [2018-09-23 21:27:58,650 INFO L226 Difference]: Without dead ends: 75 [2018-09-23 21:27:58,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=997, Invalid=10559, Unknown=0, NotChecked=0, Total=11556 [2018-09-23 21:27:58,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-23 21:27:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-23 21:27:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-23 21:27:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-09-23 21:27:58,677 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 70 [2018-09-23 21:27:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:27:58,677 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-09-23 21:27:58,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-23 21:27:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-09-23 21:27:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-23 21:27:58,678 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:27:58,678 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2018-09-23 21:27:58,678 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:27:58,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:27:58,678 INFO L82 PathProgramCache]: Analyzing trace with hash -177016449, now seen corresponding path program 24 times [2018-09-23 21:27:58,678 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:27:58,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:27:58,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:58,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:27:58,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:27:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:28:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:28:00,311 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:28:00,312 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-23 21:28:00,319 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 21:28:00,395 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-09-23 21:28:00,395 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:28:00,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:28:01,269 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 8 treesize of output 7 [2018-09-23 21:28:01,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:28:01,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:28:01,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 21:28:01,346 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:28:01,367 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:28:01,367 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 57 [2018-09-23 21:28:01,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-23 21:28:01,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-23 21:28:01,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2018-09-23 21:28:01,369 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 58 states. [2018-09-23 21:28:03,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:28:03,224 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-09-23 21:28:03,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-23 21:28:03,224 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 74 [2018-09-23 21:28:03,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:28:03,225 INFO L225 Difference]: With dead ends: 115 [2018-09-23 21:28:03,225 INFO L226 Difference]: Without dead ends: 77 [2018-09-23 21:28:03,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=358, Invalid=5648, Unknown=0, NotChecked=0, Total=6006 [2018-09-23 21:28:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-23 21:28:03,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-23 21:28:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-23 21:28:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-09-23 21:28:03,253 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-09-23 21:28:03,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:28:03,253 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-09-23 21:28:03,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-23 21:28:03,253 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-09-23 21:28:03,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-23 21:28:03,254 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:28:03,254 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 1, 1, 1, 1] [2018-09-23 21:28:03,254 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:28:03,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:28:03,254 INFO L82 PathProgramCache]: Analyzing trace with hash -42507335, now seen corresponding path program 25 times [2018-09-23 21:28:03,254 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:28:03,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:28:03,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:03,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:28:03,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:28:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 306 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:28:03,569 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:28:03,569 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-23 21:28:03,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:28:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:28:03,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:28:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 306 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:28:03,657 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:28:03,657 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 21 [2018-09-23 21:28:03,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-23 21:28:03,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-23 21:28:03,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-09-23 21:28:03,658 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 22 states. [2018-09-23 21:28:03,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:28:03,968 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-09-23 21:28:03,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-23 21:28:03,968 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 76 [2018-09-23 21:28:03,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:28:03,969 INFO L225 Difference]: With dead ends: 81 [2018-09-23 21:28:03,969 INFO L226 Difference]: Without dead ends: 79 [2018-09-23 21:28:03,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-23 21:28:03,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-23 21:28:03,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-23 21:28:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-23 21:28:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-09-23 21:28:03,997 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-09-23 21:28:03,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:28:03,997 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-09-23 21:28:03,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-23 21:28:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-09-23 21:28:03,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-23 21:28:03,998 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:28:03,998 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1] [2018-09-23 21:28:03,998 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:28:03,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:28:03,998 INFO L82 PathProgramCache]: Analyzing trace with hash 2100176371, now seen corresponding path program 26 times [2018-09-23 21:28:03,998 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:28:03,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:28:03,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:03,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:28:04,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:28:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 684 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:28:05,196 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:28:05,197 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-23 21:28:05,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:28:05,247 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:28:05,248 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:28:05,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:28:06,170 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 8 treesize of output 7 [2018-09-23 21:28:06,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:28:06,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:28:06,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 21:28:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 684 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:28:06,263 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:28:06,264 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 60 [2018-09-23 21:28:06,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-23 21:28:06,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-23 21:28:06,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3482, Unknown=0, NotChecked=0, Total=3660 [2018-09-23 21:28:06,265 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 61 states. [2018-09-23 21:28:07,871 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-09-23 21:28:08,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:28:08,434 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-09-23 21:28:08,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-23 21:28:08,434 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 78 [2018-09-23 21:28:08,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:28:08,435 INFO L225 Difference]: With dead ends: 121 [2018-09-23 21:28:08,435 INFO L226 Difference]: Without dead ends: 81 [2018-09-23 21:28:08,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=377, Invalid=6265, Unknown=0, NotChecked=0, Total=6642 [2018-09-23 21:28:08,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-23 21:28:08,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-23 21:28:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-23 21:28:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-09-23 21:28:08,464 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-09-23 21:28:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:28:08,465 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-09-23 21:28:08,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-23 21:28:08,465 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-09-23 21:28:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-23 21:28:08,465 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:28:08,465 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 18, 1, 1, 1, 1] [2018-09-23 21:28:08,466 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:28:08,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:28:08,466 INFO L82 PathProgramCache]: Analyzing trace with hash 752544557, now seen corresponding path program 27 times [2018-09-23 21:28:08,466 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:28:08,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:28:08,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:08,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:28:08,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:28:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 342 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:28:08,892 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:28:08,892 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:28:08,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:28:08,989 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-09-23 21:28:08,989 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:28:08,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:28:10,875 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 8 treesize of output 7 [2018-09-23 21:28:10,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:28:10,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:28:10,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:28:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-09-23 21:28:10,944 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:28:10,944 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2018-09-23 21:28:10,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-23 21:28:10,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-23 21:28:10,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1450, Unknown=0, NotChecked=0, Total=1722 [2018-09-23 21:28:10,945 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 42 states. [2018-09-23 21:28:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:28:12,128 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-09-23 21:28:12,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-23 21:28:12,128 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-09-23 21:28:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:28:12,129 INFO L225 Difference]: With dead ends: 85 [2018-09-23 21:28:12,129 INFO L226 Difference]: Without dead ends: 83 [2018-09-23 21:28:12,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=588, Invalid=3318, Unknown=0, NotChecked=0, Total=3906 [2018-09-23 21:28:12,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-23 21:28:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-23 21:28:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-23 21:28:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-09-23 21:28:12,161 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-09-23 21:28:12,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:28:12,161 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-09-23 21:28:12,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-23 21:28:12,162 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-09-23 21:28:12,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-23 21:28:12,162 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:28:12,162 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2018-09-23 21:28:12,163 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:28:12,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:28:12,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1640865895, now seen corresponding path program 28 times [2018-09-23 21:28:12,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:28:12,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:28:12,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:12,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:28:12,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:28:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:28:13,221 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:28:13,221 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:28:13,229 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 21:28:13,255 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 21:28:13,255 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:28:13,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:28:14,219 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 8 treesize of output 7 [2018-09-23 21:28:14,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:28:14,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:28:14,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:28:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-09-23 21:28:14,314 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:28:14,314 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 22] total 62 [2018-09-23 21:28:14,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-23 21:28:14,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-23 21:28:14,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=3624, Unknown=0, NotChecked=0, Total=3782 [2018-09-23 21:28:14,316 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 62 states. [2018-09-23 21:28:17,281 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-23 21:28:17,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:28:17,491 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-09-23 21:28:17,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-23 21:28:17,492 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 82 [2018-09-23 21:28:17,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:28:17,493 INFO L225 Difference]: With dead ends: 131 [2018-09-23 21:28:17,493 INFO L226 Difference]: Without dead ends: 87 [2018-09-23 21:28:17,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=358, Invalid=6952, Unknown=0, NotChecked=0, Total=7310 [2018-09-23 21:28:17,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-23 21:28:17,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-23 21:28:17,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-23 21:28:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-09-23 21:28:17,539 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2018-09-23 21:28:17,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:28:17,540 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-09-23 21:28:17,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-23 21:28:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-09-23 21:28:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-23 21:28:17,540 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:28:17,541 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1] [2018-09-23 21:28:17,541 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:28:17,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:28:17,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1957273381, now seen corresponding path program 29 times [2018-09-23 21:28:17,541 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:28:17,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:28:17,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:17,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:28:17,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:28:18,581 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:28:18,582 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:28:18,582 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:28:18,590 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 21:28:18,721 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2018-09-23 21:28:18,721 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:28:18,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:28:20,821 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 8 treesize of output 7 [2018-09-23 21:28:20,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:28:20,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:28:20,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:28:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 306 proven. 534 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:28:20,929 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:28:20,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 83 [2018-09-23 21:28:20,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-23 21:28:20,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-23 21:28:20,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=663, Invalid=6309, Unknown=0, NotChecked=0, Total=6972 [2018-09-23 21:28:20,930 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 84 states. [2018-09-23 21:28:25,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:28:25,758 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-09-23 21:28:25,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-23 21:28:25,758 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 86 [2018-09-23 21:28:25,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:28:25,759 INFO L225 Difference]: With dead ends: 137 [2018-09-23 21:28:25,759 INFO L226 Difference]: Without dead ends: 91 [2018-09-23 21:28:25,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2976 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1431, Invalid=15861, Unknown=0, NotChecked=0, Total=17292 [2018-09-23 21:28:25,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-23 21:28:25,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-23 21:28:25,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-23 21:28:25,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-09-23 21:28:25,808 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2018-09-23 21:28:25,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:28:25,808 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-09-23 21:28:25,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-23 21:28:25,808 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-09-23 21:28:25,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-23 21:28:25,809 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:28:25,809 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2018-09-23 21:28:25,809 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:28:25,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:28:25,810 INFO L82 PathProgramCache]: Analyzing trace with hash -783456433, now seen corresponding path program 30 times [2018-09-23 21:28:25,810 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:28:25,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:28:25,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:25,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:28:25,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:28:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:28:26,926 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:28:26,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 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-23 21:28:26,933 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 21:28:27,034 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-09-23 21:28:27,034 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:28:27,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:28:28,277 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 8 treesize of output 7 [2018-09-23 21:28:28,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:28:28,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:28:28,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 21:28:28,356 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:28:28,377 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:28:28,378 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 69 [2018-09-23 21:28:28,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-23 21:28:28,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-23 21:28:28,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2018-09-23 21:28:28,379 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 70 states. [2018-09-23 21:28:31,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:28:31,182 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2018-09-23 21:28:31,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-23 21:28:31,182 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 90 [2018-09-23 21:28:31,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:28:31,183 INFO L225 Difference]: With dead ends: 139 [2018-09-23 21:28:31,183 INFO L226 Difference]: Without dead ends: 93 [2018-09-23 21:28:31,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=434, Invalid=8308, Unknown=0, NotChecked=0, Total=8742 [2018-09-23 21:28:31,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-23 21:28:31,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-23 21:28:31,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-23 21:28:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-09-23 21:28:31,234 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-09-23 21:28:31,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:28:31,235 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-09-23 21:28:31,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-23 21:28:31,235 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-09-23 21:28:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-23 21:28:31,235 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:28:31,236 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 1, 1, 1, 1] [2018-09-23 21:28:31,236 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:28:31,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:28:31,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1017783689, now seen corresponding path program 31 times [2018-09-23 21:28:31,236 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:28:31,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:28:31,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:31,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:28:31,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:28:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 462 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:28:31,690 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:28:31,690 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-23 21:28:31,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:28:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:28:31,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:28:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 462 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:28:31,798 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:28:31,798 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 25 [2018-09-23 21:28:31,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-23 21:28:31,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-23 21:28:31,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-09-23 21:28:31,799 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 26 states. [2018-09-23 21:28:32,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:28:32,230 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-09-23 21:28:32,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-23 21:28:32,230 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 92 [2018-09-23 21:28:32,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:28:32,231 INFO L225 Difference]: With dead ends: 97 [2018-09-23 21:28:32,231 INFO L226 Difference]: Without dead ends: 95 [2018-09-23 21:28:32,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-23 21:28:32,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-23 21:28:32,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-23 21:28:32,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-23 21:28:32,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-09-23 21:28:32,270 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-09-23 21:28:32,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:28:32,271 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-09-23 21:28:32,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-23 21:28:32,271 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-09-23 21:28:32,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-23 21:28:32,271 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:28:32,272 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1] [2018-09-23 21:28:32,272 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:28:32,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:28:32,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1162366013, now seen corresponding path program 32 times [2018-09-23 21:28:32,272 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:28:32,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:28:32,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:32,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:28:32,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:28:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:28:33,478 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:28:33,478 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-23 21:28:33,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:28:33,533 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:28:33,534 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:28:33,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:28:34,836 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 8 treesize of output 7 [2018-09-23 21:28:34,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:28:34,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:28:34,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 21:28:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:28:35,122 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:28:35,122 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 72 [2018-09-23 21:28:35,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-23 21:28:35,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-23 21:28:35,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=5042, Unknown=0, NotChecked=0, Total=5256 [2018-09-23 21:28:35,123 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 73 states. [2018-09-23 21:28:38,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:28:38,069 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2018-09-23 21:28:38,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-23 21:28:38,069 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 94 [2018-09-23 21:28:38,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:28:38,070 INFO L225 Difference]: With dead ends: 145 [2018-09-23 21:28:38,070 INFO L226 Difference]: Without dead ends: 97 [2018-09-23 21:28:38,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=453, Invalid=9053, Unknown=0, NotChecked=0, Total=9506 [2018-09-23 21:28:38,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-23 21:28:38,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-23 21:28:38,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-23 21:28:38,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-09-23 21:28:38,113 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2018-09-23 21:28:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:28:38,113 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-09-23 21:28:38,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-23 21:28:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-09-23 21:28:38,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-23 21:28:38,114 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:28:38,114 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 22, 1, 1, 1, 1] [2018-09-23 21:28:38,114 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:28:38,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:28:38,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1867070211, now seen corresponding path program 33 times [2018-09-23 21:28:38,115 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:28:38,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:28:38,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:38,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:28:38,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:28:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 506 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:28:38,618 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:28:38,618 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-23 21:28:38,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:28:38,748 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-09-23 21:28:38,749 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:28:38,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:28:39,340 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 8 treesize of output 7 [2018-09-23 21:28:39,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:28:39,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:28:39,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:28:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-09-23 21:28:39,558 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:28:39,558 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2018-09-23 21:28:39,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-23 21:28:39,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-23 21:28:39,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2076, Unknown=0, NotChecked=0, Total=2450 [2018-09-23 21:28:39,559 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 50 states. [2018-09-23 21:28:41,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:28:41,312 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-09-23 21:28:41,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-23 21:28:41,313 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-09-23 21:28:41,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:28:41,314 INFO L225 Difference]: With dead ends: 101 [2018-09-23 21:28:41,314 INFO L226 Difference]: Without dead ends: 99 [2018-09-23 21:28:41,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=800, Invalid=4750, Unknown=0, NotChecked=0, Total=5550 [2018-09-23 21:28:41,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-23 21:28:41,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-23 21:28:41,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-23 21:28:41,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-09-23 21:28:41,369 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-09-23 21:28:41,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:28:41,369 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-09-23 21:28:41,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-23 21:28:41,369 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-09-23 21:28:41,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-23 21:28:41,370 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:28:41,370 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2018-09-23 21:28:41,370 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:28:41,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:28:41,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1041909303, now seen corresponding path program 34 times [2018-09-23 21:28:41,370 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:28:41,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:28:41,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:41,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:28:41,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:28:42,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 1104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:28:42,965 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:28:42,965 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-23 21:28:42,972 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 21:28:43,008 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 21:28:43,009 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:28:43,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:28:44,343 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 8 treesize of output 7 [2018-09-23 21:28:44,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:28:44,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:28:44,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:28:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-09-23 21:28:44,478 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:28:44,478 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 26] total 74 [2018-09-23 21:28:44,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-23 21:28:44,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-23 21:28:44,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=5212, Unknown=0, NotChecked=0, Total=5402 [2018-09-23 21:28:44,479 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 74 states. [2018-09-23 21:28:48,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:28:48,509 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-09-23 21:28:48,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-23 21:28:48,509 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 98 [2018-09-23 21:28:48,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:28:48,510 INFO L225 Difference]: With dead ends: 155 [2018-09-23 21:28:48,510 INFO L226 Difference]: Without dead ends: 103 [2018-09-23 21:28:48,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=426, Invalid=9876, Unknown=0, NotChecked=0, Total=10302 [2018-09-23 21:28:48,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-23 21:28:48,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-23 21:28:48,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-23 21:28:48,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-09-23 21:28:48,557 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2018-09-23 21:28:48,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:28:48,558 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-09-23 21:28:48,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-23 21:28:48,558 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-09-23 21:28:48,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-23 21:28:48,558 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:28:48,558 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1] [2018-09-23 21:28:48,558 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:28:48,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:28:48,559 INFO L82 PathProgramCache]: Analyzing trace with hash -2122703189, now seen corresponding path program 35 times [2018-09-23 21:28:48,559 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:28:48,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:28:48,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:48,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:28:48,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:28:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 1200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:28:50,000 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:28:50,000 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-23 21:28:50,008 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 21:28:50,214 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-09-23 21:28:50,214 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:28:50,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:28:53,075 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 8 treesize of output 7 [2018-09-23 21:28:53,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:28:53,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:28:53,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:28:53,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 462 proven. 738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:28:53,194 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:28:53,195 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 99 [2018-09-23 21:28:53,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-23 21:28:53,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-23 21:28:53,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=937, Invalid=8963, Unknown=0, NotChecked=0, Total=9900 [2018-09-23 21:28:53,196 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 100 states. [2018-09-23 21:28:59,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:28:59,280 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2018-09-23 21:28:59,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-23 21:28:59,281 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 102 [2018-09-23 21:28:59,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:28:59,282 INFO L225 Difference]: With dead ends: 161 [2018-09-23 21:28:59,282 INFO L226 Difference]: Without dead ends: 107 [2018-09-23 21:28:59,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4198 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1945, Invalid=22235, Unknown=0, NotChecked=0, Total=24180 [2018-09-23 21:28:59,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-23 21:28:59,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-23 21:28:59,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-23 21:28:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-09-23 21:28:59,333 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 102 [2018-09-23 21:28:59,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:28:59,333 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-09-23 21:28:59,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-23 21:28:59,334 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-09-23 21:28:59,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-23 21:28:59,334 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:28:59,334 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2018-09-23 21:28:59,335 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:28:59,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:28:59,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1705231073, now seen corresponding path program 36 times [2018-09-23 21:28:59,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:28:59,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:28:59,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:59,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:28:59,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:28:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:29:02,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 1300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:29:02,037 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:29:02,037 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-23 21:29:02,043 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 21:29:02,188 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-09-23 21:29:02,188 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:29:02,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:29:03,802 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 8 treesize of output 7 [2018-09-23 21:29:03,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:29:03,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:29:03,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 21:29:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 1300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:29:03,915 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:29:03,915 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 81 [2018-09-23 21:29:03,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-23 21:29:03,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-23 21:29:03,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=6401, Unknown=0, NotChecked=0, Total=6642 [2018-09-23 21:29:03,917 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 82 states. [2018-09-23 21:29:07,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:29:07,892 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2018-09-23 21:29:07,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-23 21:29:07,892 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 106 [2018-09-23 21:29:07,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:29:07,893 INFO L225 Difference]: With dead ends: 163 [2018-09-23 21:29:07,893 INFO L226 Difference]: Without dead ends: 109 [2018-09-23 21:29:07,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=510, Invalid=11480, Unknown=0, NotChecked=0, Total=11990 [2018-09-23 21:29:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-23 21:29:07,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-23 21:29:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-23 21:29:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-09-23 21:29:07,951 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-09-23 21:29:07,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:29:07,952 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-09-23 21:29:07,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-23 21:29:07,952 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-09-23 21:29:07,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-23 21:29:07,952 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:29:07,953 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 25, 1, 1, 1, 1] [2018-09-23 21:29:07,953 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:29:07,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:29:07,953 INFO L82 PathProgramCache]: Analyzing trace with hash 653870937, now seen corresponding path program 37 times [2018-09-23 21:29:07,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:29:07,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:29:07,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:29:07,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:29:07,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:29:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:29:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 650 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:29:08,574 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:29:08,574 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-23 21:29:08,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:29:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:29:08,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:29:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 650 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:29:08,705 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:29:08,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 29 [2018-09-23 21:29:08,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-23 21:29:08,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-23 21:29:08,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-09-23 21:29:08,706 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 30 states. [2018-09-23 21:29:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:29:09,235 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2018-09-23 21:29:09,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-23 21:29:09,237 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 108 [2018-09-23 21:29:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:29:09,238 INFO L225 Difference]: With dead ends: 113 [2018-09-23 21:29:09,238 INFO L226 Difference]: Without dead ends: 111 [2018-09-23 21:29:09,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-23 21:29:09,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-23 21:29:09,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-23 21:29:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-23 21:29:09,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-09-23 21:29:09,294 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-09-23 21:29:09,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:29:09,294 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-09-23 21:29:09,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-23 21:29:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-09-23 21:29:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-23 21:29:09,295 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:29:09,295 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1] [2018-09-23 21:29:09,295 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:29:09,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:29:09,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1304797587, now seen corresponding path program 38 times [2018-09-23 21:29:09,295 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:29:09,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:29:09,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:29:09,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:29:09,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:29:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:29:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:29:11,199 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:29:11,199 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-23 21:29:11,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:29:11,274 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:29:11,274 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:29:11,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:29:13,203 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 8 treesize of output 7 [2018-09-23 21:29:13,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:29:13,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:29:13,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 21:29:13,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:29:13,327 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:29:13,327 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 84 [2018-09-23 21:29:13,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-23 21:29:13,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-23 21:29:13,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=6890, Unknown=0, NotChecked=0, Total=7140 [2018-09-23 21:29:13,329 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 85 states. [2018-09-23 21:29:18,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:29:18,314 INFO L93 Difference]: Finished difference Result 169 states and 171 transitions. [2018-09-23 21:29:18,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-23 21:29:18,314 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 110 [2018-09-23 21:29:18,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:29:18,316 INFO L225 Difference]: With dead ends: 169 [2018-09-23 21:29:18,316 INFO L226 Difference]: Without dead ends: 113 [2018-09-23 21:29:18,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=529, Invalid=12353, Unknown=0, NotChecked=0, Total=12882 [2018-09-23 21:29:18,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-23 21:29:18,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-23 21:29:18,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-23 21:29:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-09-23 21:29:18,376 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2018-09-23 21:29:18,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:29:18,376 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-09-23 21:29:18,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-23 21:29:18,376 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-09-23 21:29:18,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-23 21:29:18,376 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:29:18,377 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 26, 1, 1, 1, 1] [2018-09-23 21:29:18,377 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:29:18,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:29:18,377 INFO L82 PathProgramCache]: Analyzing trace with hash -738263347, now seen corresponding path program 39 times [2018-09-23 21:29:18,377 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:29:18,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:29:18,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:29:18,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:29:18,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:29:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:29:19,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 702 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:29:19,718 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:29:19,718 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-23 21:29:19,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:29:19,914 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-09-23 21:29:19,914 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:29:19,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:29:22,037 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 8 treesize of output 7 [2018-09-23 21:29:22,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:29:22,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:29:22,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:29:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-09-23 21:29:22,126 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:29:22,127 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 58 [2018-09-23 21:29:22,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-23 21:29:22,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-23 21:29:22,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=2814, Unknown=0, NotChecked=0, Total=3306 [2018-09-23 21:29:22,128 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 58 states. [2018-09-23 21:29:24,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:29:24,191 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-09-23 21:29:24,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-23 21:29:24,191 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-09-23 21:29:24,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:29:24,192 INFO L225 Difference]: With dead ends: 117 [2018-09-23 21:29:24,192 INFO L226 Difference]: Without dead ends: 115 [2018-09-23 21:29:24,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1538 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1044, Invalid=6438, Unknown=0, NotChecked=0, Total=7482 [2018-09-23 21:29:24,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-23 21:29:24,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-23 21:29:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-23 21:29:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-09-23 21:29:24,255 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-09-23 21:29:24,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:29:24,256 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-09-23 21:29:24,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-23 21:29:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-09-23 21:29:24,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-23 21:29:24,256 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:29:24,257 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2018-09-23 21:29:24,257 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:29:24,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:29:24,257 INFO L82 PathProgramCache]: Analyzing trace with hash -801420281, now seen corresponding path program 40 times [2018-09-23 21:29:24,257 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:29:24,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:29:24,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:29:24,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:29:24,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:29:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:29:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:29:26,452 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:29:26,452 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-23 21:29:26,459 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 21:29:26,501 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 21:29:26,501 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:29:26,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:29:28,370 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 8 treesize of output 7 [2018-09-23 21:29:28,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:29:28,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:29:28,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:29:28,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-09-23 21:29:28,489 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:29:28,489 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 30] total 86 [2018-09-23 21:29:28,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-23 21:29:28,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-23 21:29:28,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=7088, Unknown=0, NotChecked=0, Total=7310 [2018-09-23 21:29:28,490 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 86 states. [2018-09-23 21:29:33,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:29:33,996 INFO L93 Difference]: Finished difference Result 179 states and 183 transitions. [2018-09-23 21:29:33,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-23 21:29:33,997 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 114 [2018-09-23 21:29:33,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:29:33,998 INFO L225 Difference]: With dead ends: 179 [2018-09-23 21:29:33,998 INFO L226 Difference]: Without dead ends: 119 [2018-09-23 21:29:33,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=494, Invalid=13312, Unknown=0, NotChecked=0, Total=13806 [2018-09-23 21:29:33,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-23 21:29:34,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-23 21:29:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-23 21:29:34,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-09-23 21:29:34,064 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2018-09-23 21:29:34,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:29:34,064 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-09-23 21:29:34,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-23 21:29:34,064 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-09-23 21:29:34,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-23 21:29:34,065 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:29:34,065 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1] [2018-09-23 21:29:34,065 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:29:34,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:29:34,066 INFO L82 PathProgramCache]: Analyzing trace with hash -2050868101, now seen corresponding path program 41 times [2018-09-23 21:29:34,066 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:29:34,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:29:34,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:29:34,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:29:34,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:29:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:29:37,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 1624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:29:37,147 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:29:37,147 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-23 21:29:37,156 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 21:29:37,484 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-09-23 21:29:37,484 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:29:37,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:29:41,061 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 8 treesize of output 7 [2018-09-23 21:29:41,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:29:41,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:29:41,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:29:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 650 proven. 974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:29:41,196 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:29:41,196 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 115 [2018-09-23 21:29:41,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-23 21:29:41,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-23 21:29:41,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=12081, Unknown=0, NotChecked=0, Total=13340 [2018-09-23 21:29:41,198 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 116 states. [2018-09-23 21:29:49,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:29:49,338 INFO L93 Difference]: Finished difference Result 185 states and 189 transitions. [2018-09-23 21:29:49,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-23 21:29:49,338 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 118 [2018-09-23 21:29:49,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:29:49,340 INFO L225 Difference]: With dead ends: 185 [2018-09-23 21:29:49,340 INFO L226 Difference]: Without dead ends: 123 [2018-09-23 21:29:49,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5628 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=2539, Invalid=29681, Unknown=0, NotChecked=0, Total=32220 [2018-09-23 21:29:49,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-23 21:29:49,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-23 21:29:49,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-23 21:29:49,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-09-23 21:29:49,432 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 118 [2018-09-23 21:29:49,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:29:49,432 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-09-23 21:29:49,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-23 21:29:49,433 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-09-23 21:29:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-23 21:29:49,433 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:29:49,434 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2018-09-23 21:29:49,434 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:29:49,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:29:49,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1042320657, now seen corresponding path program 42 times [2018-09-23 21:29:49,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:29:49,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:29:49,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:29:49,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:29:49,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:29:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:29:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 1740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:29:51,594 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:29:51,594 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-23 21:29:51,601 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 21:29:51,821 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2018-09-23 21:29:51,821 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:29:51,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:29:53,982 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 8 treesize of output 7 [2018-09-23 21:29:53,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:29:53,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:29:53,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:29:54,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2018-09-23 21:29:54,125 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:29:54,126 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 32] total 92 [2018-09-23 21:29:54,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-23 21:29:54,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-23 21:29:54,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=8134, Unknown=0, NotChecked=0, Total=8372 [2018-09-23 21:29:54,127 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 92 states. [2018-09-23 21:30:00,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:30:00,244 INFO L93 Difference]: Finished difference Result 191 states and 195 transitions. [2018-09-23 21:30:00,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-23 21:30:00,244 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 122 [2018-09-23 21:30:00,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:30:00,246 INFO L225 Difference]: With dead ends: 191 [2018-09-23 21:30:00,246 INFO L226 Difference]: Without dead ends: 127 [2018-09-23 21:30:00,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=528, Invalid=15222, Unknown=0, NotChecked=0, Total=15750 [2018-09-23 21:30:00,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-23 21:30:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-23 21:30:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-23 21:30:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-09-23 21:30:00,317 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 122 [2018-09-23 21:30:00,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:30:00,317 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-09-23 21:30:00,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-23 21:30:00,317 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-09-23 21:30:00,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-23 21:30:00,318 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:30:00,318 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1] [2018-09-23 21:30:00,318 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:30:00,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:30:00,319 INFO L82 PathProgramCache]: Analyzing trace with hash -2020085917, now seen corresponding path program 43 times [2018-09-23 21:30:00,319 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:30:00,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:30:00,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:00,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:30:00,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:30:02,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 1860 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:30:02,685 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:30:02,685 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-23 21:30:02,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:30:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:30:02,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:30:04,994 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 8 treesize of output 7 [2018-09-23 21:30:04,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:30:04,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:30:05,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 21:30:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 1860 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:30:05,128 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:30:05,128 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 96 [2018-09-23 21:30:05,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-23 21:30:05,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-23 21:30:05,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=9026, Unknown=0, NotChecked=0, Total=9312 [2018-09-23 21:30:05,129 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 97 states. [2018-09-23 21:30:10,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:30:10,208 INFO L93 Difference]: Finished difference Result 193 states and 195 transitions. [2018-09-23 21:30:10,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-23 21:30:10,209 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 126 [2018-09-23 21:30:10,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:30:10,210 INFO L225 Difference]: With dead ends: 193 [2018-09-23 21:30:10,210 INFO L226 Difference]: Without dead ends: 129 [2018-09-23 21:30:10,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=605, Invalid=16165, Unknown=0, NotChecked=0, Total=16770 [2018-09-23 21:30:10,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-23 21:30:10,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-23 21:30:10,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-23 21:30:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-09-23 21:30:10,304 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-09-23 21:30:10,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:30:10,304 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-09-23 21:30:10,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-23 21:30:10,304 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-09-23 21:30:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-23 21:30:10,305 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:30:10,305 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 30, 1, 1, 1, 1] [2018-09-23 21:30:10,305 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:30:10,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:30:10,305 INFO L82 PathProgramCache]: Analyzing trace with hash 2012453021, now seen corresponding path program 44 times [2018-09-23 21:30:10,305 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:30:10,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:30:10,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:10,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:30:10,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:30:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 930 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:30:11,895 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:30:11,895 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-23 21:30:11,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:30:11,975 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:30:11,975 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:30:11,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:30:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 930 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:30:12,037 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:30:12,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 34 [2018-09-23 21:30:12,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-23 21:30:12,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-23 21:30:12,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-09-23 21:30:12,039 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 35 states. [2018-09-23 21:30:12,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:30:12,804 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2018-09-23 21:30:12,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-23 21:30:12,805 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 128 [2018-09-23 21:30:12,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:30:12,805 INFO L225 Difference]: With dead ends: 133 [2018-09-23 21:30:12,805 INFO L226 Difference]: Without dead ends: 131 [2018-09-23 21:30:12,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-23 21:30:12,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-23 21:30:12,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-23 21:30:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-23 21:30:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-09-23 21:30:12,880 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-09-23 21:30:12,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:30:12,880 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-09-23 21:30:12,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-23 21:30:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-09-23 21:30:12,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-23 21:30:12,880 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:30:12,880 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2018-09-23 21:30:12,881 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:30:12,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:30:12,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1232122327, now seen corresponding path program 45 times [2018-09-23 21:30:12,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:30:12,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:30:12,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:12,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:30:12,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:30:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 1984 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:30:15,400 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:30:15,400 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-23 21:30:15,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:30:15,667 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-09-23 21:30:15,668 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:30:15,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:30:18,433 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 8 treesize of output 7 [2018-09-23 21:30:18,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:30:18,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:30:18,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 21:30:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 1984 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:30:18,578 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:30:18,578 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 99 [2018-09-23 21:30:18,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-23 21:30:18,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-23 21:30:18,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=9605, Unknown=0, NotChecked=0, Total=9900 [2018-09-23 21:30:18,580 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 100 states. [2018-09-23 21:30:24,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:30:24,356 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2018-09-23 21:30:24,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-23 21:30:24,356 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 130 [2018-09-23 21:30:24,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:30:24,357 INFO L225 Difference]: With dead ends: 199 [2018-09-23 21:30:24,357 INFO L226 Difference]: Without dead ends: 133 [2018-09-23 21:30:24,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2089 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=624, Invalid=17198, Unknown=0, NotChecked=0, Total=17822 [2018-09-23 21:30:24,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-23 21:30:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-23 21:30:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-23 21:30:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-09-23 21:30:24,433 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-09-23 21:30:24,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:30:24,433 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-09-23 21:30:24,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-23 21:30:24,433 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-09-23 21:30:24,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-23 21:30:24,434 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:30:24,434 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 31, 1, 1, 1, 1] [2018-09-23 21:30:24,434 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:30:24,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:30:24,434 INFO L82 PathProgramCache]: Analyzing trace with hash -452907503, now seen corresponding path program 46 times [2018-09-23 21:30:24,435 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:30:24,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:30:24,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:24,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:30:24,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:30:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 992 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:30:25,885 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:30:25,885 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-23 21:30:25,892 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 21:30:25,944 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 21:30:25,945 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:30:25,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:30:27,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 21:30:27,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:30:27,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:30:27,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:30:27,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-09-23 21:30:27,422 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:30:27,422 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 68 [2018-09-23 21:30:27,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-23 21:30:27,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-23 21:30:27,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=662, Invalid=3894, Unknown=0, NotChecked=0, Total=4556 [2018-09-23 21:30:27,423 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 68 states. [2018-09-23 21:30:30,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:30:30,365 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-09-23 21:30:30,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-23 21:30:30,365 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-09-23 21:30:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:30:30,366 INFO L225 Difference]: With dead ends: 137 [2018-09-23 21:30:30,366 INFO L226 Difference]: Without dead ends: 135 [2018-09-23 21:30:30,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2143 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1394, Invalid=8908, Unknown=0, NotChecked=0, Total=10302 [2018-09-23 21:30:30,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-23 21:30:30,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-23 21:30:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-23 21:30:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-09-23 21:30:30,458 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-09-23 21:30:30,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:30:30,459 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-09-23 21:30:30,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-23 21:30:30,459 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-09-23 21:30:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-23 21:30:30,459 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:30:30,460 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1] [2018-09-23 21:30:30,460 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:30:30,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:30:30,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1452361141, now seen corresponding path program 47 times [2018-09-23 21:30:30,461 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:30:30,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:30:30,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:30,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:30:30,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:30:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 2112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:30:33,594 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:30:33,594 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-23 21:30:33,602 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 21:30:34,063 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2018-09-23 21:30:34,063 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:30:34,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:30:38,867 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 8 treesize of output 7 [2018-09-23 21:30:38,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:30:38,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:30:38,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 21:30:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 870 proven. 1242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:30:39,015 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:30:39,015 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 131 [2018-09-23 21:30:39,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-23 21:30:39,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-23 21:30:39,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1629, Invalid=15663, Unknown=0, NotChecked=0, Total=17292 [2018-09-23 21:30:39,016 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 132 states. [2018-09-23 21:30:44,617 WARN L178 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-09-23 21:30:49,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:30:49,317 INFO L93 Difference]: Finished difference Result 209 states and 213 transitions. [2018-09-23 21:30:49,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-23 21:30:49,318 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 134 [2018-09-23 21:30:49,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:30:49,319 INFO L225 Difference]: With dead ends: 209 [2018-09-23 21:30:49,319 INFO L226 Difference]: Without dead ends: 139 [2018-09-23 21:30:49,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7266 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=3213, Invalid=38199, Unknown=0, NotChecked=0, Total=41412 [2018-09-23 21:30:49,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-23 21:30:49,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-23 21:30:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-23 21:30:49,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-09-23 21:30:49,400 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2018-09-23 21:30:49,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:30:49,400 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-09-23 21:30:49,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-23 21:30:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-09-23 21:30:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-23 21:30:49,400 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:30:49,401 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2018-09-23 21:30:49,401 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:30:49,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:30:49,401 INFO L82 PathProgramCache]: Analyzing trace with hash 957810879, now seen corresponding path program 48 times [2018-09-23 21:30:49,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:30:49,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:30:49,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:49,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:30:49,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:30:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:30:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 2244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:30:51,820 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:30:51,820 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-23 21:30:51,828 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 21:30:52,128 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2018-09-23 21:30:52,129 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:30:52,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:30:55,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 21:30:55,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:30:55,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:30:55,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 21:30:55,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 2244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:30:55,224 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:30:55,224 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 105 [2018-09-23 21:30:55,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-23 21:30:55,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-23 21:30:55,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=10817, Unknown=0, NotChecked=0, Total=11130 [2018-09-23 21:30:55,225 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 106 states. [2018-09-23 21:31:01,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:01,598 INFO L93 Difference]: Finished difference Result 211 states and 213 transitions. [2018-09-23 21:31:01,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-23 21:31:01,599 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 138 [2018-09-23 21:31:01,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:01,600 INFO L225 Difference]: With dead ends: 211 [2018-09-23 21:31:01,600 INFO L226 Difference]: Without dead ends: 141 [2018-09-23 21:31:01,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2355 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=662, Invalid=19360, Unknown=0, NotChecked=0, Total=20022 [2018-09-23 21:31:01,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-23 21:31:01,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-23 21:31:01,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-23 21:31:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-09-23 21:31:01,690 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-09-23 21:31:01,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:01,691 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-09-23 21:31:01,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-23 21:31:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-09-23 21:31:01,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-23 21:31:01,691 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:01,691 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 33, 1, 1, 1, 1] [2018-09-23 21:31:01,692 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:01,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:01,692 INFO L82 PathProgramCache]: Analyzing trace with hash 32287481, now seen corresponding path program 49 times [2018-09-23 21:31:01,692 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:01,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:01,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:01,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:31:01,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:02,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1122 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:31:02,979 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:31:02,979 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-23 21:31:02,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:03,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:31:03,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1122 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:31:03,123 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:31:03,123 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 37 [2018-09-23 21:31:03,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-23 21:31:03,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-23 21:31:03,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-09-23 21:31:03,124 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 38 states. [2018-09-23 21:31:04,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:04,193 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2018-09-23 21:31:04,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-23 21:31:04,194 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 140 [2018-09-23 21:31:04,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:04,195 INFO L225 Difference]: With dead ends: 145 [2018-09-23 21:31:04,195 INFO L226 Difference]: Without dead ends: 143 [2018-09-23 21:31:04,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-23 21:31:04,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-23 21:31:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-23 21:31:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-23 21:31:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-09-23 21:31:04,276 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2018-09-23 21:31:04,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:04,276 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-09-23 21:31:04,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-23 21:31:04,276 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-09-23 21:31:04,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-23 21:31:04,277 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:04,277 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1] [2018-09-23 21:31:04,277 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:04,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:04,278 INFO L82 PathProgramCache]: Analyzing trace with hash 963550515, now seen corresponding path program 50 times [2018-09-23 21:31:04,278 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:04,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:04,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:04,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:04,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:06,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:31:06,844 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:31:06,844 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-23 21:31:06,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:31:06,930 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:31:06,930 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:31:06,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:31:10,015 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 8 treesize of output 7 [2018-09-23 21:31:10,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:31:10,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:31:10,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 21:31:10,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:31:10,170 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:31:10,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 108 [2018-09-23 21:31:10,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-23 21:31:10,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-23 21:31:10,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=11450, Unknown=0, NotChecked=0, Total=11772 [2018-09-23 21:31:10,172 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 109 states. Received shutdown request... [2018-09-23 21:31:10,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-23 21:31:10,551 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-23 21:31:10,557 WARN L206 ceAbstractionStarter]: Timeout [2018-09-23 21:31:10,557 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 09:31:10 BoogieIcfgContainer [2018-09-23 21:31:10,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 21:31:10,558 INFO L168 Benchmark]: Toolchain (without parser) took 239290.39 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -391.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-09-23 21:31:10,559 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:31:10,559 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.40 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-23 21:31:10,559 INFO L168 Benchmark]: Boogie Preprocessor took 25.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:31:10,560 INFO L168 Benchmark]: RCFGBuilder took 358.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-23 21:31:10,560 INFO L168 Benchmark]: TraceAbstraction took 238856.07 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -412.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-09-23 21:31:10,561 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.40 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 25.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 358.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 238856.07 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -412.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 80). Cancelled while BasicCegarLoop was constructing difference of abstraction (143states) and FLOYD_HOARE automaton (currently 9 states, 109 states before enhancement), while ReachableStatesComputation was computing reachable states (13 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. TIMEOUT Result, 238.7s OverallTime, 52 OverallIterations, 35 TraceHistogramMax, 119.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1729 SDtfs, 5023 SDslu, 73750 SDs, 0 SdLazy, 78760 SolverSat, 5532 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6779 GetRequests, 3106 SyntacticMatches, 24 SemanticMatches, 3649 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50600 ImplicationChecksByTransitivity, 157.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 51 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 109.2s InterpolantComputationTime, 7566 NumberOfCodeBlocks, 7413 NumberOfCodeBlocksAsserted, 529 NumberOfCheckSat, 7463 ConstructedInterpolants, 0 QuantifiedInterpolants, 4137911 SizeOfPredicates, 297 NumberOfNonLiveVariables, 12745 ConjunctsInSsa, 3768 ConjunctsInUnsatCore, 103 InterpolantComputations, 1 PerfectInterpolantSequences, 18946/83904 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/invert_string.i_4.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_21-31-10-569.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/invert_string.i_4.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_21-31-10-569.csv Completed graceful shutdown