java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe_weaved.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:15:51,014 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:15:51,016 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:15:51,027 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:15:51,028 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:15:51,028 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:15:51,032 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:15:51,034 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:15:51,037 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:15:51,038 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:15:51,038 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:15:51,039 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:15:51,040 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:15:51,043 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:15:51,044 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:15:51,044 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:15:51,057 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:15:51,059 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:15:51,060 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:15:51,061 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:15:51,062 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:15:51,065 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:15:51,065 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:15:51,065 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:15:51,070 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:15:51,071 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:15:51,071 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:15:51,072 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:15:51,078 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:15:51,078 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:15:51,079 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:15:51,079 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:15:51,080 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:15:51,080 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:15:51,081 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:15:51,081 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:15:51,108 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:15:51,109 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:15:51,109 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:15:51,109 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:15:51,110 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:15:51,110 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:15:51,111 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:15:51,111 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:15:51,111 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:15:51,111 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:15:51,111 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:15:51,111 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:15:51,112 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:15:51,112 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:15:51,112 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:15:51,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:15:51,112 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:15:51,114 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:15:51,114 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:15:51,166 INFO ]: Repository-Root is: /tmp [2018-06-22 01:15:51,179 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:15:51,182 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:15:51,183 INFO ]: Initializing SmtParser... [2018-06-22 01:15:51,184 INFO ]: SmtParser initialized [2018-06-22 01:15:51,184 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe_weaved.c-1.smt2 [2018-06-22 01:15:51,185 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:15:51,274 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe_weaved.c-1.smt2 unknown [2018-06-22 01:15:51,464 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe_weaved.c-1.smt2 [2018-06-22 01:15:51,470 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:15:51,478 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:15:51,478 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:15:51,478 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:15:51,479 INFO ]: ChcToBoogie initialized [2018-06-22 01:15:51,482 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:15:51" (1/1) ... [2018-06-22 01:15:51,537 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:51 Unit [2018-06-22 01:15:51,537 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:15:51,538 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:15:51,538 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:15:51,538 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:15:51,559 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:51" (1/1) ... [2018-06-22 01:15:51,559 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:51" (1/1) ... [2018-06-22 01:15:51,565 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:51" (1/1) ... [2018-06-22 01:15:51,565 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:51" (1/1) ... [2018-06-22 01:15:51,568 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:51" (1/1) ... [2018-06-22 01:15:51,570 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:51" (1/1) ... [2018-06-22 01:15:51,571 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:51" (1/1) ... [2018-06-22 01:15:51,574 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:15:51,574 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:15:51,574 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:15:51,574 INFO ]: RCFGBuilder initialized [2018-06-22 01:15:51,575 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:51" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:15:51,593 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:15:51,593 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:15:51,593 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:15:51,593 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:15:51,593 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:15:51,593 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:15:51,809 INFO ]: Using library mode [2018-06-22 01:15:51,810 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:15:51 BoogieIcfgContainer [2018-06-22 01:15:51,810 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:15:51,811 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:15:51,811 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:15:51,814 INFO ]: TraceAbstraction initialized [2018-06-22 01:15:51,815 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:15:51" (1/3) ... [2018-06-22 01:15:51,816 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323b3cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:15:51, skipping insertion in model container [2018-06-22 01:15:51,816 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:51" (2/3) ... [2018-06-22 01:15:51,816 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323b3cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:15:51, skipping insertion in model container [2018-06-22 01:15:51,816 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:15:51" (3/3) ... [2018-06-22 01:15:51,818 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:15:51,827 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:15:51,837 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:15:51,875 INFO ]: Using default assertion order modulation [2018-06-22 01:15:51,875 INFO ]: Interprodecural is true [2018-06-22 01:15:51,875 INFO ]: Hoare is false [2018-06-22 01:15:51,875 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:15:51,876 INFO ]: Backedges is TWOTRACK [2018-06-22 01:15:51,876 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:15:51,879 INFO ]: Difference is false [2018-06-22 01:15:51,879 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:15:51,879 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:15:51,895 INFO ]: Start isEmpty. Operand 14 states. [2018-06-22 01:15:51,903 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:15:51,903 INFO ]: Found error trace [2018-06-22 01:15:51,904 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:51,904 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:51,908 INFO ]: Analyzing trace with hash 46595302, now seen corresponding path program 1 times [2018-06-22 01:15:51,910 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:51,910 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:51,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:51,941 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:51,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:51,982 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:52,125 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:52,127 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:15:52,127 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:15:52,128 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:15:52,138 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:15:52,139 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:15:52,141 INFO ]: Start difference. First operand 14 states. Second operand 5 states. [2018-06-22 01:15:52,258 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:52,258 INFO ]: Finished difference Result 19 states and 24 transitions. [2018-06-22 01:15:52,258 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:15:52,259 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-22 01:15:52,259 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:52,267 INFO ]: With dead ends: 19 [2018-06-22 01:15:52,267 INFO ]: Without dead ends: 19 [2018-06-22 01:15:52,269 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 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-22 01:15:52,286 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:15:52,303 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-22 01:15:52,304 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:15:52,304 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-06-22 01:15:52,308 INFO ]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 11 [2018-06-22 01:15:52,309 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:52,309 INFO ]: Abstraction has 14 states and 17 transitions. [2018-06-22 01:15:52,309 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:15:52,309 INFO ]: Start isEmpty. Operand 14 states and 17 transitions. [2018-06-22 01:15:52,309 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:15:52,309 INFO ]: Found error trace [2018-06-22 01:15:52,309 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:52,309 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:52,309 INFO ]: Analyzing trace with hash -1251009968, now seen corresponding path program 1 times [2018-06-22 01:15:52,309 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:52,310 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:52,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:52,310 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:52,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:52,332 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:52,523 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:52,524 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:52,524 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:52,530 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:52,565 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:52,574 INFO ]: Computing forward predicates... [2018-06-22 01:15:52,856 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:52,879 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:15:52,879 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2018-06-22 01:15:52,879 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:15:52,880 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:15:52,880 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:15:52,880 INFO ]: Start difference. First operand 14 states and 17 transitions. Second operand 9 states. [2018-06-22 01:15:53,085 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:53,085 INFO ]: Finished difference Result 16 states and 20 transitions. [2018-06-22 01:15:53,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:15:53,085 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-22 01:15:53,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:53,086 INFO ]: With dead ends: 16 [2018-06-22 01:15:53,086 INFO ]: Without dead ends: 13 [2018-06-22 01:15:53,087 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:15:53,087 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:15:53,088 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 01:15:53,088 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:15:53,091 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-06-22 01:15:53,091 INFO ]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 12 [2018-06-22 01:15:53,091 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:53,091 INFO ]: Abstraction has 13 states and 15 transitions. [2018-06-22 01:15:53,091 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:15:53,091 INFO ]: Start isEmpty. Operand 13 states and 15 transitions. [2018-06-22 01:15:53,092 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:15:53,092 INFO ]: Found error trace [2018-06-22 01:15:53,092 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:53,092 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:53,092 INFO ]: Analyzing trace with hash -570451450, now seen corresponding path program 1 times [2018-06-22 01:15:53,092 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:53,092 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:53,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:53,093 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:53,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:53,104 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:53,167 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:53,167 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:15:53,167 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:15:53,167 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:15:53,167 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:15:53,167 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:15:53,167 INFO ]: Start difference. First operand 13 states and 15 transitions. Second operand 5 states. [2018-06-22 01:15:53,284 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:53,285 INFO ]: Finished difference Result 14 states and 16 transitions. [2018-06-22 01:15:53,285 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:15:53,285 INFO ]: Start accepts. Automaton has 5 states. Word has length 12 [2018-06-22 01:15:53,285 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:53,285 INFO ]: With dead ends: 14 [2018-06-22 01:15:53,285 INFO ]: Without dead ends: 14 [2018-06-22 01:15:53,286 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 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-22 01:15:53,286 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:15:53,288 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 01:15:53,288 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:15:53,288 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-22 01:15:53,288 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2018-06-22 01:15:53,288 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:53,288 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-22 01:15:53,288 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:15:53,288 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-22 01:15:53,289 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:15:53,289 INFO ]: Found error trace [2018-06-22 01:15:53,289 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:53,289 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:53,289 INFO ]: Analyzing trace with hash -450596954, now seen corresponding path program 1 times [2018-06-22 01:15:53,289 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:53,289 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:53,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:53,290 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:53,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:53,302 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:53,419 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:15:53,419 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:53,419 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:53,445 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:53,481 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:53,483 INFO ]: Computing forward predicates... [2018-06-22 01:15:53,585 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:15:53,620 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:15:53,621 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-06-22 01:15:53,621 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:15:53,621 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:15:53,621 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:15:53,621 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2018-06-22 01:15:53,825 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-22 01:15:53,965 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:53,966 INFO ]: Finished difference Result 17 states and 20 transitions. [2018-06-22 01:15:53,966 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:15:53,966 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 01:15:53,966 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:53,967 INFO ]: With dead ends: 17 [2018-06-22 01:15:53,967 INFO ]: Without dead ends: 15 [2018-06-22 01:15:53,967 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:15:53,967 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:15:53,968 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 01:15:53,968 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:15:53,968 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-06-22 01:15:53,968 INFO ]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13 [2018-06-22 01:15:53,968 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:53,969 INFO ]: Abstraction has 15 states and 17 transitions. [2018-06-22 01:15:53,969 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:15:53,969 INFO ]: Start isEmpty. Operand 15 states and 17 transitions. [2018-06-22 01:15:53,969 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:15:53,969 INFO ]: Found error trace [2018-06-22 01:15:53,969 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:53,969 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:53,969 INFO ]: Analyzing trace with hash -349516356, now seen corresponding path program 1 times [2018-06-22 01:15:53,969 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:53,969 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:53,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:53,970 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:53,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:53,989 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:54,142 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:15:54,143 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:54,143 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:54,152 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:54,186 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:54,189 INFO ]: Computing forward predicates... [2018-06-22 01:15:54,330 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:15:54,350 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:54,350 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-06-22 01:15:54,350 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:15:54,351 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:15:54,351 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:15:54,351 INFO ]: Start difference. First operand 15 states and 17 transitions. Second operand 12 states. [2018-06-22 01:15:54,555 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:54,555 INFO ]: Finished difference Result 24 states and 29 transitions. [2018-06-22 01:15:54,556 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:15:54,556 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-22 01:15:54,556 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:54,556 INFO ]: With dead ends: 24 [2018-06-22 01:15:54,556 INFO ]: Without dead ends: 24 [2018-06-22 01:15:54,557 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:15:54,557 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:15:54,559 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-06-22 01:15:54,559 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:15:54,559 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-06-22 01:15:54,559 INFO ]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2018-06-22 01:15:54,559 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:54,559 INFO ]: Abstraction has 17 states and 20 transitions. [2018-06-22 01:15:54,559 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:15:54,559 INFO ]: Start isEmpty. Operand 17 states and 20 transitions. [2018-06-22 01:15:54,561 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:15:54,561 INFO ]: Found error trace [2018-06-22 01:15:54,561 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:54,561 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:54,562 INFO ]: Analyzing trace with hash -1510985114, now seen corresponding path program 2 times [2018-06-22 01:15:54,562 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:54,562 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:54,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:54,562 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:54,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:54,573 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:54,690 INFO ]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:15:54,690 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:54,690 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:54,703 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:15:54,732 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:15:54,732 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:54,734 INFO ]: Computing forward predicates... [2018-06-22 01:15:54,872 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:15:54,892 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:54,892 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-22 01:15:54,892 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:15:54,892 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:15:54,892 INFO ]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:15:54,892 INFO ]: Start difference. First operand 17 states and 20 transitions. Second operand 12 states. [2018-06-22 01:15:55,121 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:55,121 INFO ]: Finished difference Result 28 states and 34 transitions. [2018-06-22 01:15:55,121 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:15:55,121 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-22 01:15:55,122 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:55,122 INFO ]: With dead ends: 28 [2018-06-22 01:15:55,122 INFO ]: Without dead ends: 23 [2018-06-22 01:15:55,123 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:15:55,123 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:15:55,124 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-06-22 01:15:55,124 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:15:55,125 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-06-22 01:15:55,125 INFO ]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2018-06-22 01:15:55,125 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:55,125 INFO ]: Abstraction has 18 states and 21 transitions. [2018-06-22 01:15:55,125 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:15:55,125 INFO ]: Start isEmpty. Operand 18 states and 21 transitions. [2018-06-22 01:15:55,126 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:15:55,126 INFO ]: Found error trace [2018-06-22 01:15:55,126 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:55,126 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:55,126 INFO ]: Analyzing trace with hash -329278308, now seen corresponding path program 3 times [2018-06-22 01:15:55,126 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:55,126 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:55,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:55,127 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:55,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:55,137 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:55,276 INFO ]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:15:55,276 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:55,276 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:55,285 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:15:55,306 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 01:15:55,306 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:55,308 INFO ]: Computing forward predicates... [2018-06-22 01:15:55,356 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:15:55,378 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:55,378 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-22 01:15:55,378 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:15:55,378 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:15:55,378 INFO ]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:15:55,378 INFO ]: Start difference. First operand 18 states and 21 transitions. Second operand 11 states. [2018-06-22 01:15:55,543 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:55,544 INFO ]: Finished difference Result 21 states and 24 transitions. [2018-06-22 01:15:55,545 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:15:55,545 INFO ]: Start accepts. Automaton has 11 states. Word has length 15 [2018-06-22 01:15:55,545 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:55,545 INFO ]: With dead ends: 21 [2018-06-22 01:15:55,545 INFO ]: Without dead ends: 18 [2018-06-22 01:15:55,546 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:15:55,546 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:15:55,547 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-22 01:15:55,547 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:15:55,548 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-06-22 01:15:55,548 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-06-22 01:15:55,548 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:55,548 INFO ]: Abstraction has 18 states and 20 transitions. [2018-06-22 01:15:55,548 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:15:55,548 INFO ]: Start isEmpty. Operand 18 states and 20 transitions. [2018-06-22 01:15:55,548 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:15:55,548 INFO ]: Found error trace [2018-06-22 01:15:55,548 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:55,548 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:55,548 INFO ]: Analyzing trace with hash -1568441818, now seen corresponding path program 4 times [2018-06-22 01:15:55,548 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:55,548 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:55,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:55,549 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:55,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:55,564 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:55,772 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:15:55,772 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:55,772 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) [2018-06-22 01:15:55,787 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:55,810 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:15:55,810 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:55,813 INFO ]: Computing forward predicates... [2018-06-22 01:15:55,947 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:15:55,978 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:55,979 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-06-22 01:15:55,979 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:15:55,979 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:15:55,979 INFO ]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:15:55,979 INFO ]: Start difference. First operand 18 states and 20 transitions. Second operand 16 states. [2018-06-22 01:15:56,470 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:56,470 INFO ]: Finished difference Result 29 states and 34 transitions. [2018-06-22 01:15:56,471 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:15:56,471 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-22 01:15:56,471 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:56,471 INFO ]: With dead ends: 29 [2018-06-22 01:15:56,471 INFO ]: Without dead ends: 29 [2018-06-22 01:15:56,472 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:15:56,472 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:15:56,474 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-06-22 01:15:56,474 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:15:56,474 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-06-22 01:15:56,474 INFO ]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2018-06-22 01:15:56,474 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:56,474 INFO ]: Abstraction has 20 states and 23 transitions. [2018-06-22 01:15:56,474 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:15:56,474 INFO ]: Start isEmpty. Operand 20 states and 23 transitions. [2018-06-22 01:15:56,474 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:15:56,474 INFO ]: Found error trace [2018-06-22 01:15:56,475 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:56,475 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:56,475 INFO ]: Analyzing trace with hash -1701049712, now seen corresponding path program 5 times [2018-06-22 01:15:56,475 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:56,475 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:56,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:56,475 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:56,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:56,493 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:56,854 INFO ]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:15:56,854 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:56,905 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:56,913 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:15:56,951 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 01:15:56,951 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:56,954 INFO ]: Computing forward predicates... [2018-06-22 01:15:57,175 INFO ]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:15:57,204 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:57,204 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 01:15:57,204 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:15:57,204 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:15:57,204 INFO ]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:15:57,204 INFO ]: Start difference. First operand 20 states and 23 transitions. Second operand 16 states. [2018-06-22 01:15:57,504 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:57,504 INFO ]: Finished difference Result 34 states and 40 transitions. [2018-06-22 01:15:57,504 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:15:57,504 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-22 01:15:57,504 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:57,504 INFO ]: With dead ends: 34 [2018-06-22 01:15:57,504 INFO ]: Without dead ends: 27 [2018-06-22 01:15:57,505 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:15:57,505 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:15:57,507 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-06-22 01:15:57,507 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:15:57,507 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-06-22 01:15:57,508 INFO ]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 18 [2018-06-22 01:15:57,508 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:57,508 INFO ]: Abstraction has 21 states and 24 transitions. [2018-06-22 01:15:57,508 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:15:57,508 INFO ]: Start isEmpty. Operand 21 states and 24 transitions. [2018-06-22 01:15:57,508 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:15:57,508 INFO ]: Found error trace [2018-06-22 01:15:57,508 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:57,508 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:57,508 INFO ]: Analyzing trace with hash 47824710, now seen corresponding path program 6 times [2018-06-22 01:15:57,508 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:57,508 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:57,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:57,509 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:57,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:57,519 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:57,597 INFO ]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:15:57,597 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:57,597 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:57,605 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:15:57,627 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-22 01:15:57,627 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:57,629 INFO ]: Computing forward predicates... [2018-06-22 01:15:57,697 INFO ]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:15:57,717 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:57,717 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-06-22 01:15:57,718 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:15:57,718 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:15:57,718 INFO ]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:15:57,718 INFO ]: Start difference. First operand 21 states and 24 transitions. Second operand 14 states. [2018-06-22 01:15:57,866 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:57,866 INFO ]: Finished difference Result 25 states and 28 transitions. [2018-06-22 01:15:57,867 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:15:57,867 INFO ]: Start accepts. Automaton has 14 states. Word has length 18 [2018-06-22 01:15:57,867 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:57,867 INFO ]: With dead ends: 25 [2018-06-22 01:15:57,868 INFO ]: Without dead ends: 21 [2018-06-22 01:15:57,868 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:15:57,868 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:15:57,869 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 01:15:57,869 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:15:57,870 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-06-22 01:15:57,870 INFO ]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 18 [2018-06-22 01:15:57,870 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:57,870 INFO ]: Abstraction has 21 states and 23 transitions. [2018-06-22 01:15:57,870 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:15:57,870 INFO ]: Start isEmpty. Operand 21 states and 23 transitions. [2018-06-22 01:15:57,870 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:15:57,870 INFO ]: Found error trace [2018-06-22 01:15:57,870 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:57,871 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:57,871 INFO ]: Analyzing trace with hash 1609534844, now seen corresponding path program 7 times [2018-06-22 01:15:57,871 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:57,871 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:57,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:57,871 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:57,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:57,889 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:58,077 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:15:58,077 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:58,077 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:58,085 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:58,106 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:58,109 INFO ]: Computing forward predicates... [2018-06-22 01:15:58,531 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:15:58,550 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:58,550 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-06-22 01:15:58,551 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:15:58,551 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:15:58,551 INFO ]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:15:58,551 INFO ]: Start difference. First operand 21 states and 23 transitions. Second operand 20 states. [2018-06-22 01:15:58,984 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:58,984 INFO ]: Finished difference Result 34 states and 39 transitions. [2018-06-22 01:15:58,985 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:15:58,985 INFO ]: Start accepts. Automaton has 20 states. Word has length 20 [2018-06-22 01:15:58,985 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:58,986 INFO ]: With dead ends: 34 [2018-06-22 01:15:58,986 INFO ]: Without dead ends: 34 [2018-06-22 01:15:58,986 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:15:58,986 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 01:15:58,988 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 23. [2018-06-22 01:15:58,988 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:15:58,989 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-06-22 01:15:58,989 INFO ]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 20 [2018-06-22 01:15:58,990 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:58,990 INFO ]: Abstraction has 23 states and 26 transitions. [2018-06-22 01:15:58,990 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:15:58,990 INFO ]: Start isEmpty. Operand 23 states and 26 transitions. [2018-06-22 01:15:58,990 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:15:58,990 INFO ]: Found error trace [2018-06-22 01:15:58,990 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:58,990 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:58,990 INFO ]: Analyzing trace with hash -408791770, now seen corresponding path program 8 times [2018-06-22 01:15:58,990 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:58,990 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:58,991 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:58,991 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:58,991 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:59,003 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:59,156 INFO ]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:15:59,156 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:59,156 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:59,164 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:15:59,200 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:15:59,201 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:59,203 INFO ]: Computing forward predicates... [2018-06-22 01:15:59,390 INFO ]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:15:59,422 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:59,422 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-06-22 01:15:59,422 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:15:59,422 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:15:59,423 INFO ]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:15:59,423 INFO ]: Start difference. First operand 23 states and 26 transitions. Second operand 20 states. [2018-06-22 01:16:00,033 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:00,033 INFO ]: Finished difference Result 40 states and 46 transitions. [2018-06-22 01:16:00,033 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:16:00,033 INFO ]: Start accepts. Automaton has 20 states. Word has length 21 [2018-06-22 01:16:00,033 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:00,033 INFO ]: With dead ends: 40 [2018-06-22 01:16:00,033 INFO ]: Without dead ends: 31 [2018-06-22 01:16:00,034 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=881, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:16:00,034 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 01:16:00,038 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 24. [2018-06-22 01:16:00,038 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:16:00,038 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-06-22 01:16:00,038 INFO ]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 21 [2018-06-22 01:16:00,038 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:00,038 INFO ]: Abstraction has 24 states and 27 transitions. [2018-06-22 01:16:00,038 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:16:00,038 INFO ]: Start isEmpty. Operand 24 states and 27 transitions. [2018-06-22 01:16:00,039 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:16:00,039 INFO ]: Found error trace [2018-06-22 01:16:00,039 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:00,039 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:00,039 INFO ]: Analyzing trace with hash 927315036, now seen corresponding path program 9 times [2018-06-22 01:16:00,039 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:00,039 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:00,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:00,040 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:00,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:00,054 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:00,180 INFO ]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:16:00,180 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:00,180 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:00,196 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:16:00,223 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:16:00,223 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:00,225 INFO ]: Computing forward predicates... [2018-06-22 01:16:00,301 INFO ]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:16:00,326 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:00,326 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2018-06-22 01:16:00,326 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:16:00,327 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:16:00,327 INFO ]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:16:00,327 INFO ]: Start difference. First operand 24 states and 27 transitions. Second operand 17 states. [2018-06-22 01:16:00,568 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:00,568 INFO ]: Finished difference Result 29 states and 32 transitions. [2018-06-22 01:16:00,569 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:16:00,569 INFO ]: Start accepts. Automaton has 17 states. Word has length 21 [2018-06-22 01:16:00,569 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:00,570 INFO ]: With dead ends: 29 [2018-06-22 01:16:00,570 INFO ]: Without dead ends: 24 [2018-06-22 01:16:00,570 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:16:00,570 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:16:00,572 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-22 01:16:00,572 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:16:00,572 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-06-22 01:16:00,572 INFO ]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2018-06-22 01:16:00,572 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:00,572 INFO ]: Abstraction has 24 states and 26 transitions. [2018-06-22 01:16:00,572 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:16:00,573 INFO ]: Start isEmpty. Operand 24 states and 26 transitions. [2018-06-22 01:16:00,573 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:16:00,573 INFO ]: Found error trace [2018-06-22 01:16:00,573 INFO ]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:00,573 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:00,573 INFO ]: Analyzing trace with hash 1782646630, now seen corresponding path program 10 times [2018-06-22 01:16:00,573 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:00,573 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:00,574 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:00,574 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:00,574 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:00,599 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:00,816 INFO ]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:16:00,816 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:00,816 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:00,822 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:16:00,849 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:16:00,849 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:00,852 INFO ]: Computing forward predicates... [2018-06-22 01:16:01,278 INFO ]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:16:01,297 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:01,297 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-06-22 01:16:01,297 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:16:01,297 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:16:01,297 INFO ]: CoverageRelationStatistics Valid=50, Invalid=502, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:16:01,298 INFO ]: Start difference. First operand 24 states and 26 transitions. Second operand 24 states. [2018-06-22 01:16:01,775 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:01,775 INFO ]: Finished difference Result 39 states and 44 transitions. [2018-06-22 01:16:01,776 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:16:01,776 INFO ]: Start accepts. Automaton has 24 states. Word has length 23 [2018-06-22 01:16:01,776 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:01,777 INFO ]: With dead ends: 39 [2018-06-22 01:16:01,777 INFO ]: Without dead ends: 39 [2018-06-22 01:16:01,777 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=1007, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:16:01,778 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:16:01,779 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-06-22 01:16:01,779 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:16:01,780 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-06-22 01:16:01,780 INFO ]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 23 [2018-06-22 01:16:01,780 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:01,780 INFO ]: Abstraction has 26 states and 29 transitions. [2018-06-22 01:16:01,780 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:16:01,780 INFO ]: Start isEmpty. Operand 26 states and 29 transitions. [2018-06-22 01:16:01,781 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:16:01,781 INFO ]: Found error trace [2018-06-22 01:16:01,781 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:01,781 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:01,781 INFO ]: Analyzing trace with hash 1754172112, now seen corresponding path program 11 times [2018-06-22 01:16:01,781 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:01,781 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:01,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:01,781 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:01,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:01,800 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:01,974 INFO ]: Checked inductivity of 35 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:16:01,974 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:02,001 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:02,007 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:16:02,034 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:16:02,034 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:02,037 INFO ]: Computing forward predicates... [2018-06-22 01:16:02,174 INFO ]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:16:02,194 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:02,194 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2018-06-22 01:16:02,194 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:16:02,194 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:16:02,195 INFO ]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:16:02,195 INFO ]: Start difference. First operand 26 states and 29 transitions. Second operand 24 states. [2018-06-22 01:16:02,597 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:02,597 INFO ]: Finished difference Result 46 states and 52 transitions. [2018-06-22 01:16:02,598 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:16:02,598 INFO ]: Start accepts. Automaton has 24 states. Word has length 24 [2018-06-22 01:16:02,598 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:02,598 INFO ]: With dead ends: 46 [2018-06-22 01:16:02,599 INFO ]: Without dead ends: 35 [2018-06-22 01:16:02,599 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=339, Invalid=1301, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:16:02,599 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 01:16:02,601 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-06-22 01:16:02,601 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:16:02,602 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-06-22 01:16:02,605 INFO ]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 24 [2018-06-22 01:16:02,605 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:02,605 INFO ]: Abstraction has 27 states and 30 transitions. [2018-06-22 01:16:02,605 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:16:02,605 INFO ]: Start isEmpty. Operand 27 states and 30 transitions. [2018-06-22 01:16:02,606 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:16:02,606 INFO ]: Found error trace [2018-06-22 01:16:02,606 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:02,606 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:02,606 INFO ]: Analyzing trace with hash 1557591174, now seen corresponding path program 12 times [2018-06-22 01:16:02,606 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:02,606 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:02,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:02,607 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:02,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:02,621 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:03,239 INFO ]: Checked inductivity of 35 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:16:03,239 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:03,239 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:03,245 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:16:03,283 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:16:03,283 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:03,285 INFO ]: Computing forward predicates... [2018-06-22 01:16:03,385 INFO ]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:16:03,404 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:03,404 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-06-22 01:16:03,404 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:16:03,404 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:16:03,404 INFO ]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:16:03,404 INFO ]: Start difference. First operand 27 states and 30 transitions. Second operand 19 states. [2018-06-22 01:16:03,525 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:03,525 INFO ]: Finished difference Result 32 states and 35 transitions. [2018-06-22 01:16:03,525 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:16:03,525 INFO ]: Start accepts. Automaton has 19 states. Word has length 24 [2018-06-22 01:16:03,525 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:03,526 INFO ]: With dead ends: 32 [2018-06-22 01:16:03,526 INFO ]: Without dead ends: 32 [2018-06-22 01:16:03,526 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:16:03,526 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:16:03,528 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-06-22 01:16:03,528 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:16:03,528 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-06-22 01:16:03,528 INFO ]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 24 [2018-06-22 01:16:03,529 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:03,529 INFO ]: Abstraction has 26 states and 28 transitions. [2018-06-22 01:16:03,529 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:16:03,529 INFO ]: Start isEmpty. Operand 26 states and 28 transitions. [2018-06-22 01:16:03,529 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:16:03,529 INFO ]: Found error trace [2018-06-22 01:16:03,529 INFO ]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:03,529 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:03,529 INFO ]: Analyzing trace with hash 1094214950, now seen corresponding path program 13 times [2018-06-22 01:16:03,529 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:03,529 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:03,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:03,530 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:03,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:03,540 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:04,325 INFO ]: Checked inductivity of 40 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:16:04,325 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:04,325 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:04,331 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:16:04,358 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:04,361 INFO ]: Computing forward predicates... [2018-06-22 01:16:04,527 INFO ]: Checked inductivity of 40 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:16:04,551 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:04,551 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-22 01:16:04,551 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:16:04,551 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:16:04,551 INFO ]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:16:04,551 INFO ]: Start difference. First operand 26 states and 28 transitions. Second operand 24 states. [2018-06-22 01:16:04,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:04,667 INFO ]: Finished difference Result 33 states and 36 transitions. [2018-06-22 01:16:04,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:16:04,667 INFO ]: Start accepts. Automaton has 24 states. Word has length 25 [2018-06-22 01:16:04,668 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:04,668 INFO ]: With dead ends: 33 [2018-06-22 01:16:04,668 INFO ]: Without dead ends: 27 [2018-06-22 01:16:04,668 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:16:04,668 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:16:04,670 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 01:16:04,670 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:16:04,670 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-06-22 01:16:04,670 INFO ]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2018-06-22 01:16:04,671 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:04,671 INFO ]: Abstraction has 27 states and 29 transitions. [2018-06-22 01:16:04,671 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:16:04,671 INFO ]: Start isEmpty. Operand 27 states and 29 transitions. [2018-06-22 01:16:04,671 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:16:04,671 INFO ]: Found error trace [2018-06-22 01:16:04,671 INFO ]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:04,671 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:04,671 INFO ]: Analyzing trace with hash 1363328316, now seen corresponding path program 14 times [2018-06-22 01:16:04,671 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:04,671 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:04,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:04,672 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:16:04,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:04,690 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:04,912 INFO ]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:16:04,913 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:04,913 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:04,919 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:16:04,964 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:16:04,964 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:04,967 INFO ]: Computing forward predicates... [2018-06-22 01:16:05,497 INFO ]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:16:05,517 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:05,517 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2018-06-22 01:16:05,518 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:16:05,518 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:16:05,518 INFO ]: CoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:16:05,518 INFO ]: Start difference. First operand 27 states and 29 transitions. Second operand 28 states. [2018-06-22 01:16:06,061 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:06,061 INFO ]: Finished difference Result 44 states and 49 transitions. [2018-06-22 01:16:06,063 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:16:06,063 INFO ]: Start accepts. Automaton has 28 states. Word has length 26 [2018-06-22 01:16:06,063 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:06,063 INFO ]: With dead ends: 44 [2018-06-22 01:16:06,063 INFO ]: Without dead ends: 44 [2018-06-22 01:16:06,063 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=1423, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:16:06,063 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 01:16:06,065 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 29. [2018-06-22 01:16:06,066 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:16:06,066 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-06-22 01:16:06,066 INFO ]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2018-06-22 01:16:06,066 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:06,066 INFO ]: Abstraction has 29 states and 32 transitions. [2018-06-22 01:16:06,066 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:16:06,066 INFO ]: Start isEmpty. Operand 29 states and 32 transitions. [2018-06-22 01:16:06,067 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:16:06,067 INFO ]: Found error trace [2018-06-22 01:16:06,067 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:06,067 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:06,067 INFO ]: Analyzing trace with hash 1115908070, now seen corresponding path program 15 times [2018-06-22 01:16:06,067 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:06,067 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:06,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:06,068 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:06,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:06,079 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:06,753 INFO ]: Checked inductivity of 51 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:16:06,753 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:06,753 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-22 01:16:06,760 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:16:06,790 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:16:06,790 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:06,793 INFO ]: Computing forward predicates... [2018-06-22 01:16:06,938 INFO ]: Checked inductivity of 51 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:16:06,957 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:06,957 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-06-22 01:16:06,958 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:16:06,958 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:16:06,958 INFO ]: CoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:16:06,958 INFO ]: Start difference. First operand 29 states and 32 transitions. Second operand 26 states. [2018-06-22 01:16:07,165 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:07,165 INFO ]: Finished difference Result 45 states and 50 transitions. [2018-06-22 01:16:07,190 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:16:07,191 INFO ]: Start accepts. Automaton has 26 states. Word has length 27 [2018-06-22 01:16:07,191 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:07,191 INFO ]: With dead ends: 45 [2018-06-22 01:16:07,191 INFO ]: Without dead ends: 45 [2018-06-22 01:16:07,192 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=392, Invalid=940, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:16:07,192 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 01:16:07,194 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 36. [2018-06-22 01:16:07,194 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:16:07,194 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-06-22 01:16:07,194 INFO ]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 27 [2018-06-22 01:16:07,194 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:07,194 INFO ]: Abstraction has 36 states and 40 transitions. [2018-06-22 01:16:07,194 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:16:07,194 INFO ]: Start isEmpty. Operand 36 states and 40 transitions. [2018-06-22 01:16:07,195 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:16:07,195 INFO ]: Found error trace [2018-06-22 01:16:07,195 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:07,195 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:07,195 INFO ]: Analyzing trace with hash 1180187676, now seen corresponding path program 16 times [2018-06-22 01:16:07,195 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:07,195 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:07,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:07,196 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:07,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:07,224 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:07,482 INFO ]: Checked inductivity of 51 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:16:07,482 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:07,482 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:07,487 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:16:07,520 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:16:07,520 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:07,523 INFO ]: Computing forward predicates... [2018-06-22 01:16:07,626 INFO ]: Checked inductivity of 51 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:16:07,645 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:07,645 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2018-06-22 01:16:07,645 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:16:07,645 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:16:07,646 INFO ]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:16:07,646 INFO ]: Start difference. First operand 36 states and 40 transitions. Second operand 23 states. [2018-06-22 01:16:08,289 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:08,289 INFO ]: Finished difference Result 54 states and 60 transitions. [2018-06-22 01:16:08,290 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:16:08,290 INFO ]: Start accepts. Automaton has 23 states. Word has length 27 [2018-06-22 01:16:08,290 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:08,290 INFO ]: With dead ends: 54 [2018-06-22 01:16:08,290 INFO ]: Without dead ends: 47 [2018-06-22 01:16:08,291 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=470, Invalid=1336, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:16:08,291 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 01:16:08,293 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 29. [2018-06-22 01:16:08,293 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:16:08,293 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-22 01:16:08,293 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2018-06-22 01:16:08,294 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:08,294 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-22 01:16:08,294 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:16:08,294 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-22 01:16:08,294 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:16:08,294 INFO ]: Found error trace [2018-06-22 01:16:08,294 INFO ]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:08,294 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:08,294 INFO ]: Analyzing trace with hash 286940614, now seen corresponding path program 17 times [2018-06-22 01:16:08,294 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:08,294 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:08,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:08,296 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:08,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:08,307 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:08,539 INFO ]: Checked inductivity of 57 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:16:08,539 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:08,539 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-22 01:16:08,545 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:16:08,634 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:16:08,634 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:08,638 INFO ]: Computing forward predicates... [2018-06-22 01:16:08,881 INFO ]: Checked inductivity of 57 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:16:08,901 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:08,901 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2018-06-22 01:16:08,901 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:16:08,901 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:16:08,901 INFO ]: CoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:16:08,901 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 25 states. [2018-06-22 01:16:09,032 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:09,032 INFO ]: Finished difference Result 44 states and 48 transitions. [2018-06-22 01:16:09,032 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:16:09,032 INFO ]: Start accepts. Automaton has 25 states. Word has length 28 [2018-06-22 01:16:09,032 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:09,033 INFO ]: With dead ends: 44 [2018-06-22 01:16:09,033 INFO ]: Without dead ends: 30 [2018-06-22 01:16:09,033 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:16:09,033 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 01:16:09,035 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 01:16:09,035 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:16:09,035 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-06-22 01:16:09,036 INFO ]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2018-06-22 01:16:09,036 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:09,036 INFO ]: Abstraction has 30 states and 32 transitions. [2018-06-22 01:16:09,036 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:16:09,036 INFO ]: Start isEmpty. Operand 30 states and 32 transitions. [2018-06-22 01:16:09,036 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:16:09,036 INFO ]: Found error trace [2018-06-22 01:16:09,036 INFO ]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:09,036 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:09,036 INFO ]: Analyzing trace with hash 382444710, now seen corresponding path program 18 times [2018-06-22 01:16:09,036 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:09,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:09,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:09,038 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:09,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:09,059 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:09,311 INFO ]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:16:09,311 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:09,311 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:09,316 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:16:09,354 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:16:09,354 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:09,358 INFO ]: Computing forward predicates... [2018-06-22 01:16:10,545 INFO ]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:16:10,565 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:10,565 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 24] total 39 [2018-06-22 01:16:10,565 INFO ]: Interpolant automaton has 39 states [2018-06-22 01:16:10,565 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 01:16:10,565 INFO ]: CoverageRelationStatistics Valid=82, Invalid=1400, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:16:10,566 INFO ]: Start difference. First operand 30 states and 32 transitions. Second operand 39 states. [2018-06-22 01:16:12,571 WARN ]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-06-22 01:16:12,686 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:12,686 INFO ]: Finished difference Result 57 states and 63 transitions. [2018-06-22 01:16:12,687 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:16:12,687 INFO ]: Start accepts. Automaton has 39 states. Word has length 29 [2018-06-22 01:16:12,687 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:12,687 INFO ]: With dead ends: 57 [2018-06-22 01:16:12,687 INFO ]: Without dead ends: 49 [2018-06-22 01:16:12,689 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=377, Invalid=3529, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 01:16:12,689 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 01:16:12,690 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-06-22 01:16:12,691 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:16:12,691 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-06-22 01:16:12,691 INFO ]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2018-06-22 01:16:12,691 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:12,691 INFO ]: Abstraction has 32 states and 35 transitions. [2018-06-22 01:16:12,691 INFO ]: Interpolant automaton has 39 states. [2018-06-22 01:16:12,691 INFO ]: Start isEmpty. Operand 32 states and 35 transitions. [2018-06-22 01:16:12,692 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:16:12,692 INFO ]: Found error trace [2018-06-22 01:16:12,692 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:12,692 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:12,692 INFO ]: Analyzing trace with hash 1699912464, now seen corresponding path program 19 times [2018-06-22 01:16:12,692 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:12,692 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:12,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:12,692 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:12,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:12,704 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:13,236 INFO ]: Checked inductivity of 70 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:16:13,236 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:13,236 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:13,242 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:16:13,274 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:13,276 INFO ]: Computing forward predicates... [2018-06-22 01:16:13,486 INFO ]: Checked inductivity of 70 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:16:13,507 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:13,507 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2018-06-22 01:16:13,508 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:16:13,508 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:16:13,508 INFO ]: CoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:16:13,508 INFO ]: Start difference. First operand 32 states and 35 transitions. Second operand 32 states. [2018-06-22 01:16:14,164 WARN ]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-22 01:16:14,168 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:14,168 INFO ]: Finished difference Result 58 states and 64 transitions. [2018-06-22 01:16:14,169 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 01:16:14,169 INFO ]: Start accepts. Automaton has 32 states. Word has length 30 [2018-06-22 01:16:14,169 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:14,169 INFO ]: With dead ends: 58 [2018-06-22 01:16:14,169 INFO ]: Without dead ends: 43 [2018-06-22 01:16:14,170 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=586, Invalid=2384, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 01:16:14,170 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 01:16:14,172 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 33. [2018-06-22 01:16:14,172 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:16:14,173 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-06-22 01:16:14,173 INFO ]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 30 [2018-06-22 01:16:14,173 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:14,173 INFO ]: Abstraction has 33 states and 36 transitions. [2018-06-22 01:16:14,173 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:16:14,173 INFO ]: Start isEmpty. Operand 33 states and 36 transitions. [2018-06-22 01:16:14,173 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:16:14,173 INFO ]: Found error trace [2018-06-22 01:16:14,173 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:14,173 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:14,173 INFO ]: Analyzing trace with hash -951895610, now seen corresponding path program 20 times [2018-06-22 01:16:14,173 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:14,173 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:14,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:14,176 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:16:14,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:14,187 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:14,914 INFO ]: Checked inductivity of 70 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:16:14,915 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:14,915 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:14,927 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:16:14,978 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:16:14,978 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:14,981 INFO ]: Computing forward predicates... [2018-06-22 01:16:15,181 INFO ]: Checked inductivity of 70 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:16:15,212 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:15,212 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2018-06-22 01:16:15,212 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:16:15,212 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:16:15,212 INFO ]: CoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:16:15,212 INFO ]: Start difference. First operand 33 states and 36 transitions. Second operand 26 states. [2018-06-22 01:16:15,642 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:15,642 INFO ]: Finished difference Result 41 states and 44 transitions. [2018-06-22 01:16:15,642 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 01:16:15,642 INFO ]: Start accepts. Automaton has 26 states. Word has length 30 [2018-06-22 01:16:15,643 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:15,643 INFO ]: With dead ends: 41 [2018-06-22 01:16:15,643 INFO ]: Without dead ends: 33 [2018-06-22 01:16:15,643 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=601, Invalid=1751, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 01:16:15,643 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:16:15,645 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-22 01:16:15,645 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:16:15,646 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-06-22 01:16:15,646 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2018-06-22 01:16:15,646 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:15,646 INFO ]: Abstraction has 33 states and 35 transitions. [2018-06-22 01:16:15,646 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:16:15,646 INFO ]: Start isEmpty. Operand 33 states and 35 transitions. [2018-06-22 01:16:15,646 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:16:15,646 INFO ]: Found error trace [2018-06-22 01:16:15,646 INFO ]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:15,646 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:15,646 INFO ]: Analyzing trace with hash -1189585668, now seen corresponding path program 21 times [2018-06-22 01:16:15,646 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:15,646 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:15,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:15,648 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:15,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:15,669 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:16,041 INFO ]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:16:16,041 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:16,041 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:16,047 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:16:16,088 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:16:16,088 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:16,092 INFO ]: Computing forward predicates... [2018-06-22 01:16:17,375 INFO ]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:16:17,394 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:17,400 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27] total 44 [2018-06-22 01:16:17,400 INFO ]: Interpolant automaton has 44 states [2018-06-22 01:16:17,400 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 01:16:17,400 INFO ]: CoverageRelationStatistics Valid=93, Invalid=1799, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:16:17,400 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 44 states. [2018-06-22 01:16:18,809 WARN ]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-06-22 01:16:19,529 WARN ]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-06-22 01:16:20,149 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:20,149 INFO ]: Finished difference Result 63 states and 69 transitions. [2018-06-22 01:16:20,150 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:16:20,150 INFO ]: Start accepts. Automaton has 44 states. Word has length 32 [2018-06-22 01:16:20,150 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:20,150 INFO ]: With dead ends: 63 [2018-06-22 01:16:20,150 INFO ]: Without dead ends: 54 [2018-06-22 01:16:20,151 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=514, Invalid=4456, Unknown=0, NotChecked=0, Total=4970 [2018-06-22 01:16:20,151 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 01:16:20,153 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 35. [2018-06-22 01:16:20,153 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:16:20,153 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-06-22 01:16:20,153 INFO ]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2018-06-22 01:16:20,154 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:20,154 INFO ]: Abstraction has 35 states and 38 transitions. [2018-06-22 01:16:20,154 INFO ]: Interpolant automaton has 44 states. [2018-06-22 01:16:20,154 INFO ]: Start isEmpty. Operand 35 states and 38 transitions. [2018-06-22 01:16:20,154 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 01:16:20,154 INFO ]: Found error trace [2018-06-22 01:16:20,154 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:20,154 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:20,154 INFO ]: Analyzing trace with hash -1127781722, now seen corresponding path program 22 times [2018-06-22 01:16:20,154 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:20,154 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:20,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:20,155 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:20,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:20,168 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:20,683 INFO ]: Checked inductivity of 92 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:16:20,683 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:20,683 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:20,689 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:16:20,728 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:16:20,728 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:20,731 INFO ]: Computing forward predicates... [2018-06-22 01:16:20,994 INFO ]: Checked inductivity of 92 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:16:21,024 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:21,024 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 36 [2018-06-22 01:16:21,025 INFO ]: Interpolant automaton has 36 states [2018-06-22 01:16:21,025 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 01:16:21,025 INFO ]: CoverageRelationStatistics Valid=226, Invalid=1034, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:16:21,025 INFO ]: Start difference. First operand 35 states and 38 transitions. Second operand 36 states. [2018-06-22 01:16:21,624 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:21,624 INFO ]: Finished difference Result 64 states and 70 transitions. [2018-06-22 01:16:21,625 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-22 01:16:21,625 INFO ]: Start accepts. Automaton has 36 states. Word has length 33 [2018-06-22 01:16:21,625 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:21,625 INFO ]: With dead ends: 64 [2018-06-22 01:16:21,625 INFO ]: Without dead ends: 47 [2018-06-22 01:16:21,626 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=735, Invalid=3047, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 01:16:21,626 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 01:16:21,628 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 36. [2018-06-22 01:16:21,628 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:16:21,628 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-06-22 01:16:21,628 INFO ]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 33 [2018-06-22 01:16:21,628 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:21,628 INFO ]: Abstraction has 36 states and 39 transitions. [2018-06-22 01:16:21,628 INFO ]: Interpolant automaton has 36 states. [2018-06-22 01:16:21,628 INFO ]: Start isEmpty. Operand 36 states and 39 transitions. [2018-06-22 01:16:21,629 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 01:16:21,629 INFO ]: Found error trace [2018-06-22 01:16:21,629 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:21,629 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:21,629 INFO ]: Analyzing trace with hash 1695232988, now seen corresponding path program 23 times [2018-06-22 01:16:21,629 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:21,629 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:21,629 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:21,629 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:21,629 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:21,641 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:22,233 INFO ]: Checked inductivity of 92 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:16:22,233 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:22,233 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:22,240 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:16:22,293 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 01:16:22,293 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:22,297 INFO ]: Computing forward predicates... [2018-06-22 01:16:22,490 INFO ]: Checked inductivity of 92 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:16:22,509 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:22,509 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 29 [2018-06-22 01:16:22,509 INFO ]: Interpolant automaton has 29 states [2018-06-22 01:16:22,509 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 01:16:22,510 INFO ]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:16:22,510 INFO ]: Start difference. First operand 36 states and 39 transitions. Second operand 29 states. [2018-06-22 01:16:22,961 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:22,961 INFO ]: Finished difference Result 45 states and 48 transitions. [2018-06-22 01:16:22,961 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:16:22,961 INFO ]: Start accepts. Automaton has 29 states. Word has length 33 [2018-06-22 01:16:22,961 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:22,961 INFO ]: With dead ends: 45 [2018-06-22 01:16:22,961 INFO ]: Without dead ends: 36 [2018-06-22 01:16:22,962 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=748, Invalid=2222, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 01:16:22,962 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:16:22,963 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 01:16:22,963 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:16:22,964 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-06-22 01:16:22,964 INFO ]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 33 [2018-06-22 01:16:22,964 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:22,964 INFO ]: Abstraction has 36 states and 38 transitions. [2018-06-22 01:16:22,964 INFO ]: Interpolant automaton has 29 states. [2018-06-22 01:16:22,964 INFO ]: Start isEmpty. Operand 36 states and 38 transitions. [2018-06-22 01:16:22,964 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:16:22,965 INFO ]: Found error trace [2018-06-22 01:16:22,965 INFO ]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:22,965 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:22,967 INFO ]: Analyzing trace with hash 1508856294, now seen corresponding path program 24 times [2018-06-22 01:16:22,967 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:22,967 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:22,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:22,968 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:22,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:22,981 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:23,349 INFO ]: Checked inductivity of 108 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:16:23,349 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:23,349 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:23,355 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:16:23,402 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 01:16:23,402 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:23,407 INFO ]: Computing forward predicates... [2018-06-22 01:16:24,617 INFO ]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:16:24,642 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:24,642 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 30] total 49 [2018-06-22 01:16:24,642 INFO ]: Interpolant automaton has 49 states [2018-06-22 01:16:24,643 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-22 01:16:24,643 INFO ]: CoverageRelationStatistics Valid=104, Invalid=2248, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 01:16:24,643 INFO ]: Start difference. First operand 36 states and 38 transitions. Second operand 49 states. [2018-06-22 01:16:26,752 WARN ]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-06-22 01:16:27,804 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:27,804 INFO ]: Finished difference Result 69 states and 75 transitions. [2018-06-22 01:16:27,804 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 01:16:27,804 INFO ]: Start accepts. Automaton has 49 states. Word has length 35 [2018-06-22 01:16:27,804 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:27,805 INFO ]: With dead ends: 69 [2018-06-22 01:16:27,805 INFO ]: Without dead ends: 59 [2018-06-22 01:16:27,806 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=559, Invalid=5603, Unknown=0, NotChecked=0, Total=6162 [2018-06-22 01:16:27,806 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 01:16:27,807 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 38. [2018-06-22 01:16:27,807 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:16:27,807 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-06-22 01:16:27,807 INFO ]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 35 [2018-06-22 01:16:27,808 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:27,808 INFO ]: Abstraction has 38 states and 41 transitions. [2018-06-22 01:16:27,808 INFO ]: Interpolant automaton has 49 states. [2018-06-22 01:16:27,808 INFO ]: Start isEmpty. Operand 38 states and 41 transitions. [2018-06-22 01:16:27,809 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:16:27,809 INFO ]: Found error trace [2018-06-22 01:16:27,809 INFO ]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:27,809 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:27,809 INFO ]: Analyzing trace with hash -1946928304, now seen corresponding path program 25 times [2018-06-22 01:16:27,809 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:27,809 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:27,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:27,810 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:27,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:27,822 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:28,266 INFO ]: Checked inductivity of 117 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:16:28,266 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:28,266 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:28,273 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:16:28,312 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:28,314 INFO ]: Computing forward predicates... [2018-06-22 01:16:28,630 INFO ]: Checked inductivity of 117 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:16:28,649 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:28,649 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2018-06-22 01:16:28,649 INFO ]: Interpolant automaton has 40 states [2018-06-22 01:16:28,649 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 01:16:28,649 INFO ]: CoverageRelationStatistics Valid=276, Invalid=1284, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:16:28,650 INFO ]: Start difference. First operand 38 states and 41 transitions. Second operand 40 states. [2018-06-22 01:16:29,302 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:29,302 INFO ]: Finished difference Result 70 states and 76 transitions. [2018-06-22 01:16:29,303 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-22 01:16:29,303 INFO ]: Start accepts. Automaton has 40 states. Word has length 36 [2018-06-22 01:16:29,303 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:29,303 INFO ]: With dead ends: 70 [2018-06-22 01:16:29,303 INFO ]: Without dead ends: 51 [2018-06-22 01:16:29,305 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=901, Invalid=3791, Unknown=0, NotChecked=0, Total=4692 [2018-06-22 01:16:29,305 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 01:16:29,307 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 39. [2018-06-22 01:16:29,307 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:16:29,307 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-06-22 01:16:29,307 INFO ]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 36 [2018-06-22 01:16:29,307 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:29,307 INFO ]: Abstraction has 39 states and 42 transitions. [2018-06-22 01:16:29,307 INFO ]: Interpolant automaton has 40 states. [2018-06-22 01:16:29,307 INFO ]: Start isEmpty. Operand 39 states and 42 transitions. [2018-06-22 01:16:29,308 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:16:29,308 INFO ]: Found error trace [2018-06-22 01:16:29,308 INFO ]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:29,308 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:29,308 INFO ]: Analyzing trace with hash 845844230, now seen corresponding path program 26 times [2018-06-22 01:16:29,308 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:29,308 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:29,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:29,308 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:16:29,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:29,321 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:29,544 INFO ]: Checked inductivity of 117 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:16:29,544 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:29,544 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:29,549 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:16:29,589 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:16:29,589 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:29,593 INFO ]: Computing forward predicates... [2018-06-22 01:16:29,779 INFO ]: Checked inductivity of 117 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:16:29,798 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:29,798 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 32 [2018-06-22 01:16:29,798 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:16:29,799 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:16:29,799 INFO ]: CoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:16:29,799 INFO ]: Start difference. First operand 39 states and 42 transitions. Second operand 32 states. [2018-06-22 01:16:30,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:30,306 INFO ]: Finished difference Result 49 states and 52 transitions. [2018-06-22 01:16:30,307 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 01:16:30,307 INFO ]: Start accepts. Automaton has 32 states. Word has length 36 [2018-06-22 01:16:30,307 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:30,307 INFO ]: With dead ends: 49 [2018-06-22 01:16:30,307 INFO ]: Without dead ends: 39 [2018-06-22 01:16:30,307 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=911, Invalid=2749, Unknown=0, NotChecked=0, Total=3660 [2018-06-22 01:16:30,307 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:16:30,309 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-22 01:16:30,309 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:16:30,309 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-06-22 01:16:30,309 INFO ]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 36 [2018-06-22 01:16:30,309 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:30,309 INFO ]: Abstraction has 39 states and 41 transitions. [2018-06-22 01:16:30,309 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:16:30,309 INFO ]: Start isEmpty. Operand 39 states and 41 transitions. [2018-06-22 01:16:30,309 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:16:30,309 INFO ]: Found error trace [2018-06-22 01:16:30,309 INFO ]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:30,310 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:30,310 INFO ]: Analyzing trace with hash -1671140164, now seen corresponding path program 27 times [2018-06-22 01:16:30,310 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:30,310 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:30,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:30,310 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:30,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:30,326 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:30,923 INFO ]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:16:30,923 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:30,923 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:30,929 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:16:30,982 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 01:16:30,982 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:30,988 INFO ]: Computing forward predicates... [2018-06-22 01:16:31,762 INFO ]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:16:31,781 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:31,781 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2018-06-22 01:16:31,781 INFO ]: Interpolant automaton has 44 states [2018-06-22 01:16:31,782 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 01:16:31,782 INFO ]: CoverageRelationStatistics Valid=95, Invalid=1797, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:16:31,782 INFO ]: Start difference. First operand 39 states and 41 transitions. Second operand 44 states. [2018-06-22 01:16:32,840 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:32,840 INFO ]: Finished difference Result 64 states and 69 transitions. [2018-06-22 01:16:32,840 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:16:32,840 INFO ]: Start accepts. Automaton has 44 states. Word has length 38 [2018-06-22 01:16:32,840 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:32,840 INFO ]: With dead ends: 64 [2018-06-22 01:16:32,840 INFO ]: Without dead ends: 64 [2018-06-22 01:16:32,841 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-22 01:16:32,841 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 01:16:32,843 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 41. [2018-06-22 01:16:32,843 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:16:32,843 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-06-22 01:16:32,843 INFO ]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 38 [2018-06-22 01:16:32,843 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:32,843 INFO ]: Abstraction has 41 states and 44 transitions. [2018-06-22 01:16:32,843 INFO ]: Interpolant automaton has 44 states. [2018-06-22 01:16:32,843 INFO ]: Start isEmpty. Operand 41 states and 44 transitions. [2018-06-22 01:16:32,843 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 01:16:32,843 INFO ]: Found error trace [2018-06-22 01:16:32,843 INFO ]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:32,844 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:32,844 INFO ]: Analyzing trace with hash -408789658, now seen corresponding path program 28 times [2018-06-22 01:16:32,845 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:32,845 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:32,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:32,845 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:32,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:32,860 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:33,214 INFO ]: Checked inductivity of 145 backedges. 46 proven. 54 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:16:33,214 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:33,214 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:33,220 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:16:33,262 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:16:33,262 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:33,265 INFO ]: Computing forward predicates... [2018-06-22 01:16:33,702 INFO ]: Checked inductivity of 145 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:16:33,721 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:33,721 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2018-06-22 01:16:33,721 INFO ]: Interpolant automaton has 44 states [2018-06-22 01:16:33,721 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 01:16:33,721 INFO ]: CoverageRelationStatistics Valid=331, Invalid=1561, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:16:33,722 INFO ]: Start difference. First operand 41 states and 44 transitions. Second operand 44 states. [2018-06-22 01:16:34,649 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:34,649 INFO ]: Finished difference Result 76 states and 82 transitions. [2018-06-22 01:16:34,650 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-06-22 01:16:34,650 INFO ]: Start accepts. Automaton has 44 states. Word has length 39 [2018-06-22 01:16:34,650 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:34,650 INFO ]: With dead ends: 76 [2018-06-22 01:16:34,650 INFO ]: Without dead ends: 55 [2018-06-22 01:16:34,651 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1084, Invalid=4616, Unknown=0, NotChecked=0, Total=5700 [2018-06-22 01:16:34,651 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 01:16:34,652 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 42. [2018-06-22 01:16:34,652 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:16:34,652 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-06-22 01:16:34,652 INFO ]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 39 [2018-06-22 01:16:34,652 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:34,653 INFO ]: Abstraction has 42 states and 45 transitions. [2018-06-22 01:16:34,653 INFO ]: Interpolant automaton has 44 states. [2018-06-22 01:16:34,653 INFO ]: Start isEmpty. Operand 42 states and 45 transitions. [2018-06-22 01:16:34,653 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 01:16:34,653 INFO ]: Found error trace [2018-06-22 01:16:34,653 INFO ]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:34,653 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:34,653 INFO ]: Analyzing trace with hash -908944484, now seen corresponding path program 29 times [2018-06-22 01:16:34,653 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:34,653 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:34,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:34,654 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:34,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:34,665 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:35,234 INFO ]: Checked inductivity of 145 backedges. 46 proven. 54 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:16:35,234 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:35,234 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-22 01:16:35,240 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:16:35,289 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 01:16:35,289 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:35,293 INFO ]: Computing forward predicates... [2018-06-22 01:16:35,443 INFO ]: Checked inductivity of 145 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:16:35,463 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:35,463 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 34 [2018-06-22 01:16:35,463 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:16:35,463 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:16:35,463 INFO ]: CoverageRelationStatistics Valid=256, Invalid=866, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:16:35,463 INFO ]: Start difference. First operand 42 states and 45 transitions. Second operand 34 states. [2018-06-22 01:16:35,602 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:35,602 INFO ]: Finished difference Result 52 states and 55 transitions. [2018-06-22 01:16:35,605 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:16:35,605 INFO ]: Start accepts. Automaton has 34 states. Word has length 39 [2018-06-22 01:16:35,605 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:35,605 INFO ]: With dead ends: 52 [2018-06-22 01:16:35,605 INFO ]: Without dead ends: 52 [2018-06-22 01:16:35,606 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=575, Invalid=1405, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 01:16:35,606 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 01:16:35,607 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 41. [2018-06-22 01:16:35,607 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:16:35,607 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-06-22 01:16:35,607 INFO ]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 39 [2018-06-22 01:16:35,607 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:35,607 INFO ]: Abstraction has 41 states and 43 transitions. [2018-06-22 01:16:35,607 INFO ]: Interpolant automaton has 34 states. [2018-06-22 01:16:35,607 INFO ]: Start isEmpty. Operand 41 states and 43 transitions. [2018-06-22 01:16:35,608 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 01:16:35,608 INFO ]: Found error trace [2018-06-22 01:16:35,608 INFO ]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:35,608 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:35,608 INFO ]: Analyzing trace with hash 1941020880, now seen corresponding path program 30 times [2018-06-22 01:16:35,608 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:35,608 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:35,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:35,608 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:35,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:35,619 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:35,935 INFO ]: Checked inductivity of 155 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:16:35,936 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:35,936 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:35,941 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:16:35,991 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 01:16:35,991 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:35,994 INFO ]: Computing forward predicates... [2018-06-22 01:16:36,336 INFO ]: Checked inductivity of 155 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:16:36,355 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:36,356 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-06-22 01:16:36,356 INFO ]: Interpolant automaton has 44 states [2018-06-22 01:16:36,356 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 01:16:36,356 INFO ]: CoverageRelationStatistics Valid=322, Invalid=1570, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:16:36,356 INFO ]: Start difference. First operand 41 states and 43 transitions. Second operand 44 states. [2018-06-22 01:16:36,620 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:36,620 INFO ]: Finished difference Result 53 states and 56 transitions. [2018-06-22 01:16:36,620 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:16:36,620 INFO ]: Start accepts. Automaton has 44 states. Word has length 40 [2018-06-22 01:16:36,620 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:36,620 INFO ]: With dead ends: 53 [2018-06-22 01:16:36,620 INFO ]: Without dead ends: 42 [2018-06-22 01:16:36,620 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=655, Invalid=2425, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 01:16:36,620 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:16:36,621 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 01:16:36,621 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:16:36,621 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-06-22 01:16:36,621 INFO ]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 40 [2018-06-22 01:16:36,621 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:36,621 INFO ]: Abstraction has 42 states and 44 transitions. [2018-06-22 01:16:36,621 INFO ]: Interpolant automaton has 44 states. [2018-06-22 01:16:36,621 INFO ]: Start isEmpty. Operand 42 states and 44 transitions. [2018-06-22 01:16:36,621 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 01:16:36,621 INFO ]: Found error trace [2018-06-22 01:16:36,621 INFO ]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:36,621 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:36,621 INFO ]: Analyzing trace with hash -1703407834, now seen corresponding path program 31 times [2018-06-22 01:16:36,621 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:36,621 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:36,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:36,622 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:36,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:36,637 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:37,161 INFO ]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:16:37,161 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:37,161 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:37,166 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:16:37,215 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:37,221 INFO ]: Computing forward predicates... [2018-06-22 01:16:38,088 INFO ]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:16:38,107 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:38,107 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-06-22 01:16:38,107 INFO ]: Interpolant automaton has 48 states [2018-06-22 01:16:38,107 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-22 01:16:38,107 INFO ]: CoverageRelationStatistics Valid=104, Invalid=2152, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 01:16:38,107 INFO ]: Start difference. First operand 42 states and 44 transitions. Second operand 48 states. [2018-06-22 01:16:39,319 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:39,319 INFO ]: Finished difference Result 69 states and 74 transitions. [2018-06-22 01:16:39,319 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:16:39,319 INFO ]: Start accepts. Automaton has 48 states. Word has length 41 [2018-06-22 01:16:39,319 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:39,319 INFO ]: With dead ends: 69 [2018-06-22 01:16:39,319 INFO ]: Without dead ends: 69 [2018-06-22 01:16:39,320 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-22 01:16:39,320 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 01:16:39,321 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 44. [2018-06-22 01:16:39,321 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 01:16:39,321 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-06-22 01:16:39,321 INFO ]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 41 [2018-06-22 01:16:39,322 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:39,322 INFO ]: Abstraction has 44 states and 47 transitions. [2018-06-22 01:16:39,322 INFO ]: Interpolant automaton has 48 states. [2018-06-22 01:16:39,322 INFO ]: Start isEmpty. Operand 44 states and 47 transitions. [2018-06-22 01:16:39,322 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:16:39,322 INFO ]: Found error trace [2018-06-22 01:16:39,322 INFO ]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:39,322 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:39,322 INFO ]: Analyzing trace with hash 1283419024, now seen corresponding path program 32 times [2018-06-22 01:16:39,322 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:39,322 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:39,323 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:39,323 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:16:39,323 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:39,334 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:39,976 INFO ]: Checked inductivity of 176 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:16:39,976 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:39,976 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:39,981 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:16:40,031 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:16:40,031 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:40,035 INFO ]: Computing forward predicates... [2018-06-22 01:16:41,052 INFO ]: Checked inductivity of 176 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:16:41,071 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:41,071 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 48 [2018-06-22 01:16:41,071 INFO ]: Interpolant automaton has 48 states [2018-06-22 01:16:41,071 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-22 01:16:41,071 INFO ]: CoverageRelationStatistics Valid=391, Invalid=1865, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 01:16:41,071 INFO ]: Start difference. First operand 44 states and 47 transitions. Second operand 48 states. [2018-06-22 01:16:41,942 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:41,942 INFO ]: Finished difference Result 82 states and 88 transitions. [2018-06-22 01:16:41,947 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-06-22 01:16:41,947 INFO ]: Start accepts. Automaton has 48 states. Word has length 42 [2018-06-22 01:16:41,947 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:41,948 INFO ]: With dead ends: 82 [2018-06-22 01:16:41,948 INFO ]: Without dead ends: 59 [2018-06-22 01:16:41,948 INFO ]: 0 DeclaredPredicates, 111 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1580 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1284, Invalid=5522, Unknown=0, NotChecked=0, Total=6806 [2018-06-22 01:16:41,948 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 01:16:41,950 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 45. [2018-06-22 01:16:41,950 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 01:16:41,950 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-06-22 01:16:41,950 INFO ]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 42 [2018-06-22 01:16:41,950 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:41,950 INFO ]: Abstraction has 45 states and 48 transitions. [2018-06-22 01:16:41,950 INFO ]: Interpolant automaton has 48 states. [2018-06-22 01:16:41,950 INFO ]: Start isEmpty. Operand 45 states and 48 transitions. [2018-06-22 01:16:41,951 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:16:41,951 INFO ]: Found error trace [2018-06-22 01:16:41,951 INFO ]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:41,951 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:41,951 INFO ]: Analyzing trace with hash 1670968390, now seen corresponding path program 33 times [2018-06-22 01:16:41,951 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:41,951 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:41,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:41,951 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:41,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:41,965 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:42,222 INFO ]: Checked inductivity of 176 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:16:42,222 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:42,222 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:42,231 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:16:42,290 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 01:16:42,290 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:42,295 INFO ]: Computing forward predicates... [2018-06-22 01:16:42,466 INFO ]: Checked inductivity of 176 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:16:42,485 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:42,485 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 37 [2018-06-22 01:16:42,485 INFO ]: Interpolant automaton has 37 states [2018-06-22 01:16:42,485 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 01:16:42,486 INFO ]: CoverageRelationStatistics Valid=303, Invalid=1029, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:16:42,486 INFO ]: Start difference. First operand 45 states and 48 transitions. Second operand 37 states. [2018-06-22 01:16:42,723 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:42,723 INFO ]: Finished difference Result 56 states and 59 transitions. [2018-06-22 01:16:42,728 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:16:42,728 INFO ]: Start accepts. Automaton has 37 states. Word has length 42 [2018-06-22 01:16:42,728 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:42,729 INFO ]: With dead ends: 56 [2018-06-22 01:16:42,729 INFO ]: Without dead ends: 56 [2018-06-22 01:16:42,729 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=681, Invalid=1671, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 01:16:42,729 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 01:16:42,730 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 44. [2018-06-22 01:16:42,730 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 01:16:42,731 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-06-22 01:16:42,731 INFO ]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 42 [2018-06-22 01:16:42,731 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:42,731 INFO ]: Abstraction has 44 states and 46 transitions. [2018-06-22 01:16:42,731 INFO ]: Interpolant automaton has 37 states. [2018-06-22 01:16:42,731 INFO ]: Start isEmpty. Operand 44 states and 46 transitions. [2018-06-22 01:16:42,731 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:16:42,731 INFO ]: Found error trace [2018-06-22 01:16:42,731 INFO ]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:42,731 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:42,732 INFO ]: Analyzing trace with hash 313941350, now seen corresponding path program 34 times [2018-06-22 01:16:42,732 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:42,732 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:42,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:42,734 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:42,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:42,750 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:43,025 INFO ]: Checked inductivity of 187 backedges. 45 proven. 76 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 01:16:43,025 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:43,025 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:43,031 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:16:43,079 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:16:43,079 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:43,083 INFO ]: Computing forward predicates... [2018-06-22 01:16:43,454 INFO ]: Checked inductivity of 187 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 01:16:43,473 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:43,473 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-06-22 01:16:43,473 INFO ]: Interpolant automaton has 48 states [2018-06-22 01:16:43,473 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-22 01:16:43,473 INFO ]: CoverageRelationStatistics Valid=381, Invalid=1875, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 01:16:43,473 INFO ]: Start difference. First operand 44 states and 46 transitions. Second operand 48 states. [2018-06-22 01:16:43,768 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:43,768 INFO ]: Finished difference Result 57 states and 60 transitions. [2018-06-22 01:16:43,768 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:16:43,768 INFO ]: Start accepts. Automaton has 48 states. Word has length 43 [2018-06-22 01:16:43,768 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:43,768 INFO ]: With dead ends: 57 [2018-06-22 01:16:43,768 INFO ]: Without dead ends: 45 [2018-06-22 01:16:43,769 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=774, Invalid=2886, Unknown=0, NotChecked=0, Total=3660 [2018-06-22 01:16:43,769 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 01:16:43,769 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-22 01:16:43,769 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 01:16:43,770 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-06-22 01:16:43,770 INFO ]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 43 [2018-06-22 01:16:43,770 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:43,770 INFO ]: Abstraction has 45 states and 47 transitions. [2018-06-22 01:16:43,770 INFO ]: Interpolant automaton has 48 states. [2018-06-22 01:16:43,770 INFO ]: Start isEmpty. Operand 45 states and 47 transitions. [2018-06-22 01:16:43,770 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:16:43,770 INFO ]: Found error trace [2018-06-22 01:16:43,770 INFO ]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:43,770 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:43,770 INFO ]: Analyzing trace with hash 1260055676, now seen corresponding path program 35 times [2018-06-22 01:16:43,770 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:43,770 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:43,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:43,771 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:43,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:43,796 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:44,679 INFO ]: Checked inductivity of 198 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 01:16:44,679 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:44,679 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:44,684 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:16:44,747 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 01:16:44,747 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:44,755 INFO ]: Computing forward predicates... [2018-06-22 01:16:46,402 INFO ]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:16:46,421 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:46,421 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 39] total 64 [2018-06-22 01:16:46,421 INFO ]: Interpolant automaton has 64 states [2018-06-22 01:16:46,421 INFO ]: Constructing interpolant automaton starting with 64 interpolants. [2018-06-22 01:16:46,422 INFO ]: CoverageRelationStatistics Valid=203, Invalid=3829, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 01:16:46,422 INFO ]: Start difference. First operand 45 states and 47 transitions. Second operand 64 states. [2018-06-22 01:16:48,437 WARN ]: Spent 333.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 154 [2018-06-22 01:16:48,926 WARN ]: Spent 353.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 154 [2018-06-22 01:16:49,374 WARN ]: Spent 337.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 154 [2018-06-22 01:16:49,780 WARN ]: Spent 325.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 154 [2018-06-22 01:16:50,196 WARN ]: Spent 326.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 154 [2018-06-22 01:16:50,665 WARN ]: Spent 377.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 154 [2018-06-22 01:16:51,127 WARN ]: Spent 362.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 154 [2018-06-22 01:16:51,576 WARN ]: Spent 345.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 154 Received shutdown request... [2018-06-22 01:16:51,875 WARN ]: Removed 32 from assertion stack [2018-06-22 01:16:51,875 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 01:16:51,875 WARN ]: Verification canceled [2018-06-22 01:16:51,878 WARN ]: Timeout [2018-06-22 01:16:51,878 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:16:51 BoogieIcfgContainer [2018-06-22 01:16:51,878 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:16:51,879 INFO ]: Toolchain (without parser) took 60408.96 ms. Allocated memory was 305.7 MB in the beginning and 641.2 MB in the end (delta: 335.5 MB). Free memory was 262.0 MB in the beginning and 379.8 MB in the end (delta: -117.7 MB). Peak memory consumption was 217.8 MB. Max. memory is 3.6 GB. [2018-06-22 01:16:51,880 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:16:51,880 INFO ]: ChcToBoogie took 58.83 ms. Allocated memory is still 305.7 MB. Free memory was 261.0 MB in the beginning and 259.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:16:51,880 INFO ]: Boogie Preprocessor took 36.15 ms. Allocated memory is still 305.7 MB. Free memory was 259.0 MB in the beginning and 258.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 01:16:51,881 INFO ]: RCFGBuilder took 235.94 ms. Allocated memory is still 305.7 MB. Free memory was 258.0 MB in the beginning and 249.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:16:51,881 INFO ]: TraceAbstraction took 60067.02 ms. Allocated memory was 305.7 MB in the beginning and 641.2 MB in the end (delta: 335.5 MB). Free memory was 249.0 MB in the beginning and 379.8 MB in the end (delta: -130.8 MB). Peak memory consumption was 204.8 MB. Max. memory is 3.6 GB. [2018-06-22 01:16:51,883 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 305.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 58.83 ms. Allocated memory is still 305.7 MB. Free memory was 261.0 MB in the beginning and 259.0 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.15 ms. Allocated memory is still 305.7 MB. Free memory was 259.0 MB in the beginning and 258.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 235.94 ms. Allocated memory is still 305.7 MB. Free memory was 258.0 MB in the beginning and 249.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 60067.02 ms. Allocated memory was 305.7 MB in the beginning and 641.2 MB in the end (delta: 335.5 MB). Free memory was 249.0 MB in the beginning and 379.8 MB in the end (delta: -130.8 MB). Peak memory consumption was 204.8 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 constructing difference of abstraction (45states) and interpolant automaton (currently 37 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 163. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. TIMEOUT Result, 60.0s OverallTime, 39 OverallIterations, 11 TraceHistogramMax, 28.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 415 SDtfs, 1397 SDslu, 6281 SDs, 0 SdLazy, 11300 SolverSat, 2203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2451 GetRequests, 810 SyntacticMatches, 10 SemanticMatches, 1630 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16616 ImplicationChecksByTransitivity, 45.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=36, 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, 38 MinimizatonAttempts, 307 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 28.2s InterpolantComputationTime, 2123 NumberOfCodeBlocks, 2123 NumberOfCodeBlocksAsserted, 143 NumberOfCheckSat, 2047 ConstructedInterpolants, 75 QuantifiedInterpolants, 370750 SizeOfPredicates, 293 NumberOfNonLiveVariables, 11607 ConjunctsInSsa, 3000 ConjunctsInUnsatCore, 76 InterpolantComputations, 4 PerfectInterpolantSequences, 2904/5501 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_weaved.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-16-51-973.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_safe_weaved.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-16-51-973.csv Completed graceful shutdown