java -Xss1g -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__barthe2-big2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 02:09:30,985 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 02:09:30,988 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 02:09:31,003 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 02:09:31,004 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 02:09:31,005 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 02:09:31,006 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 02:09:31,009 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 02:09:31,010 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 02:09:31,012 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 02:09:31,013 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 02:09:31,013 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 02:09:31,014 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 02:09:31,015 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 02:09:31,020 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 02:09:31,021 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 02:09:31,022 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 02:09:31,035 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 02:09:31,039 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 02:09:31,040 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 02:09:31,041 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 02:09:31,043 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 02:09:31,043 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 02:09:31,044 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 02:09:31,044 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 02:09:31,045 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 02:09:31,051 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 02:09:31,051 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 02:09:31,052 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 02:09:31,053 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 02:09:31,053 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 02:09:31,054 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 02:09:31,054 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 02:09:31,055 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 02:09:31,055 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 02:09:31,056 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 02:09:31,080 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 02:09:31,082 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 02:09:31,082 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 02:09:31,083 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 02:09:31,084 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 02:09:31,084 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 02:09:31,084 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 02:09:31,084 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 02:09:31,084 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:09:31,085 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 02:09:31,085 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 02:09:31,085 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 02:09:31,085 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 02:09:31,085 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 02:09:31,085 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 02:09:31,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 02:09:31,086 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 02:09:31,088 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 02:09:31,088 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 02:09:31,125 INFO ]: Repository-Root is: /tmp [2018-06-22 02:09:31,142 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 02:09:31,148 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 02:09:31,149 INFO ]: Initializing SmtParser... [2018-06-22 02:09:31,149 INFO ]: SmtParser initialized [2018-06-22 02:09:31,150 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big2.smt2 [2018-06-22 02:09:31,151 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-22 02:09:31,245 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big2.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@3e5a9e9d [2018-06-22 02:09:31,496 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big2.smt2 [2018-06-22 02:09:31,501 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 02:09:31,507 INFO ]: Walking toolchain with 4 elements. [2018-06-22 02:09:31,507 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 02:09:31,508 INFO ]: Initializing ChcToBoogie... [2018-06-22 02:09:31,508 INFO ]: ChcToBoogie initialized [2018-06-22 02:09:31,511 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:09:31" (1/1) ... [2018-06-22 02:09:31,568 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:31 Unit [2018-06-22 02:09:31,568 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 02:09:31,570 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 02:09:31,570 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 02:09:31,570 INFO ]: Boogie Preprocessor initialized [2018-06-22 02:09:31,591 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:31" (1/1) ... [2018-06-22 02:09:31,591 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:31" (1/1) ... [2018-06-22 02:09:31,597 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:31" (1/1) ... [2018-06-22 02:09:31,597 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:31" (1/1) ... [2018-06-22 02:09:31,601 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:31" (1/1) ... [2018-06-22 02:09:31,603 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:31" (1/1) ... [2018-06-22 02:09:31,604 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:31" (1/1) ... [2018-06-22 02:09:31,605 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 02:09:31,606 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 02:09:31,606 INFO ]: Initializing RCFGBuilder... [2018-06-22 02:09:31,606 INFO ]: RCFGBuilder initialized [2018-06-22 02:09:31,607 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:31" (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-22 02:09:31,617 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 02:09:31,617 INFO ]: Found specification of procedure gotoProc [2018-06-22 02:09:31,617 INFO ]: Found implementation of procedure gotoProc [2018-06-22 02:09:31,617 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 02:09:31,617 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 02:09:31,617 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-22 02:09:31,913 INFO ]: Using library mode [2018-06-22 02:09:31,914 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:09:31 BoogieIcfgContainer [2018-06-22 02:09:31,914 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 02:09:31,915 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 02:09:31,915 INFO ]: Initializing TraceAbstraction... [2018-06-22 02:09:31,918 INFO ]: TraceAbstraction initialized [2018-06-22 02:09:31,918 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:09:31" (1/3) ... [2018-06-22 02:09:31,921 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f344b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 02:09:31, skipping insertion in model container [2018-06-22 02:09:31,922 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:31" (2/3) ... [2018-06-22 02:09:31,922 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f344b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:09:31, skipping insertion in model container [2018-06-22 02:09:31,922 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:09:31" (3/3) ... [2018-06-22 02:09:31,924 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 02:09:31,939 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 02:09:31,947 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 02:09:31,990 INFO ]: Using default assertion order modulation [2018-06-22 02:09:31,991 INFO ]: Interprodecural is true [2018-06-22 02:09:31,991 INFO ]: Hoare is false [2018-06-22 02:09:31,991 INFO ]: Compute interpolants for FPandBP [2018-06-22 02:09:31,991 INFO ]: Backedges is TWOTRACK [2018-06-22 02:09:31,991 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 02:09:31,991 INFO ]: Difference is false [2018-06-22 02:09:31,991 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 02:09:31,991 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 02:09:32,004 INFO ]: Start isEmpty. Operand 12 states. [2018-06-22 02:09:32,014 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:09:32,014 INFO ]: Found error trace [2018-06-22 02:09:32,015 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:32,015 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:32,020 INFO ]: Analyzing trace with hash 1600860554, now seen corresponding path program 1 times [2018-06-22 02:09:32,022 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:32,023 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:32,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:32,056 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:32,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:32,101 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:32,312 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:32,315 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:09:32,315 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 02:09:32,317 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:09:32,333 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:09:32,333 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:09:32,336 INFO ]: Start difference. First operand 12 states. Second operand 5 states. [2018-06-22 02:09:32,683 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:32,683 INFO ]: Finished difference Result 17 states and 39 transitions. [2018-06-22 02:09:32,685 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:09:32,686 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-22 02:09:32,686 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:32,703 INFO ]: With dead ends: 17 [2018-06-22 02:09:32,703 INFO ]: Without dead ends: 16 [2018-06-22 02:09:32,705 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:09:32,732 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 02:09:32,756 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-22 02:09:32,758 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 02:09:32,759 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2018-06-22 02:09:32,760 INFO ]: Start accepts. Automaton has 12 states and 25 transitions. Word has length 9 [2018-06-22 02:09:32,762 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:32,762 INFO ]: Abstraction has 12 states and 25 transitions. [2018-06-22 02:09:32,762 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:09:32,763 INFO ]: Start isEmpty. Operand 12 states and 25 transitions. [2018-06-22 02:09:32,763 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:09:32,763 INFO ]: Found error trace [2018-06-22 02:09:32,763 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:32,763 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:32,763 INFO ]: Analyzing trace with hash 1968862292, now seen corresponding path program 1 times [2018-06-22 02:09:32,763 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:32,764 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:32,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:32,764 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:32,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:32,796 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:32,958 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:32,958 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:09:32,958 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 02:09:32,960 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:09:32,960 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:09:32,960 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:09:32,960 INFO ]: Start difference. First operand 12 states and 25 transitions. Second operand 5 states. [2018-06-22 02:09:33,184 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:33,184 INFO ]: Finished difference Result 20 states and 49 transitions. [2018-06-22 02:09:33,185 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:09:33,185 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-22 02:09:33,185 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:33,186 INFO ]: With dead ends: 20 [2018-06-22 02:09:33,186 INFO ]: Without dead ends: 20 [2018-06-22 02:09:33,187 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:09:33,187 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 02:09:33,192 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-06-22 02:09:33,192 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 02:09:33,193 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 43 transitions. [2018-06-22 02:09:33,193 INFO ]: Start accepts. Automaton has 17 states and 43 transitions. Word has length 10 [2018-06-22 02:09:33,193 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:33,193 INFO ]: Abstraction has 17 states and 43 transitions. [2018-06-22 02:09:33,193 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:09:33,193 INFO ]: Start isEmpty. Operand 17 states and 43 transitions. [2018-06-22 02:09:33,196 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:09:33,196 INFO ]: Found error trace [2018-06-22 02:09:33,197 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:33,197 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:33,197 INFO ]: Analyzing trace with hash 2084568188, now seen corresponding path program 1 times [2018-06-22 02:09:33,197 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:33,197 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:33,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:33,198 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:33,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:33,235 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:33,321 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:33,321 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:09:33,321 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:09:33,322 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:09:33,322 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:09:33,322 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:09:33,322 INFO ]: Start difference. First operand 17 states and 43 transitions. Second operand 4 states. [2018-06-22 02:09:33,389 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:33,389 INFO ]: Finished difference Result 25 states and 66 transitions. [2018-06-22 02:09:33,389 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:09:33,389 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 02:09:33,389 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:33,390 INFO ]: With dead ends: 25 [2018-06-22 02:09:33,390 INFO ]: Without dead ends: 25 [2018-06-22 02:09:33,390 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:09:33,390 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 02:09:33,393 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-06-22 02:09:33,394 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 02:09:33,394 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 57 transitions. [2018-06-22 02:09:33,394 INFO ]: Start accepts. Automaton has 21 states and 57 transitions. Word has length 10 [2018-06-22 02:09:33,395 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:33,395 INFO ]: Abstraction has 21 states and 57 transitions. [2018-06-22 02:09:33,395 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:09:33,395 INFO ]: Start isEmpty. Operand 21 states and 57 transitions. [2018-06-22 02:09:33,395 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:09:33,395 INFO ]: Found error trace [2018-06-22 02:09:33,395 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:33,395 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:33,395 INFO ]: Analyzing trace with hash -2095882504, now seen corresponding path program 1 times [2018-06-22 02:09:33,395 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:33,396 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:33,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:33,396 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:33,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:33,414 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:33,476 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:33,476 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:33,476 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-22 02:09:33,502 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:33,542 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:33,552 INFO ]: Computing forward predicates... [2018-06-22 02:09:33,597 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:33,644 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:33,644 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 02:09:33,644 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:09:33,644 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:09:33,644 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:09:33,644 INFO ]: Start difference. First operand 21 states and 57 transitions. Second operand 7 states. [2018-06-22 02:09:34,185 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:34,185 INFO ]: Finished difference Result 35 states and 102 transitions. [2018-06-22 02:09:34,186 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 02:09:34,186 INFO ]: Start accepts. Automaton has 7 states. Word has length 10 [2018-06-22 02:09:34,186 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:34,187 INFO ]: With dead ends: 35 [2018-06-22 02:09:34,187 INFO ]: Without dead ends: 33 [2018-06-22 02:09:34,187 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:09:34,188 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 02:09:34,191 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 23. [2018-06-22 02:09:34,191 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 02:09:34,192 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 63 transitions. [2018-06-22 02:09:34,192 INFO ]: Start accepts. Automaton has 23 states and 63 transitions. Word has length 10 [2018-06-22 02:09:34,192 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:34,192 INFO ]: Abstraction has 23 states and 63 transitions. [2018-06-22 02:09:34,192 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:09:34,192 INFO ]: Start isEmpty. Operand 23 states and 63 transitions. [2018-06-22 02:09:34,193 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:09:34,193 INFO ]: Found error trace [2018-06-22 02:09:34,193 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:34,193 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:34,193 INFO ]: Analyzing trace with hash 938807502, now seen corresponding path program 1 times [2018-06-22 02:09:34,193 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:34,193 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:34,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:34,194 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:34,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:34,204 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:34,261 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:34,261 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:09:34,261 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:09:34,261 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:09:34,261 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:09:34,261 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:09:34,261 INFO ]: Start difference. First operand 23 states and 63 transitions. Second operand 4 states. [2018-06-22 02:09:34,384 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:34,384 INFO ]: Finished difference Result 34 states and 93 transitions. [2018-06-22 02:09:34,385 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:09:34,385 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 02:09:34,385 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:34,386 INFO ]: With dead ends: 34 [2018-06-22 02:09:34,386 INFO ]: Without dead ends: 34 [2018-06-22 02:09:34,386 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:09:34,386 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 02:09:34,389 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 23. [2018-06-22 02:09:34,389 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 02:09:34,390 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 61 transitions. [2018-06-22 02:09:34,390 INFO ]: Start accepts. Automaton has 23 states and 61 transitions. Word has length 10 [2018-06-22 02:09:34,390 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:34,390 INFO ]: Abstraction has 23 states and 61 transitions. [2018-06-22 02:09:34,390 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:09:34,390 INFO ]: Start isEmpty. Operand 23 states and 61 transitions. [2018-06-22 02:09:34,390 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:09:34,390 INFO ]: Found error trace [2018-06-22 02:09:34,391 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:34,391 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:34,391 INFO ]: Analyzing trace with hash 897705772, now seen corresponding path program 1 times [2018-06-22 02:09:34,391 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:34,391 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:34,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:34,391 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:34,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:34,403 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:34,457 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:34,457 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:34,457 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-22 02:09:34,464 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:34,496 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:34,498 INFO ]: Computing forward predicates... [2018-06-22 02:09:34,529 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:09:34,565 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:09:34,566 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-22 02:09:34,566 INFO ]: Interpolant automaton has 8 states [2018-06-22 02:09:34,566 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 02:09:34,566 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:09:34,566 INFO ]: Start difference. First operand 23 states and 61 transitions. Second operand 8 states. [2018-06-22 02:09:34,996 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:34,996 INFO ]: Finished difference Result 32 states and 83 transitions. [2018-06-22 02:09:34,997 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:09:34,997 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-22 02:09:34,997 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:34,998 INFO ]: With dead ends: 32 [2018-06-22 02:09:34,998 INFO ]: Without dead ends: 32 [2018-06-22 02:09:34,998 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:09:34,998 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 02:09:35,001 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-06-22 02:09:35,002 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 02:09:35,002 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 62 transitions. [2018-06-22 02:09:35,002 INFO ]: Start accepts. Automaton has 24 states and 62 transitions. Word has length 11 [2018-06-22 02:09:35,003 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:35,003 INFO ]: Abstraction has 24 states and 62 transitions. [2018-06-22 02:09:35,003 INFO ]: Interpolant automaton has 8 states. [2018-06-22 02:09:35,003 INFO ]: Start isEmpty. Operand 24 states and 62 transitions. [2018-06-22 02:09:35,003 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:09:35,003 INFO ]: Found error trace [2018-06-22 02:09:35,003 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:35,003 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:35,003 INFO ]: Analyzing trace with hash 193315336, now seen corresponding path program 1 times [2018-06-22 02:09:35,003 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:35,004 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:35,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:35,004 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:35,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:35,016 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:35,068 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:09:35,068 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:35,068 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-22 02:09:35,074 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:35,103 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:35,107 INFO ]: Computing forward predicates... [2018-06-22 02:09:35,178 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:09:35,204 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:35,204 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-22 02:09:35,204 INFO ]: Interpolant automaton has 6 states [2018-06-22 02:09:35,204 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 02:09:35,204 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:09:35,204 INFO ]: Start difference. First operand 24 states and 62 transitions. Second operand 6 states. [2018-06-22 02:09:35,258 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:35,258 INFO ]: Finished difference Result 35 states and 94 transitions. [2018-06-22 02:09:35,259 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:09:35,259 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-22 02:09:35,259 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:35,260 INFO ]: With dead ends: 35 [2018-06-22 02:09:35,260 INFO ]: Without dead ends: 32 [2018-06-22 02:09:35,260 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:09:35,260 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 02:09:35,264 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-06-22 02:09:35,264 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 02:09:35,265 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 59 transitions. [2018-06-22 02:09:35,265 INFO ]: Start accepts. Automaton has 26 states and 59 transitions. Word has length 11 [2018-06-22 02:09:35,265 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:35,265 INFO ]: Abstraction has 26 states and 59 transitions. [2018-06-22 02:09:35,265 INFO ]: Interpolant automaton has 6 states. [2018-06-22 02:09:35,265 INFO ]: Start isEmpty. Operand 26 states and 59 transitions. [2018-06-22 02:09:35,265 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:09:35,265 INFO ]: Found error trace [2018-06-22 02:09:35,265 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:35,265 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:35,266 INFO ]: Analyzing trace with hash -730800310, now seen corresponding path program 2 times [2018-06-22 02:09:35,266 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:35,266 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:35,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:35,266 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:35,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:35,279 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:35,339 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:35,339 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:09:35,339 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 02:09:35,340 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:09:35,340 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:09:35,340 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:09:35,340 INFO ]: Start difference. First operand 26 states and 59 transitions. Second operand 5 states. [2018-06-22 02:09:35,425 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:35,425 INFO ]: Finished difference Result 47 states and 111 transitions. [2018-06-22 02:09:35,426 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:09:35,426 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-22 02:09:35,426 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:35,428 INFO ]: With dead ends: 47 [2018-06-22 02:09:35,428 INFO ]: Without dead ends: 47 [2018-06-22 02:09:35,428 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:09:35,429 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 02:09:35,433 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-06-22 02:09:35,433 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 02:09:35,434 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 74 transitions. [2018-06-22 02:09:35,434 INFO ]: Start accepts. Automaton has 32 states and 74 transitions. Word has length 11 [2018-06-22 02:09:35,434 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:35,434 INFO ]: Abstraction has 32 states and 74 transitions. [2018-06-22 02:09:35,434 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:09:35,434 INFO ]: Start isEmpty. Operand 32 states and 74 transitions. [2018-06-22 02:09:35,434 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:09:35,434 INFO ]: Found error trace [2018-06-22 02:09:35,434 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:35,434 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:35,435 INFO ]: Analyzing trace with hash 910714710, now seen corresponding path program 1 times [2018-06-22 02:09:35,435 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:35,435 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:35,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:35,436 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:35,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:35,455 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:35,498 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:09:35,498 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:35,498 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-22 02:09:35,506 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:35,534 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:35,537 INFO ]: Computing forward predicates... [2018-06-22 02:09:35,675 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:09:35,695 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:35,695 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 02:09:35,695 INFO ]: Interpolant automaton has 8 states [2018-06-22 02:09:35,695 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 02:09:35,695 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:09:35,696 INFO ]: Start difference. First operand 32 states and 74 transitions. Second operand 8 states. [2018-06-22 02:09:35,897 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:35,897 INFO ]: Finished difference Result 54 states and 128 transitions. [2018-06-22 02:09:35,898 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 02:09:35,898 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-22 02:09:35,898 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:35,898 INFO ]: With dead ends: 54 [2018-06-22 02:09:35,898 INFO ]: Without dead ends: 42 [2018-06-22 02:09:35,899 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:09:35,899 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 02:09:35,902 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 31. [2018-06-22 02:09:35,902 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 02:09:35,902 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 70 transitions. [2018-06-22 02:09:35,903 INFO ]: Start accepts. Automaton has 31 states and 70 transitions. Word has length 12 [2018-06-22 02:09:35,903 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:35,903 INFO ]: Abstraction has 31 states and 70 transitions. [2018-06-22 02:09:35,903 INFO ]: Interpolant automaton has 8 states. [2018-06-22 02:09:35,903 INFO ]: Start isEmpty. Operand 31 states and 70 transitions. [2018-06-22 02:09:35,903 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:09:35,903 INFO ]: Found error trace [2018-06-22 02:09:35,903 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:35,903 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:35,904 INFO ]: Analyzing trace with hash -1187456266, now seen corresponding path program 1 times [2018-06-22 02:09:35,904 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:35,904 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:35,904 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:35,904 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:35,904 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:35,914 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:35,949 INFO ]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:09:35,949 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:09:35,949 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:09:35,950 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:09:35,950 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:09:35,950 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:09:35,950 INFO ]: Start difference. First operand 31 states and 70 transitions. Second operand 3 states. [2018-06-22 02:09:35,973 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:35,973 INFO ]: Finished difference Result 34 states and 78 transitions. [2018-06-22 02:09:35,974 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:09:35,974 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-22 02:09:35,974 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:35,974 INFO ]: With dead ends: 34 [2018-06-22 02:09:35,974 INFO ]: Without dead ends: 29 [2018-06-22 02:09:35,975 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 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-22 02:09:35,975 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 02:09:35,977 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-06-22 02:09:35,977 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 02:09:35,977 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 44 transitions. [2018-06-22 02:09:35,978 INFO ]: Start accepts. Automaton has 20 states and 44 transitions. Word has length 12 [2018-06-22 02:09:35,978 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:35,978 INFO ]: Abstraction has 20 states and 44 transitions. [2018-06-22 02:09:35,978 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:09:35,978 INFO ]: Start isEmpty. Operand 20 states and 44 transitions. [2018-06-22 02:09:35,978 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:09:35,978 INFO ]: Found error trace [2018-06-22 02:09:35,978 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:35,978 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:35,978 INFO ]: Analyzing trace with hash -384507828, now seen corresponding path program 1 times [2018-06-22 02:09:35,978 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:35,978 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:35,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:35,979 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:35,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:35,990 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:36,031 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:09:36,031 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:36,031 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-22 02:09:36,039 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:36,063 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:36,064 INFO ]: Computing forward predicates... [2018-06-22 02:09:36,088 INFO ]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:09:36,108 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:36,108 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-22 02:09:36,109 INFO ]: Interpolant automaton has 6 states [2018-06-22 02:09:36,109 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 02:09:36,109 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:09:36,109 INFO ]: Start difference. First operand 20 states and 44 transitions. Second operand 6 states. [2018-06-22 02:09:36,603 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:36,603 INFO ]: Finished difference Result 25 states and 59 transitions. [2018-06-22 02:09:36,603 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:09:36,603 INFO ]: Start accepts. Automaton has 6 states. Word has length 12 [2018-06-22 02:09:36,603 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:36,603 INFO ]: With dead ends: 25 [2018-06-22 02:09:36,603 INFO ]: Without dead ends: 20 [2018-06-22 02:09:36,604 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:09:36,604 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 02:09:36,605 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-06-22 02:09:36,605 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 02:09:36,606 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 40 transitions. [2018-06-22 02:09:36,606 INFO ]: Start accepts. Automaton has 19 states and 40 transitions. Word has length 12 [2018-06-22 02:09:36,606 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:36,606 INFO ]: Abstraction has 19 states and 40 transitions. [2018-06-22 02:09:36,606 INFO ]: Interpolant automaton has 6 states. [2018-06-22 02:09:36,606 INFO ]: Start isEmpty. Operand 19 states and 40 transitions. [2018-06-22 02:09:36,606 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:09:36,606 INFO ]: Found error trace [2018-06-22 02:09:36,606 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:36,606 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:36,607 INFO ]: Analyzing trace with hash -1874412972, now seen corresponding path program 1 times [2018-06-22 02:09:36,607 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:36,607 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:36,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:36,607 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:36,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:36,616 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:36,680 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:09:36,680 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:36,680 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-22 02:09:36,691 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:36,727 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:36,729 INFO ]: Computing forward predicates... [2018-06-22 02:09:36,737 INFO ]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:09:36,758 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:36,758 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 02:09:36,758 INFO ]: Interpolant automaton has 6 states [2018-06-22 02:09:36,758 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 02:09:36,759 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:09:36,759 INFO ]: Start difference. First operand 19 states and 40 transitions. Second operand 6 states. [2018-06-22 02:09:36,843 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:36,843 INFO ]: Finished difference Result 27 states and 60 transitions. [2018-06-22 02:09:36,845 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 02:09:36,845 INFO ]: Start accepts. Automaton has 6 states. Word has length 12 [2018-06-22 02:09:36,845 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:36,846 INFO ]: With dead ends: 27 [2018-06-22 02:09:36,846 INFO ]: Without dead ends: 22 [2018-06-22 02:09:36,846 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:09:36,846 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 02:09:36,848 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-06-22 02:09:36,848 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 02:09:36,848 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-06-22 02:09:36,848 INFO ]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-06-22 02:09:36,848 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:36,848 INFO ]: Abstraction has 20 states and 37 transitions. [2018-06-22 02:09:36,848 INFO ]: Interpolant automaton has 6 states. [2018-06-22 02:09:36,848 INFO ]: Start isEmpty. Operand 20 states and 37 transitions. [2018-06-22 02:09:36,848 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:09:36,848 INFO ]: Found error trace [2018-06-22 02:09:36,848 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:36,849 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:36,849 INFO ]: Analyzing trace with hash -1869795367, now seen corresponding path program 1 times [2018-06-22 02:09:36,849 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:36,849 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:36,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:36,849 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:36,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:36,857 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:36,957 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:09:36,957 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:36,957 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-22 02:09:36,963 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:36,996 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:36,998 INFO ]: Computing forward predicates... [2018-06-22 02:09:37,056 INFO ]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:09:37,076 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:09:37,076 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2018-06-22 02:09:37,076 INFO ]: Interpolant automaton has 9 states [2018-06-22 02:09:37,076 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 02:09:37,076 INFO ]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:09:37,076 INFO ]: Start difference. First operand 20 states and 37 transitions. Second operand 9 states. [2018-06-22 02:09:37,156 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:37,156 INFO ]: Finished difference Result 20 states and 36 transitions. [2018-06-22 02:09:37,156 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 02:09:37,157 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-22 02:09:37,157 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:37,157 INFO ]: With dead ends: 20 [2018-06-22 02:09:37,157 INFO ]: Without dead ends: 16 [2018-06-22 02:09:37,157 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:09:37,157 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 02:09:37,158 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 02:09:37,158 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 02:09:37,159 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2018-06-22 02:09:37,159 INFO ]: Start accepts. Automaton has 16 states and 30 transitions. Word has length 12 [2018-06-22 02:09:37,159 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:37,159 INFO ]: Abstraction has 16 states and 30 transitions. [2018-06-22 02:09:37,159 INFO ]: Interpolant automaton has 9 states. [2018-06-22 02:09:37,160 INFO ]: Start isEmpty. Operand 16 states and 30 transitions. [2018-06-22 02:09:37,160 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 02:09:37,160 INFO ]: Found error trace [2018-06-22 02:09:37,160 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:37,160 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:37,160 INFO ]: Analyzing trace with hash 847549622, now seen corresponding path program 1 times [2018-06-22 02:09:37,160 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:37,160 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:37,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:37,161 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:37,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:37,180 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:37,388 INFO ]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:09:37,388 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:37,388 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-22 02:09:37,395 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:37,434 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:37,438 INFO ]: Computing forward predicates... [2018-06-22 02:09:37,684 INFO ]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:09:37,716 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:37,716 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 02:09:37,716 INFO ]: Interpolant automaton has 11 states [2018-06-22 02:09:37,716 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 02:09:37,716 INFO ]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:09:37,717 INFO ]: Start difference. First operand 16 states and 30 transitions. Second operand 11 states. [2018-06-22 02:09:38,205 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:38,205 INFO ]: Finished difference Result 47 states and 108 transitions. [2018-06-22 02:09:38,205 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 02:09:38,205 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-22 02:09:38,206 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:38,206 INFO ]: With dead ends: 47 [2018-06-22 02:09:38,206 INFO ]: Without dead ends: 43 [2018-06-22 02:09:38,206 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2018-06-22 02:09:38,206 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 02:09:38,209 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 23. [2018-06-22 02:09:38,209 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 02:09:38,210 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 46 transitions. [2018-06-22 02:09:38,210 INFO ]: Start accepts. Automaton has 23 states and 46 transitions. Word has length 13 [2018-06-22 02:09:38,210 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:38,210 INFO ]: Abstraction has 23 states and 46 transitions. [2018-06-22 02:09:38,210 INFO ]: Interpolant automaton has 11 states. [2018-06-22 02:09:38,210 INFO ]: Start isEmpty. Operand 23 states and 46 transitions. [2018-06-22 02:09:38,210 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 02:09:38,210 INFO ]: Found error trace [2018-06-22 02:09:38,211 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:38,211 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:38,211 INFO ]: Analyzing trace with hash -771143630, now seen corresponding path program 1 times [2018-06-22 02:09:38,211 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:38,211 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:38,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:38,212 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:38,212 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:38,222 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:38,307 INFO ]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:09:38,307 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:38,307 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-22 02:09:38,315 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:38,336 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:38,338 INFO ]: Computing forward predicates... [2018-06-22 02:09:38,349 INFO ]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:09:38,373 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:38,373 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 02:09:38,374 INFO ]: Interpolant automaton has 8 states [2018-06-22 02:09:38,374 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 02:09:38,374 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:09:38,374 INFO ]: Start difference. First operand 23 states and 46 transitions. Second operand 8 states. [2018-06-22 02:09:38,504 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:38,504 INFO ]: Finished difference Result 38 states and 81 transitions. [2018-06-22 02:09:38,504 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 02:09:38,504 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 02:09:38,504 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:38,504 INFO ]: With dead ends: 38 [2018-06-22 02:09:38,504 INFO ]: Without dead ends: 31 [2018-06-22 02:09:38,505 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:09:38,505 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 02:09:38,507 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-06-22 02:09:38,507 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 02:09:38,507 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 46 transitions. [2018-06-22 02:09:38,507 INFO ]: Start accepts. Automaton has 25 states and 46 transitions. Word has length 13 [2018-06-22 02:09:38,507 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:38,507 INFO ]: Abstraction has 25 states and 46 transitions. [2018-06-22 02:09:38,507 INFO ]: Interpolant automaton has 8 states. [2018-06-22 02:09:38,507 INFO ]: Start isEmpty. Operand 25 states and 46 transitions. [2018-06-22 02:09:38,508 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 02:09:38,508 INFO ]: Found error trace [2018-06-22 02:09:38,508 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:38,508 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:38,508 INFO ]: Analyzing trace with hash 1713463936, now seen corresponding path program 1 times [2018-06-22 02:09:38,508 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:38,508 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:38,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:38,509 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:38,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:38,519 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:38,609 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:09:38,609 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:38,609 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-22 02:09:38,615 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:38,635 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:38,636 INFO ]: Computing forward predicates... [2018-06-22 02:09:38,671 INFO ]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:09:38,692 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:38,692 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 02:09:38,692 INFO ]: Interpolant automaton has 10 states [2018-06-22 02:09:38,692 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 02:09:38,692 INFO ]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:09:38,693 INFO ]: Start difference. First operand 25 states and 46 transitions. Second operand 10 states. [2018-06-22 02:09:38,854 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:38,854 INFO ]: Finished difference Result 47 states and 92 transitions. [2018-06-22 02:09:38,855 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 02:09:38,855 INFO ]: Start accepts. Automaton has 10 states. Word has length 14 [2018-06-22 02:09:38,855 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:38,856 INFO ]: With dead ends: 47 [2018-06-22 02:09:38,856 INFO ]: Without dead ends: 46 [2018-06-22 02:09:38,856 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-06-22 02:09:38,856 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 02:09:38,858 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 32. [2018-06-22 02:09:38,858 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 02:09:38,859 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 59 transitions. [2018-06-22 02:09:38,859 INFO ]: Start accepts. Automaton has 32 states and 59 transitions. Word has length 14 [2018-06-22 02:09:38,859 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:38,859 INFO ]: Abstraction has 32 states and 59 transitions. [2018-06-22 02:09:38,859 INFO ]: Interpolant automaton has 10 states. [2018-06-22 02:09:38,859 INFO ]: Start isEmpty. Operand 32 states and 59 transitions. [2018-06-22 02:09:38,859 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 02:09:38,859 INFO ]: Found error trace [2018-06-22 02:09:38,859 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:38,860 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:38,860 INFO ]: Analyzing trace with hash -389729798, now seen corresponding path program 1 times [2018-06-22 02:09:38,860 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:38,860 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:38,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:38,860 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:38,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:38,869 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:39,029 INFO ]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:09:39,029 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:39,029 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:09:39,035 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:39,060 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:39,062 INFO ]: Computing forward predicates... [2018-06-22 02:09:39,076 INFO ]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:09:39,096 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:39,096 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 02:09:39,096 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:09:39,096 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:09:39,096 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:09:39,097 INFO ]: Start difference. First operand 32 states and 59 transitions. Second operand 7 states. [2018-06-22 02:09:39,261 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:39,261 INFO ]: Finished difference Result 50 states and 101 transitions. [2018-06-22 02:09:39,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:09:39,261 INFO ]: Start accepts. Automaton has 7 states. Word has length 14 [2018-06-22 02:09:39,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:39,261 INFO ]: With dead ends: 50 [2018-06-22 02:09:39,261 INFO ]: Without dead ends: 50 [2018-06-22 02:09:39,262 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:09:39,262 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 02:09:39,264 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 36. [2018-06-22 02:09:39,264 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 02:09:39,265 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 69 transitions. [2018-06-22 02:09:39,265 INFO ]: Start accepts. Automaton has 36 states and 69 transitions. Word has length 14 [2018-06-22 02:09:39,265 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:39,265 INFO ]: Abstraction has 36 states and 69 transitions. [2018-06-22 02:09:39,265 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:09:39,265 INFO ]: Start isEmpty. Operand 36 states and 69 transitions. [2018-06-22 02:09:39,266 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 02:09:39,266 INFO ]: Found error trace [2018-06-22 02:09:39,266 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:39,266 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:39,266 INFO ]: Analyzing trace with hash -2008423050, now seen corresponding path program 1 times [2018-06-22 02:09:39,266 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:39,266 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:39,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:39,267 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:39,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:39,276 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:39,343 INFO ]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:09:39,343 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:39,343 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-22 02:09:39,349 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:39,368 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:39,369 INFO ]: Computing forward predicates... [2018-06-22 02:09:39,394 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:09:39,415 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:39,415 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-06-22 02:09:39,415 INFO ]: Interpolant automaton has 9 states [2018-06-22 02:09:39,415 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 02:09:39,415 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:09:39,415 INFO ]: Start difference. First operand 36 states and 69 transitions. Second operand 9 states. [2018-06-22 02:09:39,562 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:39,562 INFO ]: Finished difference Result 49 states and 97 transitions. [2018-06-22 02:09:39,562 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 02:09:39,562 INFO ]: Start accepts. Automaton has 9 states. Word has length 14 [2018-06-22 02:09:39,562 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:39,563 INFO ]: With dead ends: 49 [2018-06-22 02:09:39,563 INFO ]: Without dead ends: 49 [2018-06-22 02:09:39,563 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2018-06-22 02:09:39,563 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 02:09:39,566 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 39. [2018-06-22 02:09:39,566 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 02:09:39,566 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 71 transitions. [2018-06-22 02:09:39,566 INFO ]: Start accepts. Automaton has 39 states and 71 transitions. Word has length 14 [2018-06-22 02:09:39,566 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:39,566 INFO ]: Abstraction has 39 states and 71 transitions. [2018-06-22 02:09:39,566 INFO ]: Interpolant automaton has 9 states. [2018-06-22 02:09:39,566 INFO ]: Start isEmpty. Operand 39 states and 71 transitions. [2018-06-22 02:09:39,567 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 02:09:39,567 INFO ]: Found error trace [2018-06-22 02:09:39,567 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:39,567 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:39,567 INFO ]: Analyzing trace with hash 115098136, now seen corresponding path program 2 times [2018-06-22 02:09:39,567 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:39,567 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:39,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:39,568 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:39,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:39,577 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:39,747 INFO ]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:09:39,748 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:39,748 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-22 02:09:39,757 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:09:39,780 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:09:39,780 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:39,782 INFO ]: Computing forward predicates... [2018-06-22 02:09:39,893 INFO ]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:09:39,913 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:39,913 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-06-22 02:09:39,913 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:09:39,914 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:09:39,914 INFO ]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:09:39,914 INFO ]: Start difference. First operand 39 states and 71 transitions. Second operand 13 states. [2018-06-22 02:09:40,217 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:40,217 INFO ]: Finished difference Result 60 states and 115 transitions. [2018-06-22 02:09:40,217 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 02:09:40,217 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-22 02:09:40,217 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:40,218 INFO ]: With dead ends: 60 [2018-06-22 02:09:40,218 INFO ]: Without dead ends: 49 [2018-06-22 02:09:40,218 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-06-22 02:09:40,218 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 02:09:40,220 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 33. [2018-06-22 02:09:40,220 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 02:09:40,220 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 59 transitions. [2018-06-22 02:09:40,221 INFO ]: Start accepts. Automaton has 33 states and 59 transitions. Word has length 14 [2018-06-22 02:09:40,221 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:40,221 INFO ]: Abstraction has 33 states and 59 transitions. [2018-06-22 02:09:40,221 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:09:40,221 INFO ]: Start isEmpty. Operand 33 states and 59 transitions. [2018-06-22 02:09:40,221 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 02:09:40,221 INFO ]: Found error trace [2018-06-22 02:09:40,221 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:40,221 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:40,221 INFO ]: Analyzing trace with hash -2135361458, now seen corresponding path program 2 times [2018-06-22 02:09:40,221 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:40,221 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:40,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:40,222 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:40,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:40,231 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:40,478 INFO ]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:09:40,478 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:40,478 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-22 02:09:40,483 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:09:40,507 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:09:40,507 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:40,509 INFO ]: Computing forward predicates... [2018-06-22 02:09:40,582 INFO ]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:09:40,602 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:40,602 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-22 02:09:40,602 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:09:40,602 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:09:40,602 INFO ]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:09:40,602 INFO ]: Start difference. First operand 33 states and 59 transitions. Second operand 13 states. [2018-06-22 02:09:40,840 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:40,840 INFO ]: Finished difference Result 48 states and 98 transitions. [2018-06-22 02:09:40,840 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 02:09:40,841 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-22 02:09:40,841 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:40,841 INFO ]: With dead ends: 48 [2018-06-22 02:09:40,841 INFO ]: Without dead ends: 35 [2018-06-22 02:09:40,841 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-06-22 02:09:40,841 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 02:09:40,845 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-06-22 02:09:40,845 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 02:09:40,845 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 53 transitions. [2018-06-22 02:09:40,845 INFO ]: Start accepts. Automaton has 29 states and 53 transitions. Word has length 15 [2018-06-22 02:09:40,845 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:40,845 INFO ]: Abstraction has 29 states and 53 transitions. [2018-06-22 02:09:40,845 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:09:40,845 INFO ]: Start isEmpty. Operand 29 states and 53 transitions. [2018-06-22 02:09:40,846 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 02:09:40,846 INFO ]: Found error trace [2018-06-22 02:09:40,846 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:40,846 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:40,846 INFO ]: Analyzing trace with hash -1925230406, now seen corresponding path program 1 times [2018-06-22 02:09:40,846 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:40,846 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:40,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:40,846 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:40,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:40,856 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:41,227 INFO ]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:09:41,227 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:41,227 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-22 02:09:41,234 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:41,268 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:41,272 INFO ]: Computing forward predicates... [2018-06-22 02:09:41,403 INFO ]: Checked inductivity of 12 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 02:09:41,436 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:41,436 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-22 02:09:41,436 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:09:41,436 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:09:41,437 INFO ]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:09:41,437 INFO ]: Start difference. First operand 29 states and 53 transitions. Second operand 13 states. [2018-06-22 02:09:41,863 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:41,863 INFO ]: Finished difference Result 39 states and 82 transitions. [2018-06-22 02:09:41,864 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 02:09:41,865 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-22 02:09:41,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:41,865 INFO ]: With dead ends: 39 [2018-06-22 02:09:41,865 INFO ]: Without dead ends: 30 [2018-06-22 02:09:41,865 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2018-06-22 02:09:41,865 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 02:09:41,867 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 23. [2018-06-22 02:09:41,867 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 02:09:41,867 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 43 transitions. [2018-06-22 02:09:41,867 INFO ]: Start accepts. Automaton has 23 states and 43 transitions. Word has length 16 [2018-06-22 02:09:41,867 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:41,867 INFO ]: Abstraction has 23 states and 43 transitions. [2018-06-22 02:09:41,867 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:09:41,867 INFO ]: Start isEmpty. Operand 23 states and 43 transitions. [2018-06-22 02:09:41,868 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 02:09:41,868 INFO ]: Found error trace [2018-06-22 02:09:41,868 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:41,868 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:41,868 INFO ]: Analyzing trace with hash 136208952, now seen corresponding path program 3 times [2018-06-22 02:09:41,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:41,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:41,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:41,868 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:41,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:41,881 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:42,712 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 02:09:42,810 INFO ]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:09:42,810 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:42,810 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-22 02:09:42,816 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:09:42,845 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 02:09:42,845 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:42,848 INFO ]: Computing forward predicates... [2018-06-22 02:09:43,313 WARN ]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-22 02:09:43,422 INFO ]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:09:43,444 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:43,444 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2018-06-22 02:09:43,444 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:09:43,444 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:09:43,444 INFO ]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:09:43,444 INFO ]: Start difference. First operand 23 states and 43 transitions. Second operand 13 states. [2018-06-22 02:09:44,045 WARN ]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-06-22 02:09:44,466 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:44,466 INFO ]: Finished difference Result 72 states and 153 transitions. [2018-06-22 02:09:44,468 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 02:09:44,468 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-22 02:09:44,469 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:44,469 INFO ]: With dead ends: 72 [2018-06-22 02:09:44,469 INFO ]: Without dead ends: 62 [2018-06-22 02:09:44,469 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2018-06-22 02:09:44,469 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 02:09:44,471 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 31. [2018-06-22 02:09:44,471 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 02:09:44,471 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 59 transitions. [2018-06-22 02:09:44,471 INFO ]: Start accepts. Automaton has 31 states and 59 transitions. Word has length 16 [2018-06-22 02:09:44,471 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:44,471 INFO ]: Abstraction has 31 states and 59 transitions. [2018-06-22 02:09:44,471 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:09:44,471 INFO ]: Start isEmpty. Operand 31 states and 59 transitions. [2018-06-22 02:09:44,471 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 02:09:44,471 INFO ]: Found error trace [2018-06-22 02:09:44,471 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:44,471 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:44,471 INFO ]: Analyzing trace with hash -649845068, now seen corresponding path program 2 times [2018-06-22 02:09:44,471 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:44,471 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:44,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:44,472 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:44,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:44,482 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:44,579 INFO ]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:09:44,579 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:44,579 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) [2018-06-22 02:09:44,594 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:09:44,622 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:09:44,622 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:44,624 INFO ]: Computing forward predicates... [2018-06-22 02:09:44,637 INFO ]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:09:44,656 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:44,656 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-22 02:09:44,656 INFO ]: Interpolant automaton has 10 states [2018-06-22 02:09:44,656 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 02:09:44,656 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:09:44,656 INFO ]: Start difference. First operand 31 states and 59 transitions. Second operand 10 states. [2018-06-22 02:09:44,734 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:44,734 INFO ]: Finished difference Result 56 states and 105 transitions. [2018-06-22 02:09:44,735 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 02:09:44,735 INFO ]: Start accepts. Automaton has 10 states. Word has length 16 [2018-06-22 02:09:44,735 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:44,735 INFO ]: With dead ends: 56 [2018-06-22 02:09:44,735 INFO ]: Without dead ends: 46 [2018-06-22 02:09:44,736 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:09:44,736 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 02:09:44,738 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-06-22 02:09:44,738 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 02:09:44,739 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 62 transitions. [2018-06-22 02:09:44,739 INFO ]: Start accepts. Automaton has 35 states and 62 transitions. Word has length 16 [2018-06-22 02:09:44,739 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:44,739 INFO ]: Abstraction has 35 states and 62 transitions. [2018-06-22 02:09:44,739 INFO ]: Interpolant automaton has 10 states. [2018-06-22 02:09:44,739 INFO ]: Start isEmpty. Operand 35 states and 62 transitions. [2018-06-22 02:09:44,739 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 02:09:44,739 INFO ]: Found error trace [2018-06-22 02:09:44,739 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:44,740 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:44,740 INFO ]: Analyzing trace with hash 1015957550, now seen corresponding path program 2 times [2018-06-22 02:09:44,740 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:44,740 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:44,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:44,740 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:44,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:44,750 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:45,152 INFO ]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:09:45,152 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:45,152 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-22 02:09:45,160 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:09:45,189 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:09:45,189 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:45,191 INFO ]: Computing forward predicates... [2018-06-22 02:09:45,236 INFO ]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:09:45,256 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:45,256 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-22 02:09:45,256 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:09:45,256 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:09:45,256 INFO ]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:09:45,257 INFO ]: Start difference. First operand 35 states and 62 transitions. Second operand 13 states. [2018-06-22 02:09:45,517 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:45,517 INFO ]: Finished difference Result 79 states and 146 transitions. [2018-06-22 02:09:45,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 02:09:45,517 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 02:09:45,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:45,518 INFO ]: With dead ends: 79 [2018-06-22 02:09:45,518 INFO ]: Without dead ends: 77 [2018-06-22 02:09:45,518 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2018-06-22 02:09:45,518 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-22 02:09:45,520 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 47. [2018-06-22 02:09:45,520 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 02:09:45,520 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 80 transitions. [2018-06-22 02:09:45,520 INFO ]: Start accepts. Automaton has 47 states and 80 transitions. Word has length 17 [2018-06-22 02:09:45,520 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:45,520 INFO ]: Abstraction has 47 states and 80 transitions. [2018-06-22 02:09:45,520 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:09:45,520 INFO ]: Start isEmpty. Operand 47 states and 80 transitions. [2018-06-22 02:09:45,521 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 02:09:45,521 INFO ]: Found error trace [2018-06-22 02:09:45,521 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:45,521 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:45,521 INFO ]: Analyzing trace with hash -245657996, now seen corresponding path program 2 times [2018-06-22 02:09:45,521 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:45,521 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:45,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:45,522 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:45,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:45,531 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:45,574 INFO ]: Checked inductivity of 15 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:09:45,574 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:45,574 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) [2018-06-22 02:09:45,590 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:09:45,616 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:09:45,616 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:45,617 INFO ]: Computing forward predicates... [2018-06-22 02:09:45,647 INFO ]: Checked inductivity of 15 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:09:45,667 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:45,667 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 02:09:45,667 INFO ]: Interpolant automaton has 9 states [2018-06-22 02:09:45,667 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 02:09:45,667 INFO ]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:09:45,667 INFO ]: Start difference. First operand 47 states and 80 transitions. Second operand 9 states. [2018-06-22 02:09:45,757 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:45,757 INFO ]: Finished difference Result 74 states and 126 transitions. [2018-06-22 02:09:45,757 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 02:09:45,757 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 02:09:45,757 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:45,757 INFO ]: With dead ends: 74 [2018-06-22 02:09:45,757 INFO ]: Without dead ends: 74 [2018-06-22 02:09:45,758 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:09:45,758 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 02:09:45,759 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 46. [2018-06-22 02:09:45,759 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 02:09:45,760 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 78 transitions. [2018-06-22 02:09:45,760 INFO ]: Start accepts. Automaton has 46 states and 78 transitions. Word has length 17 [2018-06-22 02:09:45,760 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:45,760 INFO ]: Abstraction has 46 states and 78 transitions. [2018-06-22 02:09:45,760 INFO ]: Interpolant automaton has 9 states. [2018-06-22 02:09:45,760 INFO ]: Start isEmpty. Operand 46 states and 78 transitions. [2018-06-22 02:09:45,761 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 02:09:45,761 INFO ]: Found error trace [2018-06-22 02:09:45,761 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:45,761 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:45,761 INFO ]: Analyzing trace with hash -1031712016, now seen corresponding path program 3 times [2018-06-22 02:09:45,761 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:45,761 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:45,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:45,761 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:45,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:45,773 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:45,841 INFO ]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:09:45,841 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:45,841 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-22 02:09:45,847 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:09:45,885 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 02:09:45,885 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:45,886 INFO ]: Computing forward predicates... [2018-06-22 02:09:45,963 INFO ]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:09:45,987 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:45,987 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-22 02:09:45,987 INFO ]: Interpolant automaton has 15 states [2018-06-22 02:09:45,987 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 02:09:45,987 INFO ]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:09:45,987 INFO ]: Start difference. First operand 46 states and 78 transitions. Second operand 15 states. [2018-06-22 02:09:46,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:46,521 INFO ]: Finished difference Result 105 states and 240 transitions. [2018-06-22 02:09:46,524 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 02:09:46,524 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-22 02:09:46,524 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:46,525 INFO ]: With dead ends: 105 [2018-06-22 02:09:46,525 INFO ]: Without dead ends: 105 [2018-06-22 02:09:46,525 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=470, Invalid=936, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 02:09:46,525 INFO ]: Start minimizeSevpa. Operand 105 states. [2018-06-22 02:09:46,528 INFO ]: Finished minimizeSevpa. Reduced states from 105 to 49. [2018-06-22 02:09:46,530 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 02:09:46,531 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 93 transitions. [2018-06-22 02:09:46,531 INFO ]: Start accepts. Automaton has 49 states and 93 transitions. Word has length 17 [2018-06-22 02:09:46,531 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:46,531 INFO ]: Abstraction has 49 states and 93 transitions. [2018-06-22 02:09:46,531 INFO ]: Interpolant automaton has 15 states. [2018-06-22 02:09:46,531 INFO ]: Start isEmpty. Operand 49 states and 93 transitions. [2018-06-22 02:09:46,531 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 02:09:46,531 INFO ]: Found error trace [2018-06-22 02:09:46,531 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:46,531 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:46,531 INFO ]: Analyzing trace with hash -1285940342, now seen corresponding path program 4 times [2018-06-22 02:09:46,531 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:46,531 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:46,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:46,532 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:46,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:46,541 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:46,682 INFO ]: Checked inductivity of 16 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:09:46,682 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:46,682 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-22 02:09:46,689 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:09:46,713 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:09:46,713 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:46,715 INFO ]: Computing forward predicates... [2018-06-22 02:09:46,834 INFO ]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:09:46,853 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:46,853 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-06-22 02:09:46,854 INFO ]: Interpolant automaton has 17 states [2018-06-22 02:09:46,854 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 02:09:46,854 INFO ]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:09:46,854 INFO ]: Start difference. First operand 49 states and 93 transitions. Second operand 17 states. [2018-06-22 02:09:47,373 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:47,373 INFO ]: Finished difference Result 106 states and 218 transitions. [2018-06-22 02:09:47,374 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 02:09:47,374 INFO ]: Start accepts. Automaton has 17 states. Word has length 17 [2018-06-22 02:09:47,374 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:47,375 INFO ]: With dead ends: 106 [2018-06-22 02:09:47,375 INFO ]: Without dead ends: 88 [2018-06-22 02:09:47,375 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=576, Unknown=0, NotChecked=0, Total=756 [2018-06-22 02:09:47,375 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 02:09:47,377 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 46. [2018-06-22 02:09:47,377 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 02:09:47,378 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 86 transitions. [2018-06-22 02:09:47,378 INFO ]: Start accepts. Automaton has 46 states and 86 transitions. Word has length 17 [2018-06-22 02:09:47,378 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:47,378 INFO ]: Abstraction has 46 states and 86 transitions. [2018-06-22 02:09:47,378 INFO ]: Interpolant automaton has 17 states. [2018-06-22 02:09:47,378 INFO ]: Start isEmpty. Operand 46 states and 86 transitions. [2018-06-22 02:09:47,379 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 02:09:47,379 INFO ]: Found error trace [2018-06-22 02:09:47,379 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:47,379 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:47,379 INFO ]: Analyzing trace with hash -1922090476, now seen corresponding path program 4 times [2018-06-22 02:09:47,379 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:47,379 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:47,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:47,380 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:47,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:47,391 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:47,818 INFO ]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:09:47,818 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:47,818 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-22 02:09:47,826 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:09:47,854 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:09:47,854 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:47,856 INFO ]: Computing forward predicates... [2018-06-22 02:09:47,862 INFO ]: Checked inductivity of 18 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 02:09:47,883 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:47,883 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 02:09:47,883 INFO ]: Interpolant automaton has 10 states [2018-06-22 02:09:47,884 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 02:09:47,884 INFO ]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:09:47,884 INFO ]: Start difference. First operand 46 states and 86 transitions. Second operand 10 states. [2018-06-22 02:09:47,979 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:47,979 INFO ]: Finished difference Result 70 states and 154 transitions. [2018-06-22 02:09:47,980 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 02:09:47,980 INFO ]: Start accepts. Automaton has 10 states. Word has length 18 [2018-06-22 02:09:47,980 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:47,981 INFO ]: With dead ends: 70 [2018-06-22 02:09:47,981 INFO ]: Without dead ends: 45 [2018-06-22 02:09:47,981 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:09:47,981 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 02:09:47,982 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-06-22 02:09:47,982 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 02:09:47,983 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 78 transitions. [2018-06-22 02:09:47,983 INFO ]: Start accepts. Automaton has 40 states and 78 transitions. Word has length 18 [2018-06-22 02:09:47,983 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:47,983 INFO ]: Abstraction has 40 states and 78 transitions. [2018-06-22 02:09:47,983 INFO ]: Interpolant automaton has 10 states. [2018-06-22 02:09:47,983 INFO ]: Start isEmpty. Operand 40 states and 78 transitions. [2018-06-22 02:09:47,983 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 02:09:47,983 INFO ]: Found error trace [2018-06-22 02:09:47,983 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:47,983 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:47,983 INFO ]: Analyzing trace with hash -1138436052, now seen corresponding path program 2 times [2018-06-22 02:09:47,983 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:47,983 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:47,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:47,984 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:47,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:47,993 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:48,130 INFO ]: Checked inductivity of 22 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 02:09:48,131 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:48,131 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-22 02:09:48,137 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:09:48,166 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:09:48,166 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:48,168 INFO ]: Computing forward predicates... [2018-06-22 02:09:48,321 INFO ]: Checked inductivity of 22 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 02:09:48,341 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:48,341 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-06-22 02:09:48,341 INFO ]: Interpolant automaton has 16 states [2018-06-22 02:09:48,342 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 02:09:48,342 INFO ]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-06-22 02:09:48,342 INFO ]: Start difference. First operand 40 states and 78 transitions. Second operand 16 states. [2018-06-22 02:09:48,627 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:48,627 INFO ]: Finished difference Result 62 states and 140 transitions. [2018-06-22 02:09:48,627 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 02:09:48,627 INFO ]: Start accepts. Automaton has 16 states. Word has length 19 [2018-06-22 02:09:48,627 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:48,628 INFO ]: With dead ends: 62 [2018-06-22 02:09:48,628 INFO ]: Without dead ends: 46 [2018-06-22 02:09:48,628 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2018-06-22 02:09:48,628 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 02:09:48,629 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 32. [2018-06-22 02:09:48,630 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 02:09:48,630 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 66 transitions. [2018-06-22 02:09:48,630 INFO ]: Start accepts. Automaton has 32 states and 66 transitions. Word has length 19 [2018-06-22 02:09:48,630 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:48,630 INFO ]: Abstraction has 32 states and 66 transitions. [2018-06-22 02:09:48,630 INFO ]: Interpolant automaton has 16 states. [2018-06-22 02:09:48,630 INFO ]: Start isEmpty. Operand 32 states and 66 transitions. [2018-06-22 02:09:48,630 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 02:09:48,630 INFO ]: Found error trace [2018-06-22 02:09:48,630 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:48,630 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:48,630 INFO ]: Analyzing trace with hash 539808886, now seen corresponding path program 5 times [2018-06-22 02:09:48,630 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:48,630 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:48,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:48,631 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:48,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:48,646 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:48,870 INFO ]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 02:09:48,870 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:48,870 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-22 02:09:48,876 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:09:48,944 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 02:09:48,944 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:48,948 INFO ]: Computing forward predicates... [2018-06-22 02:09:49,323 INFO ]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 02:09:49,343 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:49,343 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-22 02:09:49,343 INFO ]: Interpolant automaton has 10 states [2018-06-22 02:09:49,344 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 02:09:49,344 INFO ]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:09:49,344 INFO ]: Start difference. First operand 32 states and 66 transitions. Second operand 10 states. [2018-06-22 02:09:49,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:49,636 INFO ]: Finished difference Result 73 states and 165 transitions. [2018-06-22 02:09:49,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 02:09:49,636 INFO ]: Start accepts. Automaton has 10 states. Word has length 19 [2018-06-22 02:09:49,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:49,636 INFO ]: With dead ends: 73 [2018-06-22 02:09:49,636 INFO ]: Without dead ends: 61 [2018-06-22 02:09:49,637 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 11 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:09:49,637 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 02:09:49,638 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 38. [2018-06-22 02:09:49,638 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 02:09:49,638 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 76 transitions. [2018-06-22 02:09:49,638 INFO ]: Start accepts. Automaton has 38 states and 76 transitions. Word has length 19 [2018-06-22 02:09:49,638 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:49,638 INFO ]: Abstraction has 38 states and 76 transitions. [2018-06-22 02:09:49,638 INFO ]: Interpolant automaton has 10 states. [2018-06-22 02:09:49,638 INFO ]: Start isEmpty. Operand 38 states and 76 transitions. [2018-06-22 02:09:49,638 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 02:09:49,638 INFO ]: Found error trace [2018-06-22 02:09:49,638 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:49,638 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:49,638 INFO ]: Analyzing trace with hash 1056139762, now seen corresponding path program 3 times [2018-06-22 02:09:49,638 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:49,638 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:49,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:49,639 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:49,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:49,649 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:50,007 INFO ]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:09:50,007 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:50,007 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-22 02:09:50,014 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:09:50,049 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 02:09:50,049 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:50,051 INFO ]: Computing forward predicates... [2018-06-22 02:09:50,108 INFO ]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:09:50,127 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:50,127 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-22 02:09:50,127 INFO ]: Interpolant automaton has 12 states [2018-06-22 02:09:50,127 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 02:09:50,128 INFO ]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:09:50,128 INFO ]: Start difference. First operand 38 states and 76 transitions. Second operand 12 states. [2018-06-22 02:09:50,217 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:50,217 INFO ]: Finished difference Result 84 states and 163 transitions. [2018-06-22 02:09:50,217 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 02:09:50,217 INFO ]: Start accepts. Automaton has 12 states. Word has length 19 [2018-06-22 02:09:50,217 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:50,218 INFO ]: With dead ends: 84 [2018-06-22 02:09:50,218 INFO ]: Without dead ends: 69 [2018-06-22 02:09:50,218 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:09:50,218 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 02:09:50,220 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 48. [2018-06-22 02:09:50,220 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 02:09:50,220 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 89 transitions. [2018-06-22 02:09:50,220 INFO ]: Start accepts. Automaton has 48 states and 89 transitions. Word has length 19 [2018-06-22 02:09:50,220 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:50,220 INFO ]: Abstraction has 48 states and 89 transitions. [2018-06-22 02:09:50,220 INFO ]: Interpolant automaton has 12 states. [2018-06-22 02:09:50,220 INFO ]: Start isEmpty. Operand 48 states and 89 transitions. [2018-06-22 02:09:50,221 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:09:50,221 INFO ]: Found error trace [2018-06-22 02:09:50,221 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:50,221 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:50,221 INFO ]: Analyzing trace with hash 1239851712, now seen corresponding path program 3 times [2018-06-22 02:09:50,221 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:50,221 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:50,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:50,221 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:50,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:50,232 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:50,365 INFO ]: Checked inductivity of 26 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:09:50,365 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:50,365 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-22 02:09:50,371 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:09:50,424 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 02:09:50,424 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:50,427 INFO ]: Computing forward predicates... [2018-06-22 02:09:50,433 INFO ]: Checked inductivity of 26 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:09:50,457 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:50,457 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 02:09:50,457 INFO ]: Interpolant automaton has 11 states [2018-06-22 02:09:50,457 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 02:09:50,457 INFO ]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:09:50,457 INFO ]: Start difference. First operand 48 states and 89 transitions. Second operand 11 states. [2018-06-22 02:09:50,857 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:50,857 INFO ]: Finished difference Result 111 states and 199 transitions. [2018-06-22 02:09:50,860 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 02:09:50,860 INFO ]: Start accepts. Automaton has 11 states. Word has length 20 [2018-06-22 02:09:50,860 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:50,861 INFO ]: With dead ends: 111 [2018-06-22 02:09:50,861 INFO ]: Without dead ends: 108 [2018-06-22 02:09:50,861 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=240, Unknown=0, NotChecked=0, Total=380 [2018-06-22 02:09:50,861 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 02:09:50,864 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 52. [2018-06-22 02:09:50,865 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 02:09:50,865 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 98 transitions. [2018-06-22 02:09:50,865 INFO ]: Start accepts. Automaton has 52 states and 98 transitions. Word has length 20 [2018-06-22 02:09:50,865 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:50,865 INFO ]: Abstraction has 52 states and 98 transitions. [2018-06-22 02:09:50,865 INFO ]: Interpolant automaton has 11 states. [2018-06-22 02:09:50,865 INFO ]: Start isEmpty. Operand 52 states and 98 transitions. [2018-06-22 02:09:50,866 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:09:50,866 INFO ]: Found error trace [2018-06-22 02:09:50,866 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:50,866 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:50,866 INFO ]: Analyzing trace with hash 1709928122, now seen corresponding path program 3 times [2018-06-22 02:09:50,866 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:50,866 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:50,867 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:50,867 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:50,867 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:50,878 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:50,944 INFO ]: Checked inductivity of 26 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 02:09:50,944 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:50,944 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-22 02:09:50,950 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:09:50,984 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 02:09:50,984 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:50,986 INFO ]: Computing forward predicates... [2018-06-22 02:09:51,001 INFO ]: Checked inductivity of 26 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 02:09:51,020 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:51,020 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-22 02:09:51,020 INFO ]: Interpolant automaton has 11 states [2018-06-22 02:09:51,020 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 02:09:51,020 INFO ]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:09:51,021 INFO ]: Start difference. First operand 52 states and 98 transitions. Second operand 11 states. [2018-06-22 02:09:51,158 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:51,158 INFO ]: Finished difference Result 90 states and 170 transitions. [2018-06-22 02:09:51,160 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 02:09:51,160 INFO ]: Start accepts. Automaton has 11 states. Word has length 20 [2018-06-22 02:09:51,160 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:51,160 INFO ]: With dead ends: 90 [2018-06-22 02:09:51,160 INFO ]: Without dead ends: 90 [2018-06-22 02:09:51,161 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2018-06-22 02:09:51,161 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-22 02:09:51,163 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 51. [2018-06-22 02:09:51,163 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 02:09:51,163 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 96 transitions. [2018-06-22 02:09:51,163 INFO ]: Start accepts. Automaton has 51 states and 96 transitions. Word has length 20 [2018-06-22 02:09:51,163 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:51,163 INFO ]: Abstraction has 51 states and 96 transitions. [2018-06-22 02:09:51,163 INFO ]: Interpolant automaton has 11 states. [2018-06-22 02:09:51,163 INFO ]: Start isEmpty. Operand 51 states and 96 transitions. [2018-06-22 02:09:51,163 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:09:51,163 INFO ]: Found error trace [2018-06-22 02:09:51,164 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:51,164 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:51,164 INFO ]: Analyzing trace with hash -2068708298, now seen corresponding path program 5 times [2018-06-22 02:09:51,164 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:51,164 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:51,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:51,164 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:51,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:51,179 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:51,364 INFO ]: Checked inductivity of 26 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 02:09:51,365 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:51,365 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-22 02:09:51,371 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:09:51,403 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 02:09:51,403 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:51,406 INFO ]: Computing forward predicates... [2018-06-22 02:09:51,603 INFO ]: Checked inductivity of 26 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:09:51,625 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:51,625 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-06-22 02:09:51,625 INFO ]: Interpolant automaton has 20 states [2018-06-22 02:09:51,625 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 02:09:51,625 INFO ]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-06-22 02:09:51,625 INFO ]: Start difference. First operand 51 states and 96 transitions. Second operand 20 states. [2018-06-22 02:09:52,153 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:52,153 INFO ]: Finished difference Result 213 states and 512 transitions. [2018-06-22 02:09:52,154 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 02:09:52,154 INFO ]: Start accepts. Automaton has 20 states. Word has length 20 [2018-06-22 02:09:52,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:52,156 INFO ]: With dead ends: 213 [2018-06-22 02:09:52,156 INFO ]: Without dead ends: 173 [2018-06-22 02:09:52,156 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 02:09:52,156 INFO ]: Start minimizeSevpa. Operand 173 states. [2018-06-22 02:09:52,159 INFO ]: Finished minimizeSevpa. Reduced states from 173 to 53. [2018-06-22 02:09:52,159 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 02:09:52,160 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 102 transitions. [2018-06-22 02:09:52,160 INFO ]: Start accepts. Automaton has 53 states and 102 transitions. Word has length 20 [2018-06-22 02:09:52,160 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:52,160 INFO ]: Abstraction has 53 states and 102 transitions. [2018-06-22 02:09:52,160 INFO ]: Interpolant automaton has 20 states. [2018-06-22 02:09:52,160 INFO ]: Start isEmpty. Operand 53 states and 102 transitions. [2018-06-22 02:09:52,160 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:09:52,160 INFO ]: Found error trace [2018-06-22 02:09:52,160 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:52,160 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:52,160 INFO ]: Analyzing trace with hash 1591414488, now seen corresponding path program 6 times [2018-06-22 02:09:52,160 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:52,160 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:52,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:52,161 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:52,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:52,172 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:52,683 INFO ]: Checked inductivity of 27 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:09:52,683 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:52,683 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-22 02:09:52,689 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:09:52,743 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 02:09:52,743 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:52,745 INFO ]: Computing forward predicates... [2018-06-22 02:09:52,829 INFO ]: Checked inductivity of 27 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:09:52,849 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:52,849 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-06-22 02:09:52,849 INFO ]: Interpolant automaton has 21 states [2018-06-22 02:09:52,849 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 02:09:52,849 INFO ]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-06-22 02:09:52,850 INFO ]: Start difference. First operand 53 states and 102 transitions. Second operand 21 states. [2018-06-22 02:09:53,117 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:53,117 INFO ]: Finished difference Result 110 states and 216 transitions. [2018-06-22 02:09:53,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 02:09:53,118 INFO ]: Start accepts. Automaton has 21 states. Word has length 20 [2018-06-22 02:09:53,118 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:53,118 INFO ]: With dead ends: 110 [2018-06-22 02:09:53,118 INFO ]: Without dead ends: 98 [2018-06-22 02:09:53,118 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2018-06-22 02:09:53,119 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 02:09:53,120 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 58. [2018-06-22 02:09:53,120 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 02:09:53,121 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 116 transitions. [2018-06-22 02:09:53,121 INFO ]: Start accepts. Automaton has 58 states and 116 transitions. Word has length 20 [2018-06-22 02:09:53,121 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:53,121 INFO ]: Abstraction has 58 states and 116 transitions. [2018-06-22 02:09:53,121 INFO ]: Interpolant automaton has 21 states. [2018-06-22 02:09:53,121 INFO ]: Start isEmpty. Operand 58 states and 116 transitions. [2018-06-22 02:09:53,121 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 02:09:53,121 INFO ]: Found error trace [2018-06-22 02:09:53,121 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:53,121 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:53,121 INFO ]: Analyzing trace with hash 2135403386, now seen corresponding path program 3 times [2018-06-22 02:09:53,121 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:53,121 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:53,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:53,122 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:53,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:53,137 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:53,349 INFO ]: Checked inductivity of 35 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 02:09:53,349 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:53,349 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-22 02:09:53,357 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:09:53,432 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 02:09:53,432 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:53,435 INFO ]: Computing forward predicates... [2018-06-22 02:09:53,521 INFO ]: Checked inductivity of 35 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 02:09:53,541 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:53,541 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-06-22 02:09:53,541 INFO ]: Interpolant automaton has 17 states [2018-06-22 02:09:53,541 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 02:09:53,541 INFO ]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:09:53,541 INFO ]: Start difference. First operand 58 states and 116 transitions. Second operand 17 states. [2018-06-22 02:09:53,961 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:53,961 INFO ]: Finished difference Result 98 states and 194 transitions. [2018-06-22 02:09:53,961 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 02:09:53,961 INFO ]: Start accepts. Automaton has 17 states. Word has length 22 [2018-06-22 02:09:53,962 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:53,962 INFO ]: With dead ends: 98 [2018-06-22 02:09:53,962 INFO ]: Without dead ends: 98 [2018-06-22 02:09:53,962 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=326, Invalid=730, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 02:09:53,962 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 02:09:53,964 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 49. [2018-06-22 02:09:53,964 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 02:09:53,964 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 85 transitions. [2018-06-22 02:09:53,964 INFO ]: Start accepts. Automaton has 49 states and 85 transitions. Word has length 22 [2018-06-22 02:09:53,964 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:53,964 INFO ]: Abstraction has 49 states and 85 transitions. [2018-06-22 02:09:53,964 INFO ]: Interpolant automaton has 17 states. [2018-06-22 02:09:53,964 INFO ]: Start isEmpty. Operand 49 states and 85 transitions. [2018-06-22 02:09:53,965 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 02:09:53,965 INFO ]: Found error trace [2018-06-22 02:09:53,965 INFO ]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:53,965 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:53,965 INFO ]: Analyzing trace with hash 516710134, now seen corresponding path program 4 times [2018-06-22 02:09:53,965 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:53,965 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:53,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:53,965 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:53,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:53,974 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:54,549 INFO ]: Checked inductivity of 35 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 02:09:54,550 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:54,550 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) [2018-06-22 02:09:54,555 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:09:54,589 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:09:54,589 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:54,591 INFO ]: Computing forward predicates... [2018-06-22 02:09:54,636 INFO ]: Checked inductivity of 35 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 02:09:54,656 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:54,656 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 16 [2018-06-22 02:09:54,656 INFO ]: Interpolant automaton has 16 states [2018-06-22 02:09:54,656 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 02:09:54,656 INFO ]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-06-22 02:09:54,656 INFO ]: Start difference. First operand 49 states and 85 transitions. Second operand 16 states. [2018-06-22 02:09:54,946 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:54,946 INFO ]: Finished difference Result 102 states and 200 transitions. [2018-06-22 02:09:54,946 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 02:09:54,946 INFO ]: Start accepts. Automaton has 16 states. Word has length 22 [2018-06-22 02:09:54,946 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:54,947 INFO ]: With dead ends: 102 [2018-06-22 02:09:54,947 INFO ]: Without dead ends: 61 [2018-06-22 02:09:54,947 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-06-22 02:09:54,947 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 02:09:54,948 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 40. [2018-06-22 02:09:54,948 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 02:09:54,949 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 74 transitions. [2018-06-22 02:09:54,949 INFO ]: Start accepts. Automaton has 40 states and 74 transitions. Word has length 22 [2018-06-22 02:09:54,949 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:54,949 INFO ]: Abstraction has 40 states and 74 transitions. [2018-06-22 02:09:54,949 INFO ]: Interpolant automaton has 16 states. [2018-06-22 02:09:54,949 INFO ]: Start isEmpty. Operand 40 states and 74 transitions. [2018-06-22 02:09:54,949 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 02:09:54,949 INFO ]: Found error trace [2018-06-22 02:09:54,949 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:54,949 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:54,949 INFO ]: Analyzing trace with hash -990192652, now seen corresponding path program 4 times [2018-06-22 02:09:54,949 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:54,950 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:54,950 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:54,950 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:54,950 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:54,962 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:56,120 INFO ]: Checked inductivity of 35 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 02:09:56,120 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:56,120 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-22 02:09:56,131 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:09:56,180 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:09:56,180 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:56,182 INFO ]: Computing forward predicates... [2018-06-22 02:09:56,214 INFO ]: Checked inductivity of 35 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 02:09:56,242 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:56,242 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-22 02:09:56,242 INFO ]: Interpolant automaton has 14 states [2018-06-22 02:09:56,242 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 02:09:56,242 INFO ]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:09:56,243 INFO ]: Start difference. First operand 40 states and 74 transitions. Second operand 14 states. [2018-06-22 02:09:57,189 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:57,189 INFO ]: Finished difference Result 97 states and 170 transitions. [2018-06-22 02:09:57,189 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 02:09:57,190 INFO ]: Start accepts. Automaton has 14 states. Word has length 22 [2018-06-22 02:09:57,190 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:57,190 INFO ]: With dead ends: 97 [2018-06-22 02:09:57,190 INFO ]: Without dead ends: 77 [2018-06-22 02:09:57,190 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-06-22 02:09:57,190 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-22 02:09:57,192 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 52. [2018-06-22 02:09:57,192 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 02:09:57,193 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2018-06-22 02:09:57,193 INFO ]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 22 [2018-06-22 02:09:57,193 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:57,193 INFO ]: Abstraction has 52 states and 89 transitions. [2018-06-22 02:09:57,193 INFO ]: Interpolant automaton has 14 states. [2018-06-22 02:09:57,193 INFO ]: Start isEmpty. Operand 52 states and 89 transitions. [2018-06-22 02:09:57,193 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 02:09:57,193 INFO ]: Found error trace [2018-06-22 02:09:57,193 INFO ]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:57,193 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:57,193 INFO ]: Analyzing trace with hash -353318162, now seen corresponding path program 5 times [2018-06-22 02:09:57,193 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:57,193 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:57,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:57,194 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:57,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:57,205 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:57,472 INFO ]: Checked inductivity of 40 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 02:09:57,472 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:57,472 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-22 02:09:57,479 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:09:57,522 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 02:09:57,522 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:57,524 INFO ]: Computing forward predicates... [2018-06-22 02:09:57,599 INFO ]: Checked inductivity of 40 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 02:09:57,621 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:57,621 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-06-22 02:09:57,621 INFO ]: Interpolant automaton has 19 states [2018-06-22 02:09:57,621 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 02:09:57,621 INFO ]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2018-06-22 02:09:57,621 INFO ]: Start difference. First operand 52 states and 89 transitions. Second operand 19 states. [2018-06-22 02:09:57,952 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:57,952 INFO ]: Finished difference Result 158 states and 273 transitions. [2018-06-22 02:09:57,953 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 02:09:57,953 INFO ]: Start accepts. Automaton has 19 states. Word has length 23 [2018-06-22 02:09:57,953 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:57,954 INFO ]: With dead ends: 158 [2018-06-22 02:09:57,954 INFO ]: Without dead ends: 154 [2018-06-22 02:09:57,954 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=313, Invalid=947, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 02:09:57,954 INFO ]: Start minimizeSevpa. Operand 154 states. [2018-06-22 02:09:57,957 INFO ]: Finished minimizeSevpa. Reduced states from 154 to 71. [2018-06-22 02:09:57,957 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 02:09:57,958 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 120 transitions. [2018-06-22 02:09:57,958 INFO ]: Start accepts. Automaton has 71 states and 120 transitions. Word has length 23 [2018-06-22 02:09:57,958 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:57,958 INFO ]: Abstraction has 71 states and 120 transitions. [2018-06-22 02:09:57,958 INFO ]: Interpolant automaton has 19 states. [2018-06-22 02:09:57,958 INFO ]: Start isEmpty. Operand 71 states and 120 transitions. [2018-06-22 02:09:57,958 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 02:09:57,958 INFO ]: Found error trace [2018-06-22 02:09:57,958 INFO ]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:57,958 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:57,958 INFO ]: Analyzing trace with hash 2099627188, now seen corresponding path program 4 times [2018-06-22 02:09:57,958 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:57,958 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:57,959 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:57,959 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:57,959 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:57,970 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:58,093 INFO ]: Checked inductivity of 40 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 02:09:58,093 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:58,093 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-22 02:09:58,098 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:09:58,135 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:09:58,135 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:58,137 INFO ]: Computing forward predicates... [2018-06-22 02:09:58,200 INFO ]: Checked inductivity of 40 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 02:09:58,222 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:58,222 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-22 02:09:58,222 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:09:58,222 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:09:58,222 INFO ]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:09:58,223 INFO ]: Start difference. First operand 71 states and 120 transitions. Second operand 13 states. [2018-06-22 02:09:58,379 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:58,379 INFO ]: Finished difference Result 139 states and 229 transitions. [2018-06-22 02:09:58,380 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 02:09:58,380 INFO ]: Start accepts. Automaton has 13 states. Word has length 23 [2018-06-22 02:09:58,380 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:58,381 INFO ]: With dead ends: 139 [2018-06-22 02:09:58,381 INFO ]: Without dead ends: 139 [2018-06-22 02:09:58,381 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=291, Unknown=0, NotChecked=0, Total=462 [2018-06-22 02:09:58,381 INFO ]: Start minimizeSevpa. Operand 139 states. [2018-06-22 02:09:58,384 INFO ]: Finished minimizeSevpa. Reduced states from 139 to 70. [2018-06-22 02:09:58,384 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 02:09:58,385 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 118 transitions. [2018-06-22 02:09:58,385 INFO ]: Start accepts. Automaton has 70 states and 118 transitions. Word has length 23 [2018-06-22 02:09:58,385 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:58,385 INFO ]: Abstraction has 70 states and 118 transitions. [2018-06-22 02:09:58,385 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:09:58,385 INFO ]: Start isEmpty. Operand 70 states and 118 transitions. [2018-06-22 02:09:58,385 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 02:09:58,385 INFO ]: Found error trace [2018-06-22 02:09:58,385 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:58,385 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:58,385 INFO ]: Analyzing trace with hash 77392688, now seen corresponding path program 6 times [2018-06-22 02:09:58,385 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:58,385 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:58,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:58,386 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:58,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:58,398 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:58,553 INFO ]: Checked inductivity of 40 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 02:09:58,553 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:58,553 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-22 02:09:58,559 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:09:58,638 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 02:09:58,638 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:58,640 INFO ]: Computing forward predicates... [2018-06-22 02:09:58,649 INFO ]: Checked inductivity of 40 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 02:09:58,680 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:58,680 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-22 02:09:58,680 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:09:58,680 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:09:58,680 INFO ]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:09:58,680 INFO ]: Start difference. First operand 70 states and 118 transitions. Second operand 13 states. [2018-06-22 02:09:58,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:58,886 INFO ]: Finished difference Result 147 states and 312 transitions. [2018-06-22 02:09:58,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 02:09:58,886 INFO ]: Start accepts. Automaton has 13 states. Word has length 23 [2018-06-22 02:09:58,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:58,886 INFO ]: With dead ends: 147 [2018-06-22 02:09:58,886 INFO ]: Without dead ends: 147 [2018-06-22 02:09:58,887 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2018-06-22 02:09:58,887 INFO ]: Start minimizeSevpa. Operand 147 states. [2018-06-22 02:09:58,890 INFO ]: Finished minimizeSevpa. Reduced states from 147 to 80. [2018-06-22 02:09:58,890 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 02:09:58,890 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 144 transitions. [2018-06-22 02:09:58,890 INFO ]: Start accepts. Automaton has 80 states and 144 transitions. Word has length 23 [2018-06-22 02:09:58,890 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:58,890 INFO ]: Abstraction has 80 states and 144 transitions. [2018-06-22 02:09:58,890 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:09:58,890 INFO ]: Start isEmpty. Operand 80 states and 144 transitions. [2018-06-22 02:09:58,891 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 02:09:58,891 INFO ]: Found error trace [2018-06-22 02:09:58,891 INFO ]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:58,891 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:58,891 INFO ]: Analyzing trace with hash 1619765194, now seen corresponding path program 7 times [2018-06-22 02:09:58,891 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:58,891 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:58,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:58,892 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:58,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:58,901 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:59,008 INFO ]: Checked inductivity of 41 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 02:09:59,008 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:59,008 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-22 02:09:59,014 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:59,064 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:59,066 INFO ]: Computing forward predicates... [2018-06-22 02:09:59,192 INFO ]: Checked inductivity of 41 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 02:09:59,211 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:59,211 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-06-22 02:09:59,211 INFO ]: Interpolant automaton has 25 states [2018-06-22 02:09:59,211 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 02:09:59,212 INFO ]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2018-06-22 02:09:59,212 INFO ]: Start difference. First operand 80 states and 144 transitions. Second operand 25 states. [2018-06-22 02:09:59,875 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:59,875 INFO ]: Finished difference Result 208 states and 376 transitions. [2018-06-22 02:09:59,875 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 02:09:59,876 INFO ]: Start accepts. Automaton has 25 states. Word has length 23 [2018-06-22 02:09:59,876 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:59,877 INFO ]: With dead ends: 208 [2018-06-22 02:09:59,877 INFO ]: Without dead ends: 170 [2018-06-22 02:09:59,877 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=393, Invalid=1329, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 02:09:59,877 INFO ]: Start minimizeSevpa. Operand 170 states. [2018-06-22 02:09:59,881 INFO ]: Finished minimizeSevpa. Reduced states from 170 to 71. [2018-06-22 02:09:59,881 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 02:09:59,882 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 129 transitions. [2018-06-22 02:09:59,882 INFO ]: Start accepts. Automaton has 71 states and 129 transitions. Word has length 23 [2018-06-22 02:09:59,882 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:59,882 INFO ]: Abstraction has 71 states and 129 transitions. [2018-06-22 02:09:59,882 INFO ]: Interpolant automaton has 25 states. [2018-06-22 02:09:59,882 INFO ]: Start isEmpty. Operand 71 states and 129 transitions. [2018-06-22 02:09:59,882 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 02:09:59,882 INFO ]: Found error trace [2018-06-22 02:09:59,882 INFO ]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:59,882 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:59,883 INFO ]: Analyzing trace with hash -1899583020, now seen corresponding path program 7 times [2018-06-22 02:09:59,883 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:59,883 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:59,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:59,883 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:59,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:59,894 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:00,027 INFO ]: Checked inductivity of 45 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 02:10:00,027 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:00,027 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-22 02:10:00,033 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:00,078 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:00,080 INFO ]: Computing forward predicates... [2018-06-22 02:10:00,738 INFO ]: Checked inductivity of 45 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 02:10:00,773 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:00,773 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-06-22 02:10:00,773 INFO ]: Interpolant automaton has 20 states [2018-06-22 02:10:00,773 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 02:10:00,773 INFO ]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-06-22 02:10:00,773 INFO ]: Start difference. First operand 71 states and 129 transitions. Second operand 20 states. [2018-06-22 02:10:01,171 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:01,171 INFO ]: Finished difference Result 156 states and 296 transitions. [2018-06-22 02:10:01,171 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 02:10:01,171 INFO ]: Start accepts. Automaton has 20 states. Word has length 24 [2018-06-22 02:10:01,171 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:01,172 INFO ]: With dead ends: 156 [2018-06-22 02:10:01,172 INFO ]: Without dead ends: 117 [2018-06-22 02:10:01,173 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2018-06-22 02:10:01,173 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-22 02:10:01,177 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 80. [2018-06-22 02:10:01,177 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 02:10:01,178 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 138 transitions. [2018-06-22 02:10:01,178 INFO ]: Start accepts. Automaton has 80 states and 138 transitions. Word has length 24 [2018-06-22 02:10:01,178 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:01,178 INFO ]: Abstraction has 80 states and 138 transitions. [2018-06-22 02:10:01,178 INFO ]: Interpolant automaton has 20 states. [2018-06-22 02:10:01,178 INFO ]: Start isEmpty. Operand 80 states and 138 transitions. [2018-06-22 02:10:01,178 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 02:10:01,178 INFO ]: Found error trace [2018-06-22 02:10:01,178 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:01,178 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:01,178 INFO ]: Analyzing trace with hash -1894965415, now seen corresponding path program 1 times [2018-06-22 02:10:01,178 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:01,179 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:01,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:01,179 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:01,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:01,189 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:01,652 INFO ]: Checked inductivity of 45 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 02:10:01,652 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:01,652 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) [2018-06-22 02:10:01,664 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:01,721 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:01,724 INFO ]: Computing forward predicates... [2018-06-22 02:10:02,310 INFO ]: Checked inductivity of 45 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 02:10:02,338 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:10:02,339 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-06-22 02:10:02,339 INFO ]: Interpolant automaton has 11 states [2018-06-22 02:10:02,339 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 02:10:02,339 INFO ]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:10:02,339 INFO ]: Start difference. First operand 80 states and 138 transitions. Second operand 11 states. [2018-06-22 02:10:02,435 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:02,435 INFO ]: Finished difference Result 84 states and 130 transitions. [2018-06-22 02:10:02,435 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 02:10:02,435 INFO ]: Start accepts. Automaton has 11 states. Word has length 24 [2018-06-22 02:10:02,435 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:02,435 INFO ]: With dead ends: 84 [2018-06-22 02:10:02,435 INFO ]: Without dead ends: 80 [2018-06-22 02:10:02,436 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:10:02,436 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-22 02:10:02,437 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 59. [2018-06-22 02:10:02,437 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 02:10:02,438 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2018-06-22 02:10:02,438 INFO ]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 24 [2018-06-22 02:10:02,438 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:02,438 INFO ]: Abstraction has 59 states and 84 transitions. [2018-06-22 02:10:02,438 INFO ]: Interpolant automaton has 11 states. [2018-06-22 02:10:02,438 INFO ]: Start isEmpty. Operand 59 states and 84 transitions. [2018-06-22 02:10:02,438 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 02:10:02,438 INFO ]: Found error trace [2018-06-22 02:10:02,438 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:02,438 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:02,438 INFO ]: Analyzing trace with hash 1948046553, now seen corresponding path program 2 times [2018-06-22 02:10:02,438 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:02,438 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:02,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:02,439 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:02,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:02,450 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:02,498 INFO ]: Checked inductivity of 45 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 02:10:02,498 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:02,498 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:02,504 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:10:02,545 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:10:02,545 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:02,548 INFO ]: Computing forward predicates... [2018-06-22 02:10:02,664 INFO ]: Checked inductivity of 45 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 02:10:02,684 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:02,684 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10] total 12 [2018-06-22 02:10:02,685 INFO ]: Interpolant automaton has 12 states [2018-06-22 02:10:02,685 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 02:10:02,685 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:10:02,685 INFO ]: Start difference. First operand 59 states and 84 transitions. Second operand 12 states. [2018-06-22 02:10:02,942 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:02,942 INFO ]: Finished difference Result 75 states and 104 transitions. [2018-06-22 02:10:02,943 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 02:10:02,943 INFO ]: Start accepts. Automaton has 12 states. Word has length 24 [2018-06-22 02:10:02,943 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:02,943 INFO ]: With dead ends: 75 [2018-06-22 02:10:02,943 INFO ]: Without dead ends: 57 [2018-06-22 02:10:02,943 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-06-22 02:10:02,943 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 02:10:02,944 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 42. [2018-06-22 02:10:02,944 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 02:10:02,945 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2018-06-22 02:10:02,945 INFO ]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 24 [2018-06-22 02:10:02,945 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:02,945 INFO ]: Abstraction has 42 states and 61 transitions. [2018-06-22 02:10:02,945 INFO ]: Interpolant automaton has 12 states. [2018-06-22 02:10:02,945 INFO ]: Start isEmpty. Operand 42 states and 61 transitions. [2018-06-22 02:10:02,945 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 02:10:02,945 INFO ]: Found error trace [2018-06-22 02:10:02,945 INFO ]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:02,945 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:02,945 INFO ]: Analyzing trace with hash 1713067116, now seen corresponding path program 4 times [2018-06-22 02:10:02,945 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:02,945 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:02,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:02,946 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:02,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:02,957 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:03,257 INFO ]: Checked inductivity of 51 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 02:10:03,257 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:03,257 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:03,263 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:10:03,322 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:10:03,322 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:03,325 INFO ]: Computing forward predicates... [2018-06-22 02:10:03,434 INFO ]: Checked inductivity of 51 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 02:10:03,454 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:03,454 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2018-06-22 02:10:03,454 INFO ]: Interpolant automaton has 22 states [2018-06-22 02:10:03,454 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 02:10:03,454 INFO ]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-06-22 02:10:03,454 INFO ]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2018-06-22 02:10:03,973 WARN ]: Spent 198.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 9 [2018-06-22 02:10:04,391 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:04,391 INFO ]: Finished difference Result 66 states and 103 transitions. [2018-06-22 02:10:04,391 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 02:10:04,391 INFO ]: Start accepts. Automaton has 22 states. Word has length 25 [2018-06-22 02:10:04,391 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:04,392 INFO ]: With dead ends: 66 [2018-06-22 02:10:04,392 INFO ]: Without dead ends: 49 [2018-06-22 02:10:04,392 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=423, Invalid=1557, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 02:10:04,392 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 02:10:04,393 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-06-22 02:10:04,393 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 02:10:04,393 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 46 transitions. [2018-06-22 02:10:04,393 INFO ]: Start accepts. Automaton has 30 states and 46 transitions. Word has length 25 [2018-06-22 02:10:04,393 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:04,393 INFO ]: Abstraction has 30 states and 46 transitions. [2018-06-22 02:10:04,393 INFO ]: Interpolant automaton has 22 states. [2018-06-22 02:10:04,393 INFO ]: Start isEmpty. Operand 30 states and 46 transitions. [2018-06-22 02:10:04,394 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 02:10:04,394 INFO ]: Found error trace [2018-06-22 02:10:04,394 INFO ]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:04,394 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:04,394 INFO ]: Analyzing trace with hash 294601782, now seen corresponding path program 8 times [2018-06-22 02:10:04,394 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:04,394 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:04,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:04,394 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:04,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:04,407 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:04,574 INFO ]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 02:10:04,574 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:04,574 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:04,582 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:10:04,633 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:10:04,633 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:04,638 INFO ]: Computing forward predicates... [2018-06-22 02:10:05,230 INFO ]: Checked inductivity of 51 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 02:10:05,254 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:05,254 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 23 [2018-06-22 02:10:05,255 INFO ]: Interpolant automaton has 23 states [2018-06-22 02:10:05,255 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 02:10:05,255 INFO ]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2018-06-22 02:10:05,255 INFO ]: Start difference. First operand 30 states and 46 transitions. Second operand 23 states. [2018-06-22 02:10:06,675 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-06-22 02:10:06,687 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:06,687 INFO ]: Finished difference Result 102 states and 167 transitions. [2018-06-22 02:10:06,688 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 02:10:06,688 INFO ]: Start accepts. Automaton has 23 states. Word has length 25 [2018-06-22 02:10:06,688 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:06,688 INFO ]: With dead ends: 102 [2018-06-22 02:10:06,688 INFO ]: Without dead ends: 90 [2018-06-22 02:10:06,689 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 12 SyntacticMatches, 12 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=366, Invalid=1614, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 02:10:06,689 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-22 02:10:06,691 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 45. [2018-06-22 02:10:06,691 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 02:10:06,691 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 69 transitions. [2018-06-22 02:10:06,691 INFO ]: Start accepts. Automaton has 45 states and 69 transitions. Word has length 25 [2018-06-22 02:10:06,691 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:06,691 INFO ]: Abstraction has 45 states and 69 transitions. [2018-06-22 02:10:06,691 INFO ]: Interpolant automaton has 23 states. [2018-06-22 02:10:06,691 INFO ]: Start isEmpty. Operand 45 states and 69 transitions. [2018-06-22 02:10:06,691 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 02:10:06,691 INFO ]: Found error trace [2018-06-22 02:10:06,691 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:06,691 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:06,692 INFO ]: Analyzing trace with hash -1747534926, now seen corresponding path program 5 times [2018-06-22 02:10:06,692 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:06,692 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:06,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:06,692 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:06,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:06,705 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:06,894 INFO ]: Checked inductivity of 51 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 02:10:06,894 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:06,894 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:06,902 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:10:06,952 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 02:10:06,952 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:06,954 INFO ]: Computing forward predicates... [2018-06-22 02:10:06,968 INFO ]: Checked inductivity of 51 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 02:10:06,992 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:06,992 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-22 02:10:06,993 INFO ]: Interpolant automaton has 16 states [2018-06-22 02:10:06,993 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 02:10:06,993 INFO ]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-06-22 02:10:06,993 INFO ]: Start difference. First operand 45 states and 69 transitions. Second operand 16 states. [2018-06-22 02:10:07,237 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 02:10:07,571 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:07,571 INFO ]: Finished difference Result 107 states and 154 transitions. [2018-06-22 02:10:07,571 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 02:10:07,571 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-22 02:10:07,571 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:07,572 INFO ]: With dead ends: 107 [2018-06-22 02:10:07,572 INFO ]: Without dead ends: 75 [2018-06-22 02:10:07,572 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-06-22 02:10:07,572 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 02:10:07,574 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 51. [2018-06-22 02:10:07,574 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 02:10:07,574 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2018-06-22 02:10:07,574 INFO ]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 25 [2018-06-22 02:10:07,574 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:07,574 INFO ]: Abstraction has 51 states and 74 transitions. [2018-06-22 02:10:07,574 INFO ]: Interpolant automaton has 16 states. [2018-06-22 02:10:07,574 INFO ]: Start isEmpty. Operand 51 states and 74 transitions. [2018-06-22 02:10:07,574 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 02:10:07,574 INFO ]: Found error trace [2018-06-22 02:10:07,574 INFO ]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:07,574 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:07,575 INFO ]: Analyzing trace with hash -624708864, now seen corresponding path program 6 times [2018-06-22 02:10:07,575 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:07,575 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:07,575 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:07,575 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:07,575 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:07,587 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:08,208 INFO ]: Checked inductivity of 57 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 02:10:08,208 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:08,208 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:08,214 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:10:08,266 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 02:10:08,266 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:08,269 INFO ]: Computing forward predicates... [2018-06-22 02:10:08,362 INFO ]: Checked inductivity of 57 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 02:10:08,383 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:08,383 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2018-06-22 02:10:08,383 INFO ]: Interpolant automaton has 22 states [2018-06-22 02:10:08,383 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 02:10:08,384 INFO ]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-06-22 02:10:08,384 INFO ]: Start difference. First operand 51 states and 74 transitions. Second operand 22 states. [2018-06-22 02:10:08,946 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:08,946 INFO ]: Finished difference Result 180 states and 263 transitions. [2018-06-22 02:10:08,947 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 02:10:08,947 INFO ]: Start accepts. Automaton has 22 states. Word has length 26 [2018-06-22 02:10:08,947 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:08,947 INFO ]: With dead ends: 180 [2018-06-22 02:10:08,947 INFO ]: Without dead ends: 175 [2018-06-22 02:10:08,948 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=421, Invalid=1301, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 02:10:08,948 INFO ]: Start minimizeSevpa. Operand 175 states. [2018-06-22 02:10:08,950 INFO ]: Finished minimizeSevpa. Reduced states from 175 to 69. [2018-06-22 02:10:08,950 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 02:10:08,950 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2018-06-22 02:10:08,950 INFO ]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 26 [2018-06-22 02:10:08,950 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:08,950 INFO ]: Abstraction has 69 states and 97 transitions. [2018-06-22 02:10:08,950 INFO ]: Interpolant automaton has 22 states. [2018-06-22 02:10:08,951 INFO ]: Start isEmpty. Operand 69 states and 97 transitions. [2018-06-22 02:10:08,951 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 02:10:08,951 INFO ]: Found error trace [2018-06-22 02:10:08,951 INFO ]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:08,951 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:08,951 INFO ]: Analyzing trace with hash 496638842, now seen corresponding path program 5 times [2018-06-22 02:10:08,951 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:08,951 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:08,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:08,952 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:08,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:08,965 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:09,186 INFO ]: Checked inductivity of 57 backedges. 21 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 02:10:09,187 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:09,187 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:09,194 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:10:09,269 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 02:10:09,269 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:09,272 INFO ]: Computing forward predicates... [2018-06-22 02:10:09,299 INFO ]: Checked inductivity of 57 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 02:10:09,323 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:09,323 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 16 [2018-06-22 02:10:09,323 INFO ]: Interpolant automaton has 16 states [2018-06-22 02:10:09,323 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 02:10:09,323 INFO ]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-06-22 02:10:09,323 INFO ]: Start difference. First operand 69 states and 97 transitions. Second operand 16 states. [2018-06-22 02:10:09,504 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:09,504 INFO ]: Finished difference Result 148 states and 199 transitions. [2018-06-22 02:10:09,504 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 02:10:09,504 INFO ]: Start accepts. Automaton has 16 states. Word has length 26 [2018-06-22 02:10:09,504 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:09,505 INFO ]: With dead ends: 148 [2018-06-22 02:10:09,505 INFO ]: Without dead ends: 148 [2018-06-22 02:10:09,505 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=495, Unknown=0, NotChecked=0, Total=756 [2018-06-22 02:10:09,505 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-22 02:10:09,508 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 68. [2018-06-22 02:10:09,508 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 02:10:09,509 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2018-06-22 02:10:09,509 INFO ]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 26 [2018-06-22 02:10:09,509 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:09,509 INFO ]: Abstraction has 68 states and 95 transitions. [2018-06-22 02:10:09,509 INFO ]: Interpolant automaton has 16 states. [2018-06-22 02:10:09,509 INFO ]: Start isEmpty. Operand 68 states and 95 transitions. [2018-06-22 02:10:09,509 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 02:10:09,509 INFO ]: Found error trace [2018-06-22 02:10:09,509 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:09,509 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:09,509 INFO ]: Analyzing trace with hash -1545497866, now seen corresponding path program 8 times [2018-06-22 02:10:09,509 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:09,509 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:09,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:09,510 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:09,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:09,522 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:09,734 INFO ]: Checked inductivity of 57 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 02:10:09,734 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:09,734 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:09,740 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:10:09,786 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:10:09,786 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:09,788 INFO ]: Computing forward predicates... [2018-06-22 02:10:09,862 INFO ]: Checked inductivity of 57 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 02:10:09,888 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:09,888 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 21 [2018-06-22 02:10:09,888 INFO ]: Interpolant automaton has 21 states [2018-06-22 02:10:09,888 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 02:10:09,888 INFO ]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2018-06-22 02:10:09,889 INFO ]: Start difference. First operand 68 states and 95 transitions. Second operand 21 states. [2018-06-22 02:10:10,618 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:10,618 INFO ]: Finished difference Result 160 states and 244 transitions. [2018-06-22 02:10:10,621 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 02:10:10,621 INFO ]: Start accepts. Automaton has 21 states. Word has length 26 [2018-06-22 02:10:10,621 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:10,622 INFO ]: With dead ends: 160 [2018-06-22 02:10:10,622 INFO ]: Without dead ends: 160 [2018-06-22 02:10:10,622 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=587, Invalid=1305, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 02:10:10,622 INFO ]: Start minimizeSevpa. Operand 160 states. [2018-06-22 02:10:10,624 INFO ]: Finished minimizeSevpa. Reduced states from 160 to 62. [2018-06-22 02:10:10,624 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 02:10:10,624 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2018-06-22 02:10:10,624 INFO ]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 26 [2018-06-22 02:10:10,624 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:10,624 INFO ]: Abstraction has 62 states and 88 transitions. [2018-06-22 02:10:10,624 INFO ]: Interpolant automaton has 21 states. [2018-06-22 02:10:10,624 INFO ]: Start isEmpty. Operand 62 states and 88 transitions. [2018-06-22 02:10:10,625 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 02:10:10,625 INFO ]: Found error trace [2018-06-22 02:10:10,625 INFO ]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:10,625 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:10,625 INFO ]: Analyzing trace with hash -842855528, now seen corresponding path program 9 times [2018-06-22 02:10:10,625 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:10,625 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:10,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:10,625 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:10,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:10,637 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:11,518 INFO ]: Checked inductivity of 58 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 02:10:11,518 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:11,518 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:11,523 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:10:11,574 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 02:10:11,574 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:11,576 INFO ]: Computing forward predicates... [2018-06-22 02:10:11,727 INFO ]: Checked inductivity of 58 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 02:10:11,747 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:11,747 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-06-22 02:10:11,747 INFO ]: Interpolant automaton has 29 states [2018-06-22 02:10:11,747 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 02:10:11,747 INFO ]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2018-06-22 02:10:11,747 INFO ]: Start difference. First operand 62 states and 88 transitions. Second operand 29 states. [2018-06-22 02:10:12,702 WARN ]: Spent 268.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-06-22 02:10:12,926 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:12,926 INFO ]: Finished difference Result 207 states and 305 transitions. [2018-06-22 02:10:12,927 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 02:10:12,927 INFO ]: Start accepts. Automaton has 29 states. Word has length 26 [2018-06-22 02:10:12,927 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:12,927 INFO ]: With dead ends: 207 [2018-06-22 02:10:12,927 INFO ]: Without dead ends: 156 [2018-06-22 02:10:12,927 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=531, Invalid=1821, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 02:10:12,928 INFO ]: Start minimizeSevpa. Operand 156 states. [2018-06-22 02:10:12,929 INFO ]: Finished minimizeSevpa. Reduced states from 156 to 59. [2018-06-22 02:10:12,929 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 02:10:12,929 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2018-06-22 02:10:12,929 INFO ]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 26 [2018-06-22 02:10:12,929 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:12,929 INFO ]: Abstraction has 59 states and 81 transitions. [2018-06-22 02:10:12,929 INFO ]: Interpolant automaton has 29 states. [2018-06-22 02:10:12,929 INFO ]: Start isEmpty. Operand 59 states and 81 transitions. [2018-06-22 02:10:12,930 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 02:10:12,930 INFO ]: Found error trace [2018-06-22 02:10:12,930 INFO ]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:12,930 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:12,930 INFO ]: Analyzing trace with hash -669582642, now seen corresponding path program 9 times [2018-06-22 02:10:12,930 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:12,930 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:12,930 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:12,930 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:12,930 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:12,943 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:13,256 INFO ]: Checked inductivity of 63 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 02:10:13,256 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:13,256 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:13,264 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:10:13,318 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 02:10:13,318 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:13,321 INFO ]: Computing forward predicates... [2018-06-22 02:10:13,726 INFO ]: Checked inductivity of 63 backedges. 21 proven. 20 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 02:10:13,747 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:13,747 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-06-22 02:10:13,747 INFO ]: Interpolant automaton has 29 states [2018-06-22 02:10:13,747 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 02:10:13,747 INFO ]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2018-06-22 02:10:13,747 INFO ]: Start difference. First operand 59 states and 81 transitions. Second operand 29 states. [2018-06-22 02:10:14,671 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:14,672 INFO ]: Finished difference Result 138 states and 183 transitions. [2018-06-22 02:10:14,672 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-22 02:10:14,672 INFO ]: Start accepts. Automaton has 29 states. Word has length 27 [2018-06-22 02:10:14,672 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:14,672 INFO ]: With dead ends: 138 [2018-06-22 02:10:14,672 INFO ]: Without dead ends: 103 [2018-06-22 02:10:14,672 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=876, Invalid=3156, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 02:10:14,673 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-22 02:10:14,674 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 47. [2018-06-22 02:10:14,674 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 02:10:14,674 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2018-06-22 02:10:14,674 INFO ]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 27 [2018-06-22 02:10:14,674 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:14,674 INFO ]: Abstraction has 47 states and 67 transitions. [2018-06-22 02:10:14,674 INFO ]: Interpolant automaton has 29 states. [2018-06-22 02:10:14,674 INFO ]: Start isEmpty. Operand 47 states and 67 transitions. [2018-06-22 02:10:14,674 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 02:10:14,674 INFO ]: Found error trace [2018-06-22 02:10:14,674 INFO ]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:14,674 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:14,674 INFO ]: Analyzing trace with hash 1729279546, now seen corresponding path program 5 times [2018-06-22 02:10:14,674 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:14,674 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:14,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:14,675 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:14,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:14,683 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:14,820 INFO ]: Checked inductivity of 70 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 02:10:14,821 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:14,821 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:14,826 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:10:14,882 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 02:10:14,882 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:14,886 INFO ]: Computing forward predicates... [2018-06-22 02:10:15,005 INFO ]: Checked inductivity of 70 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 02:10:15,026 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:15,026 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 22 [2018-06-22 02:10:15,026 INFO ]: Interpolant automaton has 22 states [2018-06-22 02:10:15,026 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 02:10:15,026 INFO ]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-06-22 02:10:15,027 INFO ]: Start difference. First operand 47 states and 67 transitions. Second operand 22 states. [2018-06-22 02:10:15,807 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:15,807 INFO ]: Finished difference Result 104 states and 171 transitions. [2018-06-22 02:10:15,890 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 02:10:15,890 INFO ]: Start accepts. Automaton has 22 states. Word has length 28 [2018-06-22 02:10:15,890 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:15,891 INFO ]: With dead ends: 104 [2018-06-22 02:10:15,891 INFO ]: Without dead ends: 104 [2018-06-22 02:10:15,891 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=794, Invalid=1756, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 02:10:15,891 INFO ]: Start minimizeSevpa. Operand 104 states. [2018-06-22 02:10:15,893 INFO ]: Finished minimizeSevpa. Reduced states from 104 to 46. [2018-06-22 02:10:15,893 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 02:10:15,893 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2018-06-22 02:10:15,893 INFO ]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 28 [2018-06-22 02:10:15,893 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:15,893 INFO ]: Abstraction has 46 states and 65 transitions. [2018-06-22 02:10:15,893 INFO ]: Interpolant automaton has 22 states. [2018-06-22 02:10:15,893 INFO ]: Start isEmpty. Operand 46 states and 65 transitions. [2018-06-22 02:10:15,893 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 02:10:15,893 INFO ]: Found error trace [2018-06-22 02:10:15,893 INFO ]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:15,894 INFO ]: === Iteration 55 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:15,894 INFO ]: Analyzing trace with hash 943225526, now seen corresponding path program 7 times [2018-06-22 02:10:15,894 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:15,894 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:15,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:15,894 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:15,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:15,907 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:16,086 INFO ]: Checked inductivity of 70 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 02:10:16,086 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:16,086 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:16,094 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:16,141 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:16,144 INFO ]: Computing forward predicates... [2018-06-22 02:10:16,220 INFO ]: Checked inductivity of 70 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 02:10:16,240 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:16,240 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 22 [2018-06-22 02:10:16,240 INFO ]: Interpolant automaton has 22 states [2018-06-22 02:10:16,240 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 02:10:16,240 INFO ]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2018-06-22 02:10:16,240 INFO ]: Start difference. First operand 46 states and 65 transitions. Second operand 22 states. [2018-06-22 02:10:16,525 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:16,525 INFO ]: Finished difference Result 119 states and 176 transitions. [2018-06-22 02:10:16,525 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 02:10:16,525 INFO ]: Start accepts. Automaton has 22 states. Word has length 28 [2018-06-22 02:10:16,525 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:16,525 INFO ]: With dead ends: 119 [2018-06-22 02:10:16,525 INFO ]: Without dead ends: 83 [2018-06-22 02:10:16,526 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=952, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 02:10:16,526 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-22 02:10:16,527 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 33. [2018-06-22 02:10:16,527 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 02:10:16,527 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2018-06-22 02:10:16,527 INFO ]: Start accepts. Automaton has 33 states and 50 transitions. Word has length 28 [2018-06-22 02:10:16,527 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:16,527 INFO ]: Abstraction has 33 states and 50 transitions. [2018-06-22 02:10:16,527 INFO ]: Interpolant automaton has 22 states. [2018-06-22 02:10:16,527 INFO ]: Start isEmpty. Operand 33 states and 50 transitions. [2018-06-22 02:10:16,527 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 02:10:16,527 INFO ]: Found error trace [2018-06-22 02:10:16,527 INFO ]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:16,527 INFO ]: === Iteration 56 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:16,528 INFO ]: Analyzing trace with hash 1920948408, now seen corresponding path program 10 times [2018-06-22 02:10:16,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:16,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:16,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:16,528 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:16,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:16,569 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:16,802 INFO ]: Checked inductivity of 70 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-06-22 02:10:16,802 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:16,802 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:16,809 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:10:16,864 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:10:16,864 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:16,870 INFO ]: Computing forward predicates... [2018-06-22 02:10:17,214 INFO ]: Checked inductivity of 70 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 02:10:17,234 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:17,234 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18] total 22 [2018-06-22 02:10:17,234 INFO ]: Interpolant automaton has 22 states [2018-06-22 02:10:17,234 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 02:10:17,234 INFO ]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-06-22 02:10:17,235 INFO ]: Start difference. First operand 33 states and 50 transitions. Second operand 22 states. [2018-06-22 02:10:17,862 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:17,862 INFO ]: Finished difference Result 116 states and 182 transitions. [2018-06-22 02:10:17,862 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 02:10:17,862 INFO ]: Start accepts. Automaton has 22 states. Word has length 28 [2018-06-22 02:10:17,862 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:17,862 INFO ]: With dead ends: 116 [2018-06-22 02:10:17,862 INFO ]: Without dead ends: 82 [2018-06-22 02:10:17,863 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 13 SyntacticMatches, 18 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=222, Invalid=1110, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 02:10:17,863 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-22 02:10:17,864 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 45. [2018-06-22 02:10:17,864 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 02:10:17,864 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2018-06-22 02:10:17,864 INFO ]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 28 [2018-06-22 02:10:17,864 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:17,864 INFO ]: Abstraction has 45 states and 67 transitions. [2018-06-22 02:10:17,864 INFO ]: Interpolant automaton has 22 states. [2018-06-22 02:10:17,864 INFO ]: Start isEmpty. Operand 45 states and 67 transitions. [2018-06-22 02:10:17,865 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 02:10:17,865 INFO ]: Found error trace [2018-06-22 02:10:17,865 INFO ]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:17,865 INFO ]: === Iteration 57 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:17,865 INFO ]: Analyzing trace with hash -551027282, now seen corresponding path program 8 times [2018-06-22 02:10:17,865 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:17,865 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:17,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:17,865 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:17,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:17,879 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:18,080 INFO ]: Checked inductivity of 77 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 02:10:18,080 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:18,080 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:18,088 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:10:18,142 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:10:18,142 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:18,145 INFO ]: Computing forward predicates... [2018-06-22 02:10:18,266 INFO ]: Checked inductivity of 77 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 02:10:18,286 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:18,286 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-06-22 02:10:18,286 INFO ]: Interpolant automaton has 25 states [2018-06-22 02:10:18,286 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 02:10:18,286 INFO ]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2018-06-22 02:10:18,286 INFO ]: Start difference. First operand 45 states and 67 transitions. Second operand 25 states. [2018-06-22 02:10:18,901 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:18,902 INFO ]: Finished difference Result 169 states and 252 transitions. [2018-06-22 02:10:18,902 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 02:10:18,902 INFO ]: Start accepts. Automaton has 25 states. Word has length 29 [2018-06-22 02:10:18,902 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:18,903 INFO ]: With dead ends: 169 [2018-06-22 02:10:18,903 INFO ]: Without dead ends: 169 [2018-06-22 02:10:18,903 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=545, Invalid=1711, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 02:10:18,903 INFO ]: Start minimizeSevpa. Operand 169 states. [2018-06-22 02:10:18,904 INFO ]: Finished minimizeSevpa. Reduced states from 169 to 65. [2018-06-22 02:10:18,904 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 02:10:18,904 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2018-06-22 02:10:18,904 INFO ]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 29 [2018-06-22 02:10:18,905 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:18,905 INFO ]: Abstraction has 65 states and 95 transitions. [2018-06-22 02:10:18,905 INFO ]: Interpolant automaton has 25 states. [2018-06-22 02:10:18,905 INFO ]: Start isEmpty. Operand 65 states and 95 transitions. [2018-06-22 02:10:18,905 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 02:10:18,905 INFO ]: Found error trace [2018-06-22 02:10:18,905 INFO ]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:18,905 INFO ]: === Iteration 58 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:18,905 INFO ]: Analyzing trace with hash -737146124, now seen corresponding path program 6 times [2018-06-22 02:10:18,905 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:18,905 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:18,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:18,906 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:18,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:18,920 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:19,233 INFO ]: Checked inductivity of 77 backedges. 28 proven. 27 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 02:10:19,233 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:19,233 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:19,239 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:10:19,334 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 02:10:19,334 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:19,337 INFO ]: Computing forward predicates... [2018-06-22 02:10:19,483 INFO ]: Checked inductivity of 77 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 02:10:19,514 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:19,514 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 24 [2018-06-22 02:10:19,514 INFO ]: Interpolant automaton has 24 states [2018-06-22 02:10:19,515 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 02:10:19,515 INFO ]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2018-06-22 02:10:19,515 INFO ]: Start difference. First operand 65 states and 95 transitions. Second operand 24 states. [2018-06-22 02:10:19,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:19,990 INFO ]: Finished difference Result 263 states and 367 transitions. [2018-06-22 02:10:19,990 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 02:10:19,990 INFO ]: Start accepts. Automaton has 24 states. Word has length 29 [2018-06-22 02:10:19,990 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:19,991 INFO ]: With dead ends: 263 [2018-06-22 02:10:19,991 INFO ]: Without dead ends: 263 [2018-06-22 02:10:19,992 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=481, Invalid=1499, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 02:10:19,992 INFO ]: Start minimizeSevpa. Operand 263 states. [2018-06-22 02:10:19,994 INFO ]: Finished minimizeSevpa. Reduced states from 263 to 79. [2018-06-22 02:10:19,994 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 02:10:19,995 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 117 transitions. [2018-06-22 02:10:19,995 INFO ]: Start accepts. Automaton has 79 states and 117 transitions. Word has length 29 [2018-06-22 02:10:19,995 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:19,995 INFO ]: Abstraction has 79 states and 117 transitions. [2018-06-22 02:10:19,995 INFO ]: Interpolant automaton has 24 states. [2018-06-22 02:10:19,995 INFO ]: Start isEmpty. Operand 79 states and 117 transitions. [2018-06-22 02:10:19,995 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 02:10:19,995 INFO ]: Found error trace [2018-06-22 02:10:19,995 INFO ]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:19,995 INFO ]: === Iteration 59 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:19,995 INFO ]: Analyzing trace with hash -463402604, now seen corresponding path program 10 times [2018-06-22 02:10:19,995 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:19,995 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:19,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:19,996 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:19,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:20,010 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:20,418 INFO ]: Checked inductivity of 84 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 02:10:20,419 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:20,419 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:20,424 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:10:20,480 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:10:20,480 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:20,484 INFO ]: Computing forward predicates... [2018-06-22 02:10:21,686 INFO ]: Checked inductivity of 84 backedges. 21 proven. 34 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 02:10:21,704 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:21,704 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 25 [2018-06-22 02:10:21,704 INFO ]: Interpolant automaton has 25 states [2018-06-22 02:10:21,704 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 02:10:21,704 INFO ]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2018-06-22 02:10:21,704 INFO ]: Start difference. First operand 79 states and 117 transitions. Second operand 25 states. [2018-06-22 02:10:22,726 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:22,726 INFO ]: Finished difference Result 222 states and 381 transitions. [2018-06-22 02:10:22,726 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 02:10:22,726 INFO ]: Start accepts. Automaton has 25 states. Word has length 30 [2018-06-22 02:10:22,726 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:22,726 INFO ]: With dead ends: 222 [2018-06-22 02:10:22,726 INFO ]: Without dead ends: 107 [2018-06-22 02:10:22,727 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1097, Invalid=2809, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 02:10:22,727 INFO ]: Start minimizeSevpa. Operand 107 states. [2018-06-22 02:10:22,728 INFO ]: Finished minimizeSevpa. Reduced states from 107 to 84. [2018-06-22 02:10:22,728 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 02:10:22,729 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2018-06-22 02:10:22,729 INFO ]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 30 [2018-06-22 02:10:22,729 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:22,729 INFO ]: Abstraction has 84 states and 118 transitions. [2018-06-22 02:10:22,729 INFO ]: Interpolant automaton has 25 states. [2018-06-22 02:10:22,729 INFO ]: Start isEmpty. Operand 84 states and 118 transitions. [2018-06-22 02:10:22,729 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 02:10:22,729 INFO ]: Found error trace [2018-06-22 02:10:22,729 INFO ]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:22,729 INFO ]: === Iteration 60 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:22,729 INFO ]: Analyzing trace with hash -337941772, now seen corresponding path program 1 times [2018-06-22 02:10:22,729 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:22,729 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:22,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:22,730 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:22,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:22,743 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:22,941 INFO ]: Checked inductivity of 87 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 02:10:22,941 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:22,941 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:22,947 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:22,997 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:22,999 INFO ]: Computing forward predicates... [2018-06-22 02:10:23,208 INFO ]: Checked inductivity of 87 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 02:10:23,227 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:23,227 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2018-06-22 02:10:23,227 INFO ]: Interpolant automaton has 33 states [2018-06-22 02:10:23,227 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 02:10:23,227 INFO ]: CoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 02:10:23,227 INFO ]: Start difference. First operand 84 states and 118 transitions. Second operand 33 states. [2018-06-22 02:10:24,096 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:24,096 INFO ]: Finished difference Result 282 states and 393 transitions. [2018-06-22 02:10:24,096 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 02:10:24,096 INFO ]: Start accepts. Automaton has 33 states. Word has length 30 [2018-06-22 02:10:24,096 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:24,096 INFO ]: With dead ends: 282 [2018-06-22 02:10:24,097 INFO ]: Without dead ends: 183 [2018-06-22 02:10:24,097 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=704, Invalid=2602, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 02:10:24,097 INFO ]: Start minimizeSevpa. Operand 183 states. [2018-06-22 02:10:24,099 INFO ]: Finished minimizeSevpa. Reduced states from 183 to 78. [2018-06-22 02:10:24,099 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 02:10:24,099 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 104 transitions. [2018-06-22 02:10:24,099 INFO ]: Start accepts. Automaton has 78 states and 104 transitions. Word has length 30 [2018-06-22 02:10:24,099 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:24,099 INFO ]: Abstraction has 78 states and 104 transitions. [2018-06-22 02:10:24,099 INFO ]: Interpolant automaton has 33 states. [2018-06-22 02:10:24,099 INFO ]: Start isEmpty. Operand 78 states and 104 transitions. [2018-06-22 02:10:24,100 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 02:10:24,100 INFO ]: Found error trace [2018-06-22 02:10:24,100 INFO ]: trace histogram [6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:24,100 INFO ]: === Iteration 61 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:24,100 INFO ]: Analyzing trace with hash -1362836744, now seen corresponding path program 11 times [2018-06-22 02:10:24,100 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:24,100 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:24,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:24,100 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:24,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:24,115 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:24,270 INFO ]: Checked inductivity of 87 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 02:10:24,270 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:24,270 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:24,277 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:10:24,335 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 02:10:24,335 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:24,338 INFO ]: Computing forward predicates... [2018-06-22 02:10:24,351 INFO ]: Checked inductivity of 87 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 02:10:24,384 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:24,384 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-22 02:10:24,385 INFO ]: Interpolant automaton has 18 states [2018-06-22 02:10:24,385 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 02:10:24,385 INFO ]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2018-06-22 02:10:24,385 INFO ]: Start difference. First operand 78 states and 104 transitions. Second operand 18 states. [2018-06-22 02:10:24,706 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:24,706 INFO ]: Finished difference Result 223 states and 329 transitions. [2018-06-22 02:10:24,706 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 02:10:24,706 INFO ]: Start accepts. Automaton has 18 states. Word has length 30 [2018-06-22 02:10:24,706 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:24,707 INFO ]: With dead ends: 223 [2018-06-22 02:10:24,707 INFO ]: Without dead ends: 185 [2018-06-22 02:10:24,707 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=339, Invalid=591, Unknown=0, NotChecked=0, Total=930 [2018-06-22 02:10:24,707 INFO ]: Start minimizeSevpa. Operand 185 states. [2018-06-22 02:10:24,709 INFO ]: Finished minimizeSevpa. Reduced states from 185 to 61. [2018-06-22 02:10:24,709 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 02:10:24,709 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 85 transitions. [2018-06-22 02:10:24,709 INFO ]: Start accepts. Automaton has 61 states and 85 transitions. Word has length 30 [2018-06-22 02:10:24,709 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:24,709 INFO ]: Abstraction has 61 states and 85 transitions. [2018-06-22 02:10:24,709 INFO ]: Interpolant automaton has 18 states. [2018-06-22 02:10:24,709 INFO ]: Start isEmpty. Operand 61 states and 85 transitions. [2018-06-22 02:10:24,709 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 02:10:24,709 INFO ]: Found error trace [2018-06-22 02:10:24,709 INFO ]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:24,709 INFO ]: === Iteration 62 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:24,709 INFO ]: Analyzing trace with hash 152412332, now seen corresponding path program 6 times [2018-06-22 02:10:24,710 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:24,710 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:24,710 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:24,710 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:24,710 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:24,724 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:24,866 INFO ]: Checked inductivity of 92 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-22 02:10:24,866 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:24,866 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:24,872 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:10:24,946 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 02:10:24,946 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:24,949 INFO ]: Computing forward predicates... [2018-06-22 02:10:25,024 INFO ]: Checked inductivity of 92 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-22 02:10:25,045 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:25,045 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10] total 12 [2018-06-22 02:10:25,045 INFO ]: Interpolant automaton has 12 states [2018-06-22 02:10:25,045 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 02:10:25,045 INFO ]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:10:25,045 INFO ]: Start difference. First operand 61 states and 85 transitions. Second operand 12 states. [2018-06-22 02:10:25,420 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:25,420 INFO ]: Finished difference Result 118 states and 199 transitions. [2018-06-22 02:10:25,420 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 02:10:25,420 INFO ]: Start accepts. Automaton has 12 states. Word has length 31 [2018-06-22 02:10:25,420 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:25,420 INFO ]: With dead ends: 118 [2018-06-22 02:10:25,420 INFO ]: Without dead ends: 61 [2018-06-22 02:10:25,421 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=747, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 02:10:25,421 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 02:10:25,421 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-06-22 02:10:25,421 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 02:10:25,421 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2018-06-22 02:10:25,421 INFO ]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 31 [2018-06-22 02:10:25,421 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:25,421 INFO ]: Abstraction has 60 states and 75 transitions. [2018-06-22 02:10:25,421 INFO ]: Interpolant automaton has 12 states. [2018-06-22 02:10:25,421 INFO ]: Start isEmpty. Operand 60 states and 75 transitions. [2018-06-22 02:10:25,422 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 02:10:25,422 INFO ]: Found error trace [2018-06-22 02:10:25,422 INFO ]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:25,422 INFO ]: === Iteration 63 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:25,422 INFO ]: Analyzing trace with hash 1554541488, now seen corresponding path program 9 times [2018-06-22 02:10:25,422 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:25,422 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:25,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:25,422 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:25,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:25,432 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:25,707 INFO ]: Checked inductivity of 92 backedges. 35 proven. 28 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 02:10:25,707 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:25,707 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:25,722 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:10:25,782 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 02:10:25,782 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:25,785 INFO ]: Computing forward predicates... [2018-06-22 02:10:25,953 INFO ]: Checked inductivity of 92 backedges. 21 proven. 34 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 02:10:25,974 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:25,974 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 25 [2018-06-22 02:10:25,974 INFO ]: Interpolant automaton has 25 states [2018-06-22 02:10:25,974 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 02:10:25,974 INFO ]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2018-06-22 02:10:25,974 INFO ]: Start difference. First operand 60 states and 75 transitions. Second operand 25 states. [2018-06-22 02:10:26,252 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:26,252 INFO ]: Finished difference Result 122 states and 149 transitions. [2018-06-22 02:10:26,253 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 02:10:26,253 INFO ]: Start accepts. Automaton has 25 states. Word has length 31 [2018-06-22 02:10:26,253 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:26,253 INFO ]: With dead ends: 122 [2018-06-22 02:10:26,253 INFO ]: Without dead ends: 105 [2018-06-22 02:10:26,253 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=1260, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 02:10:26,253 INFO ]: Start minimizeSevpa. Operand 105 states. [2018-06-22 02:10:26,254 INFO ]: Finished minimizeSevpa. Reduced states from 105 to 45. [2018-06-22 02:10:26,254 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 02:10:26,254 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2018-06-22 02:10:26,254 INFO ]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 31 [2018-06-22 02:10:26,254 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:26,254 INFO ]: Abstraction has 45 states and 58 transitions. [2018-06-22 02:10:26,254 INFO ]: Interpolant automaton has 25 states. [2018-06-22 02:10:26,254 INFO ]: Start isEmpty. Operand 45 states and 58 transitions. [2018-06-22 02:10:26,254 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 02:10:26,254 INFO ]: Found error trace [2018-06-22 02:10:26,254 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:26,254 INFO ]: === Iteration 64 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:26,254 INFO ]: Analyzing trace with hash 1345797490, now seen corresponding path program 6 times [2018-06-22 02:10:26,254 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:26,254 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:26,256 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:26,256 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:26,256 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:26,266 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 02:10:26,372 WARN ]: Verification canceled [2018-06-22 02:10:26,377 WARN ]: Timeout [2018-06-22 02:10:26,377 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:10:26 BoogieIcfgContainer [2018-06-22 02:10:26,377 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 02:10:26,378 INFO ]: Toolchain (without parser) took 54876.52 ms. Allocated memory was 308.8 MB in the beginning and 749.7 MB in the end (delta: 440.9 MB). Free memory was 263.2 MB in the beginning and 578.8 MB in the end (delta: -315.6 MB). Peak memory consumption was 125.3 MB. Max. memory is 3.6 GB. [2018-06-22 02:10:26,379 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 02:10:26,379 INFO ]: ChcToBoogie took 61.76 ms. Allocated memory is still 308.8 MB. Free memory was 263.2 MB in the beginning and 261.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-22 02:10:26,380 INFO ]: Boogie Preprocessor took 35.61 ms. Allocated memory is still 308.8 MB. Free memory was 261.1 MB in the beginning and 259.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:10:26,383 INFO ]: RCFGBuilder took 308.11 ms. Allocated memory is still 308.8 MB. Free memory was 259.1 MB in the beginning and 247.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 3.6 GB. [2018-06-22 02:10:26,383 INFO ]: TraceAbstraction took 54462.65 ms. Allocated memory was 308.8 MB in the beginning and 749.7 MB in the end (delta: 440.9 MB). Free memory was 247.1 MB in the beginning and 578.8 MB in the end (delta: -331.7 MB). Peak memory consumption was 109.2 MB. Max. memory is 3.6 GB. [2018-06-22 02:10:26,385 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.76 ms. Allocated memory is still 308.8 MB. Free memory was 263.2 MB in the beginning and 261.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 35.61 ms. Allocated memory is still 308.8 MB. Free memory was 261.1 MB in the beginning and 259.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 308.11 ms. Allocated memory is still 308.8 MB. Free memory was 259.1 MB in the beginning and 247.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54462.65 ms. Allocated memory was 308.8 MB in the beginning and 749.7 MB in the end (delta: 440.9 MB). Free memory was 247.1 MB in the beginning and 578.8 MB in the end (delta: -331.7 MB). Peak memory consumption was 109.2 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 32 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 3 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. TIMEOUT Result, 54.3s OverallTime, 64 OverallIterations, 8 TraceHistogramMax, 25.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 741 SDtfs, 2101 SDslu, 4801 SDs, 0 SdLazy, 11504 SolverSat, 4832 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2695 GetRequests, 1140 SyntacticMatches, 50 SemanticMatches, 1505 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8919 ImplicationChecksByTransitivity, 33.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=59, 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.1s AutomataMinimizationTime, 63 MinimizatonAttempts, 2450 StatesRemovedByMinimization, 62 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 23.1s InterpolantComputationTime, 2418 NumberOfCodeBlocks, 2417 NumberOfCodeBlocksAsserted, 192 NumberOfCheckSat, 2298 ConstructedInterpolants, 2 QuantifiedInterpolants, 170687 SizeOfPredicates, 268 NumberOfNonLiveVariables, 18988 ConjunctsInSsa, 2429 ConjunctsInUnsatCore, 120 InterpolantComputations, 9 PerfectInterpolantSequences, 2683/4016 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__barthe2-big2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_02-10-26-396.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_02-10-26-396.csv Completed graceful shutdown