java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/004b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:04:49,834 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:04:49,837 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:04:49,851 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:04:49,851 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:04:49,853 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:04:49,854 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:04:49,858 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:04:49,860 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:04:49,861 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:04:49,864 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:04:49,864 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:04:49,865 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:04:49,866 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:04:49,878 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:04:49,879 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:04:49,880 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:04:49,882 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:04:49,883 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:04:49,884 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:04:49,886 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:04:49,892 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:04:49,893 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:04:49,893 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:04:49,894 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:04:49,895 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:04:49,895 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:04:49,898 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:04:49,899 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:04:49,899 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:04:49,900 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:04:49,901 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:04:49,906 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:04:49,907 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:04:49,907 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:04:49,908 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:04:49,929 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:04:49,929 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:04:49,929 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:04:49,930 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:04:49,932 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:04:49,933 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:04:49,933 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:04:49,933 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:04:49,933 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:04:49,933 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:04:49,934 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:04:49,934 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:04:49,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:04:49,934 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:04:49,934 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:04:49,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:04:49,936 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:04:49,936 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:04:49,936 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:04:49,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:04:49,936 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:04:49,938 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:04:49,938 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:04:49,989 INFO ]: Repository-Root is: /tmp [2018-06-25 09:04:50,006 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:04:50,011 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:04:50,013 INFO ]: Initializing SmtParser... [2018-06-25 09:04:50,013 INFO ]: SmtParser initialized [2018-06-25 09:04:50,014 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/004b-horn.smt2 [2018-06-25 09:04:50,015 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 09:04:50,105 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/004b-horn.smt2 unknown [2018-06-25 09:04:50,257 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/004b-horn.smt2 [2018-06-25 09:04:50,266 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:04:50,278 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:04:50,278 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:04:50,278 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:04:50,278 INFO ]: ChcToBoogie initialized [2018-06-25 09:04:50,284 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:04:50" (1/1) ... [2018-06-25 09:04:50,332 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:50 Unit [2018-06-25 09:04:50,332 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:04:50,332 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:04:50,332 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:04:50,332 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:04:50,353 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:50" (1/1) ... [2018-06-25 09:04:50,353 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:50" (1/1) ... [2018-06-25 09:04:50,359 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:50" (1/1) ... [2018-06-25 09:04:50,359 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:50" (1/1) ... [2018-06-25 09:04:50,363 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:50" (1/1) ... [2018-06-25 09:04:50,364 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:50" (1/1) ... [2018-06-25 09:04:50,365 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:50" (1/1) ... [2018-06-25 09:04:50,367 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:04:50,368 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:04:50,368 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:04:50,368 INFO ]: RCFGBuilder initialized [2018-06-25 09:04:50,369 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:50" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 09:04:50,380 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:04:50,380 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:04:50,380 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:04:50,381 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:04:50,381 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:04:50,381 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:04:50,629 INFO ]: Using library mode [2018-06-25 09:04:50,630 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:04:50 BoogieIcfgContainer [2018-06-25 09:04:50,630 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:04:50,630 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:04:50,630 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:04:50,635 INFO ]: TraceAbstraction initialized [2018-06-25 09:04:50,636 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:04:50" (1/3) ... [2018-06-25 09:04:50,636 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25763706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:04:50, skipping insertion in model container [2018-06-25 09:04:50,637 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:50" (2/3) ... [2018-06-25 09:04:50,637 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25763706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:04:50, skipping insertion in model container [2018-06-25 09:04:50,637 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:04:50" (3/3) ... [2018-06-25 09:04:50,639 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:04:50,648 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:04:50,658 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:04:50,707 INFO ]: Using default assertion order modulation [2018-06-25 09:04:50,708 INFO ]: Interprodecural is true [2018-06-25 09:04:50,708 INFO ]: Hoare is false [2018-06-25 09:04:50,708 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:04:50,708 INFO ]: Backedges is TWOTRACK [2018-06-25 09:04:50,708 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:04:50,708 INFO ]: Difference is false [2018-06-25 09:04:50,708 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:04:50,708 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:04:50,727 INFO ]: Start isEmpty. Operand 10 states. [2018-06-25 09:04:50,738 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:04:50,738 INFO ]: Found error trace [2018-06-25 09:04:50,741 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:50,741 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:50,746 INFO ]: Analyzing trace with hash -204783142, now seen corresponding path program 1 times [2018-06-25 09:04:50,750 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:50,750 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:50,786 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:50,786 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:50,786 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:50,834 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:50,933 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:50,935 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:04:50,935 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:04:50,937 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:04:50,952 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:04:50,953 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:04:50,955 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-25 09:04:51,069 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:51,069 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-25 09:04:51,070 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:04:51,071 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:04:51,071 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:51,078 INFO ]: With dead ends: 9 [2018-06-25 09:04:51,078 INFO ]: Without dead ends: 9 [2018-06-25 09:04:51,080 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:04:51,097 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 09:04:51,114 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 09:04:51,115 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:04:51,115 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-25 09:04:51,116 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-25 09:04:51,117 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:51,117 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-25 09:04:51,117 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:04:51,117 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-25 09:04:51,118 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:04:51,118 INFO ]: Found error trace [2018-06-25 09:04:51,118 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:51,118 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:51,118 INFO ]: Analyzing trace with hash -2057218350, now seen corresponding path program 1 times [2018-06-25 09:04:51,118 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:51,118 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:51,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:51,119 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:51,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:51,140 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:51,240 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:51,240 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:51,240 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:51,247 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:51,310 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:51,319 INFO ]: Computing forward predicates... [2018-06-25 09:04:51,570 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:51,593 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:51,593 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 09:04:51,594 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:04:51,594 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:04:51,594 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:04:51,594 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 6 states. [2018-06-25 09:04:51,813 WARN ]: Spent 138.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-06-25 09:04:52,083 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:52,083 INFO ]: Finished difference Result 12 states and 20 transitions. [2018-06-25 09:04:52,084 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:04:52,084 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-25 09:04:52,084 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:52,084 INFO ]: With dead ends: 12 [2018-06-25 09:04:52,084 INFO ]: Without dead ends: 12 [2018-06-25 09:04:52,085 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:04:52,085 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 09:04:52,087 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 09:04:52,087 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:04:52,087 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2018-06-25 09:04:52,087 INFO ]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 8 [2018-06-25 09:04:52,087 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:52,087 INFO ]: Abstraction has 12 states and 20 transitions. [2018-06-25 09:04:52,087 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:04:52,087 INFO ]: Start isEmpty. Operand 12 states and 20 transitions. [2018-06-25 09:04:52,087 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:04:52,087 INFO ]: Found error trace [2018-06-25 09:04:52,088 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:52,088 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:52,088 INFO ]: Analyzing trace with hash -2048906661, now seen corresponding path program 1 times [2018-06-25 09:04:52,088 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:52,088 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:52,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:52,089 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:52,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:52,112 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:52,340 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:52,340 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:52,340 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:52,350 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:52,374 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:52,375 INFO ]: Computing forward predicates... [2018-06-25 09:04:52,537 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:52,556 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:52,556 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 09:04:52,556 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:04:52,556 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:04:52,556 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:04:52,557 INFO ]: Start difference. First operand 12 states and 20 transitions. Second operand 6 states. [2018-06-25 09:04:52,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:52,689 INFO ]: Finished difference Result 13 states and 23 transitions. [2018-06-25 09:04:52,689 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:04:52,689 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-25 09:04:52,689 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:52,690 INFO ]: With dead ends: 13 [2018-06-25 09:04:52,690 INFO ]: Without dead ends: 13 [2018-06-25 09:04:52,690 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:04:52,690 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:04:52,692 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 09:04:52,692 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:04:52,692 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-06-25 09:04:52,692 INFO ]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-06-25 09:04:52,692 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:52,692 INFO ]: Abstraction has 13 states and 23 transitions. [2018-06-25 09:04:52,692 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:04:52,692 INFO ]: Start isEmpty. Operand 13 states and 23 transitions. [2018-06-25 09:04:52,693 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:04:52,693 INFO ]: Found error trace [2018-06-25 09:04:52,693 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:52,693 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:52,693 INFO ]: Analyzing trace with hash 904494705, now seen corresponding path program 1 times [2018-06-25 09:04:52,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:52,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:52,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:52,694 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:52,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:52,723 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:53,010 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:53,010 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:53,074 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:53,081 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:53,111 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:53,114 INFO ]: Computing forward predicates... [2018-06-25 09:04:53,519 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:53,539 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:53,539 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 09:04:53,539 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:04:53,540 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:04:53,540 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:04:53,540 INFO ]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-06-25 09:04:53,793 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:53,793 INFO ]: Finished difference Result 15 states and 29 transitions. [2018-06-25 09:04:53,794 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:04:53,794 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-25 09:04:53,794 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:53,794 INFO ]: With dead ends: 15 [2018-06-25 09:04:53,794 INFO ]: Without dead ends: 15 [2018-06-25 09:04:53,795 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:04:53,795 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:04:53,796 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 09:04:53,797 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:04:53,797 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2018-06-25 09:04:53,797 INFO ]: Start accepts. Automaton has 15 states and 29 transitions. Word has length 9 [2018-06-25 09:04:53,797 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:53,797 INFO ]: Abstraction has 15 states and 29 transitions. [2018-06-25 09:04:53,797 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:04:53,797 INFO ]: Start isEmpty. Operand 15 states and 29 transitions. [2018-06-25 09:04:53,798 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:04:53,798 INFO ]: Found error trace [2018-06-25 09:04:53,798 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:53,798 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:53,798 INFO ]: Analyzing trace with hash 912806394, now seen corresponding path program 2 times [2018-06-25 09:04:53,798 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:53,798 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:53,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:53,799 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:53,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:53,810 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:53,866 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:53,866 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:04:53,867 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:04:53,867 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:04:53,867 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:04:53,867 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:04:53,867 INFO ]: Start difference. First operand 15 states and 29 transitions. Second operand 4 states. [2018-06-25 09:04:53,893 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:53,893 INFO ]: Finished difference Result 19 states and 39 transitions. [2018-06-25 09:04:53,893 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:04:53,894 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:04:53,894 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:53,894 INFO ]: With dead ends: 19 [2018-06-25 09:04:53,894 INFO ]: Without dead ends: 15 [2018-06-25 09:04:53,894 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:04:53,894 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:04:53,896 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 09:04:53,896 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:04:53,896 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-06-25 09:04:53,897 INFO ]: Start accepts. Automaton has 15 states and 21 transitions. Word has length 9 [2018-06-25 09:04:53,897 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:53,897 INFO ]: Abstraction has 15 states and 21 transitions. [2018-06-25 09:04:53,897 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:04:53,897 INFO ]: Start isEmpty. Operand 15 states and 21 transitions. [2018-06-25 09:04:53,897 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:04:53,897 INFO ]: Found error trace [2018-06-25 09:04:53,897 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:53,897 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:53,897 INFO ]: Analyzing trace with hash -1418630309, now seen corresponding path program 2 times [2018-06-25 09:04:53,897 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:53,897 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:53,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:53,898 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:53,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:53,911 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:53,955 INFO ]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:53,956 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:04:53,956 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:04:53,956 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:04:53,956 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:04:53,956 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:04:53,956 INFO ]: Start difference. First operand 15 states and 21 transitions. Second operand 4 states. [2018-06-25 09:04:53,971 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:53,971 INFO ]: Finished difference Result 17 states and 24 transitions. [2018-06-25 09:04:53,972 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:04:53,972 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-25 09:04:53,972 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:53,972 INFO ]: With dead ends: 17 [2018-06-25 09:04:53,972 INFO ]: Without dead ends: 12 [2018-06-25 09:04:53,972 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:04:53,972 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 09:04:53,973 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 09:04:53,973 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:04:53,973 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-25 09:04:53,973 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-25 09:04:53,974 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:53,974 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-25 09:04:53,974 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:04:53,974 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-25 09:04:53,974 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:04:53,974 INFO ]: Found error trace [2018-06-25 09:04:53,974 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:53,974 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:53,974 INFO ]: Analyzing trace with hash 1510953905, now seen corresponding path program 3 times [2018-06-25 09:04:53,974 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:53,974 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:53,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:53,975 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:53,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:53,999 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:54,329 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:54,329 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:54,329 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:54,344 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:04:54,375 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:04:54,375 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:54,379 INFO ]: Computing forward predicates... [2018-06-25 09:04:54,590 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:54,611 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:54,611 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-25 09:04:54,611 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:04:54,611 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:04:54,611 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:04:54,612 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-06-25 09:04:54,917 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:54,918 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-25 09:04:54,918 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:04:54,918 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-25 09:04:54,918 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:54,918 INFO ]: With dead ends: 14 [2018-06-25 09:04:54,918 INFO ]: Without dead ends: 14 [2018-06-25 09:04:54,918 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:04:54,918 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:04:54,919 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 09:04:54,919 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:04:54,919 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-25 09:04:54,919 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-06-25 09:04:54,919 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:54,919 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-25 09:04:54,919 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:04:54,919 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-25 09:04:54,920 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:04:54,920 INFO ]: Found error trace [2018-06-25 09:04:54,920 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:54,920 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:54,920 INFO ]: Analyzing trace with hash 202692849, now seen corresponding path program 4 times [2018-06-25 09:04:54,920 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:54,920 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:54,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:54,921 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:54,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:54,949 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:55,186 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:55,186 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:55,186 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:55,196 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:04:55,237 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:04:55,237 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:55,241 INFO ]: Computing forward predicates... [2018-06-25 09:04:55,522 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:55,553 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:55,553 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-25 09:04:55,553 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:04:55,553 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:04:55,553 INFO ]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:04:55,554 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 16 states. [2018-06-25 09:04:55,805 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:55,806 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-25 09:04:55,806 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:04:55,806 INFO ]: Start accepts. Automaton has 16 states. Word has length 13 [2018-06-25 09:04:55,806 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:55,806 INFO ]: With dead ends: 15 [2018-06-25 09:04:55,806 INFO ]: Without dead ends: 15 [2018-06-25 09:04:55,806 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:04:55,806 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:04:55,808 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 09:04:55,808 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:04:55,808 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-25 09:04:55,808 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-25 09:04:55,808 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:55,808 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-25 09:04:55,808 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:04:55,808 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-25 09:04:55,809 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:04:55,809 INFO ]: Found error trace [2018-06-25 09:04:55,809 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:55,809 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:55,809 INFO ]: Analyzing trace with hash 1984602779, now seen corresponding path program 5 times [2018-06-25 09:04:55,809 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:55,809 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:55,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:55,810 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:55,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:55,831 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:56,318 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:56,318 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:56,318 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:56,326 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:04:56,358 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-25 09:04:56,358 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:56,362 INFO ]: Computing forward predicates... [2018-06-25 09:04:56,408 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:56,441 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:56,441 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-25 09:04:56,442 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:04:56,442 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:04:56,442 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:04:56,442 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 10 states. [2018-06-25 09:04:56,544 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:56,545 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-25 09:04:56,545 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:04:56,545 INFO ]: Start accepts. Automaton has 10 states. Word has length 14 [2018-06-25 09:04:56,545 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:56,545 INFO ]: With dead ends: 16 [2018-06-25 09:04:56,545 INFO ]: Without dead ends: 16 [2018-06-25 09:04:56,545 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:04:56,545 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 09:04:56,547 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-25 09:04:56,547 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 09:04:56,547 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-25 09:04:56,547 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-25 09:04:56,547 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:56,547 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-25 09:04:56,547 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:04:56,548 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-25 09:04:56,548 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:04:56,548 INFO ]: Found error trace [2018-06-25 09:04:56,549 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:56,549 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:56,549 INFO ]: Analyzing trace with hash 1389235761, now seen corresponding path program 6 times [2018-06-25 09:04:56,549 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:56,549 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:56,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:56,550 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:56,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:56,571 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:56,847 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:56,847 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:56,847 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:56,855 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:04:56,904 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-25 09:04:56,904 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:56,909 INFO ]: Computing forward predicates... [2018-06-25 09:04:57,507 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:57,527 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:57,527 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-25 09:04:57,527 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:04:57,527 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:04:57,527 INFO ]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:04:57,528 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 20 states. [2018-06-25 09:04:57,948 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:57,948 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-25 09:04:57,951 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:04:57,951 INFO ]: Start accepts. Automaton has 20 states. Word has length 15 [2018-06-25 09:04:57,951 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:57,951 INFO ]: With dead ends: 17 [2018-06-25 09:04:57,951 INFO ]: Without dead ends: 17 [2018-06-25 09:04:57,952 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:04:57,952 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 09:04:57,953 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-25 09:04:57,953 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:04:57,954 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-25 09:04:57,954 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-25 09:04:57,954 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:57,954 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-25 09:04:57,954 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:04:57,954 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-25 09:04:57,954 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:04:57,954 INFO ]: Found error trace [2018-06-25 09:04:57,954 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:57,954 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:57,955 INFO ]: Analyzing trace with hash 112727387, now seen corresponding path program 7 times [2018-06-25 09:04:57,955 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:57,955 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:57,955 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:57,955 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:57,955 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:57,980 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:58,285 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:58,285 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:58,307 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:58,313 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:58,345 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:58,348 INFO ]: Computing forward predicates... [2018-06-25 09:04:58,863 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:58,883 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:58,883 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-25 09:04:58,883 INFO ]: Interpolant automaton has 22 states [2018-06-25 09:04:58,884 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-25 09:04:58,884 INFO ]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:04:58,884 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 22 states. [2018-06-25 09:04:59,386 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:59,386 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-25 09:04:59,386 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:04:59,386 INFO ]: Start accepts. Automaton has 22 states. Word has length 16 [2018-06-25 09:04:59,386 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:59,386 INFO ]: With dead ends: 18 [2018-06-25 09:04:59,386 INFO ]: Without dead ends: 18 [2018-06-25 09:04:59,387 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2018-06-25 09:04:59,387 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 09:04:59,388 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-25 09:04:59,389 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:04:59,389 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-25 09:04:59,389 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-25 09:04:59,389 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:59,389 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-25 09:04:59,389 INFO ]: Interpolant automaton has 22 states. [2018-06-25 09:04:59,389 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-25 09:04:59,389 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:04:59,389 INFO ]: Found error trace [2018-06-25 09:04:59,390 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:59,390 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:59,390 INFO ]: Analyzing trace with hash -804326543, now seen corresponding path program 8 times [2018-06-25 09:04:59,390 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:59,390 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:59,390 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:59,391 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:59,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:59,413 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:00,188 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:00,188 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:00,188 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:05:00,194 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:05:00,230 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:05:00,230 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:00,235 INFO ]: Computing forward predicates... [2018-06-25 09:05:00,742 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:00,775 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:00,775 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-25 09:05:00,776 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:05:00,776 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:05:00,776 INFO ]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:05:00,776 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 24 states. [2018-06-25 09:05:01,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:01,053 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-25 09:05:01,053 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:05:01,053 INFO ]: Start accepts. Automaton has 24 states. Word has length 17 [2018-06-25 09:05:01,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:01,053 INFO ]: With dead ends: 19 [2018-06-25 09:05:01,053 INFO ]: Without dead ends: 19 [2018-06-25 09:05:01,054 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2018-06-25 09:05:01,054 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:05:01,055 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-25 09:05:01,055 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:05:01,056 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-25 09:05:01,056 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-25 09:05:01,056 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:01,056 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-25 09:05:01,056 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:05:01,056 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-25 09:05:01,056 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:05:01,056 INFO ]: Found error trace [2018-06-25 09:05:01,056 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:01,056 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:01,056 INFO ]: Analyzing trace with hash 831772699, now seen corresponding path program 9 times [2018-06-25 09:05:01,056 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:01,056 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:01,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:01,057 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:01,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:01,086 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:01,410 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:01,410 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:01,410 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:05:01,418 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:05:01,464 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-25 09:05:01,464 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:01,470 INFO ]: Computing forward predicates... [2018-06-25 09:05:01,883 WARN ]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-06-25 09:05:17,253 WARN ]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-06-25 09:05:17,562 WARN ]: unable to prove that (exists ((v_gotoProc_hbv_INV1_2_Int_59 Int) (v_gotoProc_hhv_INV1_2_Int_59 Int)) (let ((.cse1 (+ v_gotoProc_hbv_INV1_2_Int_59 3)) (.cse0 (+ (* 3 c_gotoProc_hhv_INV1_1_Int) c_gotoProc_hhv_INV1_2_Int c_gotoProc_hhv_INV1_0_Int))) (and (not (= (* 4 v_gotoProc_hhv_INV1_2_Int_59) (+ (* 9 c_gotoProc_hhv_INV1_1_Int) (* 3 c_gotoProc_hhv_INV1_2_Int) (* 2 c_gotoProc_hhv_INV1_4_Int) c_gotoProc_hhv_INV1_5_Int (* 4 v_gotoProc_hbv_INV1_2_Int_59) 10))) (<= v_gotoProc_hhv_INV1_2_Int_59 .cse0) (<= c_gotoProc_hhv_INV1_3_Int .cse1) (<= .cse1 c_gotoProc_hhv_INV1_3_Int) (<= .cse0 v_gotoProc_hhv_INV1_2_Int_59)))) is different from true [2018-06-25 09:05:19,245 WARN ]: unable to prove that (exists ((v_gotoProc_hbv_INV1_2_Int_59 Int) (v_gotoProc_hhv_INV1_2_Int_59 Int)) (let ((.cse0 (+ (* 4 c_gotoProc_hhv_INV1_1_Int) c_gotoProc_hhv_INV1_2_Int c_gotoProc_hhv_INV1_0_Int 3)) (.cse1 (+ v_gotoProc_hbv_INV1_2_Int_59 3))) (and (<= .cse0 v_gotoProc_hhv_INV1_2_Int_59) (<= v_gotoProc_hhv_INV1_2_Int_59 .cse0) (not (= (+ (* 12 c_gotoProc_hhv_INV1_1_Int) (* 3 c_gotoProc_hhv_INV1_2_Int) (* 3 c_gotoProc_hhv_INV1_4_Int) c_gotoProc_hhv_INV1_5_Int (* 4 v_gotoProc_hbv_INV1_2_Int_59) 21) (* 4 v_gotoProc_hhv_INV1_2_Int_59))) (<= c_gotoProc_hhv_INV1_3_Int .cse1) (<= .cse1 c_gotoProc_hhv_INV1_3_Int)))) is different from true [2018-06-25 09:05:19,586 WARN ]: unable to prove that (exists ((v_gotoProc_hbv_INV1_2_Int_59 Int) (v_gotoProc_hhv_INV1_2_Int_59 Int)) (let ((.cse1 (+ v_gotoProc_hbv_INV1_2_Int_59 3)) (.cse0 (+ (* 5 c_gotoProc_hhv_INV1_1_Int) c_gotoProc_hhv_INV1_2_Int c_gotoProc_hhv_INV1_0_Int 7))) (and (not (= (+ (* 15 c_gotoProc_hhv_INV1_1_Int) (* 3 c_gotoProc_hhv_INV1_2_Int) (* 4 c_gotoProc_hhv_INV1_4_Int) c_gotoProc_hhv_INV1_5_Int (* 4 v_gotoProc_hbv_INV1_2_Int_59) 36) (* 4 v_gotoProc_hhv_INV1_2_Int_59))) (<= v_gotoProc_hhv_INV1_2_Int_59 .cse0) (<= c_gotoProc_hhv_INV1_3_Int .cse1) (<= .cse1 c_gotoProc_hhv_INV1_3_Int) (<= .cse0 v_gotoProc_hhv_INV1_2_Int_59)))) is different from true [2018-06-25 09:05:20,951 WARN ]: unable to prove that (exists ((v_gotoProc_hbv_INV1_2_Int_59 Int) (v_gotoProc_hhv_INV1_2_Int_59 Int)) (let ((.cse0 (+ (* 6 c_gotoProc_hhv_INV1_1_Int) c_gotoProc_hhv_INV1_2_Int c_gotoProc_hhv_INV1_0_Int 12)) (.cse1 (+ v_gotoProc_hbv_INV1_2_Int_59 3))) (and (<= .cse0 v_gotoProc_hhv_INV1_2_Int_59) (<= v_gotoProc_hhv_INV1_2_Int_59 .cse0) (<= c_gotoProc_hhv_INV1_3_Int .cse1) (<= .cse1 c_gotoProc_hhv_INV1_3_Int) (not (= (+ (* 18 c_gotoProc_hhv_INV1_1_Int) (* 3 c_gotoProc_hhv_INV1_2_Int) (* 5 c_gotoProc_hhv_INV1_4_Int) c_gotoProc_hhv_INV1_5_Int (* 4 v_gotoProc_hbv_INV1_2_Int_59) 55) (* 4 v_gotoProc_hhv_INV1_2_Int_59)))))) is different from true [2018-06-25 09:05:21,322 WARN ]: unable to prove that (exists ((v_gotoProc_hbv_INV1_2_Int_59 Int) (v_gotoProc_hhv_INV1_2_Int_59 Int)) (let ((.cse1 (+ v_gotoProc_hbv_INV1_2_Int_59 3)) (.cse0 (+ (* 7 c_gotoProc_hhv_INV1_1_Int) c_gotoProc_hhv_INV1_2_Int c_gotoProc_hhv_INV1_0_Int 18))) (and (not (= (+ (* 21 c_gotoProc_hhv_INV1_1_Int) (* 3 c_gotoProc_hhv_INV1_2_Int) (* 6 c_gotoProc_hhv_INV1_4_Int) c_gotoProc_hhv_INV1_5_Int (* 4 v_gotoProc_hbv_INV1_2_Int_59) 78) (* 4 v_gotoProc_hhv_INV1_2_Int_59))) (<= .cse0 v_gotoProc_hhv_INV1_2_Int_59) (<= c_gotoProc_hhv_INV1_3_Int .cse1) (<= .cse1 c_gotoProc_hhv_INV1_3_Int) (<= v_gotoProc_hhv_INV1_2_Int_59 .cse0)))) is different from true [2018-06-25 09:05:21,325 INFO ]: Checked inductivity of 66 backedges. 0 proven. 20 refuted. 1 times theorem prover too weak. 0 trivial. 45 not checked. [2018-06-25 09:05:21,345 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:21,345 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-06-25 09:05:21,345 INFO ]: Interpolant automaton has 26 states [2018-06-25 09:05:21,345 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-25 09:05:21,345 INFO ]: CoverageRelationStatistics Valid=53, Invalid=366, Unknown=21, NotChecked=210, Total=650 [2018-06-25 09:05:21,346 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 26 states. [2018-06-25 09:05:29,582 WARN ]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 34 [2018-06-25 09:05:30,252 WARN ]: Spent 568.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-06-25 09:05:38,215 WARN ]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 42 [2018-06-25 09:05:38,977 WARN ]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-06-25 09:05:44,501 WARN ]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 44 [2018-06-25 09:05:44,554 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:44,554 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-25 09:05:44,554 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:05:44,554 INFO ]: Start accepts. Automaton has 26 states. Word has length 18 [2018-06-25 09:05:44,554 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:44,555 INFO ]: With dead ends: 20 [2018-06-25 09:05:44,555 INFO ]: Without dead ends: 20 [2018-06-25 09:05:44,555 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=80, Invalid=724, Unknown=28, NotChecked=290, Total=1122 [2018-06-25 09:05:44,555 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:05:44,557 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-25 09:05:44,557 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:05:44,557 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-25 09:05:44,557 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-25 09:05:44,557 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:44,557 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-25 09:05:44,557 INFO ]: Interpolant automaton has 26 states. [2018-06-25 09:05:44,557 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-25 09:05:44,558 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:05:44,558 INFO ]: Found error trace [2018-06-25 09:05:44,558 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:44,558 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:44,558 INFO ]: Analyzing trace with hash 11241649, now seen corresponding path program 10 times [2018-06-25 09:05:44,558 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:44,558 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:44,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:44,559 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:44,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:44,597 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:44,992 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:44,992 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:44,992 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 09:05:45,007 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:05:45,069 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:05:45,069 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:45,079 INFO ]: Computing forward predicates... [2018-06-25 09:05:45,147 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:45,166 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:45,166 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-25 09:05:45,166 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:05:45,167 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:05:45,167 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:05:45,167 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 15 states. [2018-06-25 09:05:45,275 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:45,275 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-25 09:05:45,275 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:05:45,275 INFO ]: Start accepts. Automaton has 15 states. Word has length 19 [2018-06-25 09:05:45,276 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:45,276 INFO ]: With dead ends: 21 [2018-06-25 09:05:45,276 INFO ]: Without dead ends: 21 [2018-06-25 09:05:45,276 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:05:45,276 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 09:05:45,278 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-25 09:05:45,278 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:05:45,278 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-25 09:05:45,278 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-25 09:05:45,278 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:45,278 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-25 09:05:45,278 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:05:45,278 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-25 09:05:45,279 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:05:45,279 INFO ]: Found error trace [2018-06-25 09:05:45,279 INFO ]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:45,279 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:45,279 INFO ]: Analyzing trace with hash 344582875, now seen corresponding path program 11 times [2018-06-25 09:05:45,279 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:45,279 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:45,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:45,279 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:45,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:45,317 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:45,747 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:45,747 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:45,747 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:05:45,753 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:05:45,821 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-25 09:05:45,821 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:45,828 INFO ]: Computing forward predicates... [2018-06-25 09:05:46,388 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:46,407 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:46,407 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-06-25 09:05:46,408 INFO ]: Interpolant automaton has 30 states [2018-06-25 09:05:46,408 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-25 09:05:46,408 INFO ]: CoverageRelationStatistics Valid=66, Invalid=804, Unknown=0, NotChecked=0, Total=870 [2018-06-25 09:05:46,408 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 30 states. [2018-06-25 09:05:47,103 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:47,103 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-25 09:05:47,103 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:05:47,103 INFO ]: Start accepts. Automaton has 30 states. Word has length 20 [2018-06-25 09:05:47,103 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:47,104 INFO ]: With dead ends: 22 [2018-06-25 09:05:47,104 INFO ]: Without dead ends: 22 [2018-06-25 09:05:47,104 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=131, Invalid=1761, Unknown=0, NotChecked=0, Total=1892 [2018-06-25 09:05:47,105 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 09:05:47,106 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-25 09:05:47,106 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 09:05:47,106 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-25 09:05:47,107 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-25 09:05:47,107 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:47,107 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-25 09:05:47,107 INFO ]: Interpolant automaton has 30 states. [2018-06-25 09:05:47,107 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-25 09:05:47,107 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:05:47,107 INFO ]: Found error trace [2018-06-25 09:05:47,107 INFO ]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:47,107 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:47,108 INFO ]: Analyzing trace with hash 2088226289, now seen corresponding path program 12 times [2018-06-25 09:05:47,108 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:47,108 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:47,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:47,108 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:47,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:47,142 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:47,502 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:47,502 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:47,502 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:05:47,508 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:05:47,615 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-25 09:05:47,615 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:47,622 INFO ]: Computing forward predicates... [2018-06-25 09:05:48,670 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:48,701 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:48,701 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-06-25 09:05:48,701 INFO ]: Interpolant automaton has 32 states [2018-06-25 09:05:48,701 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-25 09:05:48,701 INFO ]: CoverageRelationStatistics Valid=70, Invalid=922, Unknown=0, NotChecked=0, Total=992 [2018-06-25 09:05:48,702 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 32 states. [2018-06-25 09:05:49,723 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:49,723 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-25 09:05:49,723 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:05:49,723 INFO ]: Start accepts. Automaton has 32 states. Word has length 21 [2018-06-25 09:05:49,723 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:49,724 INFO ]: With dead ends: 23 [2018-06-25 09:05:49,724 INFO ]: Without dead ends: 23 [2018-06-25 09:05:49,724 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=94, Invalid=1312, Unknown=0, NotChecked=0, Total=1406 [2018-06-25 09:05:49,724 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 09:05:49,726 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-25 09:05:49,726 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:05:49,726 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-06-25 09:05:49,726 INFO ]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-06-25 09:05:49,726 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:49,726 INFO ]: Abstraction has 23 states and 23 transitions. [2018-06-25 09:05:49,726 INFO ]: Interpolant automaton has 32 states. [2018-06-25 09:05:49,727 INFO ]: Start isEmpty. Operand 23 states and 23 transitions. [2018-06-25 09:05:49,727 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:05:49,727 INFO ]: Found error trace [2018-06-25 09:05:49,727 INFO ]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:49,727 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:49,727 INFO ]: Analyzing trace with hash 306597275, now seen corresponding path program 13 times [2018-06-25 09:05:49,727 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:49,727 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:49,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:49,728 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:49,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:49,774 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:50,189 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:50,189 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:50,189 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) [2018-06-25 09:05:50,202 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:05:50,253 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:50,258 INFO ]: Computing forward predicates... [2018-06-25 09:05:50,748 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:50,767 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:50,767 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-06-25 09:05:50,767 INFO ]: Interpolant automaton has 34 states [2018-06-25 09:05:50,767 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-25 09:05:50,768 INFO ]: CoverageRelationStatistics Valid=69, Invalid=1053, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:05:50,768 INFO ]: Start difference. First operand 23 states and 23 transitions. Second operand 34 states. [2018-06-25 09:05:51,542 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:51,542 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-25 09:05:51,543 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 09:05:51,543 INFO ]: Start accepts. Automaton has 34 states. Word has length 22 [2018-06-25 09:05:51,543 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:51,543 INFO ]: With dead ends: 24 [2018-06-25 09:05:51,543 INFO ]: Without dead ends: 24 [2018-06-25 09:05:51,544 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=132, Invalid=2220, Unknown=0, NotChecked=0, Total=2352 [2018-06-25 09:05:51,544 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 09:05:51,545 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-25 09:05:51,545 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 09:05:51,546 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-25 09:05:51,546 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-06-25 09:05:51,546 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:51,546 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-25 09:05:51,546 INFO ]: Interpolant automaton has 34 states. [2018-06-25 09:05:51,546 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-25 09:05:51,546 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 09:05:51,546 INFO ]: Found error trace [2018-06-25 09:05:51,546 INFO ]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:51,547 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:51,547 INFO ]: Analyzing trace with hash 910672689, now seen corresponding path program 14 times [2018-06-25 09:05:51,547 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:51,547 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:51,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:51,547 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:05:51,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:51,583 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:52,102 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:52,102 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:52,102 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:05:52,107 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:05:52,162 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:05:52,162 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:52,168 INFO ]: Computing forward predicates... [2018-06-25 09:05:52,881 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:52,902 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:52,902 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-06-25 09:05:52,903 INFO ]: Interpolant automaton has 36 states [2018-06-25 09:05:52,903 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-25 09:05:52,903 INFO ]: CoverageRelationStatistics Valid=83, Invalid=1177, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 09:05:52,903 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 36 states. [2018-06-25 09:05:53,516 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:53,516 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-25 09:05:53,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:05:53,517 INFO ]: Start accepts. Automaton has 36 states. Word has length 23 [2018-06-25 09:05:53,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:53,517 INFO ]: With dead ends: 25 [2018-06-25 09:05:53,517 INFO ]: Without dead ends: 25 [2018-06-25 09:05:53,518 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=95, Invalid=1387, Unknown=0, NotChecked=0, Total=1482 [2018-06-25 09:05:53,518 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 09:05:53,519 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-25 09:05:53,519 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-25 09:05:53,520 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-25 09:05:53,520 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-25 09:05:53,520 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:53,520 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-25 09:05:53,520 INFO ]: Interpolant automaton has 36 states. [2018-06-25 09:05:53,520 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-25 09:05:53,520 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:05:53,520 INFO ]: Found error trace [2018-06-25 09:05:53,520 INFO ]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:53,520 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:53,520 INFO ]: Analyzing trace with hash -1837825957, now seen corresponding path program 15 times [2018-06-25 09:05:53,520 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:53,520 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:53,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:53,521 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:53,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:53,565 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:53,756 WARN ]: Spent 101.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-06-25 09:05:54,126 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:54,126 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:54,126 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:05:54,132 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:05:54,198 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-25 09:05:54,198 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:54,205 INFO ]: Computing forward predicates... [2018-06-25 09:05:54,687 WARN ]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 26 Received shutdown request... [2018-06-25 09:06:03,586 INFO ]: Timeout while computing interpolants [2018-06-25 09:06:03,787 WARN ]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:06:03,787 WARN ]: Verification canceled [2018-06-25 09:06:03,791 WARN ]: Timeout [2018-06-25 09:06:03,792 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:06:03 BoogieIcfgContainer [2018-06-25 09:06:03,792 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:06:03,792 INFO ]: Toolchain (without parser) took 73526.10 ms. Allocated memory was 306.2 MB in the beginning and 461.4 MB in the end (delta: 155.2 MB). Free memory was 262.6 MB in the beginning and 316.0 MB in the end (delta: -53.4 MB). Peak memory consumption was 101.7 MB. Max. memory is 3.6 GB. [2018-06-25 09:06:03,793 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:06:03,793 INFO ]: ChcToBoogie took 53.81 ms. Allocated memory is still 306.2 MB. Free memory was 262.6 MB in the beginning and 260.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:06:03,794 INFO ]: Boogie Preprocessor took 35.19 ms. Allocated memory is still 306.2 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:06:03,794 INFO ]: RCFGBuilder took 261.93 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 250.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:06:03,794 INFO ]: TraceAbstraction took 73161.32 ms. Allocated memory was 306.2 MB in the beginning and 461.4 MB in the end (delta: 155.2 MB). Free memory was 250.6 MB in the beginning and 316.0 MB in the end (delta: -65.4 MB). Peak memory consumption was 89.7 MB. Max. memory is 3.6 GB. [2018-06-25 09:06:03,797 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 53.81 ms. Allocated memory is still 306.2 MB. Free memory was 262.6 MB in the beginning and 260.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 35.19 ms. Allocated memory is still 306.2 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 261.93 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 250.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 73161.32 ms. Allocated memory was 306.2 MB in the beginning and 461.4 MB in the end (delta: 155.2 MB). Free memory was 250.6 MB in the beginning and 316.0 MB in the end (delta: -65.4 MB). Peak memory consumption was 89.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 29 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. TIMEOUT Result, 73.0s OverallTime, 19 OverallIterations, 16 TraceHistogramMax, 29.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 130 SDtfs, 8 SDslu, 1162 SDs, 0 SdLazy, 3215 SolverSat, 38 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 485 GetRequests, 128 SyntacticMatches, 5 SemanticMatches, 352 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 46.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 31.4s InterpolantComputationTime, 494 NumberOfCodeBlocks, 494 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 461 ConstructedInterpolants, 24 QuantifiedInterpolants, 117002 SizeOfPredicates, 71 NumberOfNonLiveVariables, 4486 ConjunctsInSsa, 2378 ConjunctsInUnsatCore, 33 InterpolantComputations, 3 PerfectInterpolantSequences, 9/1601 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/004b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-06-03-811.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/004b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-06-03-811.csv Completed graceful shutdown