java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/HOLA/25.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 08:46:12,668 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 08:46:12,672 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 08:46:12,687 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 08:46:12,688 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 08:46:12,689 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 08:46:12,692 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 08:46:12,695 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 08:46:12,697 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 08:46:12,697 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 08:46:12,700 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 08:46:12,700 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 08:46:12,701 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 08:46:12,702 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 08:46:12,705 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 08:46:12,706 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 08:46:12,707 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 08:46:12,720 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 08:46:12,722 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 08:46:12,723 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 08:46:12,724 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 08:46:12,726 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 08:46:12,726 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 08:46:12,726 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 08:46:12,727 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 08:46:12,728 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 08:46:12,733 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 08:46:12,734 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 08:46:12,735 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 08:46:12,735 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 08:46:12,736 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 08:46:12,736 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 08:46:12,736 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 08:46:12,742 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 08:46:12,742 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 08:46:12,743 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 08:46:12,767 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 08:46:12,767 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 08:46:12,768 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 08:46:12,768 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 08:46:12,769 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 08:46:12,769 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 08:46:12,769 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 08:46:12,769 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 08:46:12,772 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 08:46:12,773 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 08:46:12,773 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 08:46:12,773 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 08:46:12,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 08:46:12,774 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 08:46:12,774 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 08:46:12,774 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 08:46:12,774 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 08:46:12,774 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 08:46:12,774 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 08:46:12,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 08:46:12,775 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 08:46:12,777 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 08:46:12,777 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 08:46:12,821 INFO ]: Repository-Root is: /tmp [2018-06-25 08:46:12,837 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 08:46:12,842 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 08:46:12,844 INFO ]: Initializing SmtParser... [2018-06-25 08:46:12,844 INFO ]: SmtParser initialized [2018-06-25 08:46:12,845 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/25.c.smt2 [2018-06-25 08:46:12,846 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 08:46:12,933 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/25.c.smt2 unknown [2018-06-25 08:46:13,441 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/25.c.smt2 [2018-06-25 08:46:13,446 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 08:46:13,451 INFO ]: Walking toolchain with 4 elements. [2018-06-25 08:46:13,452 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 08:46:13,452 INFO ]: Initializing ChcToBoogie... [2018-06-25 08:46:13,452 INFO ]: ChcToBoogie initialized [2018-06-25 08:46:13,455 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:46:13" (1/1) ... [2018-06-25 08:46:13,523 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:46:13 Unit [2018-06-25 08:46:13,523 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 08:46:13,524 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 08:46:13,524 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 08:46:13,524 INFO ]: Boogie Preprocessor initialized [2018-06-25 08:46:13,543 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:46:13" (1/1) ... [2018-06-25 08:46:13,543 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:46:13" (1/1) ... [2018-06-25 08:46:13,556 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:46:13" (1/1) ... [2018-06-25 08:46:13,556 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:46:13" (1/1) ... [2018-06-25 08:46:13,578 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:46:13" (1/1) ... [2018-06-25 08:46:13,580 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:46:13" (1/1) ... [2018-06-25 08:46:13,582 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:46:13" (1/1) ... [2018-06-25 08:46:13,586 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 08:46:13,589 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 08:46:13,589 INFO ]: Initializing RCFGBuilder... [2018-06-25 08:46:13,589 INFO ]: RCFGBuilder initialized [2018-06-25 08:46:13,590 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:46:13" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 08:46:13,602 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 08:46:13,602 INFO ]: Found specification of procedure gotoProc [2018-06-25 08:46:13,602 INFO ]: Found implementation of procedure gotoProc [2018-06-25 08:46:13,602 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 08:46:13,602 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 08:46:13,602 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 08:46:14,626 INFO ]: Using library mode [2018-06-25 08:46:14,627 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:46:14 BoogieIcfgContainer [2018-06-25 08:46:14,627 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 08:46:14,630 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 08:46:14,630 INFO ]: Initializing TraceAbstraction... [2018-06-25 08:46:14,633 INFO ]: TraceAbstraction initialized [2018-06-25 08:46:14,634 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:46:13" (1/3) ... [2018-06-25 08:46:14,634 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6ad22d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 08:46:14, skipping insertion in model container [2018-06-25 08:46:14,634 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:46:13" (2/3) ... [2018-06-25 08:46:14,635 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6ad22d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 08:46:14, skipping insertion in model container [2018-06-25 08:46:14,635 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:46:14" (3/3) ... [2018-06-25 08:46:14,637 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 08:46:14,646 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 08:46:14,657 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 08:46:14,708 INFO ]: Using default assertion order modulation [2018-06-25 08:46:14,708 INFO ]: Interprodecural is true [2018-06-25 08:46:14,708 INFO ]: Hoare is false [2018-06-25 08:46:14,708 INFO ]: Compute interpolants for FPandBP [2018-06-25 08:46:14,708 INFO ]: Backedges is TWOTRACK [2018-06-25 08:46:14,708 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 08:46:14,708 INFO ]: Difference is false [2018-06-25 08:46:14,708 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 08:46:14,708 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 08:46:14,732 INFO ]: Start isEmpty. Operand 46 states. [2018-06-25 08:46:14,747 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 08:46:14,747 INFO ]: Found error trace [2018-06-25 08:46:14,749 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:46:14,749 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:46:14,754 INFO ]: Analyzing trace with hash 1763110588, now seen corresponding path program 1 times [2018-06-25 08:46:14,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:46:14,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:46:14,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:14,800 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:46:14,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:14,910 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:46:15,888 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:46:15,890 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:46:15,890 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-25 08:46:15,892 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:46:15,903 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:46:15,903 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:46:15,905 INFO ]: Start difference. First operand 46 states. Second operand 13 states. [2018-06-25 08:46:16,455 WARN ]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-25 08:46:17,187 WARN ]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-06-25 08:46:17,304 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:46:17,304 INFO ]: Finished difference Result 78 states and 90 transitions. [2018-06-25 08:46:17,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 08:46:17,307 INFO ]: Start accepts. Automaton has 13 states. Word has length 19 [2018-06-25 08:46:17,307 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:46:17,316 INFO ]: With dead ends: 78 [2018-06-25 08:46:17,316 INFO ]: Without dead ends: 75 [2018-06-25 08:46:17,319 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=201, Invalid=449, Unknown=0, NotChecked=0, Total=650 [2018-06-25 08:46:17,337 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-25 08:46:17,357 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 48. [2018-06-25 08:46:17,358 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-25 08:46:17,360 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-06-25 08:46:17,361 INFO ]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 19 [2018-06-25 08:46:17,361 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:46:17,361 INFO ]: Abstraction has 48 states and 55 transitions. [2018-06-25 08:46:17,361 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:46:17,361 INFO ]: Start isEmpty. Operand 48 states and 55 transitions. [2018-06-25 08:46:17,362 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:46:17,362 INFO ]: Found error trace [2018-06-25 08:46:17,362 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:46:17,362 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:46:17,363 INFO ]: Analyzing trace with hash 428360848, now seen corresponding path program 1 times [2018-06-25 08:46:17,363 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:46:17,363 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:46:17,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:17,364 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:46:17,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:17,409 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:46:17,691 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:46:17,691 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:46:17,691 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-25 08:46:17,693 INFO ]: Interpolant automaton has 19 states [2018-06-25 08:46:17,693 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 08:46:17,693 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-25 08:46:17,693 INFO ]: Start difference. First operand 48 states and 55 transitions. Second operand 19 states. [2018-06-25 08:46:19,838 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:46:19,838 INFO ]: Finished difference Result 221 states and 261 transitions. [2018-06-25 08:46:19,839 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-06-25 08:46:19,839 INFO ]: Start accepts. Automaton has 19 states. Word has length 36 [2018-06-25 08:46:19,839 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:46:19,844 INFO ]: With dead ends: 221 [2018-06-25 08:46:19,844 INFO ]: Without dead ends: 220 [2018-06-25 08:46:19,847 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1287, Invalid=4263, Unknown=0, NotChecked=0, Total=5550 [2018-06-25 08:46:19,847 INFO ]: Start minimizeSevpa. Operand 220 states. [2018-06-25 08:46:19,857 INFO ]: Finished minimizeSevpa. Reduced states from 220 to 60. [2018-06-25 08:46:19,857 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-25 08:46:19,859 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-06-25 08:46:19,859 INFO ]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 36 [2018-06-25 08:46:19,859 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:46:19,859 INFO ]: Abstraction has 60 states and 69 transitions. [2018-06-25 08:46:19,859 INFO ]: Interpolant automaton has 19 states. [2018-06-25 08:46:19,859 INFO ]: Start isEmpty. Operand 60 states and 69 transitions. [2018-06-25 08:46:19,860 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:46:19,860 INFO ]: Found error trace [2018-06-25 08:46:19,860 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:46:19,860 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:46:19,860 INFO ]: Analyzing trace with hash 99720272, now seen corresponding path program 1 times [2018-06-25 08:46:19,861 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:46:19,861 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:46:19,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:19,862 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:46:19,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:19,890 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:46:20,257 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:46:20,257 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:46:20,257 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-25 08:46:20,257 INFO ]: Interpolant automaton has 19 states [2018-06-25 08:46:20,257 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 08:46:20,258 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-25 08:46:20,258 INFO ]: Start difference. First operand 60 states and 69 transitions. Second operand 19 states. [2018-06-25 08:46:21,383 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:46:21,383 INFO ]: Finished difference Result 166 states and 195 transitions. [2018-06-25 08:46:21,402 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-25 08:46:21,403 INFO ]: Start accepts. Automaton has 19 states. Word has length 36 [2018-06-25 08:46:21,403 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:46:21,405 INFO ]: With dead ends: 166 [2018-06-25 08:46:21,405 INFO ]: Without dead ends: 163 [2018-06-25 08:46:21,406 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=741, Invalid=1911, Unknown=0, NotChecked=0, Total=2652 [2018-06-25 08:46:21,406 INFO ]: Start minimizeSevpa. Operand 163 states. [2018-06-25 08:46:21,416 INFO ]: Finished minimizeSevpa. Reduced states from 163 to 58. [2018-06-25 08:46:21,416 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-25 08:46:21,417 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-06-25 08:46:21,417 INFO ]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 36 [2018-06-25 08:46:21,418 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:46:21,418 INFO ]: Abstraction has 58 states and 66 transitions. [2018-06-25 08:46:21,418 INFO ]: Interpolant automaton has 19 states. [2018-06-25 08:46:21,418 INFO ]: Start isEmpty. Operand 58 states and 66 transitions. [2018-06-25 08:46:21,421 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:46:21,421 INFO ]: Found error trace [2018-06-25 08:46:21,421 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:46:21,421 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:46:21,421 INFO ]: Analyzing trace with hash -1223458668, now seen corresponding path program 1 times [2018-06-25 08:46:21,421 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:46:21,421 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:46:21,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:21,422 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:46:21,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:21,451 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:46:21,782 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:46:21,782 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:46:21,782 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-25 08:46:21,783 INFO ]: Interpolant automaton has 19 states [2018-06-25 08:46:21,783 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 08:46:21,783 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-25 08:46:21,783 INFO ]: Start difference. First operand 58 states and 66 transitions. Second operand 19 states. [2018-06-25 08:46:23,162 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:46:23,162 INFO ]: Finished difference Result 225 states and 266 transitions. [2018-06-25 08:46:23,163 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-06-25 08:46:23,163 INFO ]: Start accepts. Automaton has 19 states. Word has length 36 [2018-06-25 08:46:23,163 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:46:23,165 INFO ]: With dead ends: 225 [2018-06-25 08:46:23,165 INFO ]: Without dead ends: 224 [2018-06-25 08:46:23,166 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1579 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1287, Invalid=4263, Unknown=0, NotChecked=0, Total=5550 [2018-06-25 08:46:23,167 INFO ]: Start minimizeSevpa. Operand 224 states. [2018-06-25 08:46:23,181 INFO ]: Finished minimizeSevpa. Reduced states from 224 to 70. [2018-06-25 08:46:23,181 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-25 08:46:23,182 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2018-06-25 08:46:23,182 INFO ]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 36 [2018-06-25 08:46:23,182 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:46:23,182 INFO ]: Abstraction has 70 states and 80 transitions. [2018-06-25 08:46:23,182 INFO ]: Interpolant automaton has 19 states. [2018-06-25 08:46:23,182 INFO ]: Start isEmpty. Operand 70 states and 80 transitions. [2018-06-25 08:46:23,183 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:46:23,183 INFO ]: Found error trace [2018-06-25 08:46:23,183 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:46:23,183 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:46:23,184 INFO ]: Analyzing trace with hash -1552099244, now seen corresponding path program 1 times [2018-06-25 08:46:23,184 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:46:23,184 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:46:23,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:23,184 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:46:23,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:23,203 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:46:23,386 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:46:23,386 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:46:23,386 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-25 08:46:23,386 INFO ]: Interpolant automaton has 19 states [2018-06-25 08:46:23,386 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 08:46:23,386 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-25 08:46:23,387 INFO ]: Start difference. First operand 70 states and 80 transitions. Second operand 19 states. [2018-06-25 08:46:24,235 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:46:24,235 INFO ]: Finished difference Result 170 states and 200 transitions. [2018-06-25 08:46:24,239 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-25 08:46:24,239 INFO ]: Start accepts. Automaton has 19 states. Word has length 36 [2018-06-25 08:46:24,239 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:46:24,240 INFO ]: With dead ends: 170 [2018-06-25 08:46:24,240 INFO ]: Without dead ends: 167 [2018-06-25 08:46:24,241 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=1911, Unknown=0, NotChecked=0, Total=2652 [2018-06-25 08:46:24,241 INFO ]: Start minimizeSevpa. Operand 167 states. [2018-06-25 08:46:24,247 INFO ]: Finished minimizeSevpa. Reduced states from 167 to 60. [2018-06-25 08:46:24,247 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-25 08:46:24,252 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-06-25 08:46:24,252 INFO ]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 36 [2018-06-25 08:46:24,253 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:46:24,253 INFO ]: Abstraction has 60 states and 68 transitions. [2018-06-25 08:46:24,253 INFO ]: Interpolant automaton has 19 states. [2018-06-25 08:46:24,253 INFO ]: Start isEmpty. Operand 60 states and 68 transitions. [2018-06-25 08:46:24,254 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 08:46:24,254 INFO ]: Found error trace [2018-06-25 08:46:24,254 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:46:24,254 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:46:24,254 INFO ]: Analyzing trace with hash 494594780, now seen corresponding path program 1 times [2018-06-25 08:46:24,254 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:46:24,254 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:46:24,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:24,255 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:46:24,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:24,274 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:46:25,063 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:46:25,063 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:46:25,063 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-25 08:46:25,063 INFO ]: Interpolant automaton has 10 states [2018-06-25 08:46:25,064 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 08:46:25,064 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-25 08:46:25,064 INFO ]: Start difference. First operand 60 states and 68 transitions. Second operand 10 states. [2018-06-25 08:46:25,640 WARN ]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 08:46:25,898 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:46:25,898 INFO ]: Finished difference Result 240 states and 281 transitions. [2018-06-25 08:46:25,898 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-25 08:46:25,898 INFO ]: Start accepts. Automaton has 10 states. Word has length 44 [2018-06-25 08:46:25,898 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:46:25,900 INFO ]: With dead ends: 240 [2018-06-25 08:46:25,900 INFO ]: Without dead ends: 239 [2018-06-25 08:46:25,901 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 08:46:25,901 INFO ]: Start minimizeSevpa. Operand 239 states. [2018-06-25 08:46:25,907 INFO ]: Finished minimizeSevpa. Reduced states from 239 to 67. [2018-06-25 08:46:25,907 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-25 08:46:25,910 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2018-06-25 08:46:25,910 INFO ]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 44 [2018-06-25 08:46:25,910 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:46:25,910 INFO ]: Abstraction has 67 states and 77 transitions. [2018-06-25 08:46:25,910 INFO ]: Interpolant automaton has 10 states. [2018-06-25 08:46:25,910 INFO ]: Start isEmpty. Operand 67 states and 77 transitions. [2018-06-25 08:46:25,912 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 08:46:25,912 INFO ]: Found error trace [2018-06-25 08:46:25,912 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:46:25,912 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:46:25,912 INFO ]: Analyzing trace with hash -2011997412, now seen corresponding path program 1 times [2018-06-25 08:46:25,912 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:46:25,912 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:46:25,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:25,913 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:46:25,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:25,947 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:46:26,157 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:46:26,157 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:46:26,157 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-25 08:46:26,158 INFO ]: Interpolant automaton has 10 states [2018-06-25 08:46:26,158 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 08:46:26,158 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-25 08:46:26,158 INFO ]: Start difference. First operand 67 states and 77 transitions. Second operand 10 states. [2018-06-25 08:46:26,311 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:46:26,311 INFO ]: Finished difference Result 102 states and 116 transitions. [2018-06-25 08:46:26,312 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 08:46:26,312 INFO ]: Start accepts. Automaton has 10 states. Word has length 44 [2018-06-25 08:46:26,312 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:46:26,313 INFO ]: With dead ends: 102 [2018-06-25 08:46:26,313 INFO ]: Without dead ends: 98 [2018-06-25 08:46:26,313 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-25 08:46:26,313 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-25 08:46:26,317 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 64. [2018-06-25 08:46:26,317 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-25 08:46:26,318 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2018-06-25 08:46:26,318 INFO ]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 44 [2018-06-25 08:46:26,318 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:46:26,318 INFO ]: Abstraction has 64 states and 72 transitions. [2018-06-25 08:46:26,319 INFO ]: Interpolant automaton has 10 states. [2018-06-25 08:46:26,319 INFO ]: Start isEmpty. Operand 64 states and 72 transitions. [2018-06-25 08:46:26,319 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 08:46:26,319 INFO ]: Found error trace [2018-06-25 08:46:26,320 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:46:26,320 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:46:26,320 INFO ]: Analyzing trace with hash -1856095006, now seen corresponding path program 1 times [2018-06-25 08:46:26,320 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:46:26,320 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:46:26,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:26,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:46:26,321 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:26,338 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:46:26,447 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:46:26,448 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:46:26,465 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-25 08:46:26,465 INFO ]: Interpolant automaton has 10 states [2018-06-25 08:46:26,465 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 08:46:26,465 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-25 08:46:26,465 INFO ]: Start difference. First operand 64 states and 72 transitions. Second operand 10 states. [2018-06-25 08:46:26,855 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:46:26,855 INFO ]: Finished difference Result 354 states and 411 transitions. [2018-06-25 08:46:26,855 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-25 08:46:26,855 INFO ]: Start accepts. Automaton has 10 states. Word has length 44 [2018-06-25 08:46:26,855 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:46:26,856 INFO ]: With dead ends: 354 [2018-06-25 08:46:26,856 INFO ]: Without dead ends: 353 [2018-06-25 08:46:26,857 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=416, Invalid=1306, Unknown=0, NotChecked=0, Total=1722 [2018-06-25 08:46:26,857 INFO ]: Start minimizeSevpa. Operand 353 states. [2018-06-25 08:46:26,863 INFO ]: Finished minimizeSevpa. Reduced states from 353 to 67. [2018-06-25 08:46:26,863 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-25 08:46:26,864 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2018-06-25 08:46:26,864 INFO ]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 44 [2018-06-25 08:46:26,864 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:46:26,864 INFO ]: Abstraction has 67 states and 76 transitions. [2018-06-25 08:46:26,864 INFO ]: Interpolant automaton has 10 states. [2018-06-25 08:46:26,864 INFO ]: Start isEmpty. Operand 67 states and 76 transitions. [2018-06-25 08:46:26,865 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 08:46:26,865 INFO ]: Found error trace [2018-06-25 08:46:26,865 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:46:26,865 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:46:26,865 INFO ]: Analyzing trace with hash -67719902, now seen corresponding path program 1 times [2018-06-25 08:46:26,865 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:46:26,865 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:46:26,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:26,868 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:46:26,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:26,884 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:46:27,615 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:46:27,616 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:46:27,616 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-25 08:46:27,616 INFO ]: Interpolant automaton has 10 states [2018-06-25 08:46:27,616 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 08:46:27,616 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-25 08:46:27,616 INFO ]: Start difference. First operand 67 states and 76 transitions. Second operand 10 states. [2018-06-25 08:46:28,360 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:46:28,360 INFO ]: Finished difference Result 160 states and 182 transitions. [2018-06-25 08:46:28,360 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 08:46:28,360 INFO ]: Start accepts. Automaton has 10 states. Word has length 44 [2018-06-25 08:46:28,361 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:46:28,361 INFO ]: With dead ends: 160 [2018-06-25 08:46:28,361 INFO ]: Without dead ends: 157 [2018-06-25 08:46:28,362 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2018-06-25 08:46:28,362 INFO ]: Start minimizeSevpa. Operand 157 states. [2018-06-25 08:46:28,367 INFO ]: Finished minimizeSevpa. Reduced states from 157 to 65. [2018-06-25 08:46:28,367 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-25 08:46:28,367 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2018-06-25 08:46:28,367 INFO ]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 44 [2018-06-25 08:46:28,368 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:46:28,368 INFO ]: Abstraction has 65 states and 73 transitions. [2018-06-25 08:46:28,368 INFO ]: Interpolant automaton has 10 states. [2018-06-25 08:46:28,368 INFO ]: Start isEmpty. Operand 65 states and 73 transitions. [2018-06-25 08:46:28,368 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 08:46:28,368 INFO ]: Found error trace [2018-06-25 08:46:28,368 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:46:28,369 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:46:28,369 INFO ]: Analyzing trace with hash -1214538462, now seen corresponding path program 1 times [2018-06-25 08:46:28,369 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:46:28,369 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:46:28,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:28,369 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:46:28,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:28,386 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:46:28,571 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:46:28,571 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:46:28,571 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-25 08:46:28,571 INFO ]: Interpolant automaton has 10 states [2018-06-25 08:46:28,571 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 08:46:28,571 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-25 08:46:28,571 INFO ]: Start difference. First operand 65 states and 73 transitions. Second operand 10 states. [2018-06-25 08:46:28,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:46:28,886 INFO ]: Finished difference Result 279 states and 321 transitions. [2018-06-25 08:46:28,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-25 08:46:28,886 INFO ]: Start accepts. Automaton has 10 states. Word has length 44 [2018-06-25 08:46:28,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:46:28,888 INFO ]: With dead ends: 279 [2018-06-25 08:46:28,888 INFO ]: Without dead ends: 278 [2018-06-25 08:46:28,888 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 08:46:28,888 INFO ]: Start minimizeSevpa. Operand 278 states. [2018-06-25 08:46:28,894 INFO ]: Finished minimizeSevpa. Reduced states from 278 to 67. [2018-06-25 08:46:28,894 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-25 08:46:28,895 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-06-25 08:46:28,895 INFO ]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 44 [2018-06-25 08:46:28,895 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:46:28,895 INFO ]: Abstraction has 67 states and 75 transitions. [2018-06-25 08:46:28,895 INFO ]: Interpolant automaton has 10 states. [2018-06-25 08:46:28,895 INFO ]: Start isEmpty. Operand 67 states and 75 transitions. [2018-06-25 08:46:28,896 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 08:46:28,896 INFO ]: Found error trace [2018-06-25 08:46:28,896 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:46:28,896 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:46:28,896 INFO ]: Analyzing trace with hash 573836642, now seen corresponding path program 1 times [2018-06-25 08:46:28,896 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:46:28,896 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:46:28,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:28,897 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:46:28,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:46:28,916 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:46:28,999 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:46:29,000 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:46:29,000 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-25 08:46:29,000 INFO ]: Interpolant automaton has 10 states [2018-06-25 08:46:29,000 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 08:46:29,000 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-25 08:46:29,000 INFO ]: Start difference. First operand 67 states and 75 transitions. Second operand 10 states. [2018-06-25 08:46:29,079 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:46:29,079 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-25 08:46:29,079 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 08:46:29,079 INFO ]: Start accepts. Automaton has 10 states. Word has length 44 [2018-06-25 08:46:29,079 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:46:29,079 INFO ]: With dead ends: 28 [2018-06-25 08:46:29,079 INFO ]: Without dead ends: 0 [2018-06-25 08:46:29,080 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-06-25 08:46:29,080 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 08:46:29,080 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 08:46:29,080 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 08:46:29,080 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 08:46:29,080 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-06-25 08:46:29,080 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:46:29,080 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 08:46:29,080 INFO ]: Interpolant automaton has 10 states. [2018-06-25 08:46:29,080 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 08:46:29,080 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 08:46:29,084 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 08:46:29 BoogieIcfgContainer [2018-06-25 08:46:29,084 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 08:46:29,085 INFO ]: Toolchain (without parser) took 15638.79 ms. Allocated memory was 306.7 MB in the beginning and 500.7 MB in the end (delta: 194.0 MB). Free memory was 238.0 MB in the beginning and 225.2 MB in the end (delta: 12.9 MB). Peak memory consumption was 206.9 MB. Max. memory is 3.6 GB. [2018-06-25 08:46:29,086 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 08:46:29,086 INFO ]: ChcToBoogie took 71.64 ms. Allocated memory is still 306.7 MB. Free memory was 238.0 MB in the beginning and 235.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:46:29,087 INFO ]: Boogie Preprocessor took 62.57 ms. Allocated memory is still 306.7 MB. Free memory was 235.1 MB in the beginning and 233.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:46:29,087 INFO ]: RCFGBuilder took 1038.14 ms. Allocated memory was 306.7 MB in the beginning and 328.2 MB in the end (delta: 21.5 MB). Free memory was 233.1 MB in the beginning and 294.6 MB in the end (delta: -61.6 MB). Peak memory consumption was 53.3 MB. Max. memory is 3.6 GB. [2018-06-25 08:46:29,087 INFO ]: TraceAbstraction took 14454.23 ms. Allocated memory was 328.2 MB in the beginning and 500.7 MB in the end (delta: 172.5 MB). Free memory was 294.6 MB in the beginning and 225.2 MB in the end (delta: 69.4 MB). Peak memory consumption was 241.9 MB. Max. memory is 3.6 GB. [2018-06-25 08:46:29,089 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 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 71.64 ms. Allocated memory is still 306.7 MB. Free memory was 238.0 MB in the beginning and 235.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 62.57 ms. Allocated memory is still 306.7 MB. Free memory was 235.1 MB in the beginning and 233.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1038.14 ms. Allocated memory was 306.7 MB in the beginning and 328.2 MB in the end (delta: 21.5 MB). Free memory was 233.1 MB in the beginning and 294.6 MB in the end (delta: -61.6 MB). Peak memory consumption was 53.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 14454.23 ms. Allocated memory was 328.2 MB in the beginning and 500.7 MB in the end (delta: 172.5 MB). Free memory was 294.6 MB in the beginning and 225.2 MB in the end (delta: 69.4 MB). Peak memory consumption was 241.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. SAFE Result, 14.3s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 9.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 796 SDtfs, 6128 SDslu, 8669 SDs, 0 SdLazy, 1624 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 470 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 426 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5360 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 1348 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 427 NumberOfCodeBlocks, 427 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 416 ConstructedInterpolants, 0 QuantifiedInterpolants, 26790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 64/64 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/25.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_08-46-29-113.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/25.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_08-46-29-113.csv Received shutdown request...