java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/conc/fib_bench_safe_v1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 05:04:20,119 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 05:04:20,122 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 05:04:20,134 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 05:04:20,134 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 05:04:20,135 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 05:04:20,137 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 05:04:20,139 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 05:04:20,141 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 05:04:20,142 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 05:04:20,143 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 05:04:20,143 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 05:04:20,144 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 05:04:20,146 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 05:04:20,147 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 05:04:20,148 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 05:04:20,150 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 05:04:20,152 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 05:04:20,154 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 05:04:20,155 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 05:04:20,157 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 05:04:20,159 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 05:04:20,160 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 05:04:20,160 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 05:04:20,161 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 05:04:20,162 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 05:04:20,163 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 05:04:20,164 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 05:04:20,165 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 05:04:20,165 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 05:04:20,166 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 05:04:20,167 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 05:04:20,167 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 05:04:20,168 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 05:04:20,169 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 05:04:20,169 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 05:04:20,184 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 05:04:20,184 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 05:04:20,185 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 05:04:20,185 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 05:04:20,186 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 05:04:20,186 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 05:04:20,186 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 05:04:20,187 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 05:04:20,187 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 05:04:20,187 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 05:04:20,187 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 05:04:20,188 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 05:04:20,188 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 05:04:20,188 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 05:04:20,188 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 05:04:20,188 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 05:04:20,189 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 05:04:20,190 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 05:04:20,191 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 05:04:20,233 INFO ]: Repository-Root is: /tmp [2018-06-22 05:04:20,252 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 05:04:20,258 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 05:04:20,259 INFO ]: Initializing SmtParser... [2018-06-22 05:04:20,260 INFO ]: SmtParser initialized [2018-06-22 05:04:20,261 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/conc/fib_bench_safe_v1.smt2 [2018-06-22 05:04:20,262 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 05:04:20,363 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/conc/fib_bench_safe_v1.smt2 unknown [2018-06-22 05:04:20,548 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/conc/fib_bench_safe_v1.smt2 [2018-06-22 05:04:20,554 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 05:04:20,560 INFO ]: Walking toolchain with 4 elements. [2018-06-22 05:04:20,560 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 05:04:20,560 INFO ]: Initializing ChcToBoogie... [2018-06-22 05:04:20,561 INFO ]: ChcToBoogie initialized [2018-06-22 05:04:20,565 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 05:04:20" (1/1) ... [2018-06-22 05:04:20,623 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 05:04:20 Unit [2018-06-22 05:04:20,623 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 05:04:20,624 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 05:04:20,624 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 05:04:20,624 INFO ]: Boogie Preprocessor initialized [2018-06-22 05:04:20,653 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 05:04:20" (1/1) ... [2018-06-22 05:04:20,653 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 05:04:20" (1/1) ... [2018-06-22 05:04:20,660 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 05:04:20" (1/1) ... [2018-06-22 05:04:20,660 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 05:04:20" (1/1) ... [2018-06-22 05:04:20,663 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 05:04:20" (1/1) ... [2018-06-22 05:04:20,664 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 05:04:20" (1/1) ... [2018-06-22 05:04:20,666 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 05:04:20" (1/1) ... [2018-06-22 05:04:20,668 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 05:04:20,668 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 05:04:20,668 INFO ]: Initializing RCFGBuilder... [2018-06-22 05:04:20,668 INFO ]: RCFGBuilder initialized [2018-06-22 05:04:20,673 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 05:04:20" (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 05:04:20,687 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 05:04:20,687 INFO ]: Found specification of procedure gotoProc [2018-06-22 05:04:20,687 INFO ]: Found implementation of procedure gotoProc [2018-06-22 05:04:20,687 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 05:04:20,687 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 05:04:20,687 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 05:04:20,889 INFO ]: Using library mode [2018-06-22 05:04:20,889 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:04:20 BoogieIcfgContainer [2018-06-22 05:04:20,889 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 05:04:20,900 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 05:04:20,900 INFO ]: Initializing TraceAbstraction... [2018-06-22 05:04:20,903 INFO ]: TraceAbstraction initialized [2018-06-22 05:04:20,904 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 05:04:20" (1/3) ... [2018-06-22 05:04:20,904 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398f4980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 05:04:20, skipping insertion in model container [2018-06-22 05:04:20,904 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 05:04:20" (2/3) ... [2018-06-22 05:04:20,905 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398f4980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:04:20, skipping insertion in model container [2018-06-22 05:04:20,905 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:04:20" (3/3) ... [2018-06-22 05:04:20,907 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 05:04:20,925 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 05:04:20,945 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 05:04:21,013 INFO ]: Using default assertion order modulation [2018-06-22 05:04:21,013 INFO ]: Interprodecural is true [2018-06-22 05:04:21,013 INFO ]: Hoare is false [2018-06-22 05:04:21,013 INFO ]: Compute interpolants for FPandBP [2018-06-22 05:04:21,013 INFO ]: Backedges is TWOTRACK [2018-06-22 05:04:21,013 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 05:04:21,013 INFO ]: Difference is false [2018-06-22 05:04:21,013 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 05:04:21,013 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 05:04:21,033 INFO ]: Start isEmpty. Operand 10 states. [2018-06-22 05:04:21,050 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 05:04:21,050 INFO ]: Found error trace [2018-06-22 05:04:21,051 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 05:04:21,051 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 05:04:21,058 INFO ]: Analyzing trace with hash 1284994894, now seen corresponding path program 1 times [2018-06-22 05:04:21,060 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 05:04:21,060 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 05:04:21,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 05:04:21,110 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 05:04:21,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 05:04:21,184 INFO ]: Conjunction of SSA is unsat [2018-06-22 05:04:21,271 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 05:04:21,273 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 05:04:21,273 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 05:04:21,274 INFO ]: Interpolant automaton has 3 states [2018-06-22 05:04:21,285 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 05:04:21,285 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 05:04:21,287 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-22 05:04:21,348 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 05:04:21,348 INFO ]: Finished difference Result 9 states and 9 transitions. [2018-06-22 05:04:21,349 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 05:04:21,350 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 05:04:21,351 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 05:04:21,359 INFO ]: With dead ends: 9 [2018-06-22 05:04:21,359 INFO ]: Without dead ends: 9 [2018-06-22 05:04:21,361 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 05:04:21,376 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 05:04:21,393 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 05:04:21,395 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 05:04:21,395 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-06-22 05:04:21,397 INFO ]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-06-22 05:04:21,397 INFO ]: Finished accepts. word is rejected. [2018-06-22 05:04:21,397 INFO ]: Abstraction has 9 states and 9 transitions. [2018-06-22 05:04:21,397 INFO ]: Interpolant automaton has 3 states. [2018-06-22 05:04:21,397 INFO ]: Start isEmpty. Operand 9 states and 9 transitions. [2018-06-22 05:04:21,397 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 05:04:21,397 INFO ]: Found error trace [2018-06-22 05:04:21,398 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 05:04:21,398 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 05:04:21,398 INFO ]: Analyzing trace with hash 1180964567, now seen corresponding path program 1 times [2018-06-22 05:04:21,398 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 05:04:21,398 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 05:04:21,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 05:04:21,399 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 05:04:21,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 05:04:21,421 INFO ]: Conjunction of SSA is unsat [2018-06-22 05:04:21,575 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 05:04:21,575 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 05:04:21,575 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 05:04:21,583 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 05:04:21,628 INFO ]: Conjunction of SSA is unsat [2018-06-22 05:04:21,636 INFO ]: Computing forward predicates... [2018-06-22 05:04:22,637 WARN ]: Spent 377.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-06-22 05:04:22,661 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 05:04:22,697 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 05:04:22,697 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 05:04:22,697 INFO ]: Interpolant automaton has 5 states [2018-06-22 05:04:22,698 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 05:04:22,698 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 05:04:22,698 INFO ]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-06-22 05:04:23,049 WARN ]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-22 05:04:23,103 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 05:04:23,179 INFO ]: Finished difference Result 10 states and 10 transitions. [2018-06-22 05:04:23,180 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 05:04:23,180 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 05:04:23,180 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 05:04:23,180 INFO ]: With dead ends: 10 [2018-06-22 05:04:23,180 INFO ]: Without dead ends: 10 [2018-06-22 05:04:23,181 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-22 05:04:23,181 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 05:04:23,182 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 05:04:23,182 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 05:04:23,183 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-22 05:04:23,183 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-06-22 05:04:23,183 INFO ]: Finished accepts. word is rejected. [2018-06-22 05:04:23,183 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-22 05:04:23,183 INFO ]: Interpolant automaton has 5 states. [2018-06-22 05:04:23,183 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-22 05:04:23,183 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 05:04:23,183 INFO ]: Found error trace [2018-06-22 05:04:23,183 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 05:04:23,183 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 05:04:23,184 INFO ]: Analyzing trace with hash -2043975570, now seen corresponding path program 2 times [2018-06-22 05:04:23,184 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 05:04:23,184 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 05:04:23,185 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 05:04:23,185 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 05:04:23,185 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 05:04:23,232 INFO ]: Conjunction of SSA is unsat [2018-06-22 05:04:23,697 WARN ]: Spent 272.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-06-22 05:04:23,794 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 05:04:23,794 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 05:04:23,794 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 05:04:23,801 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 05:04:23,829 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 05:04:23,829 INFO ]: Conjunction of SSA is unsat [2018-06-22 05:04:23,832 INFO ]: Computing forward predicates... [2018-06-22 05:04:25,064 WARN ]: Spent 211.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 18 [2018-06-22 05:04:25,067 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 05:04:25,088 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 05:04:25,088 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-22 05:04:25,089 INFO ]: Interpolant automaton has 7 states [2018-06-22 05:04:25,089 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 05:04:25,089 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-22 05:04:25,089 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2018-06-22 05:04:25,128 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 05:04:25,128 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-22 05:04:25,129 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 05:04:25,129 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-22 05:04:25,129 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 05:04:25,129 INFO ]: With dead ends: 11 [2018-06-22 05:04:25,130 INFO ]: Without dead ends: 11 [2018-06-22 05:04:25,130 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-22 05:04:25,130 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 05:04:25,131 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 05:04:25,131 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 05:04:25,131 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-22 05:04:25,131 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-22 05:04:25,131 INFO ]: Finished accepts. word is rejected. [2018-06-22 05:04:25,131 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-22 05:04:25,131 INFO ]: Interpolant automaton has 7 states. [2018-06-22 05:04:25,131 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-22 05:04:25,132 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 05:04:25,132 INFO ]: Found error trace [2018-06-22 05:04:25,132 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 05:04:25,132 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 05:04:25,132 INFO ]: Analyzing trace with hash 1062095287, now seen corresponding path program 3 times [2018-06-22 05:04:25,132 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 05:04:25,132 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 05:04:25,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 05:04:25,133 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 05:04:25,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 05:04:25,184 INFO ]: Conjunction of SSA is unsat [2018-06-22 05:04:25,698 WARN ]: Spent 308.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2018-06-22 05:04:25,744 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 05:04:25,745 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 05:04:25,745 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 05:04:25,753 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 05:04:25,805 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 05:04:25,806 INFO ]: Conjunction of SSA is unsat [2018-06-22 05:04:25,808 INFO ]: Computing forward predicates... [2018-06-22 05:04:26,706 WARN ]: Spent 127.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2018-06-22 05:04:27,626 WARN ]: Spent 412.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 25 [2018-06-22 05:04:27,638 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 05:04:27,663 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 05:04:27,663 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 05:04:27,663 INFO ]: Interpolant automaton has 8 states [2018-06-22 05:04:27,663 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 05:04:27,663 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-22 05:04:27,664 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-06-22 05:04:27,695 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 05:04:27,695 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-22 05:04:27,695 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 05:04:27,695 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-22 05:04:27,696 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 05:04:27,696 INFO ]: With dead ends: 12 [2018-06-22 05:04:27,696 INFO ]: Without dead ends: 12 [2018-06-22 05:04:27,696 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-22 05:04:27,696 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 05:04:27,698 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 05:04:27,698 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 05:04:27,698 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-22 05:04:27,698 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-22 05:04:27,698 INFO ]: Finished accepts. word is rejected. [2018-06-22 05:04:27,698 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-22 05:04:27,698 INFO ]: Interpolant automaton has 8 states. [2018-06-22 05:04:27,698 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-22 05:04:27,698 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 05:04:27,699 INFO ]: Found error trace [2018-06-22 05:04:27,699 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 05:04:27,699 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 05:04:27,699 INFO ]: Analyzing trace with hash -1433955954, now seen corresponding path program 4 times [2018-06-22 05:04:27,699 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 05:04:27,699 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 05:04:27,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 05:04:27,700 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 05:04:27,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 05:04:27,790 INFO ]: Conjunction of SSA is unsat [2018-06-22 05:04:28,252 WARN ]: Spent 184.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 6 [2018-06-22 05:04:28,388 WARN ]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 12 [2018-06-22 05:04:28,821 WARN ]: Spent 399.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 17 [2018-06-22 05:04:29,065 WARN ]: Spent 211.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 24 [2018-06-22 05:04:29,284 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 05:04:29,284 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 05:04:29,284 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 05:04:29,294 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 05:04:29,331 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 05:04:29,331 INFO ]: Conjunction of SSA is unsat [2018-06-22 05:04:29,333 INFO ]: Computing forward predicates... [2018-06-22 05:04:33,135 WARN ]: Spent 380.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 34 [2018-06-22 05:04:33,152 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 05:04:33,187 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 05:04:33,187 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-22 05:04:33,187 INFO ]: Interpolant automaton has 11 states [2018-06-22 05:04:33,188 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 05:04:33,188 INFO ]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-06-22 05:04:33,188 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-06-22 05:04:33,284 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 05:04:33,284 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-22 05:04:33,285 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 05:04:33,285 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-22 05:04:33,285 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 05:04:33,285 INFO ]: With dead ends: 13 [2018-06-22 05:04:33,285 INFO ]: Without dead ends: 13 [2018-06-22 05:04:33,286 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=75, Invalid=81, Unknown=0, NotChecked=0, Total=156 [2018-06-22 05:04:33,286 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 05:04:33,287 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 05:04:33,287 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 05:04:33,288 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-22 05:04:33,288 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-22 05:04:33,288 INFO ]: Finished accepts. word is rejected. [2018-06-22 05:04:33,288 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-22 05:04:33,288 INFO ]: Interpolant automaton has 11 states. [2018-06-22 05:04:33,288 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-22 05:04:33,288 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 05:04:33,288 INFO ]: Found error trace [2018-06-22 05:04:33,288 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 05:04:33,288 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 05:04:33,288 INFO ]: Analyzing trace with hash -1502133097, now seen corresponding path program 5 times [2018-06-22 05:04:33,288 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 05:04:33,288 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 05:04:33,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 05:04:33,289 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 05:04:33,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 05:04:33,376 INFO ]: Conjunction of SSA is unsat [2018-06-22 05:04:34,061 WARN ]: Spent 277.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 6 [2018-06-22 05:04:35,210 WARN ]: Spent 1.08 s on a formula simplification. DAG size of input: 132 DAG size of output: 17 [2018-06-22 05:04:36,114 WARN ]: Spent 840.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 21 [2018-06-22 05:04:37,015 WARN ]: Spent 803.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 25 [2018-06-22 05:04:37,130 WARN ]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 22 [2018-06-22 05:04:37,196 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 05:04:37,197 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 05:04:37,197 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 05:04:37,205 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 05:04:37,235 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 05:04:37,235 INFO ]: Conjunction of SSA is unsat [2018-06-22 05:04:37,237 INFO ]: Computing forward predicates... [2018-06-22 05:04:37,979 WARN ]: Spent 108.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-06-22 05:04:38,602 WARN ]: Spent 110.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 32 [2018-06-22 05:04:42,001 WARN ]: Spent 2.85 s on a formula simplification. DAG size of input: 221 DAG size of output: 41 [2018-06-22 05:04:42,004 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 05:04:42,029 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 05:04:42,029 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 05:04:42,029 INFO ]: Interpolant automaton has 13 states [2018-06-22 05:04:42,029 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 05:04:42,029 INFO ]: CoverageRelationStatistics Valid=71, Invalid=85, Unknown=0, NotChecked=0, Total=156 [2018-06-22 05:04:42,032 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-06-22 05:04:42,060 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 05:04:42,060 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-22 05:04:42,062 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 05:04:42,062 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-22 05:04:42,062 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 05:04:42,063 INFO ]: With dead ends: 14 [2018-06-22 05:04:42,063 INFO ]: Without dead ends: 14 [2018-06-22 05:04:42,063 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=71, Invalid=85, Unknown=0, NotChecked=0, Total=156 [2018-06-22 05:04:42,063 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 05:04:42,064 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 05:04:42,064 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 05:04:42,065 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-22 05:04:42,065 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-22 05:04:42,065 INFO ]: Finished accepts. word is rejected. [2018-06-22 05:04:42,065 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-22 05:04:42,065 INFO ]: Interpolant automaton has 13 states. [2018-06-22 05:04:42,065 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-22 05:04:42,065 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 05:04:42,065 INFO ]: Found error trace [2018-06-22 05:04:42,065 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 05:04:42,065 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 05:04:42,066 INFO ]: Analyzing trace with hash 679342766, now seen corresponding path program 6 times [2018-06-22 05:04:42,066 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 05:04:42,066 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 05:04:42,066 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 05:04:42,066 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 05:04:42,066 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 05:04:42,251 INFO ]: Conjunction of SSA is unsat [2018-06-22 05:04:44,380 WARN ]: Spent 1.02 s on a formula simplification. DAG size of input: 95 DAG size of output: 6 [2018-06-22 05:04:45,190 WARN ]: Spent 748.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 16 [2018-06-22 05:04:49,537 WARN ]: Spent 4.15 s on a formula simplification. DAG size of input: 490 DAG size of output: 26 [2018-06-22 05:04:54,190 WARN ]: Spent 4.52 s on a formula simplification. DAG size of input: 543 DAG size of output: 37 [2018-06-22 05:04:58,008 WARN ]: Spent 3.70 s on a formula simplification. DAG size of input: 324 DAG size of output: 33 [2018-06-22 05:04:59,653 WARN ]: Spent 1.54 s on a formula simplification. DAG size of input: 343 DAG size of output: 29 [2018-06-22 05:04:59,792 WARN ]: Spent 108.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 18 [2018-06-22 05:04:59,793 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 05:04:59,793 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 05:04:59,793 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 05:04:59,800 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 05:04:59,841 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 05:04:59,841 INFO ]: Conjunction of SSA is unsat [2018-06-22 05:04:59,844 INFO ]: Computing forward predicates... [2018-06-22 05:05:01,905 WARN ]: Spent 124.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 42 [2018-06-22 05:05:04,424 WARN ]: Spent 2.39 s on a formula simplification. DAG size of input: 215 DAG size of output: 59 [2018-06-22 05:05:04,970 WARN ]: Spent 355.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 77 [2018-06-22 05:05:04,974 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 05:05:05,008 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 05:05:05,008 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-06-22 05:05:05,008 INFO ]: Interpolant automaton has 15 states [2018-06-22 05:05:05,008 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 05:05:05,008 INFO ]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-06-22 05:05:05,008 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 15 states. [2018-06-22 05:05:05,046 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 05:05:05,046 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-22 05:05:05,047 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 05:05:05,047 INFO ]: Start accepts. Automaton has 15 states. Word has length 13 [2018-06-22 05:05:05,047 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 05:05:05,047 INFO ]: With dead ends: 16 [2018-06-22 05:05:05,047 INFO ]: Without dead ends: 16 [2018-06-22 05:05:05,048 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-06-22 05:05:05,048 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 05:05:05,049 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 05:05:05,049 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 05:05:05,050 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-22 05:05:05,050 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-06-22 05:05:05,050 INFO ]: Finished accepts. word is rejected. [2018-06-22 05:05:05,050 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-22 05:05:05,050 INFO ]: Interpolant automaton has 15 states. [2018-06-22 05:05:05,050 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-22 05:05:05,050 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 05:05:05,050 INFO ]: Found error trace [2018-06-22 05:05:05,050 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 05:05:05,050 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 05:05:05,050 INFO ]: Analyzing trace with hash 39881678, now seen corresponding path program 7 times [2018-06-22 05:05:05,051 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 05:05:05,051 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 05:05:05,054 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 05:05:05,054 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 05:05:05,054 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 05:05:06,584 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 05:05:16,498 FATAL]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:235) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$0(Interpolator.java:233) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:130) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:919) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:210) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:228) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:220) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:410) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:425) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:367) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:309) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:151) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:119) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-06-22 05:05:16,502 INFO ]: Toolchain (without parser) took 55947.85 ms. Allocated memory was 306.2 MB in the beginning and 1.3 GB in the end (delta: 973.6 MB). Free memory was 262.6 MB in the beginning and 617.2 MB in the end (delta: -354.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 3.6 GB. [2018-06-22 05:05:16,504 INFO ]: SmtParser took 0.11 ms. Allocated memory is still 306.2 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 05:05:16,504 INFO ]: ChcToBoogie took 63.52 ms. Allocated memory is still 306.2 MB. Free memory was 262.6 MB in the beginning and 260.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 05:05:16,505 INFO ]: Boogie Preprocessor took 43.39 ms. Allocated memory is still 306.2 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 05:05:16,505 INFO ]: RCFGBuilder took 221.31 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 252.6 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-22 05:05:16,505 INFO ]: TraceAbstraction took 55601.00 ms. Allocated memory was 306.2 MB in the beginning and 1.3 GB in the end (delta: 973.6 MB). Free memory was 250.6 MB in the beginning and 617.2 MB in the end (delta: -366.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 3.6 GB. [2018-06-22 05:05:16,509 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.11 ms. Allocated memory is still 306.2 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.52 ms. Allocated memory is still 306.2 MB. Free memory was 262.6 MB in the beginning and 260.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 43.39 ms. Allocated memory is still 306.2 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 221.31 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 252.6 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 55601.00 ms. Allocated memory was 306.2 MB in the beginning and 1.3 GB in the end (delta: 973.6 MB). Free memory was 250.6 MB in the beginning and 617.2 MB in the end (delta: -366.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:235) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fib_bench_safe_v1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_05-05-16-521.csv Completed graceful shutdown