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/llreve-bench/smt2/rec__limit3.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 02:31:37,016 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 02:31:37,018 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 02:31:37,033 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 02:31:37,033 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 02:31:37,034 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 02:31:37,035 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 02:31:37,039 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 02:31:37,040 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 02:31:37,041 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 02:31:37,042 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 02:31:37,043 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 02:31:37,043 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 02:31:37,044 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 02:31:37,048 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 02:31:37,049 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 02:31:37,051 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 02:31:37,063 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 02:31:37,065 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 02:31:37,066 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 02:31:37,067 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 02:31:37,069 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 02:31:37,069 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 02:31:37,069 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 02:31:37,070 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 02:31:37,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 02:31:37,076 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 02:31:37,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 02:31:37,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 02:31:37,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 02:31:37,078 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 02:31:37,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 02:31:37,082 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 02:31:37,083 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 02:31:37,084 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 02:31:37,084 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 02:31:37,098 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 02:31:37,098 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 02:31:37,098 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 02:31:37,099 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 02:31:37,100 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 02:31:37,100 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 02:31:37,100 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 02:31:37,100 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 02:31:37,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:31:37,101 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 02:31:37,101 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 02:31:37,101 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 02:31:37,101 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 02:31:37,101 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 02:31:37,102 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 02:31:37,102 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 02:31:37,102 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 02:31:37,103 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 02:31:37,103 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 02:31:37,153 INFO ]: Repository-Root is: /tmp [2018-06-22 02:31:37,170 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 02:31:37,174 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 02:31:37,176 INFO ]: Initializing SmtParser... [2018-06-22 02:31:37,176 INFO ]: SmtParser initialized [2018-06-22 02:31:37,177 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__limit3.smt2 [2018-06-22 02:31:37,178 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 02:31:37,272 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__limit3.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@49d59bf3 [2018-06-22 02:31:37,496 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__limit3.smt2 [2018-06-22 02:31:37,500 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 02:31:37,506 INFO ]: Walking toolchain with 4 elements. [2018-06-22 02:31:37,508 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 02:31:37,508 INFO ]: Initializing ChcToBoogie... [2018-06-22 02:31:37,508 INFO ]: ChcToBoogie initialized [2018-06-22 02:31:37,511 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:31:37" (1/1) ... [2018-06-22 02:31:37,569 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:31:37 Unit [2018-06-22 02:31:37,569 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 02:31:37,570 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 02:31:37,570 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 02:31:37,570 INFO ]: Boogie Preprocessor initialized [2018-06-22 02:31:37,589 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:31:37" (1/1) ... [2018-06-22 02:31:37,590 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:31:37" (1/1) ... [2018-06-22 02:31:37,597 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:31:37" (1/1) ... [2018-06-22 02:31:37,597 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:31:37" (1/1) ... [2018-06-22 02:31:37,602 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:31:37" (1/1) ... [2018-06-22 02:31:37,605 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:31:37" (1/1) ... [2018-06-22 02:31:37,606 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:31:37" (1/1) ... [2018-06-22 02:31:37,609 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 02:31:37,610 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 02:31:37,610 INFO ]: Initializing RCFGBuilder... [2018-06-22 02:31:37,610 INFO ]: RCFGBuilder initialized [2018-06-22 02:31:37,611 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:31:37" (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 02:31:37,628 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 02:31:37,628 INFO ]: Found specification of procedure gotoProc [2018-06-22 02:31:37,628 INFO ]: Found implementation of procedure gotoProc [2018-06-22 02:31:37,628 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 02:31:37,628 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 02:31:37,628 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 02:31:38,277 INFO ]: Using library mode [2018-06-22 02:31:38,278 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:31:38 BoogieIcfgContainer [2018-06-22 02:31:38,278 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 02:31:38,279 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 02:31:38,279 INFO ]: Initializing TraceAbstraction... [2018-06-22 02:31:38,282 INFO ]: TraceAbstraction initialized [2018-06-22 02:31:38,283 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:31:37" (1/3) ... [2018-06-22 02:31:38,283 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a772d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 02:31:38, skipping insertion in model container [2018-06-22 02:31:38,284 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:31:37" (2/3) ... [2018-06-22 02:31:38,284 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a772d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:31:38, skipping insertion in model container [2018-06-22 02:31:38,284 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:31:38" (3/3) ... [2018-06-22 02:31:38,286 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 02:31:38,295 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 02:31:38,305 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 02:31:38,346 INFO ]: Using default assertion order modulation [2018-06-22 02:31:38,346 INFO ]: Interprodecural is true [2018-06-22 02:31:38,346 INFO ]: Hoare is false [2018-06-22 02:31:38,346 INFO ]: Compute interpolants for FPandBP [2018-06-22 02:31:38,346 INFO ]: Backedges is TWOTRACK [2018-06-22 02:31:38,346 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 02:31:38,346 INFO ]: Difference is false [2018-06-22 02:31:38,346 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 02:31:38,346 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 02:31:38,360 INFO ]: Start isEmpty. Operand 28 states. [2018-06-22 02:31:38,375 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 02:31:38,375 INFO ]: Found error trace [2018-06-22 02:31:38,376 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:38,376 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:38,381 INFO ]: Analyzing trace with hash -441380873, now seen corresponding path program 1 times [2018-06-22 02:31:38,384 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:38,384 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:38,420 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:38,420 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:38,420 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:38,452 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:38,482 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:31:38,484 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:31:38,485 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 02:31:38,486 INFO ]: Interpolant automaton has 2 states [2018-06-22 02:31:38,503 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 02:31:38,503 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 02:31:38,507 INFO ]: Start difference. First operand 28 states. Second operand 2 states. [2018-06-22 02:31:38,532 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:38,532 INFO ]: Finished difference Result 26 states and 41 transitions. [2018-06-22 02:31:38,532 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 02:31:38,533 INFO ]: Start accepts. Automaton has 2 states. Word has length 7 [2018-06-22 02:31:38,533 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:38,542 INFO ]: With dead ends: 26 [2018-06-22 02:31:38,542 INFO ]: Without dead ends: 26 [2018-06-22 02:31:38,544 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 02:31:38,563 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 02:31:38,593 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-22 02:31:38,595 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 02:31:38,598 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 41 transitions. [2018-06-22 02:31:38,599 INFO ]: Start accepts. Automaton has 26 states and 41 transitions. Word has length 7 [2018-06-22 02:31:38,599 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:38,599 INFO ]: Abstraction has 26 states and 41 transitions. [2018-06-22 02:31:38,599 INFO ]: Interpolant automaton has 2 states. [2018-06-22 02:31:38,600 INFO ]: Start isEmpty. Operand 26 states and 41 transitions. [2018-06-22 02:31:38,603 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:31:38,603 INFO ]: Found error trace [2018-06-22 02:31:38,603 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:38,603 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:38,603 INFO ]: Analyzing trace with hash -794434479, now seen corresponding path program 1 times [2018-06-22 02:31:38,603 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:38,604 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:38,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:38,604 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:38,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:38,616 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:38,744 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:31:38,744 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:31:38,744 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:31:38,745 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:31:38,746 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:31:38,746 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:31:38,746 INFO ]: Start difference. First operand 26 states and 41 transitions. Second operand 4 states. [2018-06-22 02:31:39,488 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:39,488 INFO ]: Finished difference Result 49 states and 79 transitions. [2018-06-22 02:31:39,488 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:31:39,489 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 02:31:39,489 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:39,491 INFO ]: With dead ends: 49 [2018-06-22 02:31:39,491 INFO ]: Without dead ends: 49 [2018-06-22 02:31:39,492 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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 02:31:39,493 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 02:31:39,505 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-06-22 02:31:39,507 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 02:31:39,510 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2018-06-22 02:31:39,510 INFO ]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 8 [2018-06-22 02:31:39,510 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:39,510 INFO ]: Abstraction has 49 states and 79 transitions. [2018-06-22 02:31:39,510 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:31:39,510 INFO ]: Start isEmpty. Operand 49 states and 79 transitions. [2018-06-22 02:31:39,511 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:31:39,511 INFO ]: Found error trace [2018-06-22 02:31:39,511 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:39,511 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:39,511 INFO ]: Analyzing trace with hash -791663916, now seen corresponding path program 1 times [2018-06-22 02:31:39,511 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:39,511 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:39,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:39,513 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:39,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:39,517 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:39,546 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:31:39,546 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:31:39,546 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:31:39,546 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:31:39,546 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:31:39,546 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:31:39,547 INFO ]: Start difference. First operand 49 states and 79 transitions. Second operand 4 states. [2018-06-22 02:31:39,738 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:39,738 INFO ]: Finished difference Result 72 states and 117 transitions. [2018-06-22 02:31:39,738 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:31:39,738 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 02:31:39,738 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:39,742 INFO ]: With dead ends: 72 [2018-06-22 02:31:39,742 INFO ]: Without dead ends: 72 [2018-06-22 02:31:39,742 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 02:31:39,743 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 02:31:39,751 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-06-22 02:31:39,752 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 02:31:39,755 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 117 transitions. [2018-06-22 02:31:39,755 INFO ]: Start accepts. Automaton has 72 states and 117 transitions. Word has length 8 [2018-06-22 02:31:39,755 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:39,755 INFO ]: Abstraction has 72 states and 117 transitions. [2018-06-22 02:31:39,755 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:31:39,755 INFO ]: Start isEmpty. Operand 72 states and 117 transitions. [2018-06-22 02:31:39,756 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:31:39,756 INFO ]: Found error trace [2018-06-22 02:31:39,756 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:39,756 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:39,756 INFO ]: Analyzing trace with hash 1636620787, now seen corresponding path program 1 times [2018-06-22 02:31:39,757 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:39,757 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:39,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:39,757 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:39,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:39,764 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:39,802 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:31:39,803 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:31:39,803 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:31:39,803 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:31:39,803 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:31:39,803 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:31:39,803 INFO ]: Start difference. First operand 72 states and 117 transitions. Second operand 4 states. [2018-06-22 02:31:40,066 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:40,066 INFO ]: Finished difference Result 91 states and 148 transitions. [2018-06-22 02:31:40,066 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:31:40,066 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-22 02:31:40,067 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:40,069 INFO ]: With dead ends: 91 [2018-06-22 02:31:40,069 INFO ]: Without dead ends: 91 [2018-06-22 02:31:40,069 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 02:31:40,070 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 02:31:40,079 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-06-22 02:31:40,079 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-22 02:31:40,082 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 148 transitions. [2018-06-22 02:31:40,082 INFO ]: Start accepts. Automaton has 91 states and 148 transitions. Word has length 11 [2018-06-22 02:31:40,082 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:40,082 INFO ]: Abstraction has 91 states and 148 transitions. [2018-06-22 02:31:40,082 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:31:40,082 INFO ]: Start isEmpty. Operand 91 states and 148 transitions. [2018-06-22 02:31:40,083 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:31:40,083 INFO ]: Found error trace [2018-06-22 02:31:40,084 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:40,084 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:40,084 INFO ]: Analyzing trace with hash -996008709, now seen corresponding path program 1 times [2018-06-22 02:31:40,084 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:40,084 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:40,085 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:40,085 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:40,085 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:40,108 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:40,190 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:31:40,190 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:31:40,190 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:31:40,190 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:31:40,190 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:31:40,190 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:31:40,190 INFO ]: Start difference. First operand 91 states and 148 transitions. Second operand 3 states. [2018-06-22 02:31:40,342 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:40,342 INFO ]: Finished difference Result 147 states and 272 transitions. [2018-06-22 02:31:40,346 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:31:40,346 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-22 02:31:40,346 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:40,351 INFO ]: With dead ends: 147 [2018-06-22 02:31:40,351 INFO ]: Without dead ends: 147 [2018-06-22 02:31:40,352 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 02:31:40,352 INFO ]: Start minimizeSevpa. Operand 147 states. [2018-06-22 02:31:40,377 INFO ]: Finished minimizeSevpa. Reduced states from 147 to 95. [2018-06-22 02:31:40,377 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-22 02:31:40,380 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 160 transitions. [2018-06-22 02:31:40,380 INFO ]: Start accepts. Automaton has 95 states and 160 transitions. Word has length 11 [2018-06-22 02:31:40,381 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:40,381 INFO ]: Abstraction has 95 states and 160 transitions. [2018-06-22 02:31:40,381 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:31:40,381 INFO ]: Start isEmpty. Operand 95 states and 160 transitions. [2018-06-22 02:31:40,383 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:31:40,383 INFO ]: Found error trace [2018-06-22 02:31:40,383 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:40,384 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:40,384 INFO ]: Analyzing trace with hash -277368985, now seen corresponding path program 1 times [2018-06-22 02:31:40,384 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:40,384 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:40,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:40,385 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:40,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:40,405 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:40,574 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:31:40,574 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:31:40,574 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 02:31:40,584 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:40,621 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:40,628 INFO ]: Computing forward predicates... [2018-06-22 02:31:41,271 WARN ]: Spent 524.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2018-06-22 02:31:41,406 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:31:41,431 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:31:41,431 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 02:31:41,431 INFO ]: Interpolant automaton has 8 states [2018-06-22 02:31:41,431 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 02:31:41,431 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:31:41,431 INFO ]: Start difference. First operand 95 states and 160 transitions. Second operand 8 states. [2018-06-22 02:31:41,859 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:41,859 INFO ]: Finished difference Result 171 states and 312 transitions. [2018-06-22 02:31:41,861 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:31:41,861 INFO ]: Start accepts. Automaton has 8 states. Word has length 20 [2018-06-22 02:31:41,861 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:41,869 INFO ]: With dead ends: 171 [2018-06-22 02:31:41,869 INFO ]: Without dead ends: 171 [2018-06-22 02:31:41,869 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:31:41,869 INFO ]: Start minimizeSevpa. Operand 171 states. [2018-06-22 02:31:41,891 INFO ]: Finished minimizeSevpa. Reduced states from 171 to 119. [2018-06-22 02:31:41,891 INFO ]: Start removeUnreachable. Operand 119 states. [2018-06-22 02:31:41,894 INFO ]: Finished removeUnreachable. Reduced from 119 states to 119 states and 192 transitions. [2018-06-22 02:31:41,894 INFO ]: Start accepts. Automaton has 119 states and 192 transitions. Word has length 20 [2018-06-22 02:31:41,895 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:41,895 INFO ]: Abstraction has 119 states and 192 transitions. [2018-06-22 02:31:41,895 INFO ]: Interpolant automaton has 8 states. [2018-06-22 02:31:41,895 INFO ]: Start isEmpty. Operand 119 states and 192 transitions. [2018-06-22 02:31:41,898 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 02:31:41,898 INFO ]: Found error trace [2018-06-22 02:31:41,898 INFO ]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:41,898 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:41,898 INFO ]: Analyzing trace with hash 83387879, now seen corresponding path program 2 times [2018-06-22 02:31:41,898 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:41,898 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:41,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:41,899 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:41,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:41,941 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:42,299 INFO ]: Checked inductivity of 48 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 02:31:42,299 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:31:42,299 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) [2018-06-22 02:31:42,314 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:31:42,367 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:31:42,367 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:42,372 INFO ]: Computing forward predicates... [2018-06-22 02:31:43,078 WARN ]: Spent 418.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2018-06-22 02:31:43,340 INFO ]: Checked inductivity of 48 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 02:31:43,370 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:31:43,370 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-22 02:31:43,371 INFO ]: Interpolant automaton has 16 states [2018-06-22 02:31:43,371 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 02:31:43,372 INFO ]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-06-22 02:31:43,372 INFO ]: Start difference. First operand 119 states and 192 transitions. Second operand 16 states. [2018-06-22 02:31:43,660 WARN ]: Spent 147.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2018-06-22 02:31:44,020 WARN ]: Spent 187.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2018-06-22 02:31:45,267 WARN ]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-06-22 02:31:46,204 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:46,204 INFO ]: Finished difference Result 363 states and 964 transitions. [2018-06-22 02:31:46,206 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 02:31:46,206 INFO ]: Start accepts. Automaton has 16 states. Word has length 38 [2018-06-22 02:31:46,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:46,223 INFO ]: With dead ends: 363 [2018-06-22 02:31:46,224 INFO ]: Without dead ends: 363 [2018-06-22 02:31:46,224 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2018-06-22 02:31:46,225 INFO ]: Start minimizeSevpa. Operand 363 states. [2018-06-22 02:31:46,307 INFO ]: Finished minimizeSevpa. Reduced states from 363 to 179. [2018-06-22 02:31:46,307 INFO ]: Start removeUnreachable. Operand 179 states. [2018-06-22 02:31:46,311 INFO ]: Finished removeUnreachable. Reduced from 179 states to 179 states and 296 transitions. [2018-06-22 02:31:46,311 INFO ]: Start accepts. Automaton has 179 states and 296 transitions. Word has length 38 [2018-06-22 02:31:46,311 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:46,311 INFO ]: Abstraction has 179 states and 296 transitions. [2018-06-22 02:31:46,311 INFO ]: Interpolant automaton has 16 states. [2018-06-22 02:31:46,311 INFO ]: Start isEmpty. Operand 179 states and 296 transitions. [2018-06-22 02:31:46,318 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 02:31:46,318 INFO ]: Found error trace [2018-06-22 02:31:46,318 INFO ]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:46,319 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:46,320 INFO ]: Analyzing trace with hash 2129858335, now seen corresponding path program 1 times [2018-06-22 02:31:46,320 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:46,320 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:46,321 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:46,321 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:31:46,321 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:46,352 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:46,439 INFO ]: Checked inductivity of 112 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-06-22 02:31:46,440 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:31:46,440 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:31:46,440 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:31:46,440 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:31:46,440 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:31:46,440 INFO ]: Start difference. First operand 179 states and 296 transitions. Second operand 3 states. [2018-06-22 02:31:46,535 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:46,535 INFO ]: Finished difference Result 183 states and 300 transitions. [2018-06-22 02:31:46,535 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:31:46,535 INFO ]: Start accepts. Automaton has 3 states. Word has length 57 [2018-06-22 02:31:46,536 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:46,538 INFO ]: With dead ends: 183 [2018-06-22 02:31:46,538 INFO ]: Without dead ends: 116 [2018-06-22 02:31:46,538 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 02:31:46,538 INFO ]: Start minimizeSevpa. Operand 116 states. [2018-06-22 02:31:46,546 INFO ]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-06-22 02:31:46,546 INFO ]: Start removeUnreachable. Operand 116 states. [2018-06-22 02:31:46,548 INFO ]: Finished removeUnreachable. Reduced from 116 states to 116 states and 173 transitions. [2018-06-22 02:31:46,548 INFO ]: Start accepts. Automaton has 116 states and 173 transitions. Word has length 57 [2018-06-22 02:31:46,548 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:46,548 INFO ]: Abstraction has 116 states and 173 transitions. [2018-06-22 02:31:46,548 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:31:46,548 INFO ]: Start isEmpty. Operand 116 states and 173 transitions. [2018-06-22 02:31:46,551 INFO ]: Finished isEmpty. Found accepting run of length 59 [2018-06-22 02:31:46,551 INFO ]: Found error trace [2018-06-22 02:31:46,551 INFO ]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:46,551 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:46,551 INFO ]: Analyzing trace with hash -520927395, now seen corresponding path program 1 times [2018-06-22 02:31:46,551 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:46,551 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:46,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:46,552 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:46,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:46,573 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:46,655 INFO ]: Checked inductivity of 113 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-06-22 02:31:46,655 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:31:46,655 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:31:46,656 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:31:46,656 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:31:46,656 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:31:46,656 INFO ]: Start difference. First operand 116 states and 173 transitions. Second operand 3 states. [2018-06-22 02:31:46,717 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:46,718 INFO ]: Finished difference Result 118 states and 175 transitions. [2018-06-22 02:31:46,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:31:46,718 INFO ]: Start accepts. Automaton has 3 states. Word has length 58 [2018-06-22 02:31:46,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:46,719 INFO ]: With dead ends: 118 [2018-06-22 02:31:46,719 INFO ]: Without dead ends: 108 [2018-06-22 02:31:46,720 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 02:31:46,720 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 02:31:46,725 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-06-22 02:31:46,725 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-22 02:31:46,726 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2018-06-22 02:31:46,726 INFO ]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 58 [2018-06-22 02:31:46,727 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:46,727 INFO ]: Abstraction has 108 states and 156 transitions. [2018-06-22 02:31:46,727 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:31:46,727 INFO ]: Start isEmpty. Operand 108 states and 156 transitions. [2018-06-22 02:31:46,729 INFO ]: Finished isEmpty. Found accepting run of length 84 [2018-06-22 02:31:46,729 INFO ]: Found error trace [2018-06-22 02:31:46,729 INFO ]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:46,729 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:46,730 INFO ]: Analyzing trace with hash -1633828101, now seen corresponding path program 3 times [2018-06-22 02:31:46,730 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:46,730 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:46,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:46,730 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:46,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:46,781 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:47,817 INFO ]: Checked inductivity of 308 backedges. 24 proven. 92 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-06-22 02:31:47,817 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:31:47,817 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 02:31:47,831 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:31:47,978 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 02:31:47,978 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:47,987 INFO ]: Computing forward predicates... [2018-06-22 02:31:49,714 INFO ]: Checked inductivity of 308 backedges. 59 proven. 78 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-06-22 02:31:49,736 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:31:49,736 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2018-06-22 02:31:49,736 INFO ]: Interpolant automaton has 40 states [2018-06-22 02:31:49,736 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 02:31:49,737 INFO ]: CoverageRelationStatistics Valid=127, Invalid=1433, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 02:31:49,737 INFO ]: Start difference. First operand 108 states and 156 transitions. Second operand 40 states. [2018-06-22 02:31:51,425 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:51,425 INFO ]: Finished difference Result 67 states and 101 transitions. [2018-06-22 02:31:51,426 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 02:31:51,426 INFO ]: Start accepts. Automaton has 40 states. Word has length 83 [2018-06-22 02:31:51,426 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:51,426 INFO ]: With dead ends: 67 [2018-06-22 02:31:51,426 INFO ]: Without dead ends: 0 [2018-06-22 02:31:51,427 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=254, Invalid=1726, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 02:31:51,427 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 02:31:51,427 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 02:31:51,427 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 02:31:51,427 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 02:31:51,427 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2018-06-22 02:31:51,427 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:51,427 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 02:31:51,427 INFO ]: Interpolant automaton has 40 states. [2018-06-22 02:31:51,427 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 02:31:51,427 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 02:31:51,432 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:31:51 BoogieIcfgContainer [2018-06-22 02:31:51,433 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 02:31:51,433 INFO ]: Toolchain (without parser) took 13932.35 ms. Allocated memory was 308.8 MB in the beginning and 412.6 MB in the end (delta: 103.8 MB). Free memory was 263.2 MB in the beginning and 238.1 MB in the end (delta: 25.1 MB). Peak memory consumption was 128.9 MB. Max. memory is 3.6 GB. [2018-06-22 02:31:51,434 INFO ]: SmtParser took 0.09 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 02:31:51,435 INFO ]: ChcToBoogie took 61.76 ms. Allocated memory is still 308.8 MB. Free memory was 263.2 MB in the beginning and 261.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 02:31:51,435 INFO ]: Boogie Preprocessor took 39.56 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 260.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-22 02:31:51,436 INFO ]: RCFGBuilder took 667.97 ms. Allocated memory is still 308.8 MB. Free memory was 259.1 MB in the beginning and 247.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 3.6 GB. [2018-06-22 02:31:51,436 INFO ]: TraceAbstraction took 13153.48 ms. Allocated memory was 308.8 MB in the beginning and 412.6 MB in the end (delta: 103.8 MB). Free memory was 247.1 MB in the beginning and 238.1 MB in the end (delta: 9.0 MB). Peak memory consumption was 112.8 MB. Max. memory is 3.6 GB. [2018-06-22 02:31:51,439 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 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 61.76 ms. Allocated memory is still 308.8 MB. Free memory was 263.2 MB in the beginning and 261.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 39.56 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 260.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 667.97 ms. Allocated memory is still 308.8 MB. Free memory was 259.1 MB in the beginning and 247.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 13153.48 ms. Allocated memory was 308.8 MB in the beginning and 412.6 MB in the end (delta: 103.8 MB). Free memory was 247.1 MB in the beginning and 238.1 MB in the end (delta: 9.0 MB). Peak memory consumption was 112.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. SAFE Result, 13.0s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 463 SDtfs, 366 SDslu, 1090 SDs, 0 SdLazy, 953 SolverSat, 185 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=7, 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 288 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 442 NumberOfCodeBlocks, 442 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 429 ConstructedInterpolants, 1 QuantifiedInterpolants, 201410 SizeOfPredicates, 42 NumberOfNonLiveVariables, 699 ConjunctsInSsa, 204 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 755/951 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/rec__limit3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_02-31-51-455.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__limit3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_02-31-51-455.csv Received shutdown request...