java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/018-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:17:42,084 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:17:42,086 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:17:42,097 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:17:42,098 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:17:42,099 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:17:42,100 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:17:42,101 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:17:42,103 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:17:42,104 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:17:42,105 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:17:42,105 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:17:42,106 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:17:42,107 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:17:42,108 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:17:42,108 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:17:42,110 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:17:42,112 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:17:42,114 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:17:42,115 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:17:42,116 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:17:42,118 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:17:42,119 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:17:42,119 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:17:42,120 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:17:42,121 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:17:42,122 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:17:42,122 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:17:42,123 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:17:42,124 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:17:42,124 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:17:42,125 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:17:42,125 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:17:42,126 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:17:42,127 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:17:42,127 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:17:42,141 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:17:42,142 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:17:42,142 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:17:42,142 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:17:42,143 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:17:42,144 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:17:42,144 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:17:42,144 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:17:42,145 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:17:42,153 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:17:42,153 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:17:42,153 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:17:42,153 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:17:42,154 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:17:42,154 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:17:42,154 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:17:42,154 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:17:42,154 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:17:42,154 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:17:42,156 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:17:42,156 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:17:42,206 INFO ]: Repository-Root is: /tmp [2018-06-22 11:17:42,221 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:17:42,225 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:17:42,227 INFO ]: Initializing SmtParser... [2018-06-22 11:17:42,227 INFO ]: SmtParser initialized [2018-06-22 11:17:42,227 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/018-horn.smt2 [2018-06-22 11:17:42,229 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:17:42,315 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/018-horn.smt2 unknown [2018-06-22 11:17:42,609 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/018-horn.smt2 [2018-06-22 11:17:42,614 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:17:42,622 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:17:42,623 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:17:42,623 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:17:42,623 INFO ]: ChcToBoogie initialized [2018-06-22 11:17:42,626 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:17:42" (1/1) ... [2018-06-22 11:17:42,676 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:42 Unit [2018-06-22 11:17:42,676 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:17:42,676 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:17:42,676 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:17:42,676 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:17:42,698 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:42" (1/1) ... [2018-06-22 11:17:42,699 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:42" (1/1) ... [2018-06-22 11:17:42,718 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:42" (1/1) ... [2018-06-22 11:17:42,718 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:42" (1/1) ... [2018-06-22 11:17:42,723 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:42" (1/1) ... [2018-06-22 11:17:42,725 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:42" (1/1) ... [2018-06-22 11:17:42,736 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:42" (1/1) ... [2018-06-22 11:17:42,738 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:17:42,738 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:17:42,739 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:17:42,739 INFO ]: RCFGBuilder initialized [2018-06-22 11:17:42,739 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:42" (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-22 11:17:42,767 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:17:42,767 INFO ]: Found specification of procedure False [2018-06-22 11:17:42,767 INFO ]: Found implementation of procedure False [2018-06-22 11:17:42,767 INFO ]: Specification and implementation of procedure INV3 given in one single declaration [2018-06-22 11:17:42,767 INFO ]: Found specification of procedure INV3 [2018-06-22 11:17:42,767 INFO ]: Found implementation of procedure INV3 [2018-06-22 11:17:42,767 INFO ]: Specification and implementation of procedure INV2 given in one single declaration [2018-06-22 11:17:42,767 INFO ]: Found specification of procedure INV2 [2018-06-22 11:17:42,767 INFO ]: Found implementation of procedure INV2 [2018-06-22 11:17:42,767 INFO ]: Specification and implementation of procedure INV4 given in one single declaration [2018-06-22 11:17:42,767 INFO ]: Found specification of procedure INV4 [2018-06-22 11:17:42,767 INFO ]: Found implementation of procedure INV4 [2018-06-22 11:17:42,767 INFO ]: Specification and implementation of procedure INV1 given in one single declaration [2018-06-22 11:17:42,767 INFO ]: Found specification of procedure INV1 [2018-06-22 11:17:42,767 INFO ]: Found implementation of procedure INV1 [2018-06-22 11:17:42,767 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:17:42,767 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:17:42,767 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-22 11:17:43,437 INFO ]: Using library mode [2018-06-22 11:17:43,437 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:17:43 BoogieIcfgContainer [2018-06-22 11:17:43,437 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:17:43,439 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:17:43,439 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:17:43,442 INFO ]: TraceAbstraction initialized [2018-06-22 11:17:43,442 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:17:42" (1/3) ... [2018-06-22 11:17:43,443 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79bd8ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:17:43, skipping insertion in model container [2018-06-22 11:17:43,443 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:42" (2/3) ... [2018-06-22 11:17:43,444 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79bd8ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:17:43, skipping insertion in model container [2018-06-22 11:17:43,444 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:17:43" (3/3) ... [2018-06-22 11:17:43,446 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:17:43,455 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:17:43,466 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:17:43,516 INFO ]: Using default assertion order modulation [2018-06-22 11:17:43,517 INFO ]: Interprodecural is true [2018-06-22 11:17:43,517 INFO ]: Hoare is false [2018-06-22 11:17:43,517 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:17:43,517 INFO ]: Backedges is TWOTRACK [2018-06-22 11:17:43,517 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:17:43,517 INFO ]: Difference is false [2018-06-22 11:17:43,517 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:17:43,517 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:17:43,532 INFO ]: Start isEmpty. Operand 36 states. [2018-06-22 11:17:43,544 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:17:43,545 INFO ]: Found error trace [2018-06-22 11:17:43,545 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:43,546 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:43,549 INFO ]: Analyzing trace with hash 1922679923, now seen corresponding path program 1 times [2018-06-22 11:17:43,550 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:43,551 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:43,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:43,583 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:43,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:43,600 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:43,630 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:43,632 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:43,632 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:17:43,633 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:17:43,644 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:17:43,645 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:17:43,648 INFO ]: Start difference. First operand 36 states. Second operand 2 states. [2018-06-22 11:17:43,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:43,668 INFO ]: Finished difference Result 22 states and 32 transitions. [2018-06-22 11:17:43,668 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:17:43,669 INFO ]: Start accepts. Automaton has 2 states. Word has length 9 [2018-06-22 11:17:43,669 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:43,688 INFO ]: With dead ends: 22 [2018-06-22 11:17:43,688 INFO ]: Without dead ends: 20 [2018-06-22 11:17:43,690 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:17:43,706 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:17:43,740 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 11:17:43,741 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:17:43,742 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2018-06-22 11:17:43,744 INFO ]: Start accepts. Automaton has 20 states and 32 transitions. Word has length 9 [2018-06-22 11:17:43,744 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:43,744 INFO ]: Abstraction has 20 states and 32 transitions. [2018-06-22 11:17:43,744 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:17:43,744 INFO ]: Start isEmpty. Operand 20 states and 32 transitions. [2018-06-22 11:17:43,747 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:17:43,747 INFO ]: Found error trace [2018-06-22 11:17:43,747 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:43,747 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:43,747 INFO ]: Analyzing trace with hash -1536999538, now seen corresponding path program 1 times [2018-06-22 11:17:43,747 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:43,747 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:43,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:43,748 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:43,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:43,770 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:43,829 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:43,829 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:43,829 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:43,830 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:43,830 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:43,831 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:43,831 INFO ]: Start difference. First operand 20 states and 32 transitions. Second operand 4 states. [2018-06-22 11:17:43,926 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:43,926 INFO ]: Finished difference Result 22 states and 36 transitions. [2018-06-22 11:17:43,926 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:43,926 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:17:43,926 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:43,927 INFO ]: With dead ends: 22 [2018-06-22 11:17:43,927 INFO ]: Without dead ends: 22 [2018-06-22 11:17:43,928 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-22 11:17:43,928 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 11:17:43,935 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-22 11:17:43,935 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:17:43,936 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2018-06-22 11:17:43,936 INFO ]: Start accepts. Automaton has 22 states and 36 transitions. Word has length 9 [2018-06-22 11:17:43,937 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:43,937 INFO ]: Abstraction has 22 states and 36 transitions. [2018-06-22 11:17:43,937 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:43,937 INFO ]: Start isEmpty. Operand 22 states and 36 transitions. [2018-06-22 11:17:43,938 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:17:43,938 INFO ]: Found error trace [2018-06-22 11:17:43,938 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:43,939 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:43,939 INFO ]: Analyzing trace with hash 1474446003, now seen corresponding path program 1 times [2018-06-22 11:17:43,939 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:43,939 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:43,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:43,940 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:43,940 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:43,948 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:43,983 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:43,983 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:43,983 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:43,983 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:43,983 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:43,983 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:43,983 INFO ]: Start difference. First operand 22 states and 36 transitions. Second operand 4 states. [2018-06-22 11:17:44,161 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:44,161 INFO ]: Finished difference Result 24 states and 40 transitions. [2018-06-22 11:17:44,162 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:44,162 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:17:44,162 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:44,163 INFO ]: With dead ends: 24 [2018-06-22 11:17:44,163 INFO ]: Without dead ends: 24 [2018-06-22 11:17:44,163 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-22 11:17:44,163 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:17:44,168 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-22 11:17:44,168 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:17:44,170 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 40 transitions. [2018-06-22 11:17:44,170 INFO ]: Start accepts. Automaton has 24 states and 40 transitions. Word has length 9 [2018-06-22 11:17:44,170 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:44,170 INFO ]: Abstraction has 24 states and 40 transitions. [2018-06-22 11:17:44,170 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:44,170 INFO ]: Start isEmpty. Operand 24 states and 40 transitions. [2018-06-22 11:17:44,171 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:44,171 INFO ]: Found error trace [2018-06-22 11:17:44,171 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:44,171 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:44,171 INFO ]: Analyzing trace with hash -34229924, now seen corresponding path program 1 times [2018-06-22 11:17:44,171 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:44,171 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:44,172 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:44,172 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:44,172 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:44,188 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:44,357 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:44,357 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:44,357 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:44,363 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:44,389 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:44,396 INFO ]: Computing forward predicates... [2018-06-22 11:17:44,728 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:44,750 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:44,750 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:17:44,751 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:17:44,751 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:17:44,751 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:17:44,751 INFO ]: Start difference. First operand 24 states and 40 transitions. Second operand 8 states. [2018-06-22 11:17:44,994 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:44,994 INFO ]: Finished difference Result 30 states and 53 transitions. [2018-06-22 11:17:44,994 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:17:44,994 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:17:44,994 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:44,995 INFO ]: With dead ends: 30 [2018-06-22 11:17:44,995 INFO ]: Without dead ends: 30 [2018-06-22 11:17:44,996 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:17:44,996 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:17:45,003 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-06-22 11:17:45,003 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:17:45,004 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 48 transitions. [2018-06-22 11:17:45,004 INFO ]: Start accepts. Automaton has 28 states and 48 transitions. Word has length 13 [2018-06-22 11:17:45,004 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:45,004 INFO ]: Abstraction has 28 states and 48 transitions. [2018-06-22 11:17:45,004 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:17:45,004 INFO ]: Start isEmpty. Operand 28 states and 48 transitions. [2018-06-22 11:17:45,005 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:45,006 INFO ]: Found error trace [2018-06-22 11:17:45,006 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:45,006 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:45,006 INFO ]: Analyzing trace with hash -524731630, now seen corresponding path program 1 times [2018-06-22 11:17:45,006 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:45,006 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:45,007 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:45,007 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:45,007 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:45,018 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:45,110 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:45,110 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:45,110 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:45,121 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:45,147 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:45,149 INFO ]: Computing forward predicates... [2018-06-22 11:17:45,512 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:45,542 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:45,542 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:17:45,542 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:17:45,542 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:17:45,543 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:17:45,543 INFO ]: Start difference. First operand 28 states and 48 transitions. Second operand 9 states. [2018-06-22 11:17:45,866 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:45,866 INFO ]: Finished difference Result 34 states and 61 transitions. [2018-06-22 11:17:45,867 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:17:45,867 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:17:45,867 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:45,868 INFO ]: With dead ends: 34 [2018-06-22 11:17:45,868 INFO ]: Without dead ends: 34 [2018-06-22 11:17:45,869 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:17:45,869 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:17:45,876 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-06-22 11:17:45,877 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:17:45,878 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 48 transitions. [2018-06-22 11:17:45,878 INFO ]: Start accepts. Automaton has 28 states and 48 transitions. Word has length 13 [2018-06-22 11:17:45,878 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:45,878 INFO ]: Abstraction has 28 states and 48 transitions. [2018-06-22 11:17:45,878 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:17:45,878 INFO ]: Start isEmpty. Operand 28 states and 48 transitions. [2018-06-22 11:17:45,879 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:45,879 INFO ]: Found error trace [2018-06-22 11:17:45,879 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:45,879 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:45,879 INFO ]: Analyzing trace with hash -2094624779, now seen corresponding path program 1 times [2018-06-22 11:17:45,879 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:45,879 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:45,880 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:45,880 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:45,880 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:45,894 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:45,922 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:45,922 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:45,922 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:45,922 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:45,922 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:45,922 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:45,922 INFO ]: Start difference. First operand 28 states and 48 transitions. Second operand 4 states. [2018-06-22 11:17:46,150 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:46,150 INFO ]: Finished difference Result 39 states and 73 transitions. [2018-06-22 11:17:46,151 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:17:46,151 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:17:46,151 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:46,152 INFO ]: With dead ends: 39 [2018-06-22 11:17:46,152 INFO ]: Without dead ends: 39 [2018-06-22 11:17:46,153 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:17:46,153 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:17:46,161 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-06-22 11:17:46,161 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:17:46,162 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 67 transitions. [2018-06-22 11:17:46,162 INFO ]: Start accepts. Automaton has 37 states and 67 transitions. Word has length 13 [2018-06-22 11:17:46,162 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:46,162 INFO ]: Abstraction has 37 states and 67 transitions. [2018-06-22 11:17:46,162 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:46,162 INFO ]: Start isEmpty. Operand 37 states and 67 transitions. [2018-06-22 11:17:46,164 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:46,164 INFO ]: Found error trace [2018-06-22 11:17:46,164 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:46,164 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:46,164 INFO ]: Analyzing trace with hash -1211096063, now seen corresponding path program 1 times [2018-06-22 11:17:46,164 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:46,164 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:46,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:46,165 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:46,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:46,174 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:46,235 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:46,235 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:46,235 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:46,243 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:46,253 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:46,258 INFO ]: Computing forward predicates... [2018-06-22 11:17:46,319 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:46,339 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:46,339 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:17:46,339 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:17:46,339 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:17:46,339 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:17:46,339 INFO ]: Start difference. First operand 37 states and 67 transitions. Second operand 8 states. [2018-06-22 11:17:46,441 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:46,441 INFO ]: Finished difference Result 43 states and 75 transitions. [2018-06-22 11:17:46,442 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:17:46,442 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:17:46,443 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:46,444 INFO ]: With dead ends: 43 [2018-06-22 11:17:46,444 INFO ]: Without dead ends: 43 [2018-06-22 11:17:46,444 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:17:46,444 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:17:46,453 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-06-22 11:17:46,453 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:17:46,455 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 71 transitions. [2018-06-22 11:17:46,455 INFO ]: Start accepts. Automaton has 39 states and 71 transitions. Word has length 13 [2018-06-22 11:17:46,455 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:46,455 INFO ]: Abstraction has 39 states and 71 transitions. [2018-06-22 11:17:46,455 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:17:46,455 INFO ]: Start isEmpty. Operand 39 states and 71 transitions. [2018-06-22 11:17:46,457 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:46,457 INFO ]: Found error trace [2018-06-22 11:17:46,457 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:46,457 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:46,457 INFO ]: Analyzing trace with hash -685050070, now seen corresponding path program 2 times [2018-06-22 11:17:46,457 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:46,457 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:46,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:46,458 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:46,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:46,475 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:46,546 INFO ]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:46,546 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:46,546 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:46,562 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:17:46,586 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:17:46,587 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:46,589 INFO ]: Computing forward predicates... [2018-06-22 11:17:46,757 INFO ]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:46,785 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:46,785 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-22 11:17:46,785 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:17:46,785 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:17:46,785 INFO ]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:17:46,785 INFO ]: Start difference. First operand 39 states and 71 transitions. Second operand 11 states. [2018-06-22 11:17:47,066 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:47,067 INFO ]: Finished difference Result 49 states and 93 transitions. [2018-06-22 11:17:47,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:17:47,067 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:17:47,067 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:47,068 INFO ]: With dead ends: 49 [2018-06-22 11:17:47,068 INFO ]: Without dead ends: 49 [2018-06-22 11:17:47,069 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:17:47,069 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:17:47,078 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-06-22 11:17:47,078 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:17:47,079 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 80 transitions. [2018-06-22 11:17:47,079 INFO ]: Start accepts. Automaton has 43 states and 80 transitions. Word has length 17 [2018-06-22 11:17:47,079 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:47,079 INFO ]: Abstraction has 43 states and 80 transitions. [2018-06-22 11:17:47,079 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:17:47,079 INFO ]: Start isEmpty. Operand 43 states and 80 transitions. [2018-06-22 11:17:47,081 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:47,081 INFO ]: Found error trace [2018-06-22 11:17:47,081 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:47,081 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:47,081 INFO ]: Analyzing trace with hash 552576389, now seen corresponding path program 1 times [2018-06-22 11:17:47,081 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:47,081 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:47,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:47,082 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:47,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:47,091 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:47,140 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:47,140 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:47,140 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:47,140 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:47,140 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:47,140 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:47,141 INFO ]: Start difference. First operand 43 states and 80 transitions. Second operand 4 states. [2018-06-22 11:17:47,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:47,247 INFO ]: Finished difference Result 56 states and 104 transitions. [2018-06-22 11:17:47,247 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:17:47,247 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:17:47,247 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:47,248 INFO ]: With dead ends: 56 [2018-06-22 11:17:47,248 INFO ]: Without dead ends: 56 [2018-06-22 11:17:47,248 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:17:47,248 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:17:47,259 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 48. [2018-06-22 11:17:47,259 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:17:47,260 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 89 transitions. [2018-06-22 11:17:47,260 INFO ]: Start accepts. Automaton has 48 states and 89 transitions. Word has length 17 [2018-06-22 11:17:47,260 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:47,260 INFO ]: Abstraction has 48 states and 89 transitions. [2018-06-22 11:17:47,260 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:47,260 INFO ]: Start isEmpty. Operand 48 states and 89 transitions. [2018-06-22 11:17:47,261 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:47,261 INFO ]: Found error trace [2018-06-22 11:17:47,261 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:47,261 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:47,262 INFO ]: Analyzing trace with hash 1790202848, now seen corresponding path program 1 times [2018-06-22 11:17:47,262 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:47,262 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:47,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:47,262 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:47,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:47,271 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:47,308 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:47,308 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:47,308 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:47,308 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:47,308 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:47,308 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:47,308 INFO ]: Start difference. First operand 48 states and 89 transitions. Second operand 4 states. [2018-06-22 11:17:47,382 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:47,382 INFO ]: Finished difference Result 54 states and 98 transitions. [2018-06-22 11:17:47,383 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:17:47,383 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:17:47,383 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:47,383 INFO ]: With dead ends: 54 [2018-06-22 11:17:47,383 INFO ]: Without dead ends: 49 [2018-06-22 11:17:47,384 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:17:47,384 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:17:47,390 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-06-22 11:17:47,391 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:17:47,391 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 75 transitions. [2018-06-22 11:17:47,391 INFO ]: Start accepts. Automaton has 43 states and 75 transitions. Word has length 17 [2018-06-22 11:17:47,392 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:47,392 INFO ]: Abstraction has 43 states and 75 transitions. [2018-06-22 11:17:47,392 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:47,392 INFO ]: Start isEmpty. Operand 43 states and 75 transitions. [2018-06-22 11:17:47,393 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:47,393 INFO ]: Found error trace [2018-06-22 11:17:47,393 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:47,393 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:47,393 INFO ]: Analyzing trace with hash -1967632901, now seen corresponding path program 1 times [2018-06-22 11:17:47,393 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:47,393 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:47,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:47,394 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:47,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:47,402 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:47,438 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:17:47,438 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:47,438 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:47,439 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:47,439 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:47,439 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:47,439 INFO ]: Start difference. First operand 43 states and 75 transitions. Second operand 4 states. [2018-06-22 11:17:47,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:47,486 INFO ]: Finished difference Result 52 states and 94 transitions. [2018-06-22 11:17:47,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:47,486 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:17:47,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:47,487 INFO ]: With dead ends: 52 [2018-06-22 11:17:47,487 INFO ]: Without dead ends: 49 [2018-06-22 11:17:47,487 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-22 11:17:47,487 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:17:47,494 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-06-22 11:17:47,494 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:17:47,495 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 89 transitions. [2018-06-22 11:17:47,495 INFO ]: Start accepts. Automaton has 49 states and 89 transitions. Word has length 17 [2018-06-22 11:17:47,495 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:47,495 INFO ]: Abstraction has 49 states and 89 transitions. [2018-06-22 11:17:47,495 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:47,495 INFO ]: Start isEmpty. Operand 49 states and 89 transitions. [2018-06-22 11:17:47,496 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:47,496 INFO ]: Found error trace [2018-06-22 11:17:47,496 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:47,496 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:47,496 INFO ]: Analyzing trace with hash -1430501354, now seen corresponding path program 2 times [2018-06-22 11:17:47,496 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:47,496 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:47,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:47,497 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:47,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:47,506 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:47,683 INFO ]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:17:47,683 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:47,683 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:17:47,696 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:47,725 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:17:47,725 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:47,728 INFO ]: Computing forward predicates... [2018-06-22 11:17:47,810 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:47,829 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:47,829 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-06-22 11:17:47,829 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:17:47,829 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:17:47,829 INFO ]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:17:47,829 INFO ]: Start difference. First operand 49 states and 89 transitions. Second operand 12 states. [2018-06-22 11:17:47,986 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:47,986 INFO ]: Finished difference Result 71 states and 121 transitions. [2018-06-22 11:17:47,987 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:17:47,987 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:17:47,987 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:47,988 INFO ]: With dead ends: 71 [2018-06-22 11:17:47,988 INFO ]: Without dead ends: 71 [2018-06-22 11:17:47,988 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:17:47,989 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 11:17:47,996 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 51. [2018-06-22 11:17:47,996 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:17:47,997 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 89 transitions. [2018-06-22 11:17:47,997 INFO ]: Start accepts. Automaton has 51 states and 89 transitions. Word has length 17 [2018-06-22 11:17:47,997 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:47,997 INFO ]: Abstraction has 51 states and 89 transitions. [2018-06-22 11:17:47,997 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:17:47,997 INFO ]: Start isEmpty. Operand 51 states and 89 transitions. [2018-06-22 11:17:47,998 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:47,998 INFO ]: Found error trace [2018-06-22 11:17:47,998 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:47,998 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:47,998 INFO ]: Analyzing trace with hash -629366961, now seen corresponding path program 2 times [2018-06-22 11:17:47,998 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:47,998 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:47,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:47,999 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:47,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:48,007 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:48,112 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:48,113 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:48,113 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-22 11:17:48,119 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:17:48,132 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:17:48,132 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:48,133 INFO ]: Computing forward predicates... [2018-06-22 11:17:48,183 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:48,202 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:48,202 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:17:48,202 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:17:48,202 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:17:48,202 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:17:48,203 INFO ]: Start difference. First operand 51 states and 89 transitions. Second operand 8 states. [2018-06-22 11:17:48,363 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:48,363 INFO ]: Finished difference Result 62 states and 105 transitions. [2018-06-22 11:17:48,363 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:17:48,363 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:17:48,363 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:48,364 INFO ]: With dead ends: 62 [2018-06-22 11:17:48,364 INFO ]: Without dead ends: 57 [2018-06-22 11:17:48,364 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:17:48,364 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:17:48,372 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-06-22 11:17:48,372 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:17:48,373 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 88 transitions. [2018-06-22 11:17:48,373 INFO ]: Start accepts. Automaton has 53 states and 88 transitions. Word has length 17 [2018-06-22 11:17:48,373 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:48,373 INFO ]: Abstraction has 53 states and 88 transitions. [2018-06-22 11:17:48,373 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:17:48,373 INFO ]: Start isEmpty. Operand 53 states and 88 transitions. [2018-06-22 11:17:48,374 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:48,374 INFO ]: Found error trace [2018-06-22 11:17:48,374 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:48,374 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:48,374 INFO ]: Analyzing trace with hash 389213024, now seen corresponding path program 2 times [2018-06-22 11:17:48,374 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:48,374 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:48,375 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:48,375 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:48,375 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:48,384 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:48,455 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:17:48,455 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:48,455 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:48,461 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:17:48,493 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:17:48,493 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:48,495 INFO ]: Computing forward predicates... [2018-06-22 11:17:48,550 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:48,570 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:48,570 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-06-22 11:17:48,570 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:17:48,570 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:17:48,570 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:17:48,570 INFO ]: Start difference. First operand 53 states and 88 transitions. Second operand 10 states. [2018-06-22 11:17:48,754 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:48,754 INFO ]: Finished difference Result 67 states and 106 transitions. [2018-06-22 11:17:48,754 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:17:48,755 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:17:48,755 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:48,756 INFO ]: With dead ends: 67 [2018-06-22 11:17:48,756 INFO ]: Without dead ends: 67 [2018-06-22 11:17:48,756 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:17:48,756 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 11:17:48,762 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 55. [2018-06-22 11:17:48,762 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:17:48,763 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 90 transitions. [2018-06-22 11:17:48,763 INFO ]: Start accepts. Automaton has 55 states and 90 transitions. Word has length 17 [2018-06-22 11:17:48,763 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:48,763 INFO ]: Abstraction has 55 states and 90 transitions. [2018-06-22 11:17:48,763 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:17:48,763 INFO ]: Start isEmpty. Operand 55 states and 90 transitions. [2018-06-22 11:17:48,764 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:48,764 INFO ]: Found error trace [2018-06-22 11:17:48,764 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:48,764 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:48,764 INFO ]: Analyzing trace with hash -1413975002, now seen corresponding path program 1 times [2018-06-22 11:17:48,764 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:48,764 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:48,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:48,765 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:48,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:48,772 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:48,843 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:17:48,844 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:48,844 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:48,844 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:48,844 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:48,844 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:48,844 INFO ]: Start difference. First operand 55 states and 90 transitions. Second operand 4 states. [2018-06-22 11:17:48,870 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:48,870 INFO ]: Finished difference Result 47 states and 71 transitions. [2018-06-22 11:17:48,870 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:48,870 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:17:48,870 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:48,871 INFO ]: With dead ends: 47 [2018-06-22 11:17:48,871 INFO ]: Without dead ends: 33 [2018-06-22 11:17:48,871 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 3 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-22 11:17:48,871 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:17:48,874 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-22 11:17:48,874 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:17:48,874 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2018-06-22 11:17:48,874 INFO ]: Start accepts. Automaton has 33 states and 50 transitions. Word has length 17 [2018-06-22 11:17:48,874 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:48,874 INFO ]: Abstraction has 33 states and 50 transitions. [2018-06-22 11:17:48,874 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:48,874 INFO ]: Start isEmpty. Operand 33 states and 50 transitions. [2018-06-22 11:17:48,875 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:17:48,875 INFO ]: Found error trace [2018-06-22 11:17:48,875 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:48,875 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:48,875 INFO ]: Analyzing trace with hash 249958318, now seen corresponding path program 3 times [2018-06-22 11:17:48,875 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:48,875 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:48,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:48,876 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:48,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:48,885 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:49,055 INFO ]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:17:49,055 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:49,055 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:49,061 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:17:49,092 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:17:49,092 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:49,094 INFO ]: Computing forward predicates... [2018-06-22 11:17:49,196 INFO ]: Checked inductivity of 19 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:17:49,217 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:49,217 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 14 [2018-06-22 11:17:49,217 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:17:49,217 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:17:49,217 INFO ]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:17:49,218 INFO ]: Start difference. First operand 33 states and 50 transitions. Second operand 14 states. [2018-06-22 11:17:49,409 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:49,409 INFO ]: Finished difference Result 43 states and 60 transitions. [2018-06-22 11:17:49,410 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:17:49,410 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:17:49,410 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:49,410 INFO ]: With dead ends: 43 [2018-06-22 11:17:49,410 INFO ]: Without dead ends: 30 [2018-06-22 11:17:49,411 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:17:49,411 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:17:49,413 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-06-22 11:17:49,413 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:17:49,413 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-06-22 11:17:49,413 INFO ]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 21 [2018-06-22 11:17:49,413 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:49,413 INFO ]: Abstraction has 24 states and 34 transitions. [2018-06-22 11:17:49,413 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:17:49,413 INFO ]: Start isEmpty. Operand 24 states and 34 transitions. [2018-06-22 11:17:49,414 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:17:49,414 INFO ]: Found error trace [2018-06-22 11:17:49,414 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:49,414 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:49,414 INFO ]: Analyzing trace with hash -244956417, now seen corresponding path program 2 times [2018-06-22 11:17:49,414 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:49,414 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:49,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:49,415 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:49,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:49,421 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:49,548 INFO ]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:17:49,548 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:49,548 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) [2018-06-22 11:17:49,559 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:49,600 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:17:49,600 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:49,602 INFO ]: Computing forward predicates... [2018-06-22 11:17:49,707 INFO ]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:17:49,738 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:49,738 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 11:17:49,738 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:49,738 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:49,738 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:49,739 INFO ]: Start difference. First operand 24 states and 34 transitions. Second operand 4 states. [2018-06-22 11:17:50,095 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:50,095 INFO ]: Finished difference Result 16 states and 21 transitions. [2018-06-22 11:17:50,096 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:17:50,096 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:17:50,096 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:50,096 INFO ]: With dead ends: 16 [2018-06-22 11:17:50,096 INFO ]: Without dead ends: 0 [2018-06-22 11:17:50,096 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:17:50,096 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:17:50,096 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:17:50,096 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:17:50,096 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:17:50,096 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-06-22 11:17:50,096 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:50,096 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:17:50,096 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:50,096 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:17:50,096 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:17:50,100 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:17:50 BoogieIcfgContainer [2018-06-22 11:17:50,100 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:17:50,101 INFO ]: Toolchain (without parser) took 7486.31 ms. Allocated memory was 308.8 MB in the beginning and 369.6 MB in the end (delta: 60.8 MB). Free memory was 260.2 MB in the beginning and 225.3 MB in the end (delta: 34.9 MB). Peak memory consumption was 95.7 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:50,102 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:17:50,103 INFO ]: ChcToBoogie took 53.11 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 258.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:50,103 INFO ]: Boogie Preprocessor took 61.59 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:50,104 INFO ]: RCFGBuilder took 698.96 ms. Allocated memory is still 308.8 MB. Free memory was 256.2 MB in the beginning and 240.1 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:50,104 INFO ]: TraceAbstraction took 6661.24 ms. Allocated memory was 308.8 MB in the beginning and 369.6 MB in the end (delta: 60.8 MB). Free memory was 239.2 MB in the beginning and 225.3 MB in the end (delta: 13.8 MB). Peak memory consumption was 74.7 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:50,107 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 53.11 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 258.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 61.59 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 698.96 ms. Allocated memory is still 308.8 MB. Free memory was 256.2 MB in the beginning and 240.1 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 6661.24 ms. Allocated memory was 308.8 MB in the beginning and 369.6 MB in the end (delta: 60.8 MB). Free memory was 239.2 MB in the beginning and 225.3 MB in the end (delta: 13.8 MB). Peak memory consumption was 74.7 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 6 procedures, 36 locations, 1 error locations. SAFE Result, 6.5s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 502 SDtfs, 73 SDslu, 1180 SDs, 0 SdLazy, 923 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 147 SyntacticMatches, 6 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=14, 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, 17 MinimizatonAttempts, 76 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 406 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 18792 SizeOfPredicates, 40 NumberOfNonLiveVariables, 863 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 26 InterpolantComputations, 8 PerfectInterpolantSequences, 151/211 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/018-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-17-50-117.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/018-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-17-50-117.csv Received shutdown request...