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/hopv/lia/fpice/inductive.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:38:28,546 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:38:28,548 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:38:28,559 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:38:28,559 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:38:28,560 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:38:28,561 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:38:28,563 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:38:28,564 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:38:28,565 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:38:28,566 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:38:28,566 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:38:28,567 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:38:28,568 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:38:28,568 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:38:28,569 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:38:28,571 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:38:28,573 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:38:28,574 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:38:28,575 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:38:28,576 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:38:28,579 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:38:28,579 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:38:28,579 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:38:28,580 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:38:28,581 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:38:28,582 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:38:28,583 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:38:28,584 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:38:28,584 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:38:28,585 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:38:28,586 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:38:28,586 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:38:28,587 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:38:28,587 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:38:28,588 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:38:28,601 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:38:28,601 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:38:28,602 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:38:28,602 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:38:28,603 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:38:28,603 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:38:28,603 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:38:28,603 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:38:28,604 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:38:28,604 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:38:28,604 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:38:28,604 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:38:28,605 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:38:28,605 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:38:28,605 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:38:28,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:38:28,606 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:38:28,607 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:38:28,607 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:38:28,650 INFO ]: Repository-Root is: /tmp [2018-06-22 01:38:28,664 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:38:28,668 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:38:28,669 INFO ]: Initializing SmtParser... [2018-06-22 01:38:28,669 INFO ]: SmtParser initialized [2018-06-22 01:38:28,670 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/fpice/inductive.smt2 [2018-06-22 01:38:28,672 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 01:38:28,766 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/fpice/inductive.smt2 unknown [2018-06-22 01:38:28,953 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/fpice/inductive.smt2 [2018-06-22 01:38:28,957 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:38:28,963 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:38:28,964 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:38:28,964 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:38:28,964 INFO ]: ChcToBoogie initialized [2018-06-22 01:38:28,967 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:38:28" (1/1) ... [2018-06-22 01:38:29,024 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:29 Unit [2018-06-22 01:38:29,024 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:38:29,025 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:38:29,025 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:38:29,025 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:38:29,044 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:29" (1/1) ... [2018-06-22 01:38:29,044 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:29" (1/1) ... [2018-06-22 01:38:29,050 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:29" (1/1) ... [2018-06-22 01:38:29,051 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:29" (1/1) ... [2018-06-22 01:38:29,064 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:29" (1/1) ... [2018-06-22 01:38:29,067 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:29" (1/1) ... [2018-06-22 01:38:29,069 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:29" (1/1) ... [2018-06-22 01:38:29,071 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:38:29,071 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:38:29,071 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:38:29,071 INFO ]: RCFGBuilder initialized [2018-06-22 01:38:29,072 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:29" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:38:29,092 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:38:29,092 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:38:29,092 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:38:29,092 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:38:29,092 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:38:29,092 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:38:29,428 INFO ]: Using library mode [2018-06-22 01:38:29,429 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:38:29 BoogieIcfgContainer [2018-06-22 01:38:29,429 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:38:29,430 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:38:29,430 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:38:29,433 INFO ]: TraceAbstraction initialized [2018-06-22 01:38:29,433 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:38:28" (1/3) ... [2018-06-22 01:38:29,434 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54390f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:38:29, skipping insertion in model container [2018-06-22 01:38:29,434 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:29" (2/3) ... [2018-06-22 01:38:29,435 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54390f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:38:29, skipping insertion in model container [2018-06-22 01:38:29,435 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:38:29" (3/3) ... [2018-06-22 01:38:29,436 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:38:29,445 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:38:29,455 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:38:29,495 INFO ]: Using default assertion order modulation [2018-06-22 01:38:29,495 INFO ]: Interprodecural is true [2018-06-22 01:38:29,495 INFO ]: Hoare is false [2018-06-22 01:38:29,495 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:38:29,495 INFO ]: Backedges is TWOTRACK [2018-06-22 01:38:29,495 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:38:29,495 INFO ]: Difference is false [2018-06-22 01:38:29,495 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:38:29,495 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:38:29,510 INFO ]: Start isEmpty. Operand 13 states. [2018-06-22 01:38:29,524 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:38:29,524 INFO ]: Found error trace [2018-06-22 01:38:29,524 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:38:29,524 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:38:29,528 INFO ]: Analyzing trace with hash -694525632, now seen corresponding path program 1 times [2018-06-22 01:38:29,529 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:38:29,530 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:38:29,564 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:29,564 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:29,564 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:29,596 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:29,673 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:38:29,675 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:38:29,675 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:38:29,676 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:38:29,688 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:38:29,688 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:38:29,691 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-22 01:38:29,890 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:38:29,890 INFO ]: Finished difference Result 19 states and 29 transitions. [2018-06-22 01:38:29,891 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:38:29,892 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-22 01:38:29,892 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:38:29,900 INFO ]: With dead ends: 19 [2018-06-22 01:38:29,900 INFO ]: Without dead ends: 19 [2018-06-22 01:38:29,902 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 01:38:29,917 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:38:29,935 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 01:38:29,936 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:38:29,937 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. [2018-06-22 01:38:29,939 INFO ]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 7 [2018-06-22 01:38:29,941 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:38:29,941 INFO ]: Abstraction has 19 states and 29 transitions. [2018-06-22 01:38:29,941 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:38:29,941 INFO ]: Start isEmpty. Operand 19 states and 29 transitions. [2018-06-22 01:38:29,942 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:38:29,942 INFO ]: Found error trace [2018-06-22 01:38:29,942 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:38:29,942 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:38:29,942 INFO ]: Analyzing trace with hash -18614087, now seen corresponding path program 1 times [2018-06-22 01:38:29,942 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:38:29,943 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:38:29,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:29,945 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:29,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:29,956 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:29,979 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:38:29,979 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:38:29,979 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:38:29,981 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:38:29,981 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:38:29,981 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:38:29,981 INFO ]: Start difference. First operand 19 states and 29 transitions. Second operand 3 states. [2018-06-22 01:38:30,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:38:30,068 INFO ]: Finished difference Result 21 states and 35 transitions. [2018-06-22 01:38:30,069 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:38:30,069 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:38:30,069 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:38:30,069 INFO ]: With dead ends: 21 [2018-06-22 01:38:30,069 INFO ]: Without dead ends: 21 [2018-06-22 01:38:30,070 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 01:38:30,070 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:38:30,073 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 01:38:30,073 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:38:30,074 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2018-06-22 01:38:30,074 INFO ]: Start accepts. Automaton has 21 states and 35 transitions. Word has length 8 [2018-06-22 01:38:30,074 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:38:30,074 INFO ]: Abstraction has 21 states and 35 transitions. [2018-06-22 01:38:30,074 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:38:30,074 INFO ]: Start isEmpty. Operand 21 states and 35 transitions. [2018-06-22 01:38:30,075 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:38:30,075 INFO ]: Found error trace [2018-06-22 01:38:30,075 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:38:30,075 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:38:30,075 INFO ]: Analyzing trace with hash -580827596, now seen corresponding path program 1 times [2018-06-22 01:38:30,075 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:38:30,075 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:38:30,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:30,076 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:30,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:30,084 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:30,109 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:38:30,109 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:38:30,109 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:38:30,109 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:38:30,109 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:38:30,109 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:38:30,110 INFO ]: Start difference. First operand 21 states and 35 transitions. Second operand 3 states. [2018-06-22 01:38:30,199 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:38:30,199 INFO ]: Finished difference Result 27 states and 40 transitions. [2018-06-22 01:38:30,199 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:38:30,199 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:38:30,199 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:38:30,201 INFO ]: With dead ends: 27 [2018-06-22 01:38:30,201 INFO ]: Without dead ends: 25 [2018-06-22 01:38:30,201 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 01:38:30,202 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:38:30,207 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-06-22 01:38:30,207 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:38:30,207 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2018-06-22 01:38:30,207 INFO ]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 9 [2018-06-22 01:38:30,207 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:38:30,207 INFO ]: Abstraction has 21 states and 31 transitions. [2018-06-22 01:38:30,207 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:38:30,207 INFO ]: Start isEmpty. Operand 21 states and 31 transitions. [2018-06-22 01:38:30,208 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:38:30,208 INFO ]: Found error trace [2018-06-22 01:38:30,208 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:38:30,208 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:38:30,208 INFO ]: Analyzing trace with hash -1265119991, now seen corresponding path program 1 times [2018-06-22 01:38:30,208 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:38:30,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:38:30,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:30,209 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:30,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:30,225 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:30,285 INFO ]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:38:30,285 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:38:30,285 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:38:30,285 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:38:30,285 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:38:30,285 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:38:30,285 INFO ]: Start difference. First operand 21 states and 31 transitions. Second operand 4 states. [2018-06-22 01:38:30,359 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:38:30,359 INFO ]: Finished difference Result 25 states and 39 transitions. [2018-06-22 01:38:30,359 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:38:30,359 INFO ]: Start accepts. Automaton has 4 states. Word has length 15 [2018-06-22 01:38:30,359 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:38:30,360 INFO ]: With dead ends: 25 [2018-06-22 01:38:30,360 INFO ]: Without dead ends: 23 [2018-06-22 01:38:30,360 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:38:30,360 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:38:30,363 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 01:38:30,363 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:38:30,364 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-06-22 01:38:30,364 INFO ]: Start accepts. Automaton has 23 states and 35 transitions. Word has length 15 [2018-06-22 01:38:30,365 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:38:30,365 INFO ]: Abstraction has 23 states and 35 transitions. [2018-06-22 01:38:30,365 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:38:30,365 INFO ]: Start isEmpty. Operand 23 states and 35 transitions. [2018-06-22 01:38:30,365 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:38:30,365 INFO ]: Found error trace [2018-06-22 01:38:30,366 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:38:30,366 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:38:30,366 INFO ]: Analyzing trace with hash -567804956, now seen corresponding path program 1 times [2018-06-22 01:38:30,366 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:38:30,366 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:38:30,367 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:30,367 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:30,367 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:30,388 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:30,457 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:38:30,457 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:38:30,457 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 01:38:30,466 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:30,514 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:30,524 INFO ]: Computing forward predicates... [2018-06-22 01:38:30,671 INFO ]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:38:30,695 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:38:30,695 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-22 01:38:30,695 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:38:30,696 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:38:30,696 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:38:30,696 INFO ]: Start difference. First operand 23 states and 35 transitions. Second operand 8 states. [2018-06-22 01:38:31,152 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:38:31,152 INFO ]: Finished difference Result 33 states and 47 transitions. [2018-06-22 01:38:31,152 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:38:31,152 INFO ]: Start accepts. Automaton has 8 states. Word has length 16 [2018-06-22 01:38:31,152 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:38:31,153 INFO ]: With dead ends: 33 [2018-06-22 01:38:31,153 INFO ]: Without dead ends: 27 [2018-06-22 01:38:31,153 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:38:31,154 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:38:31,159 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 01:38:31,159 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:38:31,160 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. [2018-06-22 01:38:31,160 INFO ]: Start accepts. Automaton has 25 states and 38 transitions. Word has length 16 [2018-06-22 01:38:31,160 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:38:31,160 INFO ]: Abstraction has 25 states and 38 transitions. [2018-06-22 01:38:31,160 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:38:31,160 INFO ]: Start isEmpty. Operand 25 states and 38 transitions. [2018-06-22 01:38:31,161 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:38:31,161 INFO ]: Found error trace [2018-06-22 01:38:31,161 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:38:31,161 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:38:31,161 INFO ]: Analyzing trace with hash 853939858, now seen corresponding path program 1 times [2018-06-22 01:38:31,161 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:38:31,161 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:38:31,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:31,164 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:31,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:31,179 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:31,220 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:38:31,221 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:38:31,221 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 01:38:31,228 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:31,256 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:31,258 INFO ]: Computing forward predicates... [2018-06-22 01:38:31,272 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:38:31,297 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:38:31,297 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-22 01:38:31,297 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:38:31,297 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:38:31,297 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:38:31,297 INFO ]: Start difference. First operand 25 states and 38 transitions. Second operand 5 states. [2018-06-22 01:38:31,761 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:38:31,761 INFO ]: Finished difference Result 35 states and 53 transitions. [2018-06-22 01:38:31,762 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:38:31,762 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 01:38:31,763 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:38:31,763 INFO ]: With dead ends: 35 [2018-06-22 01:38:31,763 INFO ]: Without dead ends: 27 [2018-06-22 01:38:31,763 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:38:31,764 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:38:31,766 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-06-22 01:38:31,766 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:38:31,769 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2018-06-22 01:38:31,769 INFO ]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 17 [2018-06-22 01:38:31,769 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:38:31,769 INFO ]: Abstraction has 24 states and 32 transitions. [2018-06-22 01:38:31,769 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:38:31,769 INFO ]: Start isEmpty. Operand 24 states and 32 transitions. [2018-06-22 01:38:31,769 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:38:31,770 INFO ]: Found error trace [2018-06-22 01:38:31,770 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:38:31,770 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:38:31,770 INFO ]: Analyzing trace with hash -128627667, now seen corresponding path program 1 times [2018-06-22 01:38:31,770 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:38:31,770 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:38:31,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:31,771 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:31,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:31,802 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:31,880 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:38:31,880 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:38:31,880 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 01:38:31,895 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:31,927 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:31,930 INFO ]: Computing forward predicates... [2018-06-22 01:38:31,951 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:38:31,976 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:38:31,976 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-22 01:38:31,976 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:38:31,976 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:38:31,977 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:38:31,977 INFO ]: Start difference. First operand 24 states and 32 transitions. Second operand 5 states. [2018-06-22 01:38:32,157 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:38:32,157 INFO ]: Finished difference Result 35 states and 46 transitions. [2018-06-22 01:38:32,158 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:38:32,158 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 01:38:32,158 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:38:32,158 INFO ]: With dead ends: 35 [2018-06-22 01:38:32,158 INFO ]: Without dead ends: 29 [2018-06-22 01:38:32,159 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:38:32,159 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:38:32,164 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-06-22 01:38:32,164 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:38:32,165 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2018-06-22 01:38:32,165 INFO ]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 17 [2018-06-22 01:38:32,165 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:38:32,165 INFO ]: Abstraction has 24 states and 31 transitions. [2018-06-22 01:38:32,165 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:38:32,165 INFO ]: Start isEmpty. Operand 24 states and 31 transitions. [2018-06-22 01:38:32,166 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:38:32,166 INFO ]: Found error trace [2018-06-22 01:38:32,166 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:38:32,166 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:38:32,166 INFO ]: Analyzing trace with hash 1639993878, now seen corresponding path program 1 times [2018-06-22 01:38:32,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:38:32,166 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:38:32,168 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:32,168 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:32,168 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:32,184 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:32,242 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:38:32,242 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:38:32,242 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 01:38:32,248 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:32,276 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:32,279 INFO ]: Computing forward predicates... [2018-06-22 01:38:32,355 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:38:32,374 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:38:32,374 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 01:38:32,375 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:38:32,375 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:38:32,375 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:38:32,375 INFO ]: Start difference. First operand 24 states and 31 transitions. Second operand 8 states. [2018-06-22 01:38:32,582 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:38:32,582 INFO ]: Finished difference Result 23 states and 28 transitions. [2018-06-22 01:38:32,583 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:38:32,583 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 01:38:32,583 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:38:32,583 INFO ]: With dead ends: 23 [2018-06-22 01:38:32,583 INFO ]: Without dead ends: 0 [2018-06-22 01:38:32,584 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:38:32,584 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:38:32,584 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:38:32,584 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:38:32,584 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:38:32,584 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-06-22 01:38:32,584 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:38:32,584 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:38:32,584 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:38:32,584 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:38:32,584 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:38:32,588 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:38:32 BoogieIcfgContainer [2018-06-22 01:38:32,588 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:38:32,589 INFO ]: Toolchain (without parser) took 3631.35 ms. Allocated memory was 309.3 MB in the beginning and 330.8 MB in the end (delta: 21.5 MB). Free memory was 264.7 MB in the beginning and 236.9 MB in the end (delta: 27.8 MB). Peak memory consumption was 49.3 MB. Max. memory is 3.6 GB. [2018-06-22 01:38:32,591 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:38:32,591 INFO ]: ChcToBoogie took 60.57 ms. Allocated memory is still 309.3 MB. Free memory was 264.7 MB in the beginning and 262.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:38:32,592 INFO ]: Boogie Preprocessor took 46.29 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:38:32,592 INFO ]: RCFGBuilder took 357.39 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 251.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:38:32,593 INFO ]: TraceAbstraction took 3158.13 ms. Allocated memory was 309.3 MB in the beginning and 330.8 MB in the end (delta: 21.5 MB). Free memory was 250.7 MB in the beginning and 236.9 MB in the end (delta: 13.8 MB). Peak memory consumption was 35.3 MB. Max. memory is 3.6 GB. [2018-06-22 01:38:32,596 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 60.57 ms. Allocated memory is still 309.3 MB. Free memory was 264.7 MB in the beginning and 262.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.29 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 357.39 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 251.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 3158.13 ms. Allocated memory was 309.3 MB in the beginning and 330.8 MB in the end (delta: 21.5 MB). Free memory was 250.7 MB in the beginning and 236.9 MB in the end (delta: 13.8 MB). Peak memory consumption was 35.3 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, 13 locations, 1 error locations. SAFE Result, 3.1s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 112 SDtfs, 51 SDslu, 173 SDs, 0 SdLazy, 200 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 4272 SizeOfPredicates, 5 NumberOfNonLiveVariables, 396 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 73/80 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/inductive.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-38-32-607.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/inductive.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-38-32-607.csv Received shutdown request...