java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/loop__barthe.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:52:44,076 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:52:44,078 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:52:44,093 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:52:44,093 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:52:44,095 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:52:44,096 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:52:44,103 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:52:44,105 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:52:44,105 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:52:44,108 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:52:44,108 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:52:44,109 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:52:44,110 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:52:44,111 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:52:44,113 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:52:44,115 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:52:44,117 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:52:44,118 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:52:44,119 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:52:44,120 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:52:44,123 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:52:44,123 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:52:44,123 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:52:44,124 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:52:44,125 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:52:44,125 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:52:44,126 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:52:44,127 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:52:44,127 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:52:44,128 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:52:44,128 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:52:44,129 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:52:44,130 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:52:44,130 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:52:44,130 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:52:44,143 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:52:44,144 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:52:44,144 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:52:44,144 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:52:44,145 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:52:44,145 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:52:44,146 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:52:44,146 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:52:44,146 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:52:44,146 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:52:44,146 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:52:44,147 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:52:44,147 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:52:44,147 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:52:44,147 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:52:44,147 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:52:44,148 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:52:44,148 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:52:44,148 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:52:44,148 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:52:44,148 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:52:44,149 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:52:44,151 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:52:44,197 INFO ]: Repository-Root is: /tmp [2018-06-25 09:52:44,209 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:52:44,213 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:52:44,216 INFO ]: Initializing SmtParser... [2018-06-25 09:52:44,216 INFO ]: SmtParser initialized [2018-06-25 09:52:44,217 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe.smt2 [2018-06-25 09:52:44,218 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 09:52:44,307 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@54f483f7 [2018-06-25 09:52:44,509 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe.smt2 [2018-06-25 09:52:44,522 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:52:44,527 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:52:44,528 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:52:44,528 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:52:44,528 INFO ]: ChcToBoogie initialized [2018-06-25 09:52:44,537 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:52:44" (1/1) ... [2018-06-25 09:52:44,589 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:52:44 Unit [2018-06-25 09:52:44,590 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:52:44,590 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:52:44,590 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:52:44,590 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:52:44,612 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:52:44" (1/1) ... [2018-06-25 09:52:44,612 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:52:44" (1/1) ... [2018-06-25 09:52:44,618 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:52:44" (1/1) ... [2018-06-25 09:52:44,618 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:52:44" (1/1) ... [2018-06-25 09:52:44,621 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:52:44" (1/1) ... [2018-06-25 09:52:44,624 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:52:44" (1/1) ... [2018-06-25 09:52:44,625 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:52:44" (1/1) ... [2018-06-25 09:52:44,626 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:52:44,627 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:52:44,627 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:52:44,627 INFO ]: RCFGBuilder initialized [2018-06-25 09:52:44,627 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:52:44" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 09:52:44,643 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:52:44,643 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:52:44,643 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:52:44,643 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:52:44,644 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:52:44,644 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:52:44,879 INFO ]: Using library mode [2018-06-25 09:52:44,879 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:52:44 BoogieIcfgContainer [2018-06-25 09:52:44,880 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:52:44,881 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:52:44,887 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:52:44,890 INFO ]: TraceAbstraction initialized [2018-06-25 09:52:44,891 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:52:44" (1/3) ... [2018-06-25 09:52:44,891 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4578f2a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:52:44, skipping insertion in model container [2018-06-25 09:52:44,891 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:52:44" (2/3) ... [2018-06-25 09:52:44,892 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4578f2a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:52:44, skipping insertion in model container [2018-06-25 09:52:44,892 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:52:44" (3/3) ... [2018-06-25 09:52:44,893 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:52:44,904 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:52:44,911 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:52:44,955 INFO ]: Using default assertion order modulation [2018-06-25 09:52:44,956 INFO ]: Interprodecural is true [2018-06-25 09:52:44,956 INFO ]: Hoare is false [2018-06-25 09:52:44,956 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:52:44,956 INFO ]: Backedges is TWOTRACK [2018-06-25 09:52:44,956 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:52:44,956 INFO ]: Difference is false [2018-06-25 09:52:44,956 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:52:44,956 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:52:44,968 INFO ]: Start isEmpty. Operand 10 states. [2018-06-25 09:52:44,978 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:52:44,978 INFO ]: Found error trace [2018-06-25 09:52:44,979 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:44,979 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:44,986 INFO ]: Analyzing trace with hash -204663978, now seen corresponding path program 1 times [2018-06-25 09:52:44,987 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:44,988 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:45,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:45,025 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:52:45,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:45,062 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:45,146 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:45,147 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:52:45,147 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:52:45,149 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:52:45,158 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:52:45,159 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:52:45,160 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-25 09:52:45,221 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:45,221 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-25 09:52:45,221 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:52:45,223 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:52:45,223 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:45,230 INFO ]: With dead ends: 9 [2018-06-25 09:52:45,230 INFO ]: Without dead ends: 9 [2018-06-25 09:52:45,232 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:52:45,249 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 09:52:45,266 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 09:52:45,267 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:52:45,268 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-25 09:52:45,269 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-25 09:52:45,269 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:45,269 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-25 09:52:45,269 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:52:45,269 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-25 09:52:45,270 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:52:45,270 INFO ]: Found error trace [2018-06-25 09:52:45,270 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:45,274 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:45,274 INFO ]: Analyzing trace with hash -2057099186, now seen corresponding path program 1 times [2018-06-25 09:52:45,274 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:45,274 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:45,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:45,275 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:52:45,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:45,306 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:45,379 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:45,379 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:52:45,380 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:52:45,381 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:52:45,381 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:52:45,381 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:52:45,381 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 3 states. [2018-06-25 09:52:45,478 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:45,478 INFO ]: Finished difference Result 10 states and 16 transitions. [2018-06-25 09:52:45,478 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:52:45,478 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:52:45,478 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:45,479 INFO ]: With dead ends: 10 [2018-06-25 09:52:45,479 INFO ]: Without dead ends: 10 [2018-06-25 09:52:45,479 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:52:45,480 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:52:45,481 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-06-25 09:52:45,481 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:52:45,481 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-25 09:52:45,481 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 8 [2018-06-25 09:52:45,481 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:45,481 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-25 09:52:45,481 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:52:45,482 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-25 09:52:45,482 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:52:45,482 INFO ]: Found error trace [2018-06-25 09:52:45,482 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:45,482 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:45,482 INFO ]: Analyzing trace with hash -2053405102, now seen corresponding path program 1 times [2018-06-25 09:52:45,482 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:45,482 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:45,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:45,483 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:52:45,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:45,495 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:45,533 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:45,533 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:52:45,533 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:52:45,533 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:52:45,534 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:52:45,534 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:52:45,534 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 3 states. [2018-06-25 09:52:45,591 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:45,591 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-25 09:52:45,592 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:52:45,592 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:52:45,592 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:45,592 INFO ]: With dead ends: 10 [2018-06-25 09:52:45,592 INFO ]: Without dead ends: 9 [2018-06-25 09:52:45,592 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:52:45,593 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 09:52:45,594 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 09:52:45,594 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:52:45,594 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-06-25 09:52:45,594 INFO ]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 8 [2018-06-25 09:52:45,594 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:45,594 INFO ]: Abstraction has 9 states and 11 transitions. [2018-06-25 09:52:45,594 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:52:45,594 INFO ]: Start isEmpty. Operand 9 states and 11 transitions. [2018-06-25 09:52:45,595 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:52:45,595 INFO ]: Found error trace [2018-06-25 09:52:45,595 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:45,595 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:45,595 INFO ]: Analyzing trace with hash -2048787497, now seen corresponding path program 1 times [2018-06-25 09:52:45,595 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:45,595 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:45,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:45,596 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:52:45,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:45,629 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:45,733 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:45,733 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:45,733 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:45,740 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:52:45,787 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:45,796 INFO ]: Computing forward predicates... [2018-06-25 09:52:45,902 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:45,937 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:45,937 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 09:52:45,937 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:52:45,937 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:52:45,937 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:52:45,938 INFO ]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2018-06-25 09:52:46,026 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:46,026 INFO ]: Finished difference Result 11 states and 15 transitions. [2018-06-25 09:52:46,027 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:52:46,027 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-25 09:52:46,027 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:46,027 INFO ]: With dead ends: 11 [2018-06-25 09:52:46,027 INFO ]: Without dead ends: 11 [2018-06-25 09:52:46,027 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:52:46,027 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:52:46,029 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-25 09:52:46,029 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:52:46,029 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-06-25 09:52:46,029 INFO ]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 8 [2018-06-25 09:52:46,029 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:46,029 INFO ]: Abstraction has 10 states and 13 transitions. [2018-06-25 09:52:46,029 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:52:46,029 INFO ]: Start isEmpty. Operand 10 states and 13 transitions. [2018-06-25 09:52:46,030 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:52:46,030 INFO ]: Found error trace [2018-06-25 09:52:46,030 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:46,030 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:46,030 INFO ]: Analyzing trace with hash 655263199, now seen corresponding path program 1 times [2018-06-25 09:52:46,030 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:46,030 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:46,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:46,031 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:52:46,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:46,045 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:46,112 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:46,112 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:46,112 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:46,118 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:52:46,157 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:46,160 INFO ]: Computing forward predicates... [2018-06-25 09:52:46,296 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:46,315 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:46,315 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-06-25 09:52:46,315 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:52:46,316 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:52:46,316 INFO ]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:52:46,316 INFO ]: Start difference. First operand 10 states and 13 transitions. Second operand 7 states. [2018-06-25 09:52:46,561 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:46,561 INFO ]: Finished difference Result 14 states and 21 transitions. [2018-06-25 09:52:46,561 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:52:46,561 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-25 09:52:46,561 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:46,561 INFO ]: With dead ends: 14 [2018-06-25 09:52:46,561 INFO ]: Without dead ends: 10 [2018-06-25 09:52:46,562 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:52:46,562 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:52:46,563 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:52:46,563 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:52:46,563 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-25 09:52:46,563 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 9 [2018-06-25 09:52:46,563 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:46,563 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-25 09:52:46,564 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:52:46,564 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-25 09:52:46,564 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:52:46,564 INFO ]: Found error trace [2018-06-25 09:52:46,564 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:46,564 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:46,564 INFO ]: Analyzing trace with hash 912925558, now seen corresponding path program 2 times [2018-06-25 09:52:46,564 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:46,564 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:46,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:46,565 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:52:46,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:46,584 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:46,764 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:46,764 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:46,764 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:46,775 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:52:46,819 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:52:46,819 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:46,822 INFO ]: Computing forward predicates... [2018-06-25 09:52:47,037 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:47,057 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:47,057 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 09:52:47,057 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:52:47,058 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:52:47,058 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:52:47,058 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2018-06-25 09:52:47,087 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:47,087 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-25 09:52:47,087 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:52:47,087 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-25 09:52:47,087 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:47,087 INFO ]: With dead ends: 11 [2018-06-25 09:52:47,087 INFO ]: Without dead ends: 11 [2018-06-25 09:52:47,088 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:52:47,088 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:52:47,089 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 09:52:47,089 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:52:47,089 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-25 09:52:47,089 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-25 09:52:47,089 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:47,089 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-25 09:52:47,089 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:52:47,089 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-25 09:52:47,090 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:52:47,090 INFO ]: Found error trace [2018-06-25 09:52:47,090 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:47,090 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:47,090 INFO ]: Analyzing trace with hash -1763250249, now seen corresponding path program 3 times [2018-06-25 09:52:47,090 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:47,090 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:47,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:47,091 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:47,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:47,114 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:47,426 WARN ]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-25 09:52:47,428 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:47,428 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:47,428 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:47,444 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:52:47,512 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:52:47,512 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:47,515 INFO ]: Computing forward predicates... [2018-06-25 09:52:47,665 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:47,689 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:47,689 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-25 09:52:47,690 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:52:47,690 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:52:47,690 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:52:47,690 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-06-25 09:52:47,731 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:47,731 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-25 09:52:47,731 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:52:47,731 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-25 09:52:47,731 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:47,731 INFO ]: With dead ends: 12 [2018-06-25 09:52:47,731 INFO ]: Without dead ends: 12 [2018-06-25 09:52:47,732 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:52:47,732 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 09:52:47,733 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 09:52:47,733 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:52:47,733 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-25 09:52:47,733 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-25 09:52:47,733 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:47,733 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-25 09:52:47,733 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:52:47,734 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-25 09:52:47,734 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:52:47,734 INFO ]: Found error trace [2018-06-25 09:52:47,734 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:47,734 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:47,734 INFO ]: Analyzing trace with hash 1174645654, now seen corresponding path program 4 times [2018-06-25 09:52:47,734 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:47,734 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:47,735 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:47,735 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:47,735 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:47,760 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:48,066 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:48,067 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:48,067 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:48,079 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:52:48,109 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:52:48,109 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:48,112 INFO ]: Computing forward predicates... [2018-06-25 09:52:48,150 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:48,172 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:48,172 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-25 09:52:48,172 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:52:48,172 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:52:48,172 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:52:48,172 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2018-06-25 09:52:48,290 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:48,290 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-25 09:52:48,291 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:52:48,291 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-25 09:52:48,291 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:48,291 INFO ]: With dead ends: 13 [2018-06-25 09:52:48,291 INFO ]: Without dead ends: 13 [2018-06-25 09:52:48,292 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:52:48,292 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:52:48,293 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 09:52:48,293 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:52:48,293 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-25 09:52:48,293 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-25 09:52:48,294 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:48,294 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-25 09:52:48,294 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:52:48,294 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-25 09:52:48,294 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:52:48,294 INFO ]: Found error trace [2018-06-25 09:52:48,294 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:48,294 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:48,294 INFO ]: Analyzing trace with hash 2055105431, now seen corresponding path program 5 times [2018-06-25 09:52:48,294 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:48,294 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:48,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:48,295 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:48,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:48,321 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:48,745 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:48,746 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:48,746 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:48,760 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:52:48,800 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 09:52:48,800 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:48,804 INFO ]: Computing forward predicates... [2018-06-25 09:52:48,879 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:48,911 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:48,911 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-25 09:52:48,912 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:52:48,912 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:52:48,912 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:52:48,912 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2018-06-25 09:52:49,026 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:49,026 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-25 09:52:49,027 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 09:52:49,027 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-25 09:52:49,027 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:49,027 INFO ]: With dead ends: 14 [2018-06-25 09:52:49,027 INFO ]: Without dead ends: 14 [2018-06-25 09:52:49,028 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:52:49,028 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:52:49,029 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 09:52:49,029 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:52:49,030 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-25 09:52:49,030 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-25 09:52:49,030 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:49,030 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-25 09:52:49,030 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:52:49,030 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-25 09:52:49,030 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:52:49,030 INFO ]: Found error trace [2018-06-25 09:52:49,030 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:49,030 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:49,030 INFO ]: Analyzing trace with hash -715412554, now seen corresponding path program 6 times [2018-06-25 09:52:49,030 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:49,030 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:49,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:49,031 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:49,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:49,058 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:49,298 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:49,298 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:49,298 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:49,305 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:52:49,350 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 09:52:49,350 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:49,354 INFO ]: Computing forward predicates... [2018-06-25 09:52:49,443 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:49,475 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:49,475 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-25 09:52:49,475 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:52:49,475 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:52:49,475 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:52:49,476 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2018-06-25 09:52:49,566 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:49,566 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-25 09:52:49,566 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:52:49,566 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-25 09:52:49,566 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:49,566 INFO ]: With dead ends: 15 [2018-06-25 09:52:49,566 INFO ]: Without dead ends: 15 [2018-06-25 09:52:49,567 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:52:49,567 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:52:49,568 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 09:52:49,568 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:52:49,568 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-25 09:52:49,568 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-25 09:52:49,568 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:49,568 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-25 09:52:49,568 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:52:49,568 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-25 09:52:49,568 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:52:49,568 INFO ]: Found error trace [2018-06-25 09:52:49,568 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:49,568 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:49,569 INFO ]: Analyzing trace with hash -702124169, now seen corresponding path program 7 times [2018-06-25 09:52:49,569 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:49,569 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:49,569 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:49,569 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:49,569 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:49,614 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:49,898 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:49,898 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:49,898 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:49,905 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:52:49,938 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:49,943 INFO ]: Computing forward predicates... [2018-06-25 09:52:50,138 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:50,158 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:50,158 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-06-25 09:52:50,158 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:52:50,158 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:52:50,158 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:52:50,159 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2018-06-25 09:52:50,211 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:50,212 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-25 09:52:50,212 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:52:50,212 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-25 09:52:50,212 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:50,212 INFO ]: With dead ends: 16 [2018-06-25 09:52:50,212 INFO ]: Without dead ends: 16 [2018-06-25 09:52:50,212 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:52:50,213 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 09:52:50,215 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-25 09:52:50,215 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 09:52:50,215 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-25 09:52:50,215 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-25 09:52:50,215 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:50,215 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-25 09:52:50,215 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:52:50,215 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-25 09:52:50,216 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:52:50,216 INFO ]: Found error trace [2018-06-25 09:52:50,216 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:50,216 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:50,216 INFO ]: Analyzing trace with hash -290184234, now seen corresponding path program 8 times [2018-06-25 09:52:50,216 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:50,216 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:50,218 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:50,218 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:52:50,218 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:50,244 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:50,471 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:50,471 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:50,471 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:50,477 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:52:50,534 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:52:50,534 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:50,542 INFO ]: Computing forward predicates... [2018-06-25 09:52:50,678 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:50,697 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:50,697 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-06-25 09:52:50,697 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:52:50,697 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:52:50,697 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:52:50,698 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 13 states. [2018-06-25 09:52:50,790 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:50,790 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-25 09:52:50,790 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:52:50,790 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-25 09:52:50,790 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:50,791 INFO ]: With dead ends: 17 [2018-06-25 09:52:50,791 INFO ]: Without dead ends: 17 [2018-06-25 09:52:50,791 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:52:50,791 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 09:52:50,792 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-25 09:52:50,792 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:52:50,793 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-25 09:52:50,793 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-25 09:52:50,793 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:50,793 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-25 09:52:50,793 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:52:50,793 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-25 09:52:50,793 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:52:50,793 INFO ]: Found error trace [2018-06-25 09:52:50,793 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:50,793 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:50,793 INFO ]: Analyzing trace with hash -404948137, now seen corresponding path program 9 times [2018-06-25 09:52:50,794 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:50,794 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:50,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:50,794 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:50,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:50,831 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:51,052 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:51,052 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:51,101 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:51,109 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:52:51,192 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-25 09:52:51,192 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:51,197 INFO ]: Computing forward predicates... [2018-06-25 09:52:51,235 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:51,254 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:51,254 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-25 09:52:51,254 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:52:51,255 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:52:51,255 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:52:51,255 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 13 states. [2018-06-25 09:52:51,388 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:51,388 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-25 09:52:51,389 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:52:51,389 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-25 09:52:51,390 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:51,390 INFO ]: With dead ends: 18 [2018-06-25 09:52:51,390 INFO ]: Without dead ends: 18 [2018-06-25 09:52:51,390 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:52:51,390 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 09:52:51,392 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-25 09:52:51,392 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:52:51,392 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-25 09:52:51,392 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-25 09:52:51,392 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:51,392 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-25 09:52:51,392 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:52:51,392 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-25 09:52:51,392 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:52:51,392 INFO ]: Found error trace [2018-06-25 09:52:51,393 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:51,393 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:51,393 INFO ]: Analyzing trace with hash 332338166, now seen corresponding path program 10 times [2018-06-25 09:52:51,393 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:51,393 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:51,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:51,393 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:51,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:51,423 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:51,699 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:51,699 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:51,699 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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) [2018-06-25 09:52:51,713 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:52:51,768 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:52:51,768 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:51,774 INFO ]: Computing forward predicates... [2018-06-25 09:52:51,823 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:51,842 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:51,842 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-25 09:52:51,843 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:52:51,843 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:52:51,843 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:52:51,843 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 14 states. [2018-06-25 09:52:51,998 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:51,998 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-25 09:52:51,999 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:52:51,999 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-25 09:52:51,999 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:51,999 INFO ]: With dead ends: 19 [2018-06-25 09:52:51,999 INFO ]: Without dead ends: 19 [2018-06-25 09:52:52,000 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:52:52,000 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:52:52,001 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-25 09:52:52,001 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:52:52,001 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-25 09:52:52,002 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-25 09:52:52,002 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:52,002 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-25 09:52:52,002 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:52:52,002 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-25 09:52:52,002 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:52:52,002 INFO ]: Found error trace [2018-06-25 09:52:52,002 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:52,002 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:52,002 INFO ]: Analyzing trace with hash 1713377079, now seen corresponding path program 11 times [2018-06-25 09:52:52,002 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:52,002 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:52,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:52,003 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:52,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:52,035 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:52,485 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:52,485 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:52,485 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:52,501 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:52:52,550 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-25 09:52:52,550 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:52,556 INFO ]: Computing forward predicates... [2018-06-25 09:52:52,640 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:52,659 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:52,659 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-25 09:52:52,659 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:52:52,660 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:52:52,660 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:52:52,660 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 15 states. [2018-06-25 09:52:52,767 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:52,767 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-25 09:52:52,768 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:52:52,768 INFO ]: Start accepts. Automaton has 15 states. Word has length 18 [2018-06-25 09:52:52,768 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:52,768 INFO ]: With dead ends: 20 [2018-06-25 09:52:52,768 INFO ]: Without dead ends: 20 [2018-06-25 09:52:52,768 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:52:52,768 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:52:52,770 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-25 09:52:52,770 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:52:52,770 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-25 09:52:52,770 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-25 09:52:52,770 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:52,770 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-25 09:52:52,770 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:52:52,771 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-25 09:52:52,771 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:52:52,771 INFO ]: Found error trace [2018-06-25 09:52:52,771 INFO ]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:52,771 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:52,771 INFO ]: Analyzing trace with hash 1575910422, now seen corresponding path program 12 times [2018-06-25 09:52:52,771 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:52,771 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:52,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:52,772 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:52,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:52,800 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:53,721 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:53,721 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:53,721 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:53,740 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:52:53,827 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-25 09:52:53,827 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:53,833 INFO ]: Computing forward predicates... [2018-06-25 09:52:54,266 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:54,297 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:54,297 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-25 09:52:54,297 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:52:54,297 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:52:54,297 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:52:54,297 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 16 states. [2018-06-25 09:52:54,625 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:54,625 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-25 09:52:54,625 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:52:54,625 INFO ]: Start accepts. Automaton has 16 states. Word has length 19 [2018-06-25 09:52:54,625 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:54,625 INFO ]: With dead ends: 21 [2018-06-25 09:52:54,625 INFO ]: Without dead ends: 21 [2018-06-25 09:52:54,626 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:52:54,626 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 09:52:54,627 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-25 09:52:54,627 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:52:54,628 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-25 09:52:54,628 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-25 09:52:54,628 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:54,628 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-25 09:52:54,628 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:52:54,628 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-25 09:52:54,628 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:52:54,628 INFO ]: Found error trace [2018-06-25 09:52:54,629 INFO ]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:54,629 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:54,630 INFO ]: Analyzing trace with hash 1609411351, now seen corresponding path program 13 times [2018-06-25 09:52:54,630 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:54,630 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:54,630 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:54,630 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:54,630 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:54,683 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:55,118 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:55,118 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:55,118 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:55,123 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:52:55,185 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:55,194 INFO ]: Computing forward predicates... [2018-06-25 09:52:55,628 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:55,647 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:55,647 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-25 09:52:55,647 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:52:55,648 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:52:55,648 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:52:55,648 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 17 states. [2018-06-25 09:52:55,885 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:55,885 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-25 09:52:55,885 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:52:55,885 INFO ]: Start accepts. Automaton has 17 states. Word has length 20 [2018-06-25 09:52:55,885 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:55,885 INFO ]: With dead ends: 22 [2018-06-25 09:52:55,885 INFO ]: Without dead ends: 22 [2018-06-25 09:52:55,885 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:52:55,886 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 09:52:55,887 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-25 09:52:55,887 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 09:52:55,887 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-25 09:52:55,887 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-25 09:52:55,888 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:55,888 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-25 09:52:55,888 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:52:55,888 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-25 09:52:55,888 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:52:55,888 INFO ]: Found error trace [2018-06-25 09:52:55,888 INFO ]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:55,888 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:55,888 INFO ]: Analyzing trace with hash -1647027146, now seen corresponding path program 14 times [2018-06-25 09:52:55,888 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:55,888 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:55,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:55,889 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:52:55,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:55,936 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:56,319 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:56,319 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:56,390 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:56,396 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:52:56,467 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:52:56,467 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:56,475 INFO ]: Computing forward predicates... [2018-06-25 09:52:56,636 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:56,667 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:56,667 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2018-06-25 09:52:56,667 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:52:56,667 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:52:56,668 INFO ]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:52:56,668 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 19 states. [2018-06-25 09:52:56,844 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:56,844 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-25 09:52:56,845 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:52:56,845 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-25 09:52:56,845 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:56,845 INFO ]: With dead ends: 23 [2018-06-25 09:52:56,845 INFO ]: Without dead ends: 23 [2018-06-25 09:52:56,846 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:52:56,846 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 09:52:56,847 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-25 09:52:56,847 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:52:56,848 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-06-25 09:52:56,848 INFO ]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-06-25 09:52:56,848 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:56,848 INFO ]: Abstraction has 23 states and 23 transitions. [2018-06-25 09:52:56,848 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:52:56,848 INFO ]: Start isEmpty. Operand 23 states and 23 transitions. [2018-06-25 09:52:56,848 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:52:56,848 INFO ]: Found error trace [2018-06-25 09:52:56,848 INFO ]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:56,849 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:56,849 INFO ]: Analyzing trace with hash 482594551, now seen corresponding path program 15 times [2018-06-25 09:52:56,849 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:56,849 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:56,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:56,849 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:56,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:56,907 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:57,361 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:57,362 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:57,362 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:57,382 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:52:57,442 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-25 09:52:57,442 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:57,449 INFO ]: Computing forward predicates... [2018-06-25 09:52:57,531 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:57,551 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:57,551 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-25 09:52:57,551 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:52:57,551 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:52:57,551 INFO ]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:52:57,551 INFO ]: Start difference. First operand 23 states and 23 transitions. Second operand 19 states. [2018-06-25 09:52:57,707 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:57,707 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-25 09:52:57,707 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 09:52:57,707 INFO ]: Start accepts. Automaton has 19 states. Word has length 22 [2018-06-25 09:52:57,707 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:57,707 INFO ]: With dead ends: 24 [2018-06-25 09:52:57,707 INFO ]: Without dead ends: 24 [2018-06-25 09:52:57,708 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:52:57,708 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 09:52:57,709 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-25 09:52:57,709 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 09:52:57,709 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-25 09:52:57,710 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-06-25 09:52:57,710 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:57,710 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-25 09:52:57,710 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:52:57,710 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-25 09:52:57,710 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 09:52:57,710 INFO ]: Found error trace [2018-06-25 09:52:57,710 INFO ]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:57,710 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:57,710 INFO ]: Analyzing trace with hash 2076357718, now seen corresponding path program 16 times [2018-06-25 09:52:57,710 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:57,710 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:57,712 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:57,712 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:57,712 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:57,766 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:58,256 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:58,256 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:58,256 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:58,262 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:52:58,343 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:52:58,343 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:58,353 INFO ]: Computing forward predicates... [2018-06-25 09:52:58,669 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:58,688 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:58,688 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-06-25 09:52:58,689 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:52:58,689 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:52:58,689 INFO ]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:52:58,689 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 20 states. [2018-06-25 09:52:59,013 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:59,013 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-25 09:52:59,013 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:52:59,013 INFO ]: Start accepts. Automaton has 20 states. Word has length 23 [2018-06-25 09:52:59,014 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:59,014 INFO ]: With dead ends: 25 [2018-06-25 09:52:59,014 INFO ]: Without dead ends: 25 [2018-06-25 09:52:59,014 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:52:59,014 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 09:52:59,016 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-25 09:52:59,016 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-25 09:52:59,016 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-25 09:52:59,016 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-25 09:52:59,016 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:59,016 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-25 09:52:59,016 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:52:59,016 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-25 09:52:59,017 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:52:59,017 INFO ]: Found error trace [2018-06-25 09:52:59,017 INFO ]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:59,017 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:59,017 INFO ]: Analyzing trace with hash -56591657, now seen corresponding path program 17 times [2018-06-25 09:52:59,017 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:59,017 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:59,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:59,018 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:59,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:59,097 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:59,576 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:59,576 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:59,576 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:59,583 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:52:59,762 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-25 09:52:59,762 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:59,780 INFO ]: Computing forward predicates... [2018-06-25 09:52:59,946 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:59,966 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:59,966 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-25 09:52:59,966 INFO ]: Interpolant automaton has 21 states [2018-06-25 09:52:59,966 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 09:52:59,966 INFO ]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:52:59,966 INFO ]: Start difference. First operand 25 states and 25 transitions. Second operand 21 states. [2018-06-25 09:53:00,201 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:00,201 INFO ]: Finished difference Result 26 states and 26 transitions. [2018-06-25 09:53:00,201 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 09:53:00,201 INFO ]: Start accepts. Automaton has 21 states. Word has length 24 [2018-06-25 09:53:00,202 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:00,202 INFO ]: With dead ends: 26 [2018-06-25 09:53:00,202 INFO ]: Without dead ends: 26 [2018-06-25 09:53:00,202 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:53:00,202 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 09:53:00,204 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-25 09:53:00,204 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-25 09:53:00,204 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-06-25 09:53:00,204 INFO ]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-06-25 09:53:00,204 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:00,204 INFO ]: Abstraction has 26 states and 26 transitions. [2018-06-25 09:53:00,204 INFO ]: Interpolant automaton has 21 states. [2018-06-25 09:53:00,205 INFO ]: Start isEmpty. Operand 26 states and 26 transitions. [2018-06-25 09:53:00,205 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 09:53:00,205 INFO ]: Found error trace [2018-06-25 09:53:00,205 INFO ]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:00,205 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:00,205 INFO ]: Analyzing trace with hash -1753512842, now seen corresponding path program 18 times [2018-06-25 09:53:00,205 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:00,205 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:00,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:00,206 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:00,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:00,260 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:00,788 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:00,788 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:00,788 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:53:00,794 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:53:00,880 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-25 09:53:00,880 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:00,890 INFO ]: Computing forward predicates... [2018-06-25 09:53:00,967 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:00,985 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:00,986 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2018-06-25 09:53:00,986 INFO ]: Interpolant automaton has 23 states [2018-06-25 09:53:00,986 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-25 09:53:00,986 INFO ]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:53:00,986 INFO ]: Start difference. First operand 26 states and 26 transitions. Second operand 23 states. [2018-06-25 09:53:01,220 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:01,220 INFO ]: Finished difference Result 27 states and 27 transitions. [2018-06-25 09:53:01,223 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-25 09:53:01,223 INFO ]: Start accepts. Automaton has 23 states. Word has length 25 [2018-06-25 09:53:01,223 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:01,223 INFO ]: With dead ends: 27 [2018-06-25 09:53:01,223 INFO ]: Without dead ends: 27 [2018-06-25 09:53:01,224 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:53:01,224 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-25 09:53:01,225 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-25 09:53:01,225 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-25 09:53:01,226 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-06-25 09:53:01,226 INFO ]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-06-25 09:53:01,226 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:01,226 INFO ]: Abstraction has 27 states and 27 transitions. [2018-06-25 09:53:01,226 INFO ]: Interpolant automaton has 23 states. [2018-06-25 09:53:01,226 INFO ]: Start isEmpty. Operand 27 states and 27 transitions. [2018-06-25 09:53:01,226 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 09:53:01,226 INFO ]: Found error trace [2018-06-25 09:53:01,226 INFO ]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:01,226 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:01,227 INFO ]: Analyzing trace with hash 1476505271, now seen corresponding path program 19 times [2018-06-25 09:53:01,227 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:01,227 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:01,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:01,227 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:01,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:01,285 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:02,698 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:02,698 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:02,698 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:53:02,704 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:53:02,831 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:02,843 INFO ]: Computing forward predicates... [2018-06-25 09:53:02,961 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:02,980 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:02,980 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2018-06-25 09:53:02,981 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:53:02,981 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:53:02,981 INFO ]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:53:02,981 INFO ]: Start difference. First operand 27 states and 27 transitions. Second operand 24 states. [2018-06-25 09:53:03,294 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:03,294 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-25 09:53:03,295 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-25 09:53:03,295 INFO ]: Start accepts. Automaton has 24 states. Word has length 26 [2018-06-25 09:53:03,296 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:03,296 INFO ]: With dead ends: 28 [2018-06-25 09:53:03,296 INFO ]: Without dead ends: 28 [2018-06-25 09:53:03,296 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:53:03,296 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-25 09:53:03,298 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-25 09:53:03,298 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-25 09:53:03,298 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-06-25 09:53:03,298 INFO ]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-06-25 09:53:03,298 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:03,299 INFO ]: Abstraction has 28 states and 28 transitions. [2018-06-25 09:53:03,299 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:53:03,299 INFO ]: Start isEmpty. Operand 28 states and 28 transitions. [2018-06-25 09:53:03,299 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 09:53:03,299 INFO ]: Found error trace [2018-06-25 09:53:03,299 INFO ]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:03,299 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:03,299 INFO ]: Analyzing trace with hash -1472148330, now seen corresponding path program 20 times [2018-06-25 09:53:03,299 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:03,299 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:03,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:03,300 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:53:03,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:03,370 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:03,972 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:03,972 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:03,972 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:53:03,977 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:53:04,055 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:53:04,055 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:04,065 INFO ]: Computing forward predicates... [2018-06-25 09:53:04,114 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:04,134 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:04,134 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-06-25 09:53:04,134 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:53:04,134 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:53:04,134 INFO ]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:53:04,135 INFO ]: Start difference. First operand 28 states and 28 transitions. Second operand 24 states. [2018-06-25 09:53:04,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:04,486 INFO ]: Finished difference Result 29 states and 29 transitions. [2018-06-25 09:53:04,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-25 09:53:04,492 INFO ]: Start accepts. Automaton has 24 states. Word has length 27 [2018-06-25 09:53:04,492 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:04,492 INFO ]: With dead ends: 29 [2018-06-25 09:53:04,492 INFO ]: Without dead ends: 29 [2018-06-25 09:53:04,493 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:53:04,493 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 09:53:04,495 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-25 09:53:04,495 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-25 09:53:04,495 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-25 09:53:04,495 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-06-25 09:53:04,495 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:04,495 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-25 09:53:04,495 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:53:04,495 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-25 09:53:04,496 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 09:53:04,496 INFO ]: Found error trace [2018-06-25 09:53:04,496 INFO ]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:04,496 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:04,496 INFO ]: Analyzing trace with hash 1608870551, now seen corresponding path program 21 times [2018-06-25 09:53:04,496 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:04,496 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:04,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:04,505 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:04,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:04,579 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:05,191 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:05,191 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:05,191 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:53:05,197 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:53:05,352 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-25 09:53:05,352 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:05,361 INFO ]: Computing forward predicates... [2018-06-25 09:53:05,465 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:05,484 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:05,484 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 26 [2018-06-25 09:53:05,485 INFO ]: Interpolant automaton has 26 states [2018-06-25 09:53:05,485 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-25 09:53:05,485 INFO ]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-06-25 09:53:05,485 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 26 states. [2018-06-25 09:53:05,846 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:05,846 INFO ]: Finished difference Result 30 states and 30 transitions. [2018-06-25 09:53:05,848 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-25 09:53:05,848 INFO ]: Start accepts. Automaton has 26 states. Word has length 28 [2018-06-25 09:53:05,848 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:05,848 INFO ]: With dead ends: 30 [2018-06-25 09:53:05,848 INFO ]: Without dead ends: 30 [2018-06-25 09:53:05,849 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-06-25 09:53:05,849 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-25 09:53:05,850 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-25 09:53:05,850 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-25 09:53:05,851 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-06-25 09:53:05,851 INFO ]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-06-25 09:53:05,851 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:05,851 INFO ]: Abstraction has 30 states and 30 transitions. [2018-06-25 09:53:05,851 INFO ]: Interpolant automaton has 26 states. [2018-06-25 09:53:05,851 INFO ]: Start isEmpty. Operand 30 states and 30 transitions. [2018-06-25 09:53:05,851 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-25 09:53:05,851 INFO ]: Found error trace [2018-06-25 09:53:05,851 INFO ]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:05,852 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:05,852 INFO ]: Analyzing trace with hash -1663791946, now seen corresponding path program 22 times [2018-06-25 09:53:05,852 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:05,852 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:05,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:05,852 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:05,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:05,980 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:06,873 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:06,873 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:06,873 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:53:06,878 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:53:07,031 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:53:07,031 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:07,045 INFO ]: Computing forward predicates... [2018-06-25 09:53:07,194 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:07,214 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:07,214 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2018-06-25 09:53:07,214 INFO ]: Interpolant automaton has 27 states [2018-06-25 09:53:07,214 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-25 09:53:07,214 INFO ]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-06-25 09:53:07,214 INFO ]: Start difference. First operand 30 states and 30 transitions. Second operand 27 states. [2018-06-25 09:53:07,686 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:07,686 INFO ]: Finished difference Result 31 states and 31 transitions. [2018-06-25 09:53:07,686 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-25 09:53:07,686 INFO ]: Start accepts. Automaton has 27 states. Word has length 29 [2018-06-25 09:53:07,686 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:07,686 INFO ]: With dead ends: 31 [2018-06-25 09:53:07,686 INFO ]: Without dead ends: 31 [2018-06-25 09:53:07,686 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-06-25 09:53:07,687 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-25 09:53:07,688 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-25 09:53:07,688 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-25 09:53:07,688 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-06-25 09:53:07,688 INFO ]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-06-25 09:53:07,688 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:07,688 INFO ]: Abstraction has 31 states and 31 transitions. [2018-06-25 09:53:07,688 INFO ]: Interpolant automaton has 27 states. [2018-06-25 09:53:07,688 INFO ]: Start isEmpty. Operand 31 states and 31 transitions. [2018-06-25 09:53:07,689 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-25 09:53:07,689 INFO ]: Found error trace [2018-06-25 09:53:07,689 INFO ]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:07,689 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:07,689 INFO ]: Analyzing trace with hash -37114249, now seen corresponding path program 23 times [2018-06-25 09:53:07,689 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:07,689 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:07,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:07,690 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:07,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:07,772 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:08,479 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:08,479 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:08,479 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:53:08,487 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:53:08,583 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-25 09:53:08,583 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:08,597 INFO ]: Computing forward predicates... [2018-06-25 09:53:08,717 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:08,736 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:08,736 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 28 [2018-06-25 09:53:08,736 INFO ]: Interpolant automaton has 28 states [2018-06-25 09:53:08,737 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 09:53:08,737 INFO ]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:53:08,737 INFO ]: Start difference. First operand 31 states and 31 transitions. Second operand 28 states. [2018-06-25 09:53:09,065 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:09,066 INFO ]: Finished difference Result 32 states and 32 transitions. [2018-06-25 09:53:09,066 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-25 09:53:09,066 INFO ]: Start accepts. Automaton has 28 states. Word has length 30 [2018-06-25 09:53:09,066 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:09,066 INFO ]: With dead ends: 32 [2018-06-25 09:53:09,066 INFO ]: Without dead ends: 32 [2018-06-25 09:53:09,066 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:53:09,066 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-25 09:53:09,069 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-25 09:53:09,069 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-25 09:53:09,069 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-06-25 09:53:09,069 INFO ]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-06-25 09:53:09,070 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:09,070 INFO ]: Abstraction has 32 states and 32 transitions. [2018-06-25 09:53:09,070 INFO ]: Interpolant automaton has 28 states. [2018-06-25 09:53:09,070 INFO ]: Start isEmpty. Operand 32 states and 32 transitions. [2018-06-25 09:53:09,070 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-25 09:53:09,070 INFO ]: Found error trace [2018-06-25 09:53:09,070 INFO ]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:09,070 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:09,070 INFO ]: Analyzing trace with hash -1149713194, now seen corresponding path program 24 times [2018-06-25 09:53:09,070 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:09,070 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:09,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:09,071 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:09,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:09,161 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:09,990 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:09,991 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:09,991 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:53:10,002 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:53:10,095 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-25 09:53:10,095 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:10,109 INFO ]: Computing forward predicates... [2018-06-25 09:53:10,234 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:10,259 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:10,259 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2018-06-25 09:53:10,260 INFO ]: Interpolant automaton has 29 states [2018-06-25 09:53:10,260 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-25 09:53:10,260 INFO ]: CoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-06-25 09:53:10,260 INFO ]: Start difference. First operand 32 states and 32 transitions. Second operand 29 states. [2018-06-25 09:53:10,644 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:10,644 INFO ]: Finished difference Result 33 states and 33 transitions. [2018-06-25 09:53:10,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 09:53:10,645 INFO ]: Start accepts. Automaton has 29 states. Word has length 31 [2018-06-25 09:53:10,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:10,645 INFO ]: With dead ends: 33 [2018-06-25 09:53:10,645 INFO ]: Without dead ends: 33 [2018-06-25 09:53:10,645 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-06-25 09:53:10,645 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-25 09:53:10,647 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-25 09:53:10,647 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-25 09:53:10,647 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-06-25 09:53:10,647 INFO ]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-06-25 09:53:10,647 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:10,647 INFO ]: Abstraction has 33 states and 33 transitions. [2018-06-25 09:53:10,647 INFO ]: Interpolant automaton has 29 states. [2018-06-25 09:53:10,647 INFO ]: Start isEmpty. Operand 33 states and 33 transitions. [2018-06-25 09:53:10,648 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-25 09:53:10,648 INFO ]: Found error trace [2018-06-25 09:53:10,648 INFO ]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:10,648 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:10,648 INFO ]: Analyzing trace with hash -1280542121, now seen corresponding path program 25 times [2018-06-25 09:53:10,648 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:10,649 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:10,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:10,649 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:10,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:10,748 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:11,494 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:11,494 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:11,494 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:53:11,501 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:53:11,701 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:11,719 INFO ]: Computing forward predicates... [2018-06-25 09:53:11,809 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:11,829 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:11,829 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-06-25 09:53:11,829 INFO ]: Interpolant automaton has 29 states [2018-06-25 09:53:11,829 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-25 09:53:11,830 INFO ]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-06-25 09:53:11,830 INFO ]: Start difference. First operand 33 states and 33 transitions. Second operand 29 states. [2018-06-25 09:53:12,246 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:12,246 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-25 09:53:12,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-25 09:53:12,248 INFO ]: Start accepts. Automaton has 29 states. Word has length 32 [2018-06-25 09:53:12,248 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:12,248 INFO ]: With dead ends: 34 [2018-06-25 09:53:12,248 INFO ]: Without dead ends: 34 [2018-06-25 09:53:12,249 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-06-25 09:53:12,249 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 09:53:12,250 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-25 09:53:12,250 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-25 09:53:12,251 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-06-25 09:53:12,251 INFO ]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-06-25 09:53:12,251 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:12,251 INFO ]: Abstraction has 34 states and 34 transitions. [2018-06-25 09:53:12,251 INFO ]: Interpolant automaton has 29 states. [2018-06-25 09:53:12,251 INFO ]: Start isEmpty. Operand 34 states and 34 transitions. [2018-06-25 09:53:12,251 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-25 09:53:12,251 INFO ]: Found error trace [2018-06-25 09:53:12,251 INFO ]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:12,251 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:12,252 INFO ]: Analyzing trace with hash -1041271562, now seen corresponding path program 26 times [2018-06-25 09:53:12,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:12,252 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:12,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:12,252 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:53:12,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:12,330 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:13,107 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:13,107 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:13,107 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:53:13,118 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:53:13,237 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:53:13,237 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:13,252 INFO ]: Computing forward predicates... [2018-06-25 09:53:13,423 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:13,442 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:13,443 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-06-25 09:53:13,443 INFO ]: Interpolant automaton has 30 states [2018-06-25 09:53:13,443 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-25 09:53:13,443 INFO ]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-06-25 09:53:13,443 INFO ]: Start difference. First operand 34 states and 34 transitions. Second operand 30 states. [2018-06-25 09:53:13,894 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:13,894 INFO ]: Finished difference Result 35 states and 35 transitions. [2018-06-25 09:53:13,895 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-25 09:53:13,895 INFO ]: Start accepts. Automaton has 30 states. Word has length 33 [2018-06-25 09:53:13,895 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:13,895 INFO ]: With dead ends: 35 [2018-06-25 09:53:13,895 INFO ]: Without dead ends: 35 [2018-06-25 09:53:13,896 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-06-25 09:53:13,896 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-25 09:53:13,897 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-25 09:53:13,897 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-25 09:53:13,898 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-06-25 09:53:13,898 INFO ]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-06-25 09:53:13,898 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:13,898 INFO ]: Abstraction has 35 states and 35 transitions. [2018-06-25 09:53:13,898 INFO ]: Interpolant automaton has 30 states. [2018-06-25 09:53:13,898 INFO ]: Start isEmpty. Operand 35 states and 35 transitions. [2018-06-25 09:53:13,899 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 09:53:13,899 INFO ]: Found error trace [2018-06-25 09:53:13,899 INFO ]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:13,900 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:13,900 INFO ]: Analyzing trace with hash 2081148471, now seen corresponding path program 27 times [2018-06-25 09:53:13,900 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:13,900 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:13,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:13,900 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:13,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:14,005 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:14,825 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:14,825 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:14,825 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:53:14,830 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:53:14,979 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-25 09:53:14,979 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:14,993 INFO ]: Computing forward predicates... [2018-06-25 09:53:15,222 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:15,243 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:15,244 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-06-25 09:53:15,244 INFO ]: Interpolant automaton has 31 states [2018-06-25 09:53:15,244 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-25 09:53:15,244 INFO ]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:53:15,244 INFO ]: Start difference. First operand 35 states and 35 transitions. Second operand 31 states. [2018-06-25 09:53:15,729 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:15,729 INFO ]: Finished difference Result 36 states and 36 transitions. [2018-06-25 09:53:15,731 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-25 09:53:15,731 INFO ]: Start accepts. Automaton has 31 states. Word has length 34 [2018-06-25 09:53:15,731 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:15,732 INFO ]: With dead ends: 36 [2018-06-25 09:53:15,732 INFO ]: Without dead ends: 36 [2018-06-25 09:53:15,732 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:53:15,732 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-25 09:53:15,734 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-25 09:53:15,734 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-25 09:53:15,735 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-06-25 09:53:15,735 INFO ]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-06-25 09:53:15,735 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:15,735 INFO ]: Abstraction has 36 states and 36 transitions. [2018-06-25 09:53:15,735 INFO ]: Interpolant automaton has 31 states. [2018-06-25 09:53:15,735 INFO ]: Start isEmpty. Operand 36 states and 36 transitions. [2018-06-25 09:53:15,735 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 09:53:15,735 INFO ]: Found error trace [2018-06-25 09:53:15,735 INFO ]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:15,735 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:15,735 INFO ]: Analyzing trace with hash 91921686, now seen corresponding path program 28 times [2018-06-25 09:53:15,735 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:15,735 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:15,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:15,739 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:15,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:15,810 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:16,521 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:16,521 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:16,521 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:53:16,528 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:53:16,789 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:53:16,789 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:16,809 INFO ]: Computing forward predicates... [2018-06-25 09:53:16,966 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:16,986 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:16,986 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-06-25 09:53:16,986 INFO ]: Interpolant automaton has 32 states [2018-06-25 09:53:16,986 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-25 09:53:16,986 INFO ]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-25 09:53:16,986 INFO ]: Start difference. First operand 36 states and 36 transitions. Second operand 32 states. [2018-06-25 09:53:17,516 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:17,516 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-25 09:53:17,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-25 09:53:17,517 INFO ]: Start accepts. Automaton has 32 states. Word has length 35 [2018-06-25 09:53:17,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:17,517 INFO ]: With dead ends: 37 [2018-06-25 09:53:17,517 INFO ]: Without dead ends: 37 [2018-06-25 09:53:17,517 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-25 09:53:17,517 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-25 09:53:17,518 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-25 09:53:17,518 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-25 09:53:17,519 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-06-25 09:53:17,519 INFO ]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-06-25 09:53:17,519 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:17,519 INFO ]: Abstraction has 37 states and 37 transitions. [2018-06-25 09:53:17,519 INFO ]: Interpolant automaton has 32 states. [2018-06-25 09:53:17,519 INFO ]: Start isEmpty. Operand 37 states and 37 transitions. [2018-06-25 09:53:17,519 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 09:53:17,519 INFO ]: Found error trace [2018-06-25 09:53:17,519 INFO ]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:17,519 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:17,519 INFO ]: Analyzing trace with hash -1444566505, now seen corresponding path program 29 times [2018-06-25 09:53:17,519 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:17,519 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:17,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:17,520 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:17,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:17,657 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:18,588 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:18,588 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:18,588 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:53:18,594 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:53:18,729 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-06-25 09:53:18,729 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:18,743 INFO ]: Computing forward predicates... [2018-06-25 09:53:18,899 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:18,918 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:18,918 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-06-25 09:53:18,919 INFO ]: Interpolant automaton has 33 states [2018-06-25 09:53:18,919 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-25 09:53:18,919 INFO ]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 09:53:18,919 INFO ]: Start difference. First operand 37 states and 37 transitions. Second operand 33 states. [2018-06-25 09:53:19,428 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:19,428 INFO ]: Finished difference Result 38 states and 38 transitions. [2018-06-25 09:53:19,428 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-25 09:53:19,428 INFO ]: Start accepts. Automaton has 33 states. Word has length 36 [2018-06-25 09:53:19,428 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:19,428 INFO ]: With dead ends: 38 [2018-06-25 09:53:19,428 INFO ]: Without dead ends: 38 [2018-06-25 09:53:19,429 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 09:53:19,429 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-25 09:53:19,430 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-25 09:53:19,430 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-25 09:53:19,430 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-25 09:53:19,430 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-06-25 09:53:19,431 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:19,431 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-25 09:53:19,431 INFO ]: Interpolant automaton has 33 states. [2018-06-25 09:53:19,431 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-25 09:53:19,431 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 09:53:19,431 INFO ]: Found error trace [2018-06-25 09:53:19,431 INFO ]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:19,431 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:19,431 INFO ]: Analyzing trace with hash -1831060170, now seen corresponding path program 30 times [2018-06-25 09:53:19,431 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:19,431 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:19,432 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:19,432 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:19,432 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:19,539 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:20,453 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:20,453 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:20,453 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:53:20,458 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:53:20,577 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-06-25 09:53:20,577 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:20,591 INFO ]: Computing forward predicates... [2018-06-25 09:53:20,663 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:20,682 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:20,682 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-06-25 09:53:20,683 INFO ]: Interpolant automaton has 34 states [2018-06-25 09:53:20,683 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-25 09:53:20,683 INFO ]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:53:20,683 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 34 states. [2018-06-25 09:53:21,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:21,247 INFO ]: Finished difference Result 39 states and 39 transitions. [2018-06-25 09:53:21,247 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-25 09:53:21,247 INFO ]: Start accepts. Automaton has 34 states. Word has length 37 [2018-06-25 09:53:21,247 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:21,247 INFO ]: With dead ends: 39 [2018-06-25 09:53:21,247 INFO ]: Without dead ends: 39 [2018-06-25 09:53:21,248 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:53:21,248 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-25 09:53:21,249 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-25 09:53:21,249 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-25 09:53:21,249 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-06-25 09:53:21,249 INFO ]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-06-25 09:53:21,249 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:21,249 INFO ]: Abstraction has 39 states and 39 transitions. [2018-06-25 09:53:21,249 INFO ]: Interpolant automaton has 34 states. [2018-06-25 09:53:21,249 INFO ]: Start isEmpty. Operand 39 states and 39 transitions. [2018-06-25 09:53:21,249 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-25 09:53:21,249 INFO ]: Found error trace [2018-06-25 09:53:21,249 INFO ]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:21,249 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:21,250 INFO ]: Analyzing trace with hash -927461897, now seen corresponding path program 31 times [2018-06-25 09:53:21,250 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:21,250 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:21,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:21,250 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:21,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:21,424 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:22,490 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:22,490 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:22,490 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:53:22,496 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:53:22,856 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:22,880 INFO ]: Computing forward predicates... [2018-06-25 09:53:22,959 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:23,020 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:23,020 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-06-25 09:53:23,021 INFO ]: Interpolant automaton has 35 states [2018-06-25 09:53:23,021 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-25 09:53:23,021 INFO ]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 09:53:23,021 INFO ]: Start difference. First operand 39 states and 39 transitions. Second operand 35 states. [2018-06-25 09:53:23,612 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:23,612 INFO ]: Finished difference Result 40 states and 40 transitions. [2018-06-25 09:53:23,612 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-25 09:53:23,612 INFO ]: Start accepts. Automaton has 35 states. Word has length 38 [2018-06-25 09:53:23,612 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:23,612 INFO ]: With dead ends: 40 [2018-06-25 09:53:23,612 INFO ]: Without dead ends: 40 [2018-06-25 09:53:23,613 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 09:53:23,613 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-25 09:53:23,614 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-25 09:53:23,614 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-25 09:53:23,614 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-06-25 09:53:23,614 INFO ]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-06-25 09:53:23,614 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:23,614 INFO ]: Abstraction has 40 states and 40 transitions. [2018-06-25 09:53:23,614 INFO ]: Interpolant automaton has 35 states. [2018-06-25 09:53:23,614 INFO ]: Start isEmpty. Operand 40 states and 40 transitions. [2018-06-25 09:53:23,615 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-25 09:53:23,615 INFO ]: Found error trace [2018-06-25 09:53:23,615 INFO ]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:23,615 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:23,615 INFO ]: Analyzing trace with hash 1314280790, now seen corresponding path program 32 times [2018-06-25 09:53:23,615 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:23,615 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:23,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:23,615 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:53:23,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:23,782 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:24,995 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:24,995 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:24,995 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:53:25,001 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:53:25,166 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:53:25,166 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:25,185 INFO ]: Computing forward predicates... [2018-06-25 09:53:25,334 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:25,354 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:25,354 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2018-06-25 09:53:25,354 INFO ]: Interpolant automaton has 37 states [2018-06-25 09:53:25,354 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-25 09:53:25,355 INFO ]: CoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 09:53:25,355 INFO ]: Start difference. First operand 40 states and 40 transitions. Second operand 37 states. [2018-06-25 09:53:26,051 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:26,051 INFO ]: Finished difference Result 41 states and 41 transitions. [2018-06-25 09:53:26,052 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-25 09:53:26,052 INFO ]: Start accepts. Automaton has 37 states. Word has length 39 [2018-06-25 09:53:26,052 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:26,052 INFO ]: With dead ends: 41 [2018-06-25 09:53:26,052 INFO ]: Without dead ends: 41 [2018-06-25 09:53:26,053 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 09:53:26,053 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-25 09:53:26,054 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-25 09:53:26,054 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-25 09:53:26,054 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-06-25 09:53:26,054 INFO ]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-06-25 09:53:26,055 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:26,055 INFO ]: Abstraction has 41 states and 41 transitions. [2018-06-25 09:53:26,055 INFO ]: Interpolant automaton has 37 states. [2018-06-25 09:53:26,055 INFO ]: Start isEmpty. Operand 41 states and 41 transitions. [2018-06-25 09:53:26,055 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-25 09:53:26,055 INFO ]: Found error trace [2018-06-25 09:53:26,055 INFO ]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:26,055 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:26,055 INFO ]: Analyzing trace with hash 2088827351, now seen corresponding path program 33 times [2018-06-25 09:53:26,055 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:26,055 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:26,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:26,056 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:26,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:26,276 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:28,042 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:28,074 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:28,074 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:53:28,082 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:53:28,273 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-06-25 09:53:28,273 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:28,289 INFO ]: Computing forward predicates... [2018-06-25 09:53:28,885 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:28,906 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:28,906 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-06-25 09:53:28,906 INFO ]: Interpolant automaton has 37 states [2018-06-25 09:53:28,906 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-25 09:53:28,906 INFO ]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 09:53:28,906 INFO ]: Start difference. First operand 41 states and 41 transitions. Second operand 37 states. [2018-06-25 09:53:29,587 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:29,587 INFO ]: Finished difference Result 42 states and 42 transitions. [2018-06-25 09:53:29,587 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-25 09:53:29,587 INFO ]: Start accepts. Automaton has 37 states. Word has length 40 [2018-06-25 09:53:29,587 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:29,587 INFO ]: With dead ends: 42 [2018-06-25 09:53:29,587 INFO ]: Without dead ends: 42 [2018-06-25 09:53:29,588 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 09:53:29,588 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-25 09:53:29,588 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-25 09:53:29,588 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-25 09:53:29,589 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-06-25 09:53:29,589 INFO ]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-06-25 09:53:29,589 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:29,589 INFO ]: Abstraction has 42 states and 42 transitions. [2018-06-25 09:53:29,589 INFO ]: Interpolant automaton has 37 states. [2018-06-25 09:53:29,589 INFO ]: Start isEmpty. Operand 42 states and 42 transitions. [2018-06-25 09:53:29,589 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-25 09:53:29,589 INFO ]: Found error trace [2018-06-25 09:53:29,589 INFO ]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:29,589 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:29,589 INFO ]: Analyzing trace with hash 329966966, now seen corresponding path program 34 times [2018-06-25 09:53:29,589 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:29,589 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:29,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:29,590 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:29,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:29,759 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:31,607 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:31,607 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:31,607 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:53:31,613 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:53:32,062 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:53:32,062 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:32,090 INFO ]: Computing forward predicates... [2018-06-25 09:53:32,262 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:32,282 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:32,282 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-06-25 09:53:32,283 INFO ]: Interpolant automaton has 38 states [2018-06-25 09:53:32,283 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-25 09:53:32,283 INFO ]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-06-25 09:53:32,283 INFO ]: Start difference. First operand 42 states and 42 transitions. Second operand 38 states. [2018-06-25 09:53:33,035 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:33,035 INFO ]: Finished difference Result 43 states and 43 transitions. [2018-06-25 09:53:33,035 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-25 09:53:33,036 INFO ]: Start accepts. Automaton has 38 states. Word has length 41 [2018-06-25 09:53:33,036 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:33,036 INFO ]: With dead ends: 43 [2018-06-25 09:53:33,036 INFO ]: Without dead ends: 43 [2018-06-25 09:53:33,036 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-06-25 09:53:33,036 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-25 09:53:33,037 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-25 09:53:33,037 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-25 09:53:33,038 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-06-25 09:53:33,038 INFO ]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-06-25 09:53:33,038 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:33,038 INFO ]: Abstraction has 43 states and 43 transitions. [2018-06-25 09:53:33,038 INFO ]: Interpolant automaton has 38 states. [2018-06-25 09:53:33,038 INFO ]: Start isEmpty. Operand 43 states and 43 transitions. [2018-06-25 09:53:33,038 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-25 09:53:33,038 INFO ]: Found error trace [2018-06-25 09:53:33,038 INFO ]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:33,038 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:33,038 INFO ]: Analyzing trace with hash 1639869879, now seen corresponding path program 35 times [2018-06-25 09:53:33,038 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:33,038 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:33,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:33,039 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:33,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:33,136 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:34,526 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:34,526 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:34,526 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:53:34,533 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:53:34,708 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-06-25 09:53:34,718 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:34,748 INFO ]: Computing forward predicates... [2018-06-25 09:53:34,853 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:34,873 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:34,873 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-06-25 09:53:34,873 INFO ]: Interpolant automaton has 39 states [2018-06-25 09:53:34,873 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-25 09:53:34,873 INFO ]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-06-25 09:53:34,873 INFO ]: Start difference. First operand 43 states and 43 transitions. Second operand 39 states. [2018-06-25 09:53:35,641 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:35,641 INFO ]: Finished difference Result 44 states and 44 transitions. [2018-06-25 09:53:35,642 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-25 09:53:35,642 INFO ]: Start accepts. Automaton has 39 states. Word has length 42 [2018-06-25 09:53:35,642 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:35,642 INFO ]: With dead ends: 44 [2018-06-25 09:53:35,642 INFO ]: Without dead ends: 44 [2018-06-25 09:53:35,642 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-06-25 09:53:35,642 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-25 09:53:35,643 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-25 09:53:35,643 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-25 09:53:35,644 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-06-25 09:53:35,644 INFO ]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-06-25 09:53:35,644 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:35,644 INFO ]: Abstraction has 44 states and 44 transitions. [2018-06-25 09:53:35,644 INFO ]: Interpolant automaton has 39 states. [2018-06-25 09:53:35,644 INFO ]: Start isEmpty. Operand 44 states and 44 transitions. [2018-06-25 09:53:35,644 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-25 09:53:35,644 INFO ]: Found error trace [2018-06-25 09:53:35,644 INFO ]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:35,644 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:35,644 INFO ]: Analyzing trace with hash -702812778, now seen corresponding path program 36 times [2018-06-25 09:53:35,644 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:35,644 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:35,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:35,645 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:35,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:35,753 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:37,163 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:37,163 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:37,163 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:53:37,169 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:53:37,325 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-06-25 09:53:37,325 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:37,347 INFO ]: Computing forward predicates... [2018-06-25 09:53:37,743 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:37,763 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:37,763 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-06-25 09:53:37,763 INFO ]: Interpolant automaton has 40 states [2018-06-25 09:53:37,763 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-25 09:53:37,764 INFO ]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:53:37,764 INFO ]: Start difference. First operand 44 states and 44 transitions. Second operand 40 states. [2018-06-25 09:53:38,568 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:38,568 INFO ]: Finished difference Result 45 states and 45 transitions. [2018-06-25 09:53:38,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-25 09:53:38,568 INFO ]: Start accepts. Automaton has 40 states. Word has length 43 [2018-06-25 09:53:38,568 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:38,568 INFO ]: With dead ends: 45 [2018-06-25 09:53:38,568 INFO ]: Without dead ends: 45 [2018-06-25 09:53:38,568 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:53:38,568 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-25 09:53:38,569 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-25 09:53:38,569 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-25 09:53:38,569 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-06-25 09:53:38,569 INFO ]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-06-25 09:53:38,570 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:38,570 INFO ]: Abstraction has 45 states and 45 transitions. [2018-06-25 09:53:38,570 INFO ]: Interpolant automaton has 40 states. [2018-06-25 09:53:38,570 INFO ]: Start isEmpty. Operand 45 states and 45 transitions. [2018-06-25 09:53:38,570 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 09:53:38,570 INFO ]: Found error trace [2018-06-25 09:53:38,570 INFO ]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:38,570 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:38,570 INFO ]: Analyzing trace with hash -311531113, now seen corresponding path program 37 times [2018-06-25 09:53:38,570 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:38,570 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:38,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:38,571 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:38,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:38,674 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:39,935 INFO ]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:39,935 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:39,935 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:53:39,941 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:53:40,483 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:40,538 INFO ]: Computing forward predicates... [2018-06-25 09:53:40,750 INFO ]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:40,770 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:40,770 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-06-25 09:53:40,770 INFO ]: Interpolant automaton has 41 states [2018-06-25 09:53:40,770 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-25 09:53:40,770 INFO ]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-06-25 09:53:40,771 INFO ]: Start difference. First operand 45 states and 45 transitions. Second operand 41 states. [2018-06-25 09:53:41,600 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:42,939 INFO ]: Finished difference Result 46 states and 46 transitions. [2018-06-25 09:53:42,940 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-25 09:53:42,940 INFO ]: Start accepts. Automaton has 41 states. Word has length 44 [2018-06-25 09:53:42,940 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:42,940 INFO ]: With dead ends: 46 [2018-06-25 09:53:42,940 INFO ]: Without dead ends: 46 [2018-06-25 09:53:42,941 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-06-25 09:53:42,941 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-25 09:53:42,943 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-06-25 09:53:42,943 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-25 09:53:42,943 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-06-25 09:53:42,943 INFO ]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-06-25 09:53:42,943 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:42,943 INFO ]: Abstraction has 46 states and 46 transitions. [2018-06-25 09:53:42,943 INFO ]: Interpolant automaton has 41 states. [2018-06-25 09:53:42,943 INFO ]: Start isEmpty. Operand 46 states and 46 transitions. [2018-06-25 09:53:42,944 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-25 09:53:42,944 INFO ]: Found error trace [2018-06-25 09:53:42,944 INFO ]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:42,944 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:42,944 INFO ]: Analyzing trace with hash -1066701386, now seen corresponding path program 38 times [2018-06-25 09:53:42,944 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:42,944 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:42,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:42,945 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:53:42,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:43,182 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-25 09:53:44,204 WARN ]: Verification canceled [2018-06-25 09:53:44,207 WARN ]: Timeout [2018-06-25 09:53:44,207 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:53:44 BoogieIcfgContainer [2018-06-25 09:53:44,207 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:53:44,208 INFO ]: Toolchain (without parser) took 59685.48 ms. Allocated memory was 307.8 MB in the beginning and 841.0 MB in the end (delta: 533.2 MB). Free memory was 264.3 MB in the beginning and 358.6 MB in the end (delta: -94.3 MB). Peak memory consumption was 438.9 MB. Max. memory is 3.6 GB. [2018-06-25 09:53:44,209 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 272.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:53:44,209 INFO ]: ChcToBoogie took 61.81 ms. Allocated memory is still 307.8 MB. Free memory was 264.3 MB in the beginning and 260.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:53:44,209 INFO ]: Boogie Preprocessor took 35.84 ms. Allocated memory is still 307.8 MB. Free memory is still 260.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:53:44,210 INFO ]: RCFGBuilder took 253.03 ms. Allocated memory is still 307.8 MB. Free memory was 260.3 MB in the beginning and 252.3 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:53:44,210 INFO ]: TraceAbstraction took 59326.82 ms. Allocated memory was 307.8 MB in the beginning and 841.0 MB in the end (delta: 533.2 MB). Free memory was 250.3 MB in the beginning and 358.6 MB in the end (delta: -108.3 MB). Peak memory consumption was 424.9 MB. Max. memory is 3.6 GB. [2018-06-25 09:53:44,212 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 272.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.81 ms. Allocated memory is still 307.8 MB. Free memory was 264.3 MB in the beginning and 260.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 35.84 ms. Allocated memory is still 307.8 MB. Free memory is still 260.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 253.03 ms. Allocated memory is still 307.8 MB. Free memory was 260.3 MB in the beginning and 252.3 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59326.82 ms. Allocated memory was 307.8 MB in the beginning and 841.0 MB in the end (delta: 533.2 MB). Free memory was 250.3 MB in the beginning and 358.6 MB in the end (delta: -108.3 MB). Peak memory consumption was 424.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 46 with TraceHistMax 38, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. TIMEOUT Result, 59.2s OverallTime, 42 OverallIterations, 38 TraceHistogramMax, 14.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 293 SDtfs, 0 SDslu, 3840 SDs, 0 SdLazy, 21056 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1762 GetRequests, 927 SyntacticMatches, 36 SemanticMatches, 799 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 28.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=41, 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: 0.0s AutomataMinimizationTime, 41 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 7.2s SatisfiabilityAnalysisTime, 33.5s InterpolantComputationTime, 1965 NumberOfCodeBlocks, 1965 NumberOfCodeBlocksAsserted, 268 NumberOfCheckSat, 1886 ConstructedInterpolants, 0 QuantifiedInterpolants, 1352235 SizeOfPredicates, 189 NumberOfNonLiveVariables, 21938 ConjunctsInSsa, 13004 ConjunctsInUnsatCore, 79 InterpolantComputations, 3 PerfectInterpolantSequences, 5/18286 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/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-53-44-227.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-53-44-227.csv Completed graceful shutdown