java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 08:59:57,747 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 08:59:57,748 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 08:59:57,760 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 08:59:57,761 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 08:59:57,762 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 08:59:57,765 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 08:59:57,767 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 08:59:57,768 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 08:59:57,769 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 08:59:57,771 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 08:59:57,771 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 08:59:57,772 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 08:59:57,773 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 08:59:57,774 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 08:59:57,774 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 08:59:57,778 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 08:59:57,788 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 08:59:57,789 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 08:59:57,790 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 08:59:57,791 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 08:59:57,797 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 08:59:57,798 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 08:59:57,798 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 08:59:57,799 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 08:59:57,799 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 08:59:57,800 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 08:59:57,801 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 08:59:57,801 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 08:59:57,802 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 08:59:57,805 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 08:59:57,806 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 08:59:57,806 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 08:59:57,807 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 08:59:57,807 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 08:59:57,809 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 08:59:57,829 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 08:59:57,829 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 08:59:57,832 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 08:59:57,832 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 08:59:57,833 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 08:59:57,833 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 08:59:57,833 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 08:59:57,834 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 08:59:57,834 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 08:59:57,834 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 08:59:57,834 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 08:59:57,834 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 08:59:57,834 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 08:59:57,836 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 08:59:57,836 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 08:59:57,836 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 08:59:57,836 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 08:59:57,836 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 08:59:57,837 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 08:59:57,837 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 08:59:57,837 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 08:59:57,838 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 08:59:57,838 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 08:59:57,885 INFO ]: Repository-Root is: /tmp [2018-06-25 08:59:57,904 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 08:59:57,909 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 08:59:57,911 INFO ]: Initializing SmtParser... [2018-06-25 08:59:57,911 INFO ]: SmtParser initialized [2018-06-25 08:59:57,912 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe.c-1.smt2 [2018-06-25 08:59:57,913 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 08:59:57,996 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe.c-1.smt2 unknown [2018-06-25 08:59:58,190 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe.c-1.smt2 [2018-06-25 08:59:58,194 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 08:59:58,204 INFO ]: Walking toolchain with 4 elements. [2018-06-25 08:59:58,205 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 08:59:58,205 INFO ]: Initializing ChcToBoogie... [2018-06-25 08:59:58,205 INFO ]: ChcToBoogie initialized [2018-06-25 08:59:58,208 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:59:58" (1/1) ... [2018-06-25 08:59:58,255 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:59:58 Unit [2018-06-25 08:59:58,255 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 08:59:58,256 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 08:59:58,256 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 08:59:58,256 INFO ]: Boogie Preprocessor initialized [2018-06-25 08:59:58,276 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:59:58" (1/1) ... [2018-06-25 08:59:58,276 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:59:58" (1/1) ... [2018-06-25 08:59:58,284 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:59:58" (1/1) ... [2018-06-25 08:59:58,284 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:59:58" (1/1) ... [2018-06-25 08:59:58,287 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:59:58" (1/1) ... [2018-06-25 08:59:58,289 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:59:58" (1/1) ... [2018-06-25 08:59:58,290 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:59:58" (1/1) ... [2018-06-25 08:59:58,292 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 08:59:58,293 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 08:59:58,293 INFO ]: Initializing RCFGBuilder... [2018-06-25 08:59:58,293 INFO ]: RCFGBuilder initialized [2018-06-25 08:59:58,294 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:59:58" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 08:59:58,309 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 08:59:58,309 INFO ]: Found specification of procedure gotoProc [2018-06-25 08:59:58,309 INFO ]: Found implementation of procedure gotoProc [2018-06-25 08:59:58,309 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 08:59:58,309 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 08:59:58,309 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 08:59:58,604 INFO ]: Using library mode [2018-06-25 08:59:58,605 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:59:58 BoogieIcfgContainer [2018-06-25 08:59:58,605 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 08:59:58,606 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 08:59:58,606 INFO ]: Initializing TraceAbstraction... [2018-06-25 08:59:58,609 INFO ]: TraceAbstraction initialized [2018-06-25 08:59:58,609 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:59:58" (1/3) ... [2018-06-25 08:59:58,610 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d80f2c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 08:59:58, skipping insertion in model container [2018-06-25 08:59:58,610 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:59:58" (2/3) ... [2018-06-25 08:59:58,610 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d80f2c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 08:59:58, skipping insertion in model container [2018-06-25 08:59:58,610 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:59:58" (3/3) ... [2018-06-25 08:59:58,612 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 08:59:58,621 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 08:59:58,630 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 08:59:58,679 INFO ]: Using default assertion order modulation [2018-06-25 08:59:58,680 INFO ]: Interprodecural is true [2018-06-25 08:59:58,680 INFO ]: Hoare is false [2018-06-25 08:59:58,680 INFO ]: Compute interpolants for FPandBP [2018-06-25 08:59:58,680 INFO ]: Backedges is TWOTRACK [2018-06-25 08:59:58,680 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 08:59:58,680 INFO ]: Difference is false [2018-06-25 08:59:58,680 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 08:59:58,680 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 08:59:58,696 INFO ]: Start isEmpty. Operand 14 states. [2018-06-25 08:59:58,712 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 08:59:58,712 INFO ]: Found error trace [2018-06-25 08:59:58,713 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:58,713 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:58,718 INFO ]: Analyzing trace with hash 103853604, now seen corresponding path program 1 times [2018-06-25 08:59:58,720 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:58,720 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:58,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:58,757 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:59:58,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:58,795 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:58,901 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:58,903 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:59:58,903 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 08:59:58,905 INFO ]: Interpolant automaton has 5 states [2018-06-25 08:59:58,917 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 08:59:58,917 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 08:59:58,919 INFO ]: Start difference. First operand 14 states. Second operand 5 states. [2018-06-25 08:59:59,036 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:59,036 INFO ]: Finished difference Result 19 states and 24 transitions. [2018-06-25 08:59:59,040 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 08:59:59,041 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-25 08:59:59,042 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:59,052 INFO ]: With dead ends: 19 [2018-06-25 08:59:59,053 INFO ]: Without dead ends: 19 [2018-06-25 08:59:59,054 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 08:59:59,067 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 08:59:59,078 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-25 08:59:59,080 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 08:59:59,080 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-06-25 08:59:59,084 INFO ]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 11 [2018-06-25 08:59:59,084 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:59,084 INFO ]: Abstraction has 14 states and 17 transitions. [2018-06-25 08:59:59,084 INFO ]: Interpolant automaton has 5 states. [2018-06-25 08:59:59,084 INFO ]: Start isEmpty. Operand 14 states and 17 transitions. [2018-06-25 08:59:59,084 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 08:59:59,084 INFO ]: Found error trace [2018-06-25 08:59:59,084 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:59,084 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:59,085 INFO ]: Analyzing trace with hash 1326208268, now seen corresponding path program 1 times [2018-06-25 08:59:59,085 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:59,085 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:59,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:59,086 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:59:59,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:59,107 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:59,332 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:59,332 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:59:59,332 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:59:59,339 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:59:59,370 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:59,376 INFO ]: Computing forward predicates... [2018-06-25 08:59:59,485 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:59,513 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 08:59:59,514 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2018-06-25 08:59:59,514 INFO ]: Interpolant automaton has 9 states [2018-06-25 08:59:59,514 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 08:59:59,514 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-25 08:59:59,514 INFO ]: Start difference. First operand 14 states and 17 transitions. Second operand 9 states. [2018-06-25 08:59:59,933 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:59,933 INFO ]: Finished difference Result 16 states and 20 transitions. [2018-06-25 08:59:59,933 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 08:59:59,933 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-25 08:59:59,933 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:59,934 INFO ]: With dead ends: 16 [2018-06-25 08:59:59,934 INFO ]: Without dead ends: 13 [2018-06-25 08:59:59,935 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-06-25 08:59:59,935 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 08:59:59,936 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 08:59:59,936 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 08:59:59,936 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-06-25 08:59:59,937 INFO ]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 12 [2018-06-25 08:59:59,937 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:59,937 INFO ]: Abstraction has 13 states and 15 transitions. [2018-06-25 08:59:59,937 INFO ]: Interpolant automaton has 9 states. [2018-06-25 08:59:59,937 INFO ]: Start isEmpty. Operand 13 states and 15 transitions. [2018-06-25 08:59:59,937 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 08:59:59,937 INFO ]: Found error trace [2018-06-25 08:59:59,937 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:59,937 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:59,937 INFO ]: Analyzing trace with hash -513193148, now seen corresponding path program 1 times [2018-06-25 08:59:59,937 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:59,938 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:59,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:59,938 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:59:59,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:59,950 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:00,020 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:00:00,020 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:00:00,020 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:00:00,020 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:00:00,020 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:00:00,020 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:00:00,020 INFO ]: Start difference. First operand 13 states and 15 transitions. Second operand 5 states. [2018-06-25 09:00:00,138 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:00,138 INFO ]: Finished difference Result 15 states and 18 transitions. [2018-06-25 09:00:00,138 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:00:00,138 INFO ]: Start accepts. Automaton has 5 states. Word has length 12 [2018-06-25 09:00:00,138 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:00,139 INFO ]: With dead ends: 15 [2018-06-25 09:00:00,139 INFO ]: Without dead ends: 14 [2018-06-25 09:00:00,139 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:00:00,139 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:00:00,141 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 09:00:00,141 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:00:00,141 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-25 09:00:00,141 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2018-06-25 09:00:00,142 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:00,142 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-25 09:00:00,142 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:00:00,142 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-25 09:00:00,142 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:00:00,142 INFO ]: Found error trace [2018-06-25 09:00:00,142 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:00,142 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:00,142 INFO ]: Analyzing trace with hash -622371860, now seen corresponding path program 1 times [2018-06-25 09:00:00,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:00,142 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:00,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:00,143 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:00,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:00,156 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:00,228 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:00:00,228 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:00:00,228 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:00:00,228 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:00:00,228 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:00:00,228 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:00:00,228 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 5 states. [2018-06-25 09:00:00,321 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:00,321 INFO ]: Finished difference Result 15 states and 17 transitions. [2018-06-25 09:00:00,321 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:00:00,321 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-25 09:00:00,322 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:00,322 INFO ]: With dead ends: 15 [2018-06-25 09:00:00,322 INFO ]: Without dead ends: 15 [2018-06-25 09:00:00,322 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:00:00,322 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:00:00,323 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 09:00:00,324 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:00:00,324 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-06-25 09:00:00,324 INFO ]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13 [2018-06-25 09:00:00,324 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:00,324 INFO ]: Abstraction has 15 states and 17 transitions. [2018-06-25 09:00:00,324 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:00:00,324 INFO ]: Start isEmpty. Operand 15 states and 17 transitions. [2018-06-25 09:00:00,324 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:00:00,324 INFO ]: Found error trace [2018-06-25 09:00:00,324 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:00,324 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:00,324 INFO ]: Analyzing trace with hash -2060129664, now seen corresponding path program 1 times [2018-06-25 09:00:00,324 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:00,324 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:00,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:00,325 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:00,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:00,360 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:00,817 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:00:00,817 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:00,817 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:00,825 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:00,844 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:00,846 INFO ]: Computing forward predicates... [2018-06-25 09:00:00,994 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:00:01,017 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:01,017 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-06-25 09:00:01,018 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:00:01,018 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:00:01,018 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:00:01,018 INFO ]: Start difference. First operand 15 states and 17 transitions. Second operand 12 states. [2018-06-25 09:00:01,229 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:01,229 INFO ]: Finished difference Result 24 states and 29 transitions. [2018-06-25 09:00:01,229 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:00:01,230 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-25 09:00:01,230 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:01,230 INFO ]: With dead ends: 24 [2018-06-25 09:00:01,230 INFO ]: Without dead ends: 24 [2018-06-25 09:00:01,231 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:00:01,231 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 09:00:01,233 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-06-25 09:00:01,233 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:00:01,233 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-06-25 09:00:01,233 INFO ]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2018-06-25 09:00:01,233 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:01,233 INFO ]: Abstraction has 17 states and 20 transitions. [2018-06-25 09:00:01,233 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:00:01,234 INFO ]: Start isEmpty. Operand 17 states and 20 transitions. [2018-06-25 09:00:01,234 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:00:01,234 INFO ]: Found error trace [2018-06-25 09:00:01,234 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:01,234 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:01,235 INFO ]: Analyzing trace with hash 393310504, now seen corresponding path program 2 times [2018-06-25 09:00:01,235 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:01,235 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:01,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:01,235 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:01,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:01,248 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:01,340 INFO ]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:00:01,340 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:01,340 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:01,348 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:00:01,374 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:00:01,374 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:01,376 INFO ]: Computing forward predicates... [2018-06-25 09:00:01,509 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:00:01,529 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:01,529 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-06-25 09:00:01,529 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:00:01,529 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:00:01,529 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:00:01,529 INFO ]: Start difference. First operand 17 states and 20 transitions. Second operand 12 states. [2018-06-25 09:00:02,012 WARN ]: Spent 238.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2018-06-25 09:00:02,253 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-25 09:00:02,344 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:02,344 INFO ]: Finished difference Result 29 states and 35 transitions. [2018-06-25 09:00:02,347 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:00:02,347 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-25 09:00:02,347 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:02,348 INFO ]: With dead ends: 29 [2018-06-25 09:00:02,348 INFO ]: Without dead ends: 23 [2018-06-25 09:00:02,348 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:00:02,348 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 09:00:02,350 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-06-25 09:00:02,350 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:00:02,350 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-06-25 09:00:02,350 INFO ]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2018-06-25 09:00:02,350 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:02,350 INFO ]: Abstraction has 18 states and 21 transitions. [2018-06-25 09:00:02,350 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:00:02,350 INFO ]: Start isEmpty. Operand 18 states and 21 transitions. [2018-06-25 09:00:02,351 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:00:02,351 INFO ]: Found error trace [2018-06-25 09:00:02,351 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:02,351 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:02,351 INFO ]: Analyzing trace with hash -2039891616, now seen corresponding path program 3 times [2018-06-25 09:00:02,351 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:02,351 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:02,354 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:02,354 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:02,354 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:02,366 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:02,424 INFO ]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:00:02,424 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:02,424 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:02,432 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:00:02,476 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-25 09:00:02,476 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:02,478 INFO ]: Computing forward predicates... [2018-06-25 09:00:02,568 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:00:02,592 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:02,592 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-25 09:00:02,592 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:00:02,592 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:00:02,592 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:00:02,592 INFO ]: Start difference. First operand 18 states and 21 transitions. Second operand 10 states. [2018-06-25 09:00:02,641 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:02,641 INFO ]: Finished difference Result 20 states and 23 transitions. [2018-06-25 09:00:02,642 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:00:02,642 INFO ]: Start accepts. Automaton has 10 states. Word has length 15 [2018-06-25 09:00:02,642 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:02,642 INFO ]: With dead ends: 20 [2018-06-25 09:00:02,642 INFO ]: Without dead ends: 20 [2018-06-25 09:00:02,643 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:00:02,643 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:00:02,644 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-06-25 09:00:02,644 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:00:02,645 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-06-25 09:00:02,645 INFO ]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2018-06-25 09:00:02,645 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:02,645 INFO ]: Abstraction has 17 states and 19 transitions. [2018-06-25 09:00:02,645 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:00:02,645 INFO ]: Start isEmpty. Operand 17 states and 19 transitions. [2018-06-25 09:00:02,645 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:00:02,645 INFO ]: Found error trace [2018-06-25 09:00:02,646 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:02,646 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:02,646 INFO ]: Analyzing trace with hash 1241398156, now seen corresponding path program 4 times [2018-06-25 09:00:02,646 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:02,646 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:02,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:02,647 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:02,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:02,662 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:02,716 INFO ]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:00:02,716 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:02,716 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) [2018-06-25 09:00:02,733 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:02,763 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:00:02,763 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:02,766 INFO ]: Computing forward predicates... [2018-06-25 09:00:02,804 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:00:02,825 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:02,826 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-25 09:00:02,826 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:00:02,826 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:00:02,826 INFO ]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:00:02,826 INFO ]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2018-06-25 09:00:02,899 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:02,899 INFO ]: Finished difference Result 21 states and 24 transitions. [2018-06-25 09:00:02,900 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:00:02,900 INFO ]: Start accepts. Automaton has 11 states. Word has length 16 [2018-06-25 09:00:02,900 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:02,900 INFO ]: With dead ends: 21 [2018-06-25 09:00:02,900 INFO ]: Without dead ends: 18 [2018-06-25 09:00:02,901 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:00:02,901 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 09:00:02,902 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-25 09:00:02,902 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:00:02,903 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-06-25 09:00:02,903 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2018-06-25 09:00:02,903 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:02,903 INFO ]: Abstraction has 18 states and 20 transitions. [2018-06-25 09:00:02,903 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:00:02,903 INFO ]: Start isEmpty. Operand 18 states and 20 transitions. [2018-06-25 09:00:02,903 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:00:02,904 INFO ]: Found error trace [2018-06-25 09:00:02,904 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:02,905 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:02,905 INFO ]: Analyzing trace with hash 1630147492, now seen corresponding path program 5 times [2018-06-25 09:00:02,905 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:02,905 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:02,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:02,906 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:02,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:02,942 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:03,122 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:00:03,122 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:03,122 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:03,129 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:00:03,176 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:00:03,177 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:03,180 INFO ]: Computing forward predicates... [2018-06-25 09:00:03,596 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:00:03,615 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:03,615 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-06-25 09:00:03,615 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:00:03,615 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:00:03,615 INFO ]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:00:03,616 INFO ]: Start difference. First operand 18 states and 20 transitions. Second operand 16 states. [2018-06-25 09:00:03,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:03,992 INFO ]: Finished difference Result 29 states and 34 transitions. [2018-06-25 09:00:03,993 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:00:03,993 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-25 09:00:03,993 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:03,993 INFO ]: With dead ends: 29 [2018-06-25 09:00:03,993 INFO ]: Without dead ends: 29 [2018-06-25 09:00:03,994 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:00:03,994 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 09:00:03,996 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-06-25 09:00:03,996 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:00:03,996 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-06-25 09:00:03,996 INFO ]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2018-06-25 09:00:03,996 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:03,996 INFO ]: Abstraction has 20 states and 23 transitions. [2018-06-25 09:00:03,996 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:00:03,997 INFO ]: Start isEmpty. Operand 20 states and 23 transitions. [2018-06-25 09:00:03,997 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:00:03,997 INFO ]: Found error trace [2018-06-25 09:00:03,997 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:03,997 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:03,997 INFO ]: Analyzing trace with hash 796475020, now seen corresponding path program 6 times [2018-06-25 09:00:03,997 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:03,997 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:04,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:04,000 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:04,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:04,014 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:04,239 INFO ]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:00:04,239 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:04,239 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:04,246 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:00:04,287 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-25 09:00:04,287 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:04,289 INFO ]: Computing forward predicates... [2018-06-25 09:00:04,537 INFO ]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:00:04,563 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:04,563 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-06-25 09:00:04,564 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:00:04,564 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:00:04,564 INFO ]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:00:04,564 INFO ]: Start difference. First operand 20 states and 23 transitions. Second operand 16 states. [2018-06-25 09:00:04,966 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:04,966 INFO ]: Finished difference Result 35 states and 41 transitions. [2018-06-25 09:00:04,966 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-25 09:00:04,967 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-25 09:00:04,967 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:04,967 INFO ]: With dead ends: 35 [2018-06-25 09:00:04,967 INFO ]: Without dead ends: 27 [2018-06-25 09:00:04,968 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2018-06-25 09:00:04,968 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-25 09:00:04,970 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-06-25 09:00:04,970 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:00:04,970 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-06-25 09:00:04,970 INFO ]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 18 [2018-06-25 09:00:04,970 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:04,970 INFO ]: Abstraction has 21 states and 24 transitions. [2018-06-25 09:00:04,971 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:00:04,971 INFO ]: Start isEmpty. Operand 21 states and 24 transitions. [2018-06-25 09:00:04,971 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:00:04,971 INFO ]: Found error trace [2018-06-25 09:00:04,971 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:04,971 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:04,971 INFO ]: Analyzing trace with hash -1048553276, now seen corresponding path program 7 times [2018-06-25 09:00:04,971 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:04,971 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:04,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:04,972 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:04,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:04,983 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:05,077 INFO ]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:00:05,077 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:05,077 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:05,084 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:05,104 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:05,105 INFO ]: Computing forward predicates... [2018-06-25 09:00:05,148 INFO ]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:00:05,168 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:05,168 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-25 09:00:05,168 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:00:05,169 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:00:05,169 INFO ]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:00:05,169 INFO ]: Start difference. First operand 21 states and 24 transitions. Second operand 13 states. [2018-06-25 09:00:05,222 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:05,222 INFO ]: Finished difference Result 24 states and 27 transitions. [2018-06-25 09:00:05,222 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:00:05,222 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-25 09:00:05,222 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:05,223 INFO ]: With dead ends: 24 [2018-06-25 09:00:05,223 INFO ]: Without dead ends: 24 [2018-06-25 09:00:05,223 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:00:05,223 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 09:00:05,225 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-06-25 09:00:05,225 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:00:05,225 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-06-25 09:00:05,225 INFO ]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2018-06-25 09:00:05,225 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:05,225 INFO ]: Abstraction has 20 states and 22 transitions. [2018-06-25 09:00:05,225 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:00:05,225 INFO ]: Start isEmpty. Operand 20 states and 22 transitions. [2018-06-25 09:00:05,226 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:00:05,226 INFO ]: Found error trace [2018-06-25 09:00:05,226 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:05,226 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:05,226 INFO ]: Analyzing trace with hash 1908115624, now seen corresponding path program 8 times [2018-06-25 09:00:05,226 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:05,226 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:05,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:05,227 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:05,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:05,237 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:05,368 INFO ]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:00:05,368 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:05,368 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:05,383 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:00:05,404 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:00:05,405 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:05,407 INFO ]: Computing forward predicates... [2018-06-25 09:00:05,476 INFO ]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:00:05,497 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:05,497 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-25 09:00:05,498 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:00:05,498 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:00:05,498 INFO ]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:00:05,498 INFO ]: Start difference. First operand 20 states and 22 transitions. Second operand 16 states. [2018-06-25 09:00:05,735 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:05,735 INFO ]: Finished difference Result 25 states and 28 transitions. [2018-06-25 09:00:05,735 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:00:05,735 INFO ]: Start accepts. Automaton has 16 states. Word has length 19 [2018-06-25 09:00:05,735 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:05,736 INFO ]: With dead ends: 25 [2018-06-25 09:00:05,736 INFO ]: Without dead ends: 21 [2018-06-25 09:00:05,736 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:00:05,736 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 09:00:05,737 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-25 09:00:05,737 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:00:05,738 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-06-25 09:00:05,738 INFO ]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19 [2018-06-25 09:00:05,738 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:05,738 INFO ]: Abstraction has 21 states and 23 transitions. [2018-06-25 09:00:05,738 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:00:05,738 INFO ]: Start isEmpty. Operand 21 states and 23 transitions. [2018-06-25 09:00:05,738 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:00:05,738 INFO ]: Found error trace [2018-06-25 09:00:05,738 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:05,739 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:05,739 INFO ]: Analyzing trace with hash 1723390208, now seen corresponding path program 9 times [2018-06-25 09:00:05,739 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:05,739 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:05,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:05,739 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:05,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:05,756 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:05,927 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:00:05,927 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:05,927 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:05,936 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:00:05,983 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:00:05,984 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:05,987 INFO ]: Computing forward predicates... [2018-06-25 09:00:06,390 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:00:06,410 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:06,410 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-06-25 09:00:06,411 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:00:06,411 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:00:06,411 INFO ]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:00:06,411 INFO ]: Start difference. First operand 21 states and 23 transitions. Second operand 20 states. [2018-06-25 09:00:06,736 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:06,736 INFO ]: Finished difference Result 34 states and 39 transitions. [2018-06-25 09:00:06,736 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:00:06,736 INFO ]: Start accepts. Automaton has 20 states. Word has length 20 [2018-06-25 09:00:06,736 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:06,737 INFO ]: With dead ends: 34 [2018-06-25 09:00:06,737 INFO ]: Without dead ends: 34 [2018-06-25 09:00:06,737 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:00:06,737 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 09:00:06,739 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 23. [2018-06-25 09:00:06,739 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:00:06,740 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-06-25 09:00:06,740 INFO ]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 20 [2018-06-25 09:00:06,740 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:06,740 INFO ]: Abstraction has 23 states and 26 transitions. [2018-06-25 09:00:06,740 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:00:06,740 INFO ]: Start isEmpty. Operand 23 states and 26 transitions. [2018-06-25 09:00:06,740 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:00:06,740 INFO ]: Found error trace [2018-06-25 09:00:06,740 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:06,741 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:06,741 INFO ]: Analyzing trace with hash 291869608, now seen corresponding path program 10 times [2018-06-25 09:00:06,741 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:06,741 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:06,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:06,741 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:06,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:06,762 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:07,005 INFO ]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:00:07,005 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:07,005 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 09:00:07,020 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:07,044 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:00:07,044 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:07,046 INFO ]: Computing forward predicates... [2018-06-25 09:00:07,380 INFO ]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:00:07,412 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:07,412 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-06-25 09:00:07,412 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:00:07,412 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:00:07,412 INFO ]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:00:07,413 INFO ]: Start difference. First operand 23 states and 26 transitions. Second operand 19 states. [2018-06-25 09:00:07,495 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:07,495 INFO ]: Finished difference Result 31 states and 35 transitions. [2018-06-25 09:00:07,496 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:00:07,496 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-25 09:00:07,496 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:07,496 INFO ]: With dead ends: 31 [2018-06-25 09:00:07,496 INFO ]: Without dead ends: 22 [2018-06-25 09:00:07,497 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:00:07,497 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 09:00:07,498 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-25 09:00:07,498 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 09:00:07,498 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-06-25 09:00:07,498 INFO ]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 21 [2018-06-25 09:00:07,498 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:07,499 INFO ]: Abstraction has 22 states and 24 transitions. [2018-06-25 09:00:07,499 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:00:07,499 INFO ]: Start isEmpty. Operand 22 states and 24 transitions. [2018-06-25 09:00:07,500 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:00:07,500 INFO ]: Found error trace [2018-06-25 09:00:07,500 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:07,500 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:07,500 INFO ]: Analyzing trace with hash 1041170400, now seen corresponding path program 11 times [2018-06-25 09:00:07,500 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:07,500 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:07,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:07,501 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:07,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:07,509 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:07,594 INFO ]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:00:07,594 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:07,594 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:07,601 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:00:07,644 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-25 09:00:07,644 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:07,647 INFO ]: Computing forward predicates... [2018-06-25 09:00:07,745 INFO ]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:00:07,764 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:07,764 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-25 09:00:07,765 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:00:07,765 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:00:07,765 INFO ]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:00:07,765 INFO ]: Start difference. First operand 22 states and 24 transitions. Second operand 16 states. [2018-06-25 09:00:07,837 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:07,837 INFO ]: Finished difference Result 23 states and 25 transitions. [2018-06-25 09:00:07,837 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:00:07,837 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-25 09:00:07,837 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:07,838 INFO ]: With dead ends: 23 [2018-06-25 09:00:07,838 INFO ]: Without dead ends: 23 [2018-06-25 09:00:07,838 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:00:07,838 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 09:00:07,840 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-25 09:00:07,840 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:00:07,840 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-06-25 09:00:07,840 INFO ]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 21 [2018-06-25 09:00:07,840 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:07,840 INFO ]: Abstraction has 23 states and 25 transitions. [2018-06-25 09:00:07,840 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:00:07,840 INFO ]: Start isEmpty. Operand 23 states and 25 transitions. [2018-06-25 09:00:07,841 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:00:07,841 INFO ]: Found error trace [2018-06-25 09:00:07,841 INFO ]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:07,841 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:07,841 INFO ]: Analyzing trace with hash -2029927156, now seen corresponding path program 12 times [2018-06-25 09:00:07,841 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:07,841 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:07,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:07,842 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:07,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:07,852 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:08,356 INFO ]: Checked inductivity of 26 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:00:08,356 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:08,356 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:08,361 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:00:08,425 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-25 09:00:08,425 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:08,428 INFO ]: Computing forward predicates... [2018-06-25 09:00:08,668 INFO ]: Checked inductivity of 26 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:00:08,691 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:08,691 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-25 09:00:08,691 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:00:08,691 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:00:08,692 INFO ]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:00:08,692 INFO ]: Start difference. First operand 23 states and 25 transitions. Second operand 20 states. [2018-06-25 09:00:08,960 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:08,960 INFO ]: Finished difference Result 29 states and 32 transitions. [2018-06-25 09:00:08,961 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:00:08,961 INFO ]: Start accepts. Automaton has 20 states. Word has length 22 [2018-06-25 09:00:08,961 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:08,961 INFO ]: With dead ends: 29 [2018-06-25 09:00:08,961 INFO ]: Without dead ends: 24 [2018-06-25 09:00:08,962 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=217, Invalid=653, Unknown=0, NotChecked=0, Total=870 [2018-06-25 09:00:08,962 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 09:00:08,963 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-25 09:00:08,963 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 09:00:08,963 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-06-25 09:00:08,963 INFO ]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 22 [2018-06-25 09:00:08,963 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:08,963 INFO ]: Abstraction has 24 states and 26 transitions. [2018-06-25 09:00:08,963 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:00:08,963 INFO ]: Start isEmpty. Operand 24 states and 26 transitions. [2018-06-25 09:00:08,964 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 09:00:08,964 INFO ]: Found error trace [2018-06-25 09:00:08,964 INFO ]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:08,964 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:08,964 INFO ]: Analyzing trace with hash 2028312868, now seen corresponding path program 13 times [2018-06-25 09:00:08,964 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:08,964 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:08,964 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:08,964 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:08,964 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:08,982 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:09,191 INFO ]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:00:09,191 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:09,191 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:09,198 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:09,221 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:09,224 INFO ]: Computing forward predicates... [2018-06-25 09:00:09,495 INFO ]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:00:09,514 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:09,514 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-06-25 09:00:09,514 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:00:09,514 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:00:09,514 INFO ]: CoverageRelationStatistics Valid=50, Invalid=502, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:00:09,515 INFO ]: Start difference. First operand 24 states and 26 transitions. Second operand 24 states. [2018-06-25 09:00:09,885 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:09,885 INFO ]: Finished difference Result 39 states and 44 transitions. [2018-06-25 09:00:09,885 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:00:09,885 INFO ]: Start accepts. Automaton has 24 states. Word has length 23 [2018-06-25 09:00:09,885 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:09,885 INFO ]: With dead ends: 39 [2018-06-25 09:00:09,885 INFO ]: Without dead ends: 39 [2018-06-25 09:00:09,886 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=1007, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:00:09,886 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-25 09:00:09,888 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-06-25 09:00:09,888 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-25 09:00:09,889 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-06-25 09:00:09,889 INFO ]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 23 [2018-06-25 09:00:09,889 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:09,889 INFO ]: Abstraction has 26 states and 29 transitions. [2018-06-25 09:00:09,889 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:00:09,889 INFO ]: Start isEmpty. Operand 26 states and 29 transitions. [2018-06-25 09:00:09,889 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:00:09,889 INFO ]: Found error trace [2018-06-25 09:00:09,889 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:09,889 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:09,889 INFO ]: Analyzing trace with hash -1015265268, now seen corresponding path program 14 times [2018-06-25 09:00:09,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:09,889 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:09,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:09,890 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:09,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:09,900 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:10,074 INFO ]: Checked inductivity of 35 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:00:10,074 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:10,074 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:10,081 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:00:10,106 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:00:10,106 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:10,108 INFO ]: Computing forward predicates... [2018-06-25 09:00:10,241 INFO ]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:00:10,261 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:10,261 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-06-25 09:00:10,261 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:00:10,261 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:00:10,262 INFO ]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:00:10,262 INFO ]: Start difference. First operand 26 states and 29 transitions. Second operand 24 states. [2018-06-25 09:00:11,100 WARN ]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-25 09:00:11,462 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:11,462 INFO ]: Finished difference Result 47 states and 53 transitions. [2018-06-25 09:00:11,462 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-25 09:00:11,462 INFO ]: Start accepts. Automaton has 24 states. Word has length 24 [2018-06-25 09:00:11,462 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:11,463 INFO ]: With dead ends: 47 [2018-06-25 09:00:11,463 INFO ]: Without dead ends: 35 [2018-06-25 09:00:11,463 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=448, Invalid=1358, Unknown=0, NotChecked=0, Total=1806 [2018-06-25 09:00:11,463 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-25 09:00:11,465 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-06-25 09:00:11,465 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-25 09:00:11,465 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-06-25 09:00:11,465 INFO ]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 24 [2018-06-25 09:00:11,465 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:11,465 INFO ]: Abstraction has 27 states and 30 transitions. [2018-06-25 09:00:11,465 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:00:11,465 INFO ]: Start isEmpty. Operand 27 states and 30 transitions. [2018-06-25 09:00:11,468 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:00:11,468 INFO ]: Found error trace [2018-06-25 09:00:11,468 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:11,468 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:11,468 INFO ]: Analyzing trace with hash 1803257412, now seen corresponding path program 15 times [2018-06-25 09:00:11,468 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:11,468 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:11,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:11,468 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:11,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:11,481 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:11,870 INFO ]: Checked inductivity of 35 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:00:11,870 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:11,870 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:11,876 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:00:11,907 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 09:00:11,907 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:11,909 INFO ]: Computing forward predicates... [2018-06-25 09:00:12,045 INFO ]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:00:12,064 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:12,064 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-06-25 09:00:12,064 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:00:12,064 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:00:12,064 INFO ]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:00:12,064 INFO ]: Start difference. First operand 27 states and 30 transitions. Second operand 20 states. [2018-06-25 09:00:12,480 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:12,480 INFO ]: Finished difference Result 33 states and 36 transitions. [2018-06-25 09:00:12,480 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-25 09:00:12,481 INFO ]: Start accepts. Automaton has 20 states. Word has length 24 [2018-06-25 09:00:12,481 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:12,481 INFO ]: With dead ends: 33 [2018-06-25 09:00:12,481 INFO ]: Without dead ends: 27 [2018-06-25 09:00:12,481 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=355, Invalid=977, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 09:00:12,481 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-25 09:00:12,483 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-25 09:00:12,483 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-25 09:00:12,483 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-06-25 09:00:12,483 INFO ]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2018-06-25 09:00:12,483 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:12,483 INFO ]: Abstraction has 27 states and 29 transitions. [2018-06-25 09:00:12,483 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:00:12,483 INFO ]: Start isEmpty. Operand 27 states and 29 transitions. [2018-06-25 09:00:12,484 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 09:00:12,484 INFO ]: Found error trace [2018-06-25 09:00:12,484 INFO ]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:12,484 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:12,484 INFO ]: Analyzing trace with hash 1410115456, now seen corresponding path program 16 times [2018-06-25 09:00:12,484 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:12,484 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:12,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:12,485 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:12,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:12,499 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:13,376 INFO ]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:00:13,376 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:13,376 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:13,381 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:00:13,420 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:00:13,420 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:13,431 INFO ]: Computing forward predicates... [2018-06-25 09:00:14,089 INFO ]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:00:14,108 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:14,108 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2018-06-25 09:00:14,108 INFO ]: Interpolant automaton has 28 states [2018-06-25 09:00:14,108 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 09:00:14,109 INFO ]: CoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:00:14,109 INFO ]: Start difference. First operand 27 states and 29 transitions. Second operand 28 states. [2018-06-25 09:00:14,645 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:14,645 INFO ]: Finished difference Result 44 states and 49 transitions. [2018-06-25 09:00:14,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:00:14,645 INFO ]: Start accepts. Automaton has 28 states. Word has length 26 [2018-06-25 09:00:14,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:14,645 INFO ]: With dead ends: 44 [2018-06-25 09:00:14,645 INFO ]: Without dead ends: 44 [2018-06-25 09:00:14,645 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=137, Invalid=1423, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:00:14,646 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-25 09:00:14,647 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 29. [2018-06-25 09:00:14,647 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-25 09:00:14,648 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-06-25 09:00:14,648 INFO ]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2018-06-25 09:00:14,648 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:14,648 INFO ]: Abstraction has 29 states and 32 transitions. [2018-06-25 09:00:14,648 INFO ]: Interpolant automaton has 28 states. [2018-06-25 09:00:14,648 INFO ]: Start isEmpty. Operand 29 states and 32 transitions. [2018-06-25 09:00:14,648 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 09:00:14,649 INFO ]: Found error trace [2018-06-25 09:00:14,649 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:14,650 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:14,650 INFO ]: Analyzing trace with hash -1543924184, now seen corresponding path program 17 times [2018-06-25 09:00:14,650 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:14,650 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:14,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:14,650 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:14,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:14,661 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:14,820 INFO ]: Checked inductivity of 51 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:00:14,820 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:14,820 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:14,828 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:00:14,859 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 09:00:14,859 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:14,862 INFO ]: Computing forward predicates... [2018-06-25 09:00:15,033 INFO ]: Checked inductivity of 51 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:00:15,053 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:15,053 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-06-25 09:00:15,053 INFO ]: Interpolant automaton has 28 states [2018-06-25 09:00:15,053 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 09:00:15,053 INFO ]: CoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:00:15,053 INFO ]: Start difference. First operand 29 states and 32 transitions. Second operand 28 states. [2018-06-25 09:00:15,674 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:15,674 INFO ]: Finished difference Result 53 states and 59 transitions. [2018-06-25 09:00:15,674 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-25 09:00:15,674 INFO ]: Start accepts. Automaton has 28 states. Word has length 27 [2018-06-25 09:00:15,674 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:15,675 INFO ]: With dead ends: 53 [2018-06-25 09:00:15,675 INFO ]: Without dead ends: 39 [2018-06-25 09:00:15,675 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=599, Invalid=1851, Unknown=0, NotChecked=0, Total=2450 [2018-06-25 09:00:15,675 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-25 09:00:15,677 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-06-25 09:00:15,677 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-25 09:00:15,678 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-06-25 09:00:15,678 INFO ]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 27 [2018-06-25 09:00:15,678 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:15,678 INFO ]: Abstraction has 30 states and 33 transitions. [2018-06-25 09:00:15,678 INFO ]: Interpolant automaton has 28 states. [2018-06-25 09:00:15,678 INFO ]: Start isEmpty. Operand 30 states and 33 transitions. [2018-06-25 09:00:15,679 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 09:00:15,679 INFO ]: Found error trace [2018-06-25 09:00:15,679 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:15,679 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:15,679 INFO ]: Analyzing trace with hash 1226974816, now seen corresponding path program 18 times [2018-06-25 09:00:15,679 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:15,679 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:15,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:15,679 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:15,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:15,699 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:15,852 INFO ]: Checked inductivity of 51 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:00:15,852 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:15,852 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:15,860 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:00:15,891 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 09:00:15,891 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:15,894 INFO ]: Computing forward predicates... [2018-06-25 09:00:16,102 INFO ]: Checked inductivity of 51 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:00:16,121 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:16,122 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2018-06-25 09:00:16,122 INFO ]: Interpolant automaton has 23 states [2018-06-25 09:00:16,122 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-25 09:00:16,122 INFO ]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:00:16,122 INFO ]: Start difference. First operand 30 states and 33 transitions. Second operand 23 states. [2018-06-25 09:00:16,741 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:16,741 INFO ]: Finished difference Result 37 states and 40 transitions. [2018-06-25 09:00:16,743 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-25 09:00:16,743 INFO ]: Start accepts. Automaton has 23 states. Word has length 27 [2018-06-25 09:00:16,743 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:16,743 INFO ]: With dead ends: 37 [2018-06-25 09:00:16,743 INFO ]: Without dead ends: 30 [2018-06-25 09:00:16,743 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=534, Invalid=1272, Unknown=0, NotChecked=0, Total=1806 [2018-06-25 09:00:16,743 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-25 09:00:16,745 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-25 09:00:16,745 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-25 09:00:16,745 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-06-25 09:00:16,745 INFO ]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2018-06-25 09:00:16,746 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:16,746 INFO ]: Abstraction has 30 states and 32 transitions. [2018-06-25 09:00:16,746 INFO ]: Interpolant automaton has 23 states. [2018-06-25 09:00:16,746 INFO ]: Start isEmpty. Operand 30 states and 32 transitions. [2018-06-25 09:00:16,746 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-25 09:00:16,746 INFO ]: Found error trace [2018-06-25 09:00:16,746 INFO ]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:16,746 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:16,746 INFO ]: Analyzing trace with hash -467976540, now seen corresponding path program 19 times [2018-06-25 09:00:16,746 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:16,746 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:16,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:16,747 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:16,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:16,762 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:17,127 INFO ]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-25 09:00:17,127 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:17,127 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:17,133 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:17,167 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:17,171 INFO ]: Computing forward predicates... [2018-06-25 09:00:17,583 INFO ]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-25 09:00:17,604 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:17,604 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2018-06-25 09:00:17,604 INFO ]: Interpolant automaton has 32 states [2018-06-25 09:00:17,604 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-25 09:00:17,605 INFO ]: CoverageRelationStatistics Valid=68, Invalid=924, Unknown=0, NotChecked=0, Total=992 [2018-06-25 09:00:17,605 INFO ]: Start difference. First operand 30 states and 32 transitions. Second operand 32 states. [2018-06-25 09:00:18,214 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:18,214 INFO ]: Finished difference Result 49 states and 54 transitions. [2018-06-25 09:00:18,215 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:00:18,215 INFO ]: Start accepts. Automaton has 32 states. Word has length 29 [2018-06-25 09:00:18,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:18,215 INFO ]: With dead ends: 49 [2018-06-25 09:00:18,215 INFO ]: Without dead ends: 49 [2018-06-25 09:00:18,216 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=159, Invalid=1911, Unknown=0, NotChecked=0, Total=2070 [2018-06-25 09:00:18,216 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-25 09:00:18,218 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-06-25 09:00:18,218 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-25 09:00:18,218 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-06-25 09:00:18,218 INFO ]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2018-06-25 09:00:18,218 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:18,219 INFO ]: Abstraction has 32 states and 35 transitions. [2018-06-25 09:00:18,219 INFO ]: Interpolant automaton has 32 states. [2018-06-25 09:00:18,219 INFO ]: Start isEmpty. Operand 32 states and 35 transitions. [2018-06-25 09:00:18,219 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-25 09:00:18,219 INFO ]: Found error trace [2018-06-25 09:00:18,219 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:18,219 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:18,219 INFO ]: Analyzing trace with hash -1756532340, now seen corresponding path program 20 times [2018-06-25 09:00:18,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:18,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:18,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:18,221 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:18,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:18,233 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:18,476 INFO ]: Checked inductivity of 70 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-25 09:00:18,476 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:18,476 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:18,482 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:00:18,527 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:00:18,527 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:18,529 INFO ]: Computing forward predicates... [2018-06-25 09:00:19,400 INFO ]: Checked inductivity of 70 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-25 09:00:19,431 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:19,431 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2018-06-25 09:00:19,431 INFO ]: Interpolant automaton has 32 states [2018-06-25 09:00:19,431 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-25 09:00:19,431 INFO ]: CoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2018-06-25 09:00:19,431 INFO ]: Start difference. First operand 32 states and 35 transitions. Second operand 32 states. [2018-06-25 09:00:20,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:20,608 INFO ]: Finished difference Result 59 states and 65 transitions. [2018-06-25 09:00:20,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-25 09:00:20,609 INFO ]: Start accepts. Automaton has 32 states. Word has length 30 [2018-06-25 09:00:20,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:20,609 INFO ]: With dead ends: 59 [2018-06-25 09:00:20,609 INFO ]: Without dead ends: 43 [2018-06-25 09:00:20,610 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=772, Invalid=2420, Unknown=0, NotChecked=0, Total=3192 [2018-06-25 09:00:20,610 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-25 09:00:20,612 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 33. [2018-06-25 09:00:20,612 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-25 09:00:20,612 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-06-25 09:00:20,612 INFO ]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 30 [2018-06-25 09:00:20,612 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:20,612 INFO ]: Abstraction has 33 states and 36 transitions. [2018-06-25 09:00:20,612 INFO ]: Interpolant automaton has 32 states. [2018-06-25 09:00:20,612 INFO ]: Start isEmpty. Operand 33 states and 36 transitions. [2018-06-25 09:00:20,612 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-25 09:00:20,612 INFO ]: Found error trace [2018-06-25 09:00:20,612 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:20,612 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:20,613 INFO ]: Analyzing trace with hash -1802316860, now seen corresponding path program 21 times [2018-06-25 09:00:20,617 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:20,617 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:20,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:20,617 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:20,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:20,628 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:21,036 INFO ]: Checked inductivity of 70 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-25 09:00:21,036 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:21,036 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:21,055 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:00:21,094 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-25 09:00:21,094 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:21,097 INFO ]: Computing forward predicates... [2018-06-25 09:00:21,288 INFO ]: Checked inductivity of 70 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-25 09:00:21,307 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:21,308 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-06-25 09:00:21,308 INFO ]: Interpolant automaton has 25 states [2018-06-25 09:00:21,308 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 09:00:21,308 INFO ]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:00:21,309 INFO ]: Start difference. First operand 33 states and 36 transitions. Second operand 25 states. [2018-06-25 09:00:21,438 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:21,438 INFO ]: Finished difference Result 40 states and 43 transitions. [2018-06-25 09:00:21,440 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:00:21,440 INFO ]: Start accepts. Automaton has 25 states. Word has length 30 [2018-06-25 09:00:21,440 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:21,440 INFO ]: With dead ends: 40 [2018-06-25 09:00:21,440 INFO ]: Without dead ends: 40 [2018-06-25 09:00:21,440 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=311, Invalid=745, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 09:00:21,440 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-25 09:00:21,442 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 32. [2018-06-25 09:00:21,442 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-25 09:00:21,442 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-06-25 09:00:21,442 INFO ]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 30 [2018-06-25 09:00:21,443 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:21,443 INFO ]: Abstraction has 32 states and 34 transitions. [2018-06-25 09:00:21,443 INFO ]: Interpolant automaton has 25 states. [2018-06-25 09:00:21,443 INFO ]: Start isEmpty. Operand 32 states and 34 transitions. [2018-06-25 09:00:21,443 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-25 09:00:21,443 INFO ]: Found error trace [2018-06-25 09:00:21,443 INFO ]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:21,443 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:21,443 INFO ]: Analyzing trace with hash 16281000, now seen corresponding path program 22 times [2018-06-25 09:00:21,443 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:21,443 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:21,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:21,444 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:21,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:21,460 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:21,812 INFO ]: Checked inductivity of 77 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 09:00:21,812 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:21,812 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:21,818 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:00:21,852 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:00:21,852 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:21,854 INFO ]: Computing forward predicates... [2018-06-25 09:00:21,951 INFO ]: Checked inductivity of 77 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 09:00:21,969 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:21,969 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2018-06-25 09:00:21,970 INFO ]: Interpolant automaton has 26 states [2018-06-25 09:00:21,970 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-25 09:00:21,970 INFO ]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-06-25 09:00:21,970 INFO ]: Start difference. First operand 32 states and 34 transitions. Second operand 26 states. [2018-06-25 09:00:22,122 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:22,122 INFO ]: Finished difference Result 41 states and 44 transitions. [2018-06-25 09:00:22,123 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:00:22,123 INFO ]: Start accepts. Automaton has 26 states. Word has length 31 [2018-06-25 09:00:22,123 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:22,123 INFO ]: With dead ends: 41 [2018-06-25 09:00:22,123 INFO ]: Without dead ends: 33 [2018-06-25 09:00:22,123 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=310, Invalid=812, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:00:22,123 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-25 09:00:22,125 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-25 09:00:22,125 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-25 09:00:22,125 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-06-25 09:00:22,125 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 31 [2018-06-25 09:00:22,125 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:22,125 INFO ]: Abstraction has 33 states and 35 transitions. [2018-06-25 09:00:22,125 INFO ]: Interpolant automaton has 26 states. [2018-06-25 09:00:22,125 INFO ]: Start isEmpty. Operand 33 states and 35 transitions. [2018-06-25 09:00:22,126 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-25 09:00:22,126 INFO ]: Found error trace [2018-06-25 09:00:22,126 INFO ]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:22,126 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:22,126 INFO ]: Analyzing trace with hash -965192192, now seen corresponding path program 23 times [2018-06-25 09:00:22,126 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:22,126 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:22,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:22,126 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:22,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:22,143 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:22,517 INFO ]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 09:00:22,517 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:22,517 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:22,523 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:00:22,567 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-25 09:00:22,567 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:22,571 INFO ]: Computing forward predicates... [2018-06-25 09:00:23,245 INFO ]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 09:00:23,275 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:23,275 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2018-06-25 09:00:23,275 INFO ]: Interpolant automaton has 36 states [2018-06-25 09:00:23,275 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-25 09:00:23,275 INFO ]: CoverageRelationStatistics Valid=77, Invalid=1183, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 09:00:23,276 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 36 states. [2018-06-25 09:00:23,546 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-25 09:00:24,228 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:24,228 INFO ]: Finished difference Result 54 states and 59 transitions. [2018-06-25 09:00:24,230 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:00:24,230 INFO ]: Start accepts. Automaton has 36 states. Word has length 32 [2018-06-25 09:00:24,230 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:24,231 INFO ]: With dead ends: 54 [2018-06-25 09:00:24,231 INFO ]: Without dead ends: 54 [2018-06-25 09:00:24,232 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=181, Invalid=2471, Unknown=0, NotChecked=0, Total=2652 [2018-06-25 09:00:24,232 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-25 09:00:24,233 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 35. [2018-06-25 09:00:24,233 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-25 09:00:24,234 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-06-25 09:00:24,234 INFO ]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2018-06-25 09:00:24,234 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:24,234 INFO ]: Abstraction has 35 states and 38 transitions. [2018-06-25 09:00:24,234 INFO ]: Interpolant automaton has 36 states. [2018-06-25 09:00:24,234 INFO ]: Start isEmpty. Operand 35 states and 38 transitions. [2018-06-25 09:00:24,235 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-25 09:00:24,235 INFO ]: Found error trace [2018-06-25 09:00:24,235 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:24,235 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:24,235 INFO ]: Analyzing trace with hash -1326090072, now seen corresponding path program 24 times [2018-06-25 09:00:24,235 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:24,235 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:24,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:24,235 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:24,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:24,247 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:24,432 INFO ]: Checked inductivity of 92 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 09:00:24,432 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:24,432 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:24,438 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:00:24,476 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-25 09:00:24,476 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:24,479 INFO ]: Computing forward predicates... [2018-06-25 09:00:24,734 INFO ]: Checked inductivity of 92 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 09:00:24,756 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:24,756 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2018-06-25 09:00:24,756 INFO ]: Interpolant automaton has 36 states [2018-06-25 09:00:24,756 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-25 09:00:24,757 INFO ]: CoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 09:00:24,757 INFO ]: Start difference. First operand 35 states and 38 transitions. Second operand 36 states. [2018-06-25 09:00:25,603 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:25,603 INFO ]: Finished difference Result 65 states and 71 transitions. [2018-06-25 09:00:25,604 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-25 09:00:25,604 INFO ]: Start accepts. Automaton has 36 states. Word has length 33 [2018-06-25 09:00:25,604 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:25,604 INFO ]: With dead ends: 65 [2018-06-25 09:00:25,604 INFO ]: Without dead ends: 47 [2018-06-25 09:00:25,606 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=967, Invalid=3065, Unknown=0, NotChecked=0, Total=4032 [2018-06-25 09:00:25,606 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-25 09:00:25,608 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 36. [2018-06-25 09:00:25,608 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-25 09:00:25,608 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-06-25 09:00:25,608 INFO ]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 33 [2018-06-25 09:00:25,608 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:25,608 INFO ]: Abstraction has 36 states and 39 transitions. [2018-06-25 09:00:25,608 INFO ]: Interpolant automaton has 36 states. [2018-06-25 09:00:25,608 INFO ]: Start isEmpty. Operand 36 states and 39 transitions. [2018-06-25 09:00:25,609 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-25 09:00:25,609 INFO ]: Found error trace [2018-06-25 09:00:25,609 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:25,612 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:25,612 INFO ]: Analyzing trace with hash 1919626464, now seen corresponding path program 25 times [2018-06-25 09:00:25,612 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:25,612 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:25,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:25,612 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:25,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:25,624 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:25,828 INFO ]: Checked inductivity of 92 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 09:00:25,887 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:25,887 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:25,894 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:25,949 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:25,951 INFO ]: Computing forward predicates... [2018-06-25 09:00:26,236 INFO ]: Checked inductivity of 92 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 09:00:26,255 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:26,255 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-06-25 09:00:26,256 INFO ]: Interpolant automaton has 28 states [2018-06-25 09:00:26,256 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 09:00:26,256 INFO ]: CoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:00:26,256 INFO ]: Start difference. First operand 36 states and 39 transitions. Second operand 28 states. [2018-06-25 09:00:26,386 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:26,387 INFO ]: Finished difference Result 44 states and 47 transitions. [2018-06-25 09:00:26,387 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:00:26,387 INFO ]: Start accepts. Automaton has 28 states. Word has length 33 [2018-06-25 09:00:26,387 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:26,387 INFO ]: With dead ends: 44 [2018-06-25 09:00:26,387 INFO ]: Without dead ends: 44 [2018-06-25 09:00:26,388 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=390, Invalid=942, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 09:00:26,388 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-25 09:00:26,389 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 35. [2018-06-25 09:00:26,389 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-25 09:00:26,389 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-06-25 09:00:26,389 INFO ]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2018-06-25 09:00:26,389 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:26,389 INFO ]: Abstraction has 35 states and 37 transitions. [2018-06-25 09:00:26,390 INFO ]: Interpolant automaton has 28 states. [2018-06-25 09:00:26,390 INFO ]: Start isEmpty. Operand 35 states and 37 transitions. [2018-06-25 09:00:26,390 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 09:00:26,390 INFO ]: Found error trace [2018-06-25 09:00:26,390 INFO ]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:26,390 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:26,390 INFO ]: Analyzing trace with hash -567592948, now seen corresponding path program 26 times [2018-06-25 09:00:26,390 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:26,390 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:26,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:26,391 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:26,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:26,407 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:26,692 INFO ]: Checked inductivity of 100 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-25 09:00:26,692 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:26,692 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:26,701 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:00:26,740 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:00:26,740 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:26,742 INFO ]: Computing forward predicates... [2018-06-25 09:00:27,119 INFO ]: Checked inductivity of 100 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-25 09:00:27,138 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:27,138 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-06-25 09:00:27,138 INFO ]: Interpolant automaton has 36 states [2018-06-25 09:00:27,138 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-25 09:00:27,139 INFO ]: CoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 09:00:27,139 INFO ]: Start difference. First operand 35 states and 37 transitions. Second operand 36 states. [2018-06-25 09:00:27,518 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:27,518 INFO ]: Finished difference Result 45 states and 48 transitions. [2018-06-25 09:00:27,519 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 09:00:27,519 INFO ]: Start accepts. Automaton has 36 states. Word has length 34 [2018-06-25 09:00:27,519 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:27,519 INFO ]: With dead ends: 45 [2018-06-25 09:00:27,519 INFO ]: Without dead ends: 36 [2018-06-25 09:00:27,520 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=659, Invalid=2203, Unknown=0, NotChecked=0, Total=2862 [2018-06-25 09:00:27,520 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-25 09:00:27,521 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-25 09:00:27,521 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-25 09:00:27,521 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-06-25 09:00:27,521 INFO ]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 34 [2018-06-25 09:00:27,521 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:27,521 INFO ]: Abstraction has 36 states and 38 transitions. [2018-06-25 09:00:27,521 INFO ]: Interpolant automaton has 36 states. [2018-06-25 09:00:27,521 INFO ]: Start isEmpty. Operand 36 states and 38 transitions. [2018-06-25 09:00:27,521 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 09:00:27,521 INFO ]: Found error trace [2018-06-25 09:00:27,521 INFO ]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:27,521 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:27,521 INFO ]: Analyzing trace with hash -343735260, now seen corresponding path program 27 times [2018-06-25 09:00:27,521 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:27,521 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:27,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:27,522 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:27,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:27,537 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:27,968 INFO ]: Checked inductivity of 108 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-25 09:00:27,968 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:27,968 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:27,974 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:00:28,029 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-25 09:00:28,029 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:28,033 INFO ]: Computing forward predicates... [2018-06-25 09:00:28,669 INFO ]: Checked inductivity of 108 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-25 09:00:28,688 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:28,688 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 40 [2018-06-25 09:00:28,688 INFO ]: Interpolant automaton has 40 states [2018-06-25 09:00:28,688 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-25 09:00:28,689 INFO ]: CoverageRelationStatistics Valid=86, Invalid=1474, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:00:28,689 INFO ]: Start difference. First operand 36 states and 38 transitions. Second operand 40 states. [2018-06-25 09:00:29,532 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:29,532 INFO ]: Finished difference Result 59 states and 64 transitions. [2018-06-25 09:00:29,532 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-25 09:00:29,532 INFO ]: Start accepts. Automaton has 40 states. Word has length 35 [2018-06-25 09:00:29,532 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:29,532 INFO ]: With dead ends: 59 [2018-06-25 09:00:29,532 INFO ]: Without dead ends: 59 [2018-06-25 09:00:29,533 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=203, Invalid=3103, Unknown=0, NotChecked=0, Total=3306 [2018-06-25 09:00:29,533 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-25 09:00:29,535 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 38. [2018-06-25 09:00:29,535 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-25 09:00:29,535 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-06-25 09:00:29,535 INFO ]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 35 [2018-06-25 09:00:29,535 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:29,535 INFO ]: Abstraction has 38 states and 41 transitions. [2018-06-25 09:00:29,535 INFO ]: Interpolant automaton has 40 states. [2018-06-25 09:00:29,535 INFO ]: Start isEmpty. Operand 38 states and 41 transitions. [2018-06-25 09:00:29,537 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 09:00:29,537 INFO ]: Found error trace [2018-06-25 09:00:29,537 INFO ]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:29,537 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:29,537 INFO ]: Analyzing trace with hash -1994081524, now seen corresponding path program 28 times [2018-06-25 09:00:29,537 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:29,537 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:29,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:29,538 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:29,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:29,552 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:29,908 INFO ]: Checked inductivity of 117 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-25 09:00:29,908 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:29,908 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:29,914 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:00:29,951 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:00:29,951 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:29,954 INFO ]: Computing forward predicates... [2018-06-25 09:00:30,159 INFO ]: Checked inductivity of 117 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-25 09:00:30,179 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:30,179 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 34 [2018-06-25 09:00:30,179 INFO ]: Interpolant automaton has 34 states [2018-06-25 09:00:30,179 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-25 09:00:30,179 INFO ]: CoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:00:30,179 INFO ]: Start difference. First operand 38 states and 41 transitions. Second operand 34 states. [2018-06-25 09:00:30,362 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:30,362 INFO ]: Finished difference Result 56 states and 60 transitions. [2018-06-25 09:00:30,363 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-25 09:00:30,363 INFO ]: Start accepts. Automaton has 34 states. Word has length 36 [2018-06-25 09:00:30,363 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:30,363 INFO ]: With dead ends: 56 [2018-06-25 09:00:30,363 INFO ]: Without dead ends: 37 [2018-06-25 09:00:30,364 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=470, Invalid=1510, Unknown=0, NotChecked=0, Total=1980 [2018-06-25 09:00:30,364 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-25 09:00:30,365 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-25 09:00:30,365 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-25 09:00:30,365 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-06-25 09:00:30,365 INFO ]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 36 [2018-06-25 09:00:30,365 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:30,365 INFO ]: Abstraction has 37 states and 39 transitions. [2018-06-25 09:00:30,365 INFO ]: Interpolant automaton has 34 states. [2018-06-25 09:00:30,365 INFO ]: Start isEmpty. Operand 37 states and 39 transitions. [2018-06-25 09:00:30,366 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 09:00:30,366 INFO ]: Found error trace [2018-06-25 09:00:30,366 INFO ]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:30,366 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:30,366 INFO ]: Analyzing trace with hash -1006747324, now seen corresponding path program 29 times [2018-06-25 09:00:30,366 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:30,366 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:30,367 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:30,367 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:30,367 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:30,377 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:31,250 INFO ]: Checked inductivity of 117 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-25 09:00:31,250 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:31,250 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:31,255 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:00:31,299 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-25 09:00:31,299 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:31,303 INFO ]: Computing forward predicates... [2018-06-25 09:00:31,453 INFO ]: Checked inductivity of 117 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-25 09:00:31,472 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:31,472 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2018-06-25 09:00:31,472 INFO ]: Interpolant automaton has 31 states [2018-06-25 09:00:31,472 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-25 09:00:31,472 INFO ]: CoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:00:31,472 INFO ]: Start difference. First operand 37 states and 39 transitions. Second operand 31 states. [2018-06-25 09:00:31,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:31,663 INFO ]: Finished difference Result 38 states and 40 transitions. [2018-06-25 09:00:31,664 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-25 09:00:31,664 INFO ]: Start accepts. Automaton has 31 states. Word has length 36 [2018-06-25 09:00:31,664 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:31,664 INFO ]: With dead ends: 38 [2018-06-25 09:00:31,664 INFO ]: Without dead ends: 38 [2018-06-25 09:00:31,664 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-06-25 09:00:31,665 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-25 09:00:31,665 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-25 09:00:31,665 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-25 09:00:31,666 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-06-25 09:00:31,666 INFO ]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 36 [2018-06-25 09:00:31,666 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:31,666 INFO ]: Abstraction has 38 states and 40 transitions. [2018-06-25 09:00:31,666 INFO ]: Interpolant automaton has 31 states. [2018-06-25 09:00:31,666 INFO ]: Start isEmpty. Operand 38 states and 40 transitions. [2018-06-25 09:00:31,666 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 09:00:31,666 INFO ]: Found error trace [2018-06-25 09:00:31,666 INFO ]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:31,666 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:31,666 INFO ]: Analyzing trace with hash -1090867160, now seen corresponding path program 30 times [2018-06-25 09:00:31,666 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:31,666 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:31,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:31,666 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:31,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:31,675 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:31,901 INFO ]: Checked inductivity of 126 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-25 09:00:31,901 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:31,901 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:31,906 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:00:31,950 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-25 09:00:31,950 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:31,952 INFO ]: Computing forward predicates... [2018-06-25 09:00:32,265 INFO ]: Checked inductivity of 126 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-25 09:00:32,284 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:32,284 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-06-25 09:00:32,284 INFO ]: Interpolant automaton has 40 states [2018-06-25 09:00:32,285 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-25 09:00:32,285 INFO ]: CoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:00:32,285 INFO ]: Start difference. First operand 38 states and 40 transitions. Second operand 40 states. [2018-06-25 09:00:32,841 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:32,841 INFO ]: Finished difference Result 49 states and 52 transitions. [2018-06-25 09:00:32,841 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-25 09:00:32,841 INFO ]: Start accepts. Automaton has 40 states. Word has length 37 [2018-06-25 09:00:32,842 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:32,842 INFO ]: With dead ends: 49 [2018-06-25 09:00:32,842 INFO ]: Without dead ends: 39 [2018-06-25 09:00:32,843 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=807, Invalid=2733, Unknown=0, NotChecked=0, Total=3540 [2018-06-25 09:00:32,843 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-25 09:00:32,843 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-25 09:00:32,844 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-25 09:00:32,844 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-06-25 09:00:32,844 INFO ]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 37 [2018-06-25 09:00:32,844 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:32,844 INFO ]: Abstraction has 39 states and 41 transitions. [2018-06-25 09:00:32,844 INFO ]: Interpolant automaton has 40 states. [2018-06-25 09:00:32,844 INFO ]: Start isEmpty. Operand 39 states and 41 transitions. [2018-06-25 09:00:32,844 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-25 09:00:32,844 INFO ]: Found error trace [2018-06-25 09:00:32,844 INFO ]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:32,844 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:32,844 INFO ]: Analyzing trace with hash 1162077312, now seen corresponding path program 31 times [2018-06-25 09:00:32,844 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:32,844 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:32,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:32,845 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:32,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:32,859 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:33,395 INFO ]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-25 09:00:33,395 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:33,395 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:33,401 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:33,446 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:33,451 INFO ]: Computing forward predicates... [2018-06-25 09:00:34,224 INFO ]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-25 09:00:34,243 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:34,243 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2018-06-25 09:00:34,243 INFO ]: Interpolant automaton has 44 states [2018-06-25 09:00:34,243 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-25 09:00:34,244 INFO ]: CoverageRelationStatistics Valid=95, Invalid=1797, Unknown=0, NotChecked=0, Total=1892 [2018-06-25 09:00:34,244 INFO ]: Start difference. First operand 39 states and 41 transitions. Second operand 44 states. [2018-06-25 09:00:35,231 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:35,231 INFO ]: Finished difference Result 64 states and 69 transitions. [2018-06-25 09:00:35,231 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-25 09:00:35,231 INFO ]: Start accepts. Automaton has 44 states. Word has length 38 [2018-06-25 09:00:35,231 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:35,231 INFO ]: With dead ends: 64 [2018-06-25 09:00:35,231 INFO ]: Without dead ends: 64 [2018-06-25 09:00:35,232 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=225, Invalid=3807, Unknown=0, NotChecked=0, Total=4032 [2018-06-25 09:00:35,232 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-25 09:00:35,233 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 41. [2018-06-25 09:00:35,233 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-25 09:00:35,233 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-06-25 09:00:35,233 INFO ]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 38 [2018-06-25 09:00:35,233 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:35,233 INFO ]: Abstraction has 41 states and 44 transitions. [2018-06-25 09:00:35,233 INFO ]: Interpolant automaton has 44 states. [2018-06-25 09:00:35,233 INFO ]: Start isEmpty. Operand 41 states and 44 transitions. [2018-06-25 09:00:35,234 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-25 09:00:35,234 INFO ]: Found error trace [2018-06-25 09:00:35,234 INFO ]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:35,234 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:35,234 INFO ]: Analyzing trace with hash -2011088088, now seen corresponding path program 32 times [2018-06-25 09:00:35,234 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:35,234 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:35,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:35,234 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:35,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:35,245 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:35,581 INFO ]: Checked inductivity of 145 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-25 09:00:35,581 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:35,582 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:35,592 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:00:35,634 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:00:35,635 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:35,637 INFO ]: Computing forward predicates... [2018-06-25 09:00:35,997 INFO ]: Checked inductivity of 145 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-25 09:00:36,016 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:36,053 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 44 [2018-06-25 09:00:36,054 INFO ]: Interpolant automaton has 44 states [2018-06-25 09:00:36,054 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-25 09:00:36,054 INFO ]: CoverageRelationStatistics Valid=256, Invalid=1636, Unknown=0, NotChecked=0, Total=1892 [2018-06-25 09:00:36,054 INFO ]: Start difference. First operand 41 states and 44 transitions. Second operand 44 states. [2018-06-25 09:00:37,338 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:37,338 INFO ]: Finished difference Result 77 states and 83 transitions. [2018-06-25 09:00:37,338 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-06-25 09:00:37,338 INFO ]: Start accepts. Automaton has 44 states. Word has length 39 [2018-06-25 09:00:37,338 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:37,338 INFO ]: With dead ends: 77 [2018-06-25 09:00:37,338 INFO ]: Without dead ends: 55 [2018-06-25 09:00:37,339 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1423, Invalid=4583, Unknown=0, NotChecked=0, Total=6006 [2018-06-25 09:00:37,339 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-25 09:00:37,340 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 42. [2018-06-25 09:00:37,340 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-25 09:00:37,340 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-06-25 09:00:37,340 INFO ]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 39 [2018-06-25 09:00:37,340 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:37,340 INFO ]: Abstraction has 42 states and 45 transitions. [2018-06-25 09:00:37,340 INFO ]: Interpolant automaton has 44 states. [2018-06-25 09:00:37,340 INFO ]: Start isEmpty. Operand 42 states and 45 transitions. [2018-06-25 09:00:37,340 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-25 09:00:37,340 INFO ]: Found error trace [2018-06-25 09:00:37,340 INFO ]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:37,340 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:37,340 INFO ]: Analyzing trace with hash 1924272992, now seen corresponding path program 33 times [2018-06-25 09:00:37,341 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:37,341 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:37,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:37,341 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:37,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:37,351 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:37,615 INFO ]: Checked inductivity of 145 backedges. 46 proven. 54 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-25 09:00:37,615 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:37,615 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:37,620 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:00:37,668 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-25 09:00:37,668 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:37,671 INFO ]: Computing forward predicates... [2018-06-25 09:00:37,903 INFO ]: Checked inductivity of 145 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-25 09:00:37,922 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:37,922 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 35 [2018-06-25 09:00:37,922 INFO ]: Interpolant automaton has 35 states [2018-06-25 09:00:37,922 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-25 09:00:37,922 INFO ]: CoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 09:00:37,922 INFO ]: Start difference. First operand 42 states and 45 transitions. Second operand 35 states. [2018-06-25 09:00:38,623 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:38,624 INFO ]: Finished difference Result 53 states and 56 transitions. [2018-06-25 09:00:38,624 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-25 09:00:38,624 INFO ]: Start accepts. Automaton has 35 states. Word has length 39 [2018-06-25 09:00:38,624 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:38,624 INFO ]: With dead ends: 53 [2018-06-25 09:00:38,624 INFO ]: Without dead ends: 42 [2018-06-25 09:00:38,624 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1278, Invalid=3144, Unknown=0, NotChecked=0, Total=4422 [2018-06-25 09:00:38,624 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-25 09:00:38,625 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-25 09:00:38,625 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-25 09:00:38,626 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-06-25 09:00:38,626 INFO ]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2018-06-25 09:00:38,626 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:38,626 INFO ]: Abstraction has 42 states and 44 transitions. [2018-06-25 09:00:38,626 INFO ]: Interpolant automaton has 35 states. [2018-06-25 09:00:38,626 INFO ]: Start isEmpty. Operand 42 states and 44 transitions. [2018-06-25 09:00:38,626 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-25 09:00:38,626 INFO ]: Found error trace [2018-06-25 09:00:38,626 INFO ]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:38,626 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:38,626 INFO ]: Analyzing trace with hash 164948388, now seen corresponding path program 34 times [2018-06-25 09:00:38,626 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:38,626 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:38,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:38,627 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:38,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:38,644 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:39,205 INFO ]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-25 09:00:39,205 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:39,205 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:39,210 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:00:39,259 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:00:39,259 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:39,263 INFO ]: Computing forward predicates... [2018-06-25 09:00:40,135 INFO ]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-25 09:00:40,155 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:40,155 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-06-25 09:00:40,155 INFO ]: Interpolant automaton has 48 states [2018-06-25 09:00:40,155 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-25 09:00:40,156 INFO ]: CoverageRelationStatistics Valid=104, Invalid=2152, Unknown=0, NotChecked=0, Total=2256 [2018-06-25 09:00:40,156 INFO ]: Start difference. First operand 42 states and 44 transitions. Second operand 48 states. [2018-06-25 09:00:41,364 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:41,364 INFO ]: Finished difference Result 69 states and 74 transitions. [2018-06-25 09:00:41,364 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-25 09:00:41,364 INFO ]: Start accepts. Automaton has 48 states. Word has length 41 [2018-06-25 09:00:41,364 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:41,365 INFO ]: With dead ends: 69 [2018-06-25 09:00:41,365 INFO ]: Without dead ends: 69 [2018-06-25 09:00:41,365 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=247, Invalid=4583, Unknown=0, NotChecked=0, Total=4830 [2018-06-25 09:00:41,366 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-25 09:00:41,367 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 44. [2018-06-25 09:00:41,367 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-25 09:00:41,368 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-06-25 09:00:41,368 INFO ]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 41 [2018-06-25 09:00:41,368 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:41,368 INFO ]: Abstraction has 44 states and 47 transitions. [2018-06-25 09:00:41,368 INFO ]: Interpolant automaton has 48 states. [2018-06-25 09:00:41,368 INFO ]: Start isEmpty. Operand 44 states and 47 transitions. [2018-06-25 09:00:41,368 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-25 09:00:41,368 INFO ]: Found error trace [2018-06-25 09:00:41,368 INFO ]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:41,368 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:41,368 INFO ]: Analyzing trace with hash 1228547212, now seen corresponding path program 35 times [2018-06-25 09:00:41,368 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:41,368 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:41,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:41,370 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:41,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:41,378 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:41,667 INFO ]: Checked inductivity of 176 backedges. 45 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-25 09:00:41,667 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:41,667 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:41,673 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:00:41,727 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-25 09:00:41,727 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:41,731 INFO ]: Computing forward predicates... [2018-06-25 09:00:42,131 INFO ]: Checked inductivity of 176 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-25 09:00:42,150 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:42,150 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 48 [2018-06-25 09:00:42,150 INFO ]: Interpolant automaton has 48 states [2018-06-25 09:00:42,150 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-25 09:00:42,150 INFO ]: CoverageRelationStatistics Valid=303, Invalid=1953, Unknown=0, NotChecked=0, Total=2256 [2018-06-25 09:00:42,150 INFO ]: Start difference. First operand 44 states and 47 transitions. Second operand 48 states. [2018-06-25 09:00:43,356 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:43,356 INFO ]: Finished difference Result 83 states and 89 transitions. [2018-06-25 09:00:43,356 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-06-25 09:00:43,356 INFO ]: Start accepts. Automaton has 48 states. Word has length 42 [2018-06-25 09:00:43,357 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:43,357 INFO ]: With dead ends: 83 [2018-06-25 09:00:43,357 INFO ]: Without dead ends: 59 [2018-06-25 09:00:43,358 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1684, Invalid=5456, Unknown=0, NotChecked=0, Total=7140 [2018-06-25 09:00:43,358 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-25 09:00:43,359 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 45. [2018-06-25 09:00:43,359 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-25 09:00:43,360 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-06-25 09:00:43,360 INFO ]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 42 [2018-06-25 09:00:43,360 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:43,360 INFO ]: Abstraction has 45 states and 48 transitions. [2018-06-25 09:00:43,360 INFO ]: Interpolant automaton has 48 states. [2018-06-25 09:00:43,360 INFO ]: Start isEmpty. Operand 45 states and 48 transitions. [2018-06-25 09:00:43,360 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-25 09:00:43,360 INFO ]: Found error trace [2018-06-25 09:00:43,360 INFO ]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:43,360 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:43,360 INFO ]: Analyzing trace with hash -755642684, now seen corresponding path program 36 times [2018-06-25 09:00:43,360 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:43,360 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:43,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:43,361 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:43,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:43,373 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:43,770 INFO ]: Checked inductivity of 176 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-25 09:00:43,770 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:43,770 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:43,783 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:00:43,836 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-25 09:00:43,836 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:43,839 INFO ]: Computing forward predicates... [2018-06-25 09:00:44,061 INFO ]: Checked inductivity of 176 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-25 09:00:44,080 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:44,080 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 38 [2018-06-25 09:00:44,080 INFO ]: Interpolant automaton has 38 states [2018-06-25 09:00:44,080 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-25 09:00:44,080 INFO ]: CoverageRelationStatistics Valid=239, Invalid=1167, Unknown=0, NotChecked=0, Total=1406 [2018-06-25 09:00:44,080 INFO ]: Start difference. First operand 45 states and 48 transitions. Second operand 38 states. [2018-06-25 09:00:44,769 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:44,769 INFO ]: Finished difference Result 57 states and 60 transitions. [2018-06-25 09:00:44,769 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-25 09:00:44,769 INFO ]: Start accepts. Automaton has 38 states. Word has length 42 [2018-06-25 09:00:44,770 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:44,770 INFO ]: With dead ends: 57 [2018-06-25 09:00:44,770 INFO ]: Without dead ends: 45 [2018-06-25 09:00:44,770 INFO ]: 0 DeclaredPredicates, 111 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1514, Invalid=3742, Unknown=0, NotChecked=0, Total=5256 [2018-06-25 09:00:44,770 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-25 09:00:44,772 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-25 09:00:44,772 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-25 09:00:44,772 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-06-25 09:00:44,772 INFO ]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 42 [2018-06-25 09:00:44,772 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:44,772 INFO ]: Abstraction has 45 states and 47 transitions. [2018-06-25 09:00:44,772 INFO ]: Interpolant automaton has 38 states. [2018-06-25 09:00:44,772 INFO ]: Start isEmpty. Operand 45 states and 47 transitions. [2018-06-25 09:00:44,773 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 09:00:44,773 INFO ]: Found error trace [2018-06-25 09:00:44,773 INFO ]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:44,773 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:44,773 INFO ]: Analyzing trace with hash -440970496, now seen corresponding path program 37 times [2018-06-25 09:00:44,773 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:44,773 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:44,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:44,773 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:44,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:44,793 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:45,766 INFO ]: Checked inductivity of 198 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-25 09:00:45,766 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:45,766 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:45,772 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:45,826 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:45,832 INFO ]: Computing forward predicates... [2018-06-25 09:00:46,904 INFO ]: Checked inductivity of 198 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-25 09:00:46,923 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:46,923 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 52 [2018-06-25 09:00:46,923 INFO ]: Interpolant automaton has 52 states [2018-06-25 09:00:46,923 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-25 09:00:46,923 INFO ]: CoverageRelationStatistics Valid=113, Invalid=2539, Unknown=0, NotChecked=0, Total=2652 [2018-06-25 09:00:46,923 INFO ]: Start difference. First operand 45 states and 47 transitions. Second operand 52 states. [2018-06-25 09:00:48,288 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:48,288 INFO ]: Finished difference Result 74 states and 79 transitions. [2018-06-25 09:00:48,289 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 09:00:48,289 INFO ]: Start accepts. Automaton has 52 states. Word has length 44 [2018-06-25 09:00:48,289 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:48,289 INFO ]: With dead ends: 74 [2018-06-25 09:00:48,289 INFO ]: Without dead ends: 74 [2018-06-25 09:00:48,290 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=269, Invalid=5431, Unknown=0, NotChecked=0, Total=5700 [2018-06-25 09:00:48,290 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-25 09:00:48,292 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 47. [2018-06-25 09:00:48,292 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-25 09:00:48,292 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-06-25 09:00:48,292 INFO ]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 44 [2018-06-25 09:00:48,292 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:48,292 INFO ]: Abstraction has 47 states and 50 transitions. [2018-06-25 09:00:48,292 INFO ]: Interpolant automaton has 52 states. [2018-06-25 09:00:48,292 INFO ]: Start isEmpty. Operand 47 states and 50 transitions. [2018-06-25 09:00:48,293 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-25 09:00:48,293 INFO ]: Found error trace [2018-06-25 09:00:48,294 INFO ]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:48,294 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:48,295 INFO ]: Analyzing trace with hash 1732566440, now seen corresponding path program 38 times [2018-06-25 09:00:48,295 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:48,295 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:48,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:48,295 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:48,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:48,308 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:49,062 INFO ]: Checked inductivity of 210 backedges. 55 proven. 89 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-25 09:00:49,062 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:49,062 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-25 09:00:49,067 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:00:49,119 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:00:49,119 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:49,123 INFO ]: Computing forward predicates... [2018-06-25 09:00:49,584 INFO ]: Checked inductivity of 210 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-25 09:00:49,603 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:49,603 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 52 [2018-06-25 09:00:49,603 INFO ]: Interpolant automaton has 52 states [2018-06-25 09:00:49,603 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-25 09:00:49,603 INFO ]: CoverageRelationStatistics Valid=354, Invalid=2298, Unknown=0, NotChecked=0, Total=2652 [2018-06-25 09:00:49,604 INFO ]: Start difference. First operand 47 states and 50 transitions. Second operand 52 states. [2018-06-25 09:00:51,136 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:51,136 INFO ]: Finished difference Result 89 states and 95 transitions. [2018-06-25 09:00:51,136 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-06-25 09:00:51,137 INFO ]: Start accepts. Automaton has 52 states. Word has length 45 [2018-06-25 09:00:51,137 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:51,137 INFO ]: With dead ends: 89 [2018-06-25 09:00:51,137 INFO ]: Without dead ends: 63 [2018-06-25 09:00:51,138 INFO ]: 0 DeclaredPredicates, 123 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1967, Invalid=6405, Unknown=0, NotChecked=0, Total=8372 [2018-06-25 09:00:51,138 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-25 09:00:51,139 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 48. [2018-06-25 09:00:51,139 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-25 09:00:51,140 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-06-25 09:00:51,140 INFO ]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 45 [2018-06-25 09:00:51,140 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:51,140 INFO ]: Abstraction has 48 states and 51 transitions. [2018-06-25 09:00:51,140 INFO ]: Interpolant automaton has 52 states. [2018-06-25 09:00:51,140 INFO ]: Start isEmpty. Operand 48 states and 51 transitions. [2018-06-25 09:00:51,141 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-25 09:00:51,141 INFO ]: Found error trace [2018-06-25 09:00:51,141 INFO ]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:51,141 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:51,141 INFO ]: Analyzing trace with hash 1891555808, now seen corresponding path program 39 times [2018-06-25 09:00:51,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:51,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:51,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:51,141 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:51,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:51,155 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:51,498 INFO ]: Checked inductivity of 210 backedges. 67 proven. 77 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-25 09:00:51,498 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:51,498 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-25 09:00:51,503 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:00:51,560 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-25 09:00:51,560 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:51,565 INFO ]: Computing forward predicates... [2018-06-25 09:00:51,831 INFO ]: Checked inductivity of 210 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-25 09:00:51,850 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:51,850 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 41 [2018-06-25 09:00:51,850 INFO ]: Interpolant automaton has 41 states [2018-06-25 09:00:51,851 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-25 09:00:51,851 INFO ]: CoverageRelationStatistics Valid=278, Invalid=1362, Unknown=0, NotChecked=0, Total=1640 [2018-06-25 09:00:51,851 INFO ]: Start difference. First operand 48 states and 51 transitions. Second operand 41 states. [2018-06-25 09:00:52,719 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:52,719 INFO ]: Finished difference Result 61 states and 64 transitions. [2018-06-25 09:00:52,719 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-25 09:00:52,719 INFO ]: Start accepts. Automaton has 41 states. Word has length 45 [2018-06-25 09:00:52,719 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:52,719 INFO ]: With dead ends: 61 [2018-06-25 09:00:52,719 INFO ]: Without dead ends: 48 [2018-06-25 09:00:52,720 INFO ]: 0 DeclaredPredicates, 120 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=4392, Unknown=0, NotChecked=0, Total=6162 [2018-06-25 09:00:52,720 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-25 09:00:52,721 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-25 09:00:52,721 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-25 09:00:52,721 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-06-25 09:00:52,721 INFO ]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 45 [2018-06-25 09:00:52,721 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:52,721 INFO ]: Abstraction has 48 states and 50 transitions. [2018-06-25 09:00:52,721 INFO ]: Interpolant automaton has 41 states. [2018-06-25 09:00:52,721 INFO ]: Start isEmpty. Operand 48 states and 50 transitions. [2018-06-25 09:00:52,721 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-25 09:00:52,721 INFO ]: Found error trace [2018-06-25 09:00:52,721 INFO ]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:52,721 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:52,722 INFO ]: Analyzing trace with hash 1808330532, now seen corresponding path program 40 times [2018-06-25 09:00:52,722 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:52,722 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:52,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:52,722 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:52,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:52,745 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:53,425 INFO ]: Checked inductivity of 234 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-25 09:00:53,425 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:53,425 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-25 09:00:53,431 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:00:53,490 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:00:53,490 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:53,496 INFO ]: Computing forward predicates... [2018-06-25 09:00:54,777 INFO ]: Checked inductivity of 234 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-25 09:00:54,797 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:54,797 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 56 [2018-06-25 09:00:54,797 INFO ]: Interpolant automaton has 56 states [2018-06-25 09:00:54,797 INFO ]: Constructing interpolant automaton starting with 56 interpolants. [2018-06-25 09:00:54,797 INFO ]: CoverageRelationStatistics Valid=122, Invalid=2958, Unknown=0, NotChecked=0, Total=3080 [2018-06-25 09:00:54,797 INFO ]: Start difference. First operand 48 states and 50 transitions. Second operand 56 states. [2018-06-25 09:00:56,260 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:56,260 INFO ]: Finished difference Result 79 states and 84 transitions. [2018-06-25 09:00:56,301 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-25 09:00:56,301 INFO ]: Start accepts. Automaton has 56 states. Word has length 47 [2018-06-25 09:00:56,301 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:56,301 INFO ]: With dead ends: 79 [2018-06-25 09:00:56,301 INFO ]: Without dead ends: 79 [2018-06-25 09:00:56,302 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=291, Invalid=6351, Unknown=0, NotChecked=0, Total=6642 [2018-06-25 09:00:56,302 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-25 09:00:56,303 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 50. [2018-06-25 09:00:56,304 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-25 09:00:56,304 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-06-25 09:00:56,304 INFO ]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 47 [2018-06-25 09:00:56,304 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:56,304 INFO ]: Abstraction has 50 states and 53 transitions. [2018-06-25 09:00:56,304 INFO ]: Interpolant automaton has 56 states. [2018-06-25 09:00:56,304 INFO ]: Start isEmpty. Operand 50 states and 53 transitions. [2018-06-25 09:00:56,304 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-25 09:00:56,304 INFO ]: Found error trace [2018-06-25 09:00:56,304 INFO ]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:56,304 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:56,305 INFO ]: Analyzing trace with hash -641356276, now seen corresponding path program 41 times [2018-06-25 09:00:56,305 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:56,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:56,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:56,305 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:56,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:56,319 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:57,174 INFO ]: Checked inductivity of 247 backedges. 66 proven. 103 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-25 09:00:57,174 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:57,174 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-25 09:00:57,181 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:00:57,246 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-25 09:00:57,246 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:57,252 INFO ]: Computing forward predicates... [2018-06-25 09:00:57,618 INFO ]: Checked inductivity of 247 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-25 09:00:57,638 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:57,638 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 46 [2018-06-25 09:00:57,638 INFO ]: Interpolant automaton has 46 states [2018-06-25 09:00:57,638 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-25 09:00:57,638 INFO ]: CoverageRelationStatistics Valid=443, Invalid=1627, Unknown=0, NotChecked=0, Total=2070 [2018-06-25 09:00:57,638 INFO ]: Start difference. First operand 50 states and 53 transitions. Second operand 46 states. [2018-06-25 09:00:57,930 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:57,930 INFO ]: Finished difference Result 76 states and 80 transitions. [2018-06-25 09:00:57,930 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-25 09:00:57,930 INFO ]: Start accepts. Automaton has 46 states. Word has length 48 [2018-06-25 09:00:57,931 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:57,931 INFO ]: With dead ends: 76 [2018-06-25 09:00:57,931 INFO ]: Without dead ends: 49 [2018-06-25 09:00:57,931 INFO ]: 0 DeclaredPredicates, 104 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=848, Invalid=2812, Unknown=0, NotChecked=0, Total=3660 [2018-06-25 09:00:57,931 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-25 09:00:57,932 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-06-25 09:00:57,932 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-25 09:00:57,932 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-06-25 09:00:57,932 INFO ]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 48 [2018-06-25 09:00:57,932 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:57,932 INFO ]: Abstraction has 49 states and 51 transitions. [2018-06-25 09:00:57,932 INFO ]: Interpolant automaton has 46 states. [2018-06-25 09:00:57,933 INFO ]: Start isEmpty. Operand 49 states and 51 transitions. [2018-06-25 09:00:57,933 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-25 09:00:57,933 INFO ]: Found error trace [2018-06-25 09:00:57,933 INFO ]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:57,933 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:57,933 INFO ]: Analyzing trace with hash 1823571012, now seen corresponding path program 42 times [2018-06-25 09:00:57,933 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:57,933 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:57,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:57,934 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:57,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:57,946 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-25 09:00:57,999 WARN ]: Removed 1 from assertion stack [2018-06-25 09:00:58,000 WARN ]: Verification canceled [2018-06-25 09:00:58,004 WARN ]: Timeout [2018-06-25 09:00:58,004 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:00:58 BoogieIcfgContainer [2018-06-25 09:00:58,004 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:00:58,005 INFO ]: Toolchain (without parser) took 59811.06 ms. Allocated memory was 308.3 MB in the beginning and 648.5 MB in the end (delta: 340.3 MB). Free memory was 264.6 MB in the beginning and 257.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 347.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:00:58,006 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:00:58,006 INFO ]: ChcToBoogie took 50.81 ms. Allocated memory is still 308.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:00:58,006 INFO ]: Boogie Preprocessor took 36.67 ms. Allocated memory is still 308.3 MB. Free memory is still 260.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:00:58,006 INFO ]: RCFGBuilder took 311.78 ms. Allocated memory is still 308.3 MB. Free memory was 260.7 MB in the beginning and 250.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:00:58,008 INFO ]: TraceAbstraction took 59398.62 ms. Allocated memory was 308.3 MB in the beginning and 648.5 MB in the end (delta: 340.3 MB). Free memory was 250.6 MB in the beginning and 257.9 MB in the end (delta: -7.3 MB). Peak memory consumption was 333.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:00:58,010 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 50.81 ms. Allocated memory is still 308.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 36.67 ms. Allocated memory is still 308.3 MB. Free memory is still 260.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 311.78 ms. Allocated memory is still 308.3 MB. Free memory was 260.7 MB in the beginning and 250.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59398.62 ms. Allocated memory was 308.3 MB in the beginning and 648.5 MB in the end (delta: 340.3 MB). Free memory was 250.6 MB in the beginning and 257.9 MB in the end (delta: -7.3 MB). Peak memory consumption was 333.0 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 49 with TraceHistMax 13, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. TIMEOUT Result, 59.3s OverallTime, 46 OverallIterations, 13 TraceHistogramMax, 25.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 473 SDtfs, 1758 SDslu, 7007 SDs, 0 SdLazy, 11597 SolverSat, 2531 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2908 GetRequests, 1049 SyntacticMatches, 0 SemanticMatches, 1859 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16960 ImplicationChecksByTransitivity, 44.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=44, 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, 45 MinimizatonAttempts, 336 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 29.8s InterpolantComputationTime, 2526 NumberOfCodeBlocks, 2526 NumberOfCodeBlocksAsserted, 169 NumberOfCheckSat, 2439 ConstructedInterpolants, 88 QuantifiedInterpolants, 428712 SizeOfPredicates, 284 NumberOfNonLiveVariables, 13903 ConjunctsInSsa, 3267 ConjunctsInUnsatCore, 87 InterpolantComputations, 4 PerfectInterpolantSequences, 3917/7125 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/square_twice_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-00-58-021.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-00-58-021.csv Completed graceful shutdown