java -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/chccomp2018/chcToBoogie_automizer.epf -i /storage/chc-comp/vmt-chc-benchmarks/ctigar/NetBSD_loop_int.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-55b8104 [2018-06-18 13:35:55,578 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-18 13:35:55,580 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-18 13:35:55,594 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-18 13:35:55,594 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-18 13:35:55,595 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-18 13:35:55,597 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-18 13:35:55,601 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-18 13:35:55,602 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-18 13:35:55,603 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-18 13:35:55,604 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-18 13:35:55,604 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-18 13:35:55,607 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-18 13:35:55,608 INFO L177 SettingsManager]: ChcToBoogie provides no preferences, ignoring... [2018-06-18 13:35:55,608 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-18 13:35:55,609 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-18 13:35:55,614 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-18 13:35:55,616 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-18 13:35:55,628 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-18 13:35:55,629 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-18 13:35:55,630 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-18 13:35:55,632 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-18 13:35:55,633 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-18 13:35:55,633 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-18 13:35:55,634 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-18 13:35:55,635 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-18 13:35:55,639 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-18 13:35:55,640 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-18 13:35:55,641 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-18 13:35:55,641 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-18 13:35:55,642 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-18 13:35:55,649 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-18 13:35:55,649 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-18 13:35:55,650 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-18 13:35:55,651 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-18 13:35:55,651 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chccomp2018/chcToBoogie_automizer.epf [2018-06-18 13:35:55,673 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-18 13:35:55,673 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-18 13:35:55,674 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-18 13:35:55,674 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-18 13:35:55,676 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-18 13:35:55,676 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-18 13:35:55,676 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-18 13:35:55,676 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-18 13:35:55,677 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-18 13:35:55,677 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-18 13:35:55,677 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-18 13:35:55,677 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-18 13:35:55,677 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-18 13:35:55,678 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-18 13:35:55,678 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-18 13:35:55,678 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-18 13:35:55,678 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-18 13:35:55,680 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-18 13:35:55,680 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-18 13:35:55,726 INFO ]: Repository-Root is: /tmp [2018-06-18 13:35:55,741 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-18 13:35:55,748 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-18 13:35:55,749 INFO ]: Initializing SmtParser... [2018-06-18 13:35:55,750 INFO ]: SmtParser initialized [2018-06-18 13:35:55,750 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/NetBSD_loop_int.c.smt2 [2018-06-18 13:35:55,752 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-18 13:35:55,844 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/NetBSD_loop_int.c.smt2 unknown [2018-06-18 13:35:56,172 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/NetBSD_loop_int.c.smt2 [2018-06-18 13:35:56,177 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-18 13:35:56,182 INFO ]: Walking toolchain with 4 elements. [2018-06-18 13:35:56,182 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-18 13:35:56,182 INFO ]: Initializing ChcToBoogie... [2018-06-18 13:35:56,183 INFO ]: ChcToBoogie initialized [2018-06-18 13:35:56,189 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 01:35:56" (1/1) ... [2018-06-18 13:35:56,292 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:35:56 Unit [2018-06-18 13:35:56,292 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-18 13:35:56,294 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-18 13:35:56,294 INFO ]: Initializing Boogie Preprocessor... [2018-06-18 13:35:56,294 INFO ]: Boogie Preprocessor initialized [2018-06-18 13:35:56,315 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:35:56" (1/1) ... [2018-06-18 13:35:56,315 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:35:56" (1/1) ... [2018-06-18 13:35:56,333 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:35:56" (1/1) ... [2018-06-18 13:35:56,333 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:35:56" (1/1) ... [2018-06-18 13:35:56,348 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:35:56" (1/1) ... [2018-06-18 13:35:56,349 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:35:56" (1/1) ... [2018-06-18 13:35:56,351 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:35:56" (1/1) ... [2018-06-18 13:35:56,354 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-18 13:35:56,355 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-18 13:35:56,355 INFO ]: Initializing RCFGBuilder... [2018-06-18 13:35:56,355 INFO ]: RCFGBuilder initialized [2018-06-18 13:35:56,356 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:35:56" (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-18 13:35:56,379 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-18 13:35:56,379 INFO ]: Found specification of procedure False [2018-06-18 13:35:56,379 INFO ]: Found implementation of procedure False [2018-06-18 13:35:56,379 INFO ]: Specification and implementation of procedure state given in one single declaration [2018-06-18 13:35:56,379 INFO ]: Found specification of procedure state [2018-06-18 13:35:56,379 INFO ]: Found implementation of procedure state [2018-06-18 13:35:56,379 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-18 13:35:56,379 INFO ]: Found specification of procedure Ultimate.START [2018-06-18 13:35:56,379 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-18 13:35:56,673 INFO ]: Using library mode [2018-06-18 13:35:56,674 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 01:35:56 BoogieIcfgContainer [2018-06-18 13:35:56,674 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-18 13:35:56,675 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-18 13:35:56,675 INFO ]: Initializing TraceAbstraction... [2018-06-18 13:35:56,678 INFO ]: TraceAbstraction initialized [2018-06-18 13:35:56,678 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 01:35:56" (1/3) ... [2018-06-18 13:35:56,679 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afec59c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 18.06 01:35:56, skipping insertion in model container [2018-06-18 13:35:56,679 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:35:56" (2/3) ... [2018-06-18 13:35:56,680 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afec59c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.06 01:35:56, skipping insertion in model container [2018-06-18 13:35:56,680 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 01:35:56" (3/3) ... [2018-06-18 13:35:56,681 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-18 13:35:56,695 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-18 13:35:56,710 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-18 13:35:56,745 INFO ]: Using default assertion order modulation [2018-06-18 13:35:56,745 INFO ]: Interprodecural is true [2018-06-18 13:35:56,745 INFO ]: Hoare is false [2018-06-18 13:35:56,745 INFO ]: Compute interpolants for FPandBP [2018-06-18 13:35:56,745 INFO ]: Backedges is TWOTRACK [2018-06-18 13:35:56,745 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-18 13:35:56,746 INFO ]: Difference is false [2018-06-18 13:35:56,746 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-18 13:35:56,746 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-18 13:35:56,758 INFO ]: Start isEmpty. Operand 13 states. [2018-06-18 13:35:56,768 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 13:35:56,768 INFO ]: Found error trace [2018-06-18 13:35:56,769 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:35:56,769 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:35:56,773 INFO ]: Analyzing trace with hash -683425083, now seen corresponding path program 1 times [2018-06-18 13:35:56,774 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:35:56,775 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:35:56,817 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:35:56,817 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:35:56,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:35:56,855 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:35:56,862 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:35:56,951 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 13:35:56,952 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 13:35:56,953 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 13:35:56,954 INFO ]: Interpolant automaton has 4 states [2018-06-18 13:35:56,968 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 13:35:56,969 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 13:35:56,971 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-18 13:35:57,057 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:35:57,057 INFO ]: Finished difference Result 13 states and 14 transitions. [2018-06-18 13:35:57,058 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 13:35:57,059 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 13:35:57,060 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:35:57,072 INFO ]: With dead ends: 13 [2018-06-18 13:35:57,072 INFO ]: Without dead ends: 13 [2018-06-18 13:35:57,074 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 13:35:57,093 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-18 13:35:57,114 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-18 13:35:57,115 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-18 13:35:57,116 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-18 13:35:57,117 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2018-06-18 13:35:57,117 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:35:57,117 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-18 13:35:57,117 INFO ]: Interpolant automaton has 4 states. [2018-06-18 13:35:57,117 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-18 13:35:57,119 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 13:35:57,119 INFO ]: Found error trace [2018-06-18 13:35:57,119 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:35:57,119 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:35:57,119 INFO ]: Analyzing trace with hash 204343015, now seen corresponding path program 1 times [2018-06-18 13:35:57,119 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:35:57,119 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:35:57,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:35:57,120 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:35:57,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:35:57,201 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:35:57,202 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:35:57,714 WARN ]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-06-18 13:35:57,717 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 13:35:57,717 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:35:57,717 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-18 13:35:57,725 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:35:57,773 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:35:57,784 INFO ]: Computing forward predicates... [2018-06-18 13:35:58,099 WARN ]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-18 13:35:58,493 WARN ]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-06-18 13:35:58,498 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 13:35:58,520 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:35:58,520 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-18 13:35:58,551 INFO ]: Interpolant automaton has 9 states [2018-06-18 13:35:58,551 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-18 13:35:58,552 INFO ]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-18 13:35:58,552 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 9 states. [2018-06-18 13:35:59,237 WARN ]: Spent 489.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-06-18 13:35:59,395 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:35:59,395 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-18 13:35:59,395 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 13:35:59,395 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-18 13:35:59,396 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:35:59,396 INFO ]: With dead ends: 15 [2018-06-18 13:35:59,396 INFO ]: Without dead ends: 15 [2018-06-18 13:35:59,397 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-18 13:35:59,397 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-18 13:35:59,400 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-18 13:35:59,400 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-18 13:35:59,400 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-18 13:35:59,400 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-18 13:35:59,401 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:35:59,401 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-18 13:35:59,401 INFO ]: Interpolant automaton has 9 states. [2018-06-18 13:35:59,401 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-18 13:35:59,401 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 13:35:59,401 INFO ]: Found error trace [2018-06-18 13:35:59,401 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:35:59,401 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:35:59,401 INFO ]: Analyzing trace with hash -1649658231, now seen corresponding path program 2 times [2018-06-18 13:35:59,401 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:35:59,401 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:35:59,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:35:59,402 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:35:59,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:35:59,470 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:35:59,471 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:35:59,753 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 13:35:59,753 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:35:59,753 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-18 13:35:59,760 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 13:35:59,808 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 13:35:59,808 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:35:59,811 INFO ]: Computing forward predicates... [2018-06-18 13:36:00,192 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 13:36:00,225 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:36:00,225 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-18 13:36:00,225 INFO ]: Interpolant automaton has 11 states [2018-06-18 13:36:00,226 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-18 13:36:00,226 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-18 13:36:00,226 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 11 states. [2018-06-18 13:36:00,518 WARN ]: Spent 237.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-06-18 13:36:00,766 WARN ]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-06-18 13:36:00,791 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:36:00,791 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-18 13:36:00,796 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-18 13:36:00,796 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-18 13:36:00,796 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:36:00,797 INFO ]: With dead ends: 17 [2018-06-18 13:36:00,797 INFO ]: Without dead ends: 17 [2018-06-18 13:36:00,797 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-06-18 13:36:00,797 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-18 13:36:00,800 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-18 13:36:00,800 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-18 13:36:00,801 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-18 13:36:00,801 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 17 [2018-06-18 13:36:00,801 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:36:00,801 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-18 13:36:00,801 INFO ]: Interpolant automaton has 11 states. [2018-06-18 13:36:00,801 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-18 13:36:00,802 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-18 13:36:00,802 INFO ]: Found error trace [2018-06-18 13:36:00,802 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:36:00,802 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:36:00,802 INFO ]: Analyzing trace with hash 2119922091, now seen corresponding path program 3 times [2018-06-18 13:36:00,802 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:36:00,802 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:36:00,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:00,803 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:36:00,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:00,852 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:00,854 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:36:01,396 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-18 13:36:01,396 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:36:01,396 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-18 13:36:01,405 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-18 13:36:01,472 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-18 13:36:01,472 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:01,477 INFO ]: Computing forward predicates... [2018-06-18 13:36:01,872 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-18 13:36:01,892 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:36:01,892 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-18 13:36:01,893 INFO ]: Interpolant automaton has 13 states [2018-06-18 13:36:01,893 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-18 13:36:01,893 INFO ]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-06-18 13:36:01,893 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 13 states. [2018-06-18 13:36:02,105 WARN ]: Spent 155.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2018-06-18 13:36:02,279 WARN ]: Spent 139.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2018-06-18 13:36:02,486 WARN ]: Spent 160.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27 [2018-06-18 13:36:02,630 WARN ]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2018-06-18 13:36:02,651 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:36:02,651 INFO ]: Finished difference Result 19 states and 20 transitions. [2018-06-18 13:36:02,653 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 13:36:02,653 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-18 13:36:02,653 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:36:02,653 INFO ]: With dead ends: 19 [2018-06-18 13:36:02,653 INFO ]: Without dead ends: 19 [2018-06-18 13:36:02,654 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-06-18 13:36:02,654 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-18 13:36:02,657 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-18 13:36:02,657 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-18 13:36:02,657 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-18 13:36:02,657 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 21 [2018-06-18 13:36:02,658 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:36:02,658 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-18 13:36:02,658 INFO ]: Interpolant automaton has 13 states. [2018-06-18 13:36:02,658 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-18 13:36:02,658 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-18 13:36:02,658 INFO ]: Found error trace [2018-06-18 13:36:02,658 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:36:02,659 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:36:02,659 INFO ]: Analyzing trace with hash 1762711629, now seen corresponding path program 4 times [2018-06-18 13:36:02,659 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:36:02,659 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:36:02,659 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:02,659 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:36:02,659 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:02,714 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:02,714 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:36:03,210 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-18 13:36:03,211 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:36:03,211 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-18 13:36:03,216 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-18 13:36:03,276 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-18 13:36:03,276 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:03,281 INFO ]: Computing forward predicates... [2018-06-18 13:36:03,772 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-18 13:36:03,793 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:36:03,802 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-06-18 13:36:03,803 INFO ]: Interpolant automaton has 17 states [2018-06-18 13:36:03,803 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-18 13:36:03,803 INFO ]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-06-18 13:36:03,803 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 17 states. [2018-06-18 13:36:04,093 WARN ]: Spent 255.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2018-06-18 13:36:04,251 WARN ]: Spent 135.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2018-06-18 13:36:04,494 WARN ]: Spent 224.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2018-06-18 13:36:04,723 WARN ]: Spent 212.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-06-18 13:36:04,930 WARN ]: Spent 183.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-06-18 13:36:04,960 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:36:04,960 INFO ]: Finished difference Result 21 states and 22 transitions. [2018-06-18 13:36:04,963 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-18 13:36:04,963 INFO ]: Start accepts. Automaton has 17 states. Word has length 25 [2018-06-18 13:36:04,963 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:36:04,964 INFO ]: With dead ends: 21 [2018-06-18 13:36:04,964 INFO ]: Without dead ends: 21 [2018-06-18 13:36:04,964 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-06-18 13:36:04,964 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-18 13:36:04,967 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-18 13:36:04,967 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-18 13:36:04,968 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-18 13:36:04,968 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 25 [2018-06-18 13:36:04,968 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:36:04,968 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-18 13:36:04,968 INFO ]: Interpolant automaton has 17 states. [2018-06-18 13:36:04,968 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-18 13:36:04,969 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-18 13:36:04,969 INFO ]: Found error trace [2018-06-18 13:36:04,969 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:36:04,969 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:36:04,969 INFO ]: Analyzing trace with hash 853117551, now seen corresponding path program 5 times [2018-06-18 13:36:04,969 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:36:04,969 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:36:04,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:04,970 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:36:04,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:05,037 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:05,038 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:36:05,773 INFO ]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-18 13:36:05,773 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:36:05,773 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-18 13:36:05,781 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-18 13:36:05,911 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-18 13:36:05,911 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:05,918 INFO ]: Computing forward predicates... [2018-06-18 13:36:06,566 WARN ]: Spent 266.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2018-06-18 13:36:07,350 INFO ]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-18 13:36:07,388 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:36:07,388 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-06-18 13:36:07,389 INFO ]: Interpolant automaton has 20 states [2018-06-18 13:36:07,389 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-18 13:36:07,389 INFO ]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-06-18 13:36:07,389 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 20 states. [2018-06-18 13:36:07,900 WARN ]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-18 13:36:08,283 WARN ]: Spent 303.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-06-18 13:36:08,454 WARN ]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2018-06-18 13:36:08,668 WARN ]: Spent 188.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2018-06-18 13:36:08,904 WARN ]: Spent 198.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2018-06-18 13:36:09,145 WARN ]: Spent 217.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2018-06-18 13:36:09,295 WARN ]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 37 [2018-06-18 13:36:09,334 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:36:09,335 INFO ]: Finished difference Result 23 states and 24 transitions. [2018-06-18 13:36:09,336 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-18 13:36:09,336 INFO ]: Start accepts. Automaton has 20 states. Word has length 29 [2018-06-18 13:36:09,336 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:36:09,337 INFO ]: With dead ends: 23 [2018-06-18 13:36:09,337 INFO ]: Without dead ends: 23 [2018-06-18 13:36:09,338 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2018-06-18 13:36:09,338 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-18 13:36:09,343 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-18 13:36:09,343 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-18 13:36:09,343 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-18 13:36:09,343 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 29 [2018-06-18 13:36:09,344 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:36:09,344 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-18 13:36:09,344 INFO ]: Interpolant automaton has 20 states. [2018-06-18 13:36:09,344 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-18 13:36:09,345 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-18 13:36:09,345 INFO ]: Found error trace [2018-06-18 13:36:09,345 INFO ]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:36:09,346 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:36:09,346 INFO ]: Analyzing trace with hash -1661294575, now seen corresponding path program 6 times [2018-06-18 13:36:09,346 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:36:09,346 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:36:09,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:09,347 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:36:09,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:09,425 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:09,426 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:36:10,106 WARN ]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-18 13:36:10,430 WARN ]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-18 13:36:10,746 INFO ]: Checked inductivity of 78 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-18 13:36:10,746 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:36:10,746 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:36:10,752 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-18 13:36:10,850 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-18 13:36:10,850 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:10,858 INFO ]: Computing forward predicates... [2018-06-18 13:36:13,833 WARN ]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-18 13:36:13,848 INFO ]: Checked inductivity of 78 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-18 13:36:13,877 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:36:13,877 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 20 [2018-06-18 13:36:13,878 INFO ]: Interpolant automaton has 20 states [2018-06-18 13:36:13,878 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-18 13:36:13,878 INFO ]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-06-18 13:36:13,878 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 20 states. [2018-06-18 13:36:14,130 WARN ]: Spent 182.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2018-06-18 13:36:14,493 WARN ]: Spent 155.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 30 [2018-06-18 13:36:14,711 WARN ]: Spent 198.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2018-06-18 13:36:14,839 WARN ]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 31 [2018-06-18 13:36:15,027 WARN ]: Spent 170.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 31 [2018-06-18 13:36:15,315 WARN ]: Spent 244.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2018-06-18 13:36:15,344 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:36:15,344 INFO ]: Finished difference Result 25 states and 26 transitions. [2018-06-18 13:36:15,344 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-18 13:36:15,344 INFO ]: Start accepts. Automaton has 20 states. Word has length 33 [2018-06-18 13:36:15,345 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:36:15,345 INFO ]: With dead ends: 25 [2018-06-18 13:36:15,345 INFO ]: Without dead ends: 25 [2018-06-18 13:36:15,346 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2018-06-18 13:36:15,346 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-18 13:36:15,351 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-18 13:36:15,351 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 13:36:15,353 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-18 13:36:15,353 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 33 [2018-06-18 13:36:15,353 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:36:15,353 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-18 13:36:15,353 INFO ]: Interpolant automaton has 20 states. [2018-06-18 13:36:15,353 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-18 13:36:15,354 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-18 13:36:15,354 INFO ]: Found error trace [2018-06-18 13:36:15,354 INFO ]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:36:15,354 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:36:15,354 INFO ]: Analyzing trace with hash -1494134477, now seen corresponding path program 7 times [2018-06-18 13:36:15,354 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:36:15,354 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:36:15,355 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:15,355 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:36:15,355 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:15,422 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:15,423 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:36:16,363 INFO ]: Checked inductivity of 105 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-18 13:36:16,364 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:36:16,364 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-18 13:36:16,371 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:36:16,441 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:16,448 INFO ]: Computing forward predicates... [2018-06-18 13:36:17,325 INFO ]: Checked inductivity of 105 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-18 13:36:17,346 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:36:17,346 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 21 [2018-06-18 13:36:17,346 INFO ]: Interpolant automaton has 21 states [2018-06-18 13:36:17,346 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-18 13:36:17,346 INFO ]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2018-06-18 13:36:17,347 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 21 states. [2018-06-18 13:36:17,571 WARN ]: Spent 188.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2018-06-18 13:36:17,912 WARN ]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 28 [2018-06-18 13:36:18,036 WARN ]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2018-06-18 13:36:18,404 WARN ]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2018-06-18 13:36:18,426 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:36:18,426 INFO ]: Finished difference Result 27 states and 28 transitions. [2018-06-18 13:36:18,426 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-18 13:36:18,426 INFO ]: Start accepts. Automaton has 21 states. Word has length 37 [2018-06-18 13:36:18,427 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:36:18,427 INFO ]: With dead ends: 27 [2018-06-18 13:36:18,427 INFO ]: Without dead ends: 27 [2018-06-18 13:36:18,428 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=164, Invalid=648, Unknown=0, NotChecked=0, Total=812 [2018-06-18 13:36:18,428 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-18 13:36:18,431 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-18 13:36:18,431 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-18 13:36:18,432 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-18 13:36:18,432 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 37 [2018-06-18 13:36:18,432 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:36:18,433 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-18 13:36:18,433 INFO ]: Interpolant automaton has 21 states. [2018-06-18 13:36:18,433 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-18 13:36:18,435 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-18 13:36:18,435 INFO ]: Found error trace [2018-06-18 13:36:18,435 INFO ]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:36:18,435 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:36:18,436 INFO ]: Analyzing trace with hash 1618126293, now seen corresponding path program 8 times [2018-06-18 13:36:18,436 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:36:18,436 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:36:18,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:18,436 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:36:18,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:18,499 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:18,500 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:36:19,230 INFO ]: Checked inductivity of 136 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-18 13:36:19,230 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:36:19,230 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-18 13:36:19,237 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 13:36:19,336 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 13:36:19,336 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:19,344 INFO ]: Computing forward predicates... [2018-06-18 13:36:20,109 INFO ]: Checked inductivity of 136 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-18 13:36:20,129 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:36:20,129 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 26 [2018-06-18 13:36:20,130 INFO ]: Interpolant automaton has 26 states [2018-06-18 13:36:20,130 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-18 13:36:20,130 INFO ]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2018-06-18 13:36:20,130 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 26 states. [2018-06-18 13:36:20,548 WARN ]: Spent 357.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2018-06-18 13:36:20,902 WARN ]: Spent 191.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2018-06-18 13:36:21,086 WARN ]: Spent 153.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 28 [2018-06-18 13:36:21,267 WARN ]: Spent 156.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2018-06-18 13:36:21,502 WARN ]: Spent 204.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 31 [2018-06-18 13:36:21,771 WARN ]: Spent 182.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2018-06-18 13:36:21,966 WARN ]: Spent 171.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 29 [2018-06-18 13:36:22,187 WARN ]: Spent 183.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2018-06-18 13:36:22,219 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:36:22,220 INFO ]: Finished difference Result 29 states and 30 transitions. [2018-06-18 13:36:22,220 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-18 13:36:22,220 INFO ]: Start accepts. Automaton has 26 states. Word has length 41 [2018-06-18 13:36:22,220 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:36:22,221 INFO ]: With dead ends: 29 [2018-06-18 13:36:22,221 INFO ]: Without dead ends: 29 [2018-06-18 13:36:22,221 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=225, Invalid=1035, Unknown=0, NotChecked=0, Total=1260 [2018-06-18 13:36:22,221 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-18 13:36:22,225 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-18 13:36:22,225 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-18 13:36:22,226 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-18 13:36:22,226 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 41 [2018-06-18 13:36:22,226 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:36:22,226 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-18 13:36:22,226 INFO ]: Interpolant automaton has 26 states. [2018-06-18 13:36:22,226 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-18 13:36:22,227 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-18 13:36:22,227 INFO ]: Found error trace [2018-06-18 13:36:22,227 INFO ]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:36:22,227 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:36:22,228 INFO ]: Analyzing trace with hash 996918775, now seen corresponding path program 9 times [2018-06-18 13:36:22,228 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:36:22,228 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:36:22,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:22,228 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:36:22,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:22,323 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:22,324 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:36:22,927 WARN ]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-18 13:36:23,628 INFO ]: Checked inductivity of 171 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-18 13:36:23,628 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:36:23,628 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-18 13:36:23,634 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-18 13:36:23,741 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-18 13:36:23,741 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:23,748 INFO ]: Computing forward predicates... [2018-06-18 13:36:24,808 INFO ]: Checked inductivity of 171 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-18 13:36:24,829 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:36:24,829 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 29 [2018-06-18 13:36:24,829 INFO ]: Interpolant automaton has 29 states [2018-06-18 13:36:24,829 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-18 13:36:24,830 INFO ]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2018-06-18 13:36:24,830 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 29 states. [2018-06-18 13:36:25,172 WARN ]: Spent 270.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2018-06-18 13:36:25,385 WARN ]: Spent 171.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 27 [2018-06-18 13:36:25,594 WARN ]: Spent 165.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2018-06-18 13:36:25,780 WARN ]: Spent 160.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2018-06-18 13:36:25,961 WARN ]: Spent 154.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 30 [2018-06-18 13:36:26,161 WARN ]: Spent 170.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2018-06-18 13:36:26,386 WARN ]: Spent 195.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 34 [2018-06-18 13:36:26,608 WARN ]: Spent 176.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 29 [2018-06-18 13:36:26,798 WARN ]: Spent 163.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 29 [2018-06-18 13:36:27,044 WARN ]: Spent 215.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2018-06-18 13:36:27,099 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:36:27,099 INFO ]: Finished difference Result 31 states and 32 transitions. [2018-06-18 13:36:27,100 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-18 13:36:27,100 INFO ]: Start accepts. Automaton has 29 states. Word has length 45 [2018-06-18 13:36:27,100 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:36:27,101 INFO ]: With dead ends: 31 [2018-06-18 13:36:27,101 INFO ]: Without dead ends: 31 [2018-06-18 13:36:27,101 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=274, Invalid=1286, Unknown=0, NotChecked=0, Total=1560 [2018-06-18 13:36:27,101 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-18 13:36:27,107 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-18 13:36:27,107 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-18 13:36:27,108 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-18 13:36:27,108 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 45 [2018-06-18 13:36:27,108 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:36:27,108 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-18 13:36:27,108 INFO ]: Interpolant automaton has 29 states. [2018-06-18 13:36:27,109 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-18 13:36:27,109 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-18 13:36:27,109 INFO ]: Found error trace [2018-06-18 13:36:27,109 INFO ]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:36:27,109 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:36:27,110 INFO ]: Analyzing trace with hash -570306151, now seen corresponding path program 10 times [2018-06-18 13:36:27,110 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:36:27,110 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:36:27,113 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:27,113 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:36:27,113 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:27,206 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:27,210 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:36:28,211 INFO ]: Checked inductivity of 210 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-18 13:36:28,211 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:36:28,211 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-18 13:36:28,217 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-18 13:36:28,335 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-18 13:36:28,336 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:28,346 INFO ]: Computing forward predicates... [2018-06-18 13:36:29,214 INFO ]: Checked inductivity of 210 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-18 13:36:29,235 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:36:29,235 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 31 [2018-06-18 13:36:29,235 INFO ]: Interpolant automaton has 31 states [2018-06-18 13:36:29,236 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-18 13:36:29,236 INFO ]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2018-06-18 13:36:29,236 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 31 states. [2018-06-18 13:36:29,773 WARN ]: Spent 418.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-06-18 13:36:29,956 WARN ]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 27 [2018-06-18 13:36:30,197 WARN ]: Spent 209.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2018-06-18 13:36:30,391 WARN ]: Spent 164.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 28 [2018-06-18 13:36:30,599 WARN ]: Spent 178.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 31 [2018-06-18 13:36:30,826 WARN ]: Spent 196.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2018-06-18 13:36:31,037 WARN ]: Spent 180.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2018-06-18 13:36:31,267 WARN ]: Spent 188.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2018-06-18 13:36:31,471 WARN ]: Spent 173.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2018-06-18 13:36:31,685 WARN ]: Spent 184.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2018-06-18 13:36:31,974 WARN ]: Spent 255.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2018-06-18 13:36:32,005 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:36:32,005 INFO ]: Finished difference Result 33 states and 34 transitions. [2018-06-18 13:36:32,006 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-18 13:36:32,006 INFO ]: Start accepts. Automaton has 31 states. Word has length 49 [2018-06-18 13:36:32,006 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:36:32,006 INFO ]: With dead ends: 33 [2018-06-18 13:36:32,006 INFO ]: Without dead ends: 33 [2018-06-18 13:36:32,007 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=306, Invalid=1500, Unknown=0, NotChecked=0, Total=1806 [2018-06-18 13:36:32,007 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-18 13:36:32,010 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-18 13:36:32,010 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-18 13:36:32,011 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-06-18 13:36:32,011 INFO ]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 49 [2018-06-18 13:36:32,011 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:36:32,011 INFO ]: Abstraction has 33 states and 34 transitions. [2018-06-18 13:36:32,011 INFO ]: Interpolant automaton has 31 states. [2018-06-18 13:36:32,011 INFO ]: Start isEmpty. Operand 33 states and 34 transitions. [2018-06-18 13:36:32,015 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-18 13:36:32,015 INFO ]: Found error trace [2018-06-18 13:36:32,015 INFO ]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:36:32,015 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:36:32,016 INFO ]: Analyzing trace with hash 1955719355, now seen corresponding path program 11 times [2018-06-18 13:36:32,016 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:36:32,016 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:36:32,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:32,016 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:36:32,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:32,129 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:32,130 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:36:33,170 INFO ]: Checked inductivity of 253 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-18 13:36:33,170 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:36:33,170 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:36:33,178 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-18 13:36:33,306 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-18 13:36:33,306 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:33,314 INFO ]: Computing forward predicates... [2018-06-18 13:36:33,531 WARN ]: Spent 121.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2018-06-18 13:36:34,052 WARN ]: Spent 143.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2018-06-18 13:36:34,476 INFO ]: Checked inductivity of 253 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-18 13:36:34,496 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:36:34,496 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 32 [2018-06-18 13:36:34,497 INFO ]: Interpolant automaton has 32 states [2018-06-18 13:36:34,497 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-18 13:36:34,497 INFO ]: CoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2018-06-18 13:36:34,497 INFO ]: Start difference. First operand 33 states and 34 transitions. Second operand 32 states. [2018-06-18 13:36:35,122 WARN ]: Spent 580.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2018-06-18 13:36:35,297 WARN ]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 29 [2018-06-18 13:36:35,504 WARN ]: Spent 177.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 33 [2018-06-18 13:36:35,710 WARN ]: Spent 176.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 27 [2018-06-18 13:36:35,919 WARN ]: Spent 179.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 29 [2018-06-18 13:36:36,173 WARN ]: Spent 225.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 29 [2018-06-18 13:36:36,432 WARN ]: Spent 228.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 29 [2018-06-18 13:36:36,788 WARN ]: Spent 247.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 29 [2018-06-18 13:36:37,002 WARN ]: Spent 184.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 29 [2018-06-18 13:36:37,218 WARN ]: Spent 185.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 31 [2018-06-18 13:36:37,437 WARN ]: Spent 188.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 30 [2018-06-18 13:36:37,885 WARN ]: Spent 410.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2018-06-18 13:36:37,918 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:36:37,918 INFO ]: Finished difference Result 35 states and 36 transitions. [2018-06-18 13:36:37,918 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-18 13:36:37,918 INFO ]: Start accepts. Automaton has 32 states. Word has length 53 [2018-06-18 13:36:37,919 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:36:37,919 INFO ]: With dead ends: 35 [2018-06-18 13:36:37,919 INFO ]: Without dead ends: 35 [2018-06-18 13:36:37,920 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 39 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=345, Invalid=1547, Unknown=0, NotChecked=0, Total=1892 [2018-06-18 13:36:37,920 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-18 13:36:37,923 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-18 13:36:37,923 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-18 13:36:37,924 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-06-18 13:36:37,924 INFO ]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 53 [2018-06-18 13:36:37,924 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:36:37,924 INFO ]: Abstraction has 35 states and 36 transitions. [2018-06-18 13:36:37,924 INFO ]: Interpolant automaton has 32 states. [2018-06-18 13:36:37,924 INFO ]: Start isEmpty. Operand 35 states and 36 transitions. [2018-06-18 13:36:37,926 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-18 13:36:37,926 INFO ]: Found error trace [2018-06-18 13:36:37,926 INFO ]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:36:37,926 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:36:37,926 INFO ]: Analyzing trace with hash -2085541027, now seen corresponding path program 12 times [2018-06-18 13:36:37,926 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:36:37,926 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:36:37,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:37,927 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:36:37,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:38,061 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:38,063 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:36:38,331 WARN ]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-18 13:36:39,195 INFO ]: Checked inductivity of 300 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-18 13:36:39,195 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:36:39,195 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-18 13:36:39,200 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-18 13:36:39,334 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-18 13:36:39,334 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:39,341 INFO ]: Computing forward predicates... [2018-06-18 13:36:39,634 WARN ]: Spent 167.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2018-06-18 13:36:39,945 WARN ]: Spent 131.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2018-06-18 13:36:40,493 INFO ]: Checked inductivity of 300 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-18 13:36:40,515 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:36:40,515 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 32 [2018-06-18 13:36:40,515 INFO ]: Interpolant automaton has 32 states [2018-06-18 13:36:40,515 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-18 13:36:40,515 INFO ]: CoverageRelationStatistics Valid=77, Invalid=915, Unknown=0, NotChecked=0, Total=992 [2018-06-18 13:36:40,516 INFO ]: Start difference. First operand 35 states and 36 transitions. Second operand 32 states. [2018-06-18 13:36:41,374 WARN ]: Spent 727.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2018-06-18 13:36:41,552 WARN ]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 27 [2018-06-18 13:36:41,716 WARN ]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 32 [2018-06-18 13:36:41,942 WARN ]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 30 [2018-06-18 13:36:42,160 WARN ]: Spent 180.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 31 [2018-06-18 13:36:42,398 WARN ]: Spent 201.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 31 [2018-06-18 13:36:42,592 WARN ]: Spent 143.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 33 [2018-06-18 13:36:42,795 WARN ]: Spent 167.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 29 [2018-06-18 13:36:42,998 WARN ]: Spent 168.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 31 [2018-06-18 13:36:43,217 WARN ]: Spent 182.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 32 [2018-06-18 13:36:43,559 WARN ]: Spent 175.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 31 [2018-06-18 13:36:43,797 WARN ]: Spent 171.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 31 [2018-06-18 13:36:44,104 WARN ]: Spent 264.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 42 [2018-06-18 13:36:44,144 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:36:44,144 INFO ]: Finished difference Result 37 states and 38 transitions. [2018-06-18 13:36:44,144 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-18 13:36:44,144 INFO ]: Start accepts. Automaton has 32 states. Word has length 57 [2018-06-18 13:36:44,144 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:36:44,145 INFO ]: With dead ends: 37 [2018-06-18 13:36:44,145 INFO ]: Without dead ends: 37 [2018-06-18 13:36:44,145 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 44 SyntacticMatches, 10 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=330, Invalid=1740, Unknown=0, NotChecked=0, Total=2070 [2018-06-18 13:36:44,146 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-18 13:36:44,152 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-18 13:36:44,152 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-18 13:36:44,153 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-06-18 13:36:44,153 INFO ]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 57 [2018-06-18 13:36:44,153 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:36:44,153 INFO ]: Abstraction has 37 states and 38 transitions. [2018-06-18 13:36:44,153 INFO ]: Interpolant automaton has 32 states. [2018-06-18 13:36:44,153 INFO ]: Start isEmpty. Operand 37 states and 38 transitions. [2018-06-18 13:36:44,154 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-18 13:36:44,154 INFO ]: Found error trace [2018-06-18 13:36:44,154 INFO ]: trace histogram [14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:36:44,154 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:36:44,154 INFO ]: Analyzing trace with hash 976009599, now seen corresponding path program 13 times [2018-06-18 13:36:44,154 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:36:44,154 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:36:44,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:44,155 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:36:44,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:36:44,254 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:44,255 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:36:44,596 WARN ]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2018-06-18 13:36:45,863 INFO ]: Checked inductivity of 351 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-18 13:36:45,863 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:36:45,863 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-18 13:36:45,870 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:36:45,999 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:36:46,007 INFO ]: Computing forward predicates... [2018-06-18 13:36:46,411 WARN ]: Spent 165.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2018-06-18 13:36:46,609 WARN ]: Spent 135.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2018-06-18 13:36:49,778 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-18 13:36:50,259 INFO ]: Checked inductivity of 351 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-18 13:36:50,280 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:36:50,280 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 57 [2018-06-18 13:36:50,280 INFO ]: Interpolant automaton has 57 states [2018-06-18 13:36:50,281 INFO ]: Constructing interpolant automaton starting with 57 interpolants. [2018-06-18 13:36:50,281 INFO ]: CoverageRelationStatistics Valid=168, Invalid=3024, Unknown=0, NotChecked=0, Total=3192 [2018-06-18 13:36:50,281 INFO ]: Start difference. First operand 37 states and 38 transitions. Second operand 57 states. [2018-06-18 13:36:51,366 WARN ]: Spent 890.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 111 [2018-06-18 13:36:51,753 WARN ]: Spent 306.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 42 [2018-06-18 13:36:52,138 WARN ]: Spent 304.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 50 [2018-06-18 13:36:52,560 WARN ]: Spent 282.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 53 [2018-06-18 13:36:52,920 WARN ]: Spent 276.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 51 [2018-06-18 13:36:53,318 WARN ]: Spent 310.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 50 [2018-06-18 13:36:53,735 WARN ]: Spent 329.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 51 [2018-06-18 13:36:54,123 WARN ]: Spent 298.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 51 [2018-06-18 13:36:54,512 WARN ]: Spent 299.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 50 [2018-06-18 13:36:54,943 WARN ]: Spent 340.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 55 [2018-06-18 13:36:55,384 WARN ]: Spent 351.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 55 [2018-06-18 13:36:55,785 WARN ]: Spent 312.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 45 Received shutdown request... [2018-06-18 13:36:56,125 WARN ]: Removed 2 from assertion stack [2018-06-18 13:36:56,142 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-18 13:36:56,142 WARN ]: Verification canceled [2018-06-18 13:36:56,147 WARN ]: Timeout [2018-06-18 13:36:56,147 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.06 01:36:56 BoogieIcfgContainer [2018-06-18 13:36:56,147 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-18 13:36:56,148 INFO ]: Toolchain (without parser) took 59970.90 ms. Allocated memory was 309.3 MB in the beginning and 901.3 MB in the end (delta: 591.9 MB). Free memory was 257.9 MB in the beginning and 831.9 MB in the end (delta: -574.0 MB). Peak memory consumption was 646.7 MB. Max. memory is 3.6 GB. [2018-06-18 13:36:56,149 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-18 13:36:56,149 INFO ]: ChcToBoogie took 111.41 ms. Allocated memory is still 309.3 MB. Free memory was 257.9 MB in the beginning and 253.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-18 13:36:56,149 INFO ]: Boogie Preprocessor took 60.01 ms. Allocated memory is still 309.3 MB. Free memory was 253.9 MB in the beginning and 251.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-18 13:36:56,155 INFO ]: RCFGBuilder took 319.25 ms. Allocated memory is still 309.3 MB. Free memory was 251.9 MB in the beginning and 239.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-18 13:36:56,155 INFO ]: TraceAbstraction took 59472.04 ms. Allocated memory was 309.3 MB in the beginning and 901.3 MB in the end (delta: 591.9 MB). Free memory was 239.9 MB in the beginning and 831.9 MB in the end (delta: -592.0 MB). Peak memory consumption was 628.7 MB. Max. memory is 3.6 GB. [2018-06-18 13:36:56,159 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 111.41 ms. Allocated memory is still 309.3 MB. Free memory was 257.9 MB in the beginning and 253.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 60.01 ms. Allocated memory is still 309.3 MB. Free memory was 253.9 MB in the beginning and 251.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 319.25 ms. Allocated memory is still 309.3 MB. Free memory was 251.9 MB in the beginning and 239.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59472.04 ms. Allocated memory was 309.3 MB in the beginning and 901.3 MB in the end (delta: 591.9 MB). Free memory was 239.9 MB in the beginning and 831.9 MB in the end (delta: -592.0 MB). Peak memory consumption was 628.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 constructing difference of abstraction (37states) and interpolant automaton (currently 16 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 148. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 13 locations, 1 error locations. TIMEOUT Result, 59.4s OverallTime, 14 OverallIterations, 14 TraceHistogramMax, 28.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 219 SDtfs, 1177 SDslu, 1943 SDs, 0 SdLazy, 1865 SolverSat, 1384 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 819 GetRequests, 364 SyntacticMatches, 48 SemanticMatches, 406 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 44.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=13, 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, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 28.3s InterpolantComputationTime, 971 NumberOfCodeBlocks, 971 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 944 ConstructedInterpolants, 0 QuantifiedInterpolants, 713440 SizeOfPredicates, 2182 NumberOfNonLiveVariables, 5811 ConjunctsInSsa, 768 ConjunctsInUnsatCore, 27 InterpolantComputations, 1 PerfectInterpolantSequences, 910/3458 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/NetBSD_loop_int.c.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-18_13-36-56-177.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/NetBSD_loop_int.c.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-18_13-36-56-177.csv Completed graceful shutdown