java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/HOLA/07.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 08:40:49,707 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 08:40:49,709 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 08:40:49,726 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 08:40:49,726 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 08:40:49,727 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 08:40:49,728 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 08:40:49,732 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 08:40:49,733 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 08:40:49,735 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 08:40:49,737 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 08:40:49,738 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 08:40:49,738 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 08:40:49,739 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 08:40:49,740 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 08:40:49,743 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 08:40:49,745 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 08:40:49,754 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 08:40:49,755 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 08:40:49,756 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 08:40:49,757 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 08:40:49,763 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 08:40:49,763 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 08:40:49,763 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 08:40:49,764 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 08:40:49,765 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 08:40:49,765 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 08:40:49,769 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 08:40:49,770 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 08:40:49,771 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 08:40:49,771 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 08:40:49,772 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 08:40:49,772 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 08:40:49,777 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 08:40:49,778 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 08:40:49,778 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 08:40:49,801 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 08:40:49,802 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 08:40:49,802 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 08:40:49,802 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 08:40:49,804 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 08:40:49,805 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 08:40:49,805 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 08:40:49,805 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 08:40:49,806 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 08:40:49,806 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 08:40:49,806 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 08:40:49,806 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 08:40:49,806 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 08:40:49,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 08:40:49,807 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 08:40:49,807 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 08:40:49,807 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 08:40:49,807 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 08:40:49,807 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 08:40:49,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 08:40:49,808 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 08:40:49,810 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 08:40:49,810 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 08:40:49,849 INFO ]: Repository-Root is: /tmp [2018-06-25 08:40:49,864 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 08:40:49,868 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 08:40:49,869 INFO ]: Initializing SmtParser... [2018-06-25 08:40:49,869 INFO ]: SmtParser initialized [2018-06-25 08:40:49,870 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/07.c.smt2 [2018-06-25 08:40:49,871 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 08:40:49,938 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/07.c.smt2 unknown [2018-06-25 08:40:50,464 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/07.c.smt2 [2018-06-25 08:40:50,469 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 08:40:50,475 INFO ]: Walking toolchain with 4 elements. [2018-06-25 08:40:50,475 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 08:40:50,475 INFO ]: Initializing ChcToBoogie... [2018-06-25 08:40:50,476 INFO ]: ChcToBoogie initialized [2018-06-25 08:40:50,479 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:40:50" (1/1) ... [2018-06-25 08:40:50,576 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:40:50 Unit [2018-06-25 08:40:50,576 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 08:40:50,578 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 08:40:50,578 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 08:40:50,578 INFO ]: Boogie Preprocessor initialized [2018-06-25 08:40:50,598 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:40:50" (1/1) ... [2018-06-25 08:40:50,598 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:40:50" (1/1) ... [2018-06-25 08:40:50,610 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:40:50" (1/1) ... [2018-06-25 08:40:50,611 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:40:50" (1/1) ... [2018-06-25 08:40:50,625 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:40:50" (1/1) ... [2018-06-25 08:40:50,627 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:40:50" (1/1) ... [2018-06-25 08:40:50,630 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:40:50" (1/1) ... [2018-06-25 08:40:50,645 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 08:40:50,645 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 08:40:50,645 INFO ]: Initializing RCFGBuilder... [2018-06-25 08:40:50,645 INFO ]: RCFGBuilder initialized [2018-06-25 08:40:50,646 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:40:50" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 08:40:50,660 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 08:40:50,660 INFO ]: Found specification of procedure gotoProc [2018-06-25 08:40:50,660 INFO ]: Found implementation of procedure gotoProc [2018-06-25 08:40:50,660 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 08:40:50,660 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 08:40:50,660 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 08:40:51,481 INFO ]: Using library mode [2018-06-25 08:40:51,482 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:40:51 BoogieIcfgContainer [2018-06-25 08:40:51,482 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 08:40:51,485 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 08:40:51,485 INFO ]: Initializing TraceAbstraction... [2018-06-25 08:40:51,488 INFO ]: TraceAbstraction initialized [2018-06-25 08:40:51,488 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:40:50" (1/3) ... [2018-06-25 08:40:51,489 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9dcc3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 08:40:51, skipping insertion in model container [2018-06-25 08:40:51,489 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:40:50" (2/3) ... [2018-06-25 08:40:51,489 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9dcc3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 08:40:51, skipping insertion in model container [2018-06-25 08:40:51,489 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:40:51" (3/3) ... [2018-06-25 08:40:51,492 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 08:40:51,501 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 08:40:51,511 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 08:40:51,566 INFO ]: Using default assertion order modulation [2018-06-25 08:40:51,566 INFO ]: Interprodecural is true [2018-06-25 08:40:51,566 INFO ]: Hoare is false [2018-06-25 08:40:51,567 INFO ]: Compute interpolants for FPandBP [2018-06-25 08:40:51,567 INFO ]: Backedges is TWOTRACK [2018-06-25 08:40:51,567 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 08:40:51,567 INFO ]: Difference is false [2018-06-25 08:40:51,567 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 08:40:51,567 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 08:40:51,587 INFO ]: Start isEmpty. Operand 33 states. [2018-06-25 08:40:51,628 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 08:40:51,628 INFO ]: Found error trace [2018-06-25 08:40:51,629 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:40:51,629 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:40:51,641 INFO ]: Analyzing trace with hash -75561484, now seen corresponding path program 1 times [2018-06-25 08:40:51,643 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:40:51,643 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:40:51,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:40:51,689 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:40:51,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:40:51,819 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:40:52,725 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:40:52,727 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:40:52,727 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-25 08:40:52,728 INFO ]: Interpolant automaton has 11 states [2018-06-25 08:40:52,740 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 08:40:52,741 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-25 08:40:52,743 INFO ]: Start difference. First operand 33 states. Second operand 11 states. [2018-06-25 08:40:53,268 WARN ]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-06-25 08:40:53,554 WARN ]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-06-25 08:40:54,022 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:40:54,022 INFO ]: Finished difference Result 71 states and 79 transitions. [2018-06-25 08:40:54,024 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 08:40:54,025 INFO ]: Start accepts. Automaton has 11 states. Word has length 19 [2018-06-25 08:40:54,026 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:40:54,040 INFO ]: With dead ends: 71 [2018-06-25 08:40:54,040 INFO ]: Without dead ends: 68 [2018-06-25 08:40:54,042 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-06-25 08:40:54,059 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-25 08:40:54,078 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 37. [2018-06-25 08:40:54,080 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-25 08:40:54,081 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-06-25 08:40:54,082 INFO ]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 19 [2018-06-25 08:40:54,082 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:40:54,082 INFO ]: Abstraction has 37 states and 40 transitions. [2018-06-25 08:40:54,082 INFO ]: Interpolant automaton has 11 states. [2018-06-25 08:40:54,082 INFO ]: Start isEmpty. Operand 37 states and 40 transitions. [2018-06-25 08:40:54,083 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 08:40:54,083 INFO ]: Found error trace [2018-06-25 08:40:54,083 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:40:54,083 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:40:54,084 INFO ]: Analyzing trace with hash -699586403, now seen corresponding path program 1 times [2018-06-25 08:40:54,084 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:40:54,084 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:40:54,085 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:40:54,085 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:40:54,085 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:40:54,116 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:40:54,471 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:40:54,471 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:40:54,472 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-25 08:40:54,473 INFO ]: Interpolant automaton has 12 states [2018-06-25 08:40:54,473 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 08:40:54,475 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-25 08:40:54,475 INFO ]: Start difference. First operand 37 states and 40 transitions. Second operand 12 states. [2018-06-25 08:40:54,829 WARN ]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-06-25 08:40:54,980 WARN ]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2018-06-25 08:40:55,501 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:40:55,501 INFO ]: Finished difference Result 74 states and 82 transitions. [2018-06-25 08:40:55,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 08:40:55,523 INFO ]: Start accepts. Automaton has 12 states. Word has length 19 [2018-06-25 08:40:55,523 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:40:55,524 INFO ]: With dead ends: 74 [2018-06-25 08:40:55,524 INFO ]: Without dead ends: 70 [2018-06-25 08:40:55,525 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2018-06-25 08:40:55,525 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-25 08:40:55,529 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 33. [2018-06-25 08:40:55,529 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-25 08:40:55,530 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-06-25 08:40:55,530 INFO ]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 19 [2018-06-25 08:40:55,530 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:40:55,530 INFO ]: Abstraction has 33 states and 36 transitions. [2018-06-25 08:40:55,530 INFO ]: Interpolant automaton has 12 states. [2018-06-25 08:40:55,530 INFO ]: Start isEmpty. Operand 33 states and 36 transitions. [2018-06-25 08:40:55,531 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 08:40:55,531 INFO ]: Found error trace [2018-06-25 08:40:55,531 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:40:55,531 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:40:55,531 INFO ]: Analyzing trace with hash 1316178349, now seen corresponding path program 1 times [2018-06-25 08:40:55,532 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:40:55,532 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:40:55,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:40:55,532 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:40:55,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:40:55,622 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:40:56,148 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:40:56,148 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:40:56,148 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) [2018-06-25 08:40:56,165 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:40:56,295 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:40:56,310 INFO ]: Computing forward predicates... [2018-06-25 08:40:57,257 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 08:40:57,286 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 08:40:57,286 INFO ]: Number of different interpolants: perfect sequences [18] imperfect sequences [20] total 29 [2018-06-25 08:40:57,287 INFO ]: Interpolant automaton has 29 states [2018-06-25 08:40:57,287 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-25 08:40:57,287 INFO ]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2018-06-25 08:40:57,287 INFO ]: Start difference. First operand 33 states and 36 transitions. Second operand 29 states. [2018-06-25 08:40:58,725 WARN ]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-06-25 08:40:59,700 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:40:59,700 INFO ]: Finished difference Result 178 states and 198 transitions. [2018-06-25 08:40:59,702 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-25 08:40:59,702 INFO ]: Start accepts. Automaton has 29 states. Word has length 28 [2018-06-25 08:40:59,702 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:40:59,704 INFO ]: With dead ends: 178 [2018-06-25 08:40:59,704 INFO ]: Without dead ends: 175 [2018-06-25 08:40:59,708 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=741, Invalid=2339, Unknown=0, NotChecked=0, Total=3080 [2018-06-25 08:40:59,708 INFO ]: Start minimizeSevpa. Operand 175 states. [2018-06-25 08:40:59,722 INFO ]: Finished minimizeSevpa. Reduced states from 175 to 46. [2018-06-25 08:40:59,722 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-25 08:40:59,723 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-06-25 08:40:59,724 INFO ]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 28 [2018-06-25 08:40:59,724 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:40:59,724 INFO ]: Abstraction has 46 states and 51 transitions. [2018-06-25 08:40:59,724 INFO ]: Interpolant automaton has 29 states. [2018-06-25 08:40:59,724 INFO ]: Start isEmpty. Operand 46 states and 51 transitions. [2018-06-25 08:40:59,724 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 08:40:59,725 INFO ]: Found error trace [2018-06-25 08:40:59,725 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:40:59,725 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:40:59,725 INFO ]: Analyzing trace with hash -1082544027, now seen corresponding path program 1 times [2018-06-25 08:40:59,725 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:40:59,725 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:40:59,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:40:59,726 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:40:59,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:40:59,756 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:00,124 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:41:00,124 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:41:00,124 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-25 08:41:00,139 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:41:00,229 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:00,235 INFO ]: Computing forward predicates... [2018-06-25 08:41:00,769 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 08:41:00,788 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 08:41:00,788 INFO ]: Number of different interpolants: perfect sequences [18] imperfect sequences [20] total 29 [2018-06-25 08:41:00,788 INFO ]: Interpolant automaton has 29 states [2018-06-25 08:41:00,789 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-25 08:41:00,789 INFO ]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2018-06-25 08:41:00,789 INFO ]: Start difference. First operand 46 states and 51 transitions. Second operand 29 states. [2018-06-25 08:41:02,497 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:41:02,497 INFO ]: Finished difference Result 180 states and 202 transitions. [2018-06-25 08:41:02,497 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-25 08:41:02,497 INFO ]: Start accepts. Automaton has 29 states. Word has length 28 [2018-06-25 08:41:02,497 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:41:02,499 INFO ]: With dead ends: 180 [2018-06-25 08:41:02,499 INFO ]: Without dead ends: 177 [2018-06-25 08:41:02,501 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=741, Invalid=2339, Unknown=0, NotChecked=0, Total=3080 [2018-06-25 08:41:02,501 INFO ]: Start minimizeSevpa. Operand 177 states. [2018-06-25 08:41:02,508 INFO ]: Finished minimizeSevpa. Reduced states from 177 to 59. [2018-06-25 08:41:02,508 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-25 08:41:02,509 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2018-06-25 08:41:02,509 INFO ]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 28 [2018-06-25 08:41:02,509 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:41:02,509 INFO ]: Abstraction has 59 states and 68 transitions. [2018-06-25 08:41:02,509 INFO ]: Interpolant automaton has 29 states. [2018-06-25 08:41:02,509 INFO ]: Start isEmpty. Operand 59 states and 68 transitions. [2018-06-25 08:41:02,510 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 08:41:02,510 INFO ]: Found error trace [2018-06-25 08:41:02,510 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:41:02,510 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:41:02,510 INFO ]: Analyzing trace with hash 942608429, now seen corresponding path program 1 times [2018-06-25 08:41:02,510 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:41:02,510 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:41:02,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:02,511 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:41:02,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:02,537 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:02,832 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:41:02,832 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:41:02,832 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-25 08:41:02,837 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:41:02,941 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:02,949 INFO ]: Computing forward predicates... [2018-06-25 08:41:03,445 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 08:41:03,466 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 08:41:03,466 INFO ]: Number of different interpolants: perfect sequences [18] imperfect sequences [20] total 29 [2018-06-25 08:41:03,467 INFO ]: Interpolant automaton has 29 states [2018-06-25 08:41:03,467 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-25 08:41:03,467 INFO ]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2018-06-25 08:41:03,467 INFO ]: Start difference. First operand 59 states and 68 transitions. Second operand 29 states. [2018-06-25 08:41:04,826 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:41:04,826 INFO ]: Finished difference Result 146 states and 164 transitions. [2018-06-25 08:41:04,832 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 08:41:04,832 INFO ]: Start accepts. Automaton has 29 states. Word has length 28 [2018-06-25 08:41:04,832 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:41:04,833 INFO ]: With dead ends: 146 [2018-06-25 08:41:04,833 INFO ]: Without dead ends: 143 [2018-06-25 08:41:04,834 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=656, Invalid=2100, Unknown=0, NotChecked=0, Total=2756 [2018-06-25 08:41:04,834 INFO ]: Start minimizeSevpa. Operand 143 states. [2018-06-25 08:41:04,842 INFO ]: Finished minimizeSevpa. Reduced states from 143 to 68. [2018-06-25 08:41:04,842 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-25 08:41:04,843 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2018-06-25 08:41:04,843 INFO ]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 28 [2018-06-25 08:41:04,843 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:41:04,843 INFO ]: Abstraction has 68 states and 78 transitions. [2018-06-25 08:41:04,843 INFO ]: Interpolant automaton has 29 states. [2018-06-25 08:41:04,843 INFO ]: Start isEmpty. Operand 68 states and 78 transitions. [2018-06-25 08:41:04,844 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 08:41:04,844 INFO ]: Found error trace [2018-06-25 08:41:04,844 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:41:04,844 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:41:04,845 INFO ]: Analyzing trace with hash -1058597596, now seen corresponding path program 1 times [2018-06-25 08:41:04,845 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:41:04,845 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:41:04,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:04,846 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:41:04,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:04,869 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:05,174 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:41:05,174 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:41:05,174 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) [2018-06-25 08:41:05,191 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:41:05,273 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:05,280 INFO ]: Computing forward predicates... [2018-06-25 08:41:05,839 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:41:05,872 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:41:05,873 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 31 [2018-06-25 08:41:05,873 INFO ]: Interpolant automaton has 31 states [2018-06-25 08:41:05,873 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-25 08:41:05,873 INFO ]: CoverageRelationStatistics Valid=70, Invalid=860, Unknown=0, NotChecked=0, Total=930 [2018-06-25 08:41:05,874 INFO ]: Start difference. First operand 68 states and 78 transitions. Second operand 31 states. [2018-06-25 08:41:08,259 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:41:08,259 INFO ]: Finished difference Result 205 states and 231 transitions. [2018-06-25 08:41:08,260 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-25 08:41:08,260 INFO ]: Start accepts. Automaton has 31 states. Word has length 28 [2018-06-25 08:41:08,260 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:41:08,261 INFO ]: With dead ends: 205 [2018-06-25 08:41:08,261 INFO ]: Without dead ends: 202 [2018-06-25 08:41:08,262 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1105, Invalid=4151, Unknown=0, NotChecked=0, Total=5256 [2018-06-25 08:41:08,262 INFO ]: Start minimizeSevpa. Operand 202 states. [2018-06-25 08:41:08,273 INFO ]: Finished minimizeSevpa. Reduced states from 202 to 77. [2018-06-25 08:41:08,273 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-25 08:41:08,274 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2018-06-25 08:41:08,274 INFO ]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 28 [2018-06-25 08:41:08,274 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:41:08,274 INFO ]: Abstraction has 77 states and 89 transitions. [2018-06-25 08:41:08,274 INFO ]: Interpolant automaton has 31 states. [2018-06-25 08:41:08,274 INFO ]: Start isEmpty. Operand 77 states and 89 transitions. [2018-06-25 08:41:08,275 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 08:41:08,275 INFO ]: Found error trace [2018-06-25 08:41:08,275 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:41:08,275 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:41:08,275 INFO ]: Analyzing trace with hash 837647324, now seen corresponding path program 1 times [2018-06-25 08:41:08,275 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:41:08,275 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:41:08,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:08,276 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:41:08,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:08,297 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:08,576 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:41:08,576 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:41:08,576 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:41:08,582 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:41:08,677 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:08,684 INFO ]: Computing forward predicates... [2018-06-25 08:41:09,131 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:41:09,152 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:41:09,152 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 31 [2018-06-25 08:41:09,152 INFO ]: Interpolant automaton has 31 states [2018-06-25 08:41:09,153 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-25 08:41:09,153 INFO ]: CoverageRelationStatistics Valid=70, Invalid=860, Unknown=0, NotChecked=0, Total=930 [2018-06-25 08:41:09,153 INFO ]: Start difference. First operand 77 states and 89 transitions. Second operand 31 states. [2018-06-25 08:41:11,080 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:41:11,080 INFO ]: Finished difference Result 197 states and 222 transitions. [2018-06-25 08:41:11,101 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-25 08:41:11,101 INFO ]: Start accepts. Automaton has 31 states. Word has length 28 [2018-06-25 08:41:11,101 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:41:11,102 INFO ]: With dead ends: 197 [2018-06-25 08:41:11,102 INFO ]: Without dead ends: 194 [2018-06-25 08:41:11,104 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1105, Invalid=4151, Unknown=0, NotChecked=0, Total=5256 [2018-06-25 08:41:11,104 INFO ]: Start minimizeSevpa. Operand 194 states. [2018-06-25 08:41:11,108 INFO ]: Finished minimizeSevpa. Reduced states from 194 to 78. [2018-06-25 08:41:11,108 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-25 08:41:11,109 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2018-06-25 08:41:11,109 INFO ]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 28 [2018-06-25 08:41:11,110 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:41:11,110 INFO ]: Abstraction has 78 states and 90 transitions. [2018-06-25 08:41:11,110 INFO ]: Interpolant automaton has 31 states. [2018-06-25 08:41:11,110 INFO ]: Start isEmpty. Operand 78 states and 90 transitions. [2018-06-25 08:41:11,111 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 08:41:11,111 INFO ]: Found error trace [2018-06-25 08:41:11,111 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:41:11,111 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:41:11,111 INFO ]: Analyzing trace with hash -1432167516, now seen corresponding path program 1 times [2018-06-25 08:41:11,111 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:41:11,111 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:41:11,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:11,112 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:41:11,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:11,130 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:11,823 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:41:11,823 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:41:11,823 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:41:11,831 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:41:11,905 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:11,910 INFO ]: Computing forward predicates... [2018-06-25 08:41:12,313 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:41:12,332 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:41:12,332 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 31 [2018-06-25 08:41:12,333 INFO ]: Interpolant automaton has 31 states [2018-06-25 08:41:12,333 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-25 08:41:12,333 INFO ]: CoverageRelationStatistics Valid=70, Invalid=860, Unknown=0, NotChecked=0, Total=930 [2018-06-25 08:41:12,333 INFO ]: Start difference. First operand 78 states and 90 transitions. Second operand 31 states. [2018-06-25 08:41:14,345 WARN ]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-06-25 08:41:14,457 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:41:14,457 INFO ]: Finished difference Result 144 states and 164 transitions. [2018-06-25 08:41:14,459 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-25 08:41:14,459 INFO ]: Start accepts. Automaton has 31 states. Word has length 28 [2018-06-25 08:41:14,459 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:41:14,460 INFO ]: With dead ends: 144 [2018-06-25 08:41:14,460 INFO ]: Without dead ends: 141 [2018-06-25 08:41:14,462 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=867, Invalid=3293, Unknown=0, NotChecked=0, Total=4160 [2018-06-25 08:41:14,462 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-25 08:41:14,470 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 80. [2018-06-25 08:41:14,470 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-25 08:41:14,471 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2018-06-25 08:41:14,471 INFO ]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 28 [2018-06-25 08:41:14,471 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:41:14,471 INFO ]: Abstraction has 80 states and 92 transitions. [2018-06-25 08:41:14,471 INFO ]: Interpolant automaton has 31 states. [2018-06-25 08:41:14,472 INFO ]: Start isEmpty. Operand 80 states and 92 transitions. [2018-06-25 08:41:14,473 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 08:41:14,473 INFO ]: Found error trace [2018-06-25 08:41:14,473 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:41:14,473 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:41:14,473 INFO ]: Analyzing trace with hash 1085508812, now seen corresponding path program 1 times [2018-06-25 08:41:14,473 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:41:14,473 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:41:14,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:14,474 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:41:14,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:14,494 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:14,724 INFO ]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:41:14,725 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:41:14,725 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-25 08:41:14,725 INFO ]: Interpolant automaton has 11 states [2018-06-25 08:41:14,725 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 08:41:14,725 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-25 08:41:14,725 INFO ]: Start difference. First operand 80 states and 92 transitions. Second operand 11 states. [2018-06-25 08:41:14,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:41:14,992 INFO ]: Finished difference Result 176 states and 197 transitions. [2018-06-25 08:41:14,993 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-25 08:41:14,993 INFO ]: Start accepts. Automaton has 11 states. Word has length 37 [2018-06-25 08:41:14,993 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:41:14,994 INFO ]: With dead ends: 176 [2018-06-25 08:41:14,994 INFO ]: Without dead ends: 175 [2018-06-25 08:41:14,994 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=627, Unknown=0, NotChecked=0, Total=870 [2018-06-25 08:41:14,994 INFO ]: Start minimizeSevpa. Operand 175 states. [2018-06-25 08:41:15,000 INFO ]: Finished minimizeSevpa. Reduced states from 175 to 94. [2018-06-25 08:41:15,000 INFO ]: Start removeUnreachable. Operand 94 states. [2018-06-25 08:41:15,001 INFO ]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2018-06-25 08:41:15,002 INFO ]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 37 [2018-06-25 08:41:15,002 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:41:15,002 INFO ]: Abstraction has 94 states and 107 transitions. [2018-06-25 08:41:15,002 INFO ]: Interpolant automaton has 11 states. [2018-06-25 08:41:15,002 INFO ]: Start isEmpty. Operand 94 states and 107 transitions. [2018-06-25 08:41:15,003 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 08:41:15,003 INFO ]: Found error trace [2018-06-25 08:41:15,003 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:41:15,003 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:41:15,003 INFO ]: Analyzing trace with hash -1184306028, now seen corresponding path program 1 times [2018-06-25 08:41:15,003 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:41:15,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:41:15,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:15,004 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:41:15,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:15,024 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:15,607 INFO ]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:41:15,608 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:41:15,608 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-25 08:41:15,608 INFO ]: Interpolant automaton has 11 states [2018-06-25 08:41:15,608 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 08:41:15,608 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-25 08:41:15,608 INFO ]: Start difference. First operand 94 states and 107 transitions. Second operand 11 states. [2018-06-25 08:41:15,736 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:41:15,736 INFO ]: Finished difference Result 154 states and 171 transitions. [2018-06-25 08:41:15,737 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 08:41:15,737 INFO ]: Start accepts. Automaton has 11 states. Word has length 37 [2018-06-25 08:41:15,737 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:41:15,738 INFO ]: With dead ends: 154 [2018-06-25 08:41:15,738 INFO ]: Without dead ends: 136 [2018-06-25 08:41:15,738 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-25 08:41:15,738 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-25 08:41:15,742 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 98. [2018-06-25 08:41:15,742 INFO ]: Start removeUnreachable. Operand 98 states. [2018-06-25 08:41:15,743 INFO ]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-06-25 08:41:15,743 INFO ]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 37 [2018-06-25 08:41:15,743 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:41:15,743 INFO ]: Abstraction has 98 states and 108 transitions. [2018-06-25 08:41:15,743 INFO ]: Interpolant automaton has 11 states. [2018-06-25 08:41:15,743 INFO ]: Start isEmpty. Operand 98 states and 108 transitions. [2018-06-25 08:41:15,744 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 08:41:15,744 INFO ]: Found error trace [2018-06-25 08:41:15,744 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:41:15,744 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:41:15,745 INFO ]: Analyzing trace with hash -45953444, now seen corresponding path program 2 times [2018-06-25 08:41:15,745 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:41:15,745 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:41:15,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:15,747 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:41:15,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:15,767 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:16,030 INFO ]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:41:16,030 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:41:16,030 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-25 08:41:16,030 INFO ]: Interpolant automaton has 11 states [2018-06-25 08:41:16,030 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 08:41:16,030 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-25 08:41:16,031 INFO ]: Start difference. First operand 98 states and 108 transitions. Second operand 11 states. [2018-06-25 08:41:16,187 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:41:16,187 INFO ]: Finished difference Result 132 states and 143 transitions. [2018-06-25 08:41:16,212 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 08:41:16,212 INFO ]: Start accepts. Automaton has 11 states. Word has length 37 [2018-06-25 08:41:16,212 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:41:16,213 INFO ]: With dead ends: 132 [2018-06-25 08:41:16,213 INFO ]: Without dead ends: 113 [2018-06-25 08:41:16,213 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-25 08:41:16,213 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-25 08:41:16,216 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 89. [2018-06-25 08:41:16,216 INFO ]: Start removeUnreachable. Operand 89 states. [2018-06-25 08:41:16,217 INFO ]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-06-25 08:41:16,217 INFO ]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 37 [2018-06-25 08:41:16,218 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:41:16,218 INFO ]: Abstraction has 89 states and 97 transitions. [2018-06-25 08:41:16,218 INFO ]: Interpolant automaton has 11 states. [2018-06-25 08:41:16,218 INFO ]: Start isEmpty. Operand 89 states and 97 transitions. [2018-06-25 08:41:16,219 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 08:41:16,219 INFO ]: Found error trace [2018-06-25 08:41:16,219 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:41:16,219 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:41:16,219 INFO ]: Analyzing trace with hash -1702318188, now seen corresponding path program 2 times [2018-06-25 08:41:16,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:41:16,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:41:16,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:16,220 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:41:16,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:16,238 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:16,393 INFO ]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:41:16,393 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:41:16,393 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-25 08:41:16,393 INFO ]: Interpolant automaton has 11 states [2018-06-25 08:41:16,393 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 08:41:16,393 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-25 08:41:16,393 INFO ]: Start difference. First operand 89 states and 97 transitions. Second operand 11 states. [2018-06-25 08:41:16,593 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:41:16,593 INFO ]: Finished difference Result 122 states and 130 transitions. [2018-06-25 08:41:16,593 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 08:41:16,593 INFO ]: Start accepts. Automaton has 11 states. Word has length 37 [2018-06-25 08:41:16,594 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:41:16,594 INFO ]: With dead ends: 122 [2018-06-25 08:41:16,594 INFO ]: Without dead ends: 121 [2018-06-25 08:41:16,595 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2018-06-25 08:41:16,595 INFO ]: Start minimizeSevpa. Operand 121 states. [2018-06-25 08:41:16,601 INFO ]: Finished minimizeSevpa. Reduced states from 121 to 88. [2018-06-25 08:41:16,601 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-25 08:41:16,602 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-06-25 08:41:16,602 INFO ]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 37 [2018-06-25 08:41:16,602 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:41:16,602 INFO ]: Abstraction has 88 states and 95 transitions. [2018-06-25 08:41:16,602 INFO ]: Interpolant automaton has 11 states. [2018-06-25 08:41:16,602 INFO ]: Start isEmpty. Operand 88 states and 95 transitions. [2018-06-25 08:41:16,603 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 08:41:16,603 INFO ]: Found error trace [2018-06-25 08:41:16,603 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:41:16,603 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:41:16,604 INFO ]: Analyzing trace with hash 193926732, now seen corresponding path program 1 times [2018-06-25 08:41:16,604 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:41:16,604 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:41:16,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:16,604 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:41:16,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:16,623 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:16,754 INFO ]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:41:16,754 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:41:16,754 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-25 08:41:16,754 INFO ]: Interpolant automaton has 11 states [2018-06-25 08:41:16,755 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 08:41:16,755 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-25 08:41:16,755 INFO ]: Start difference. First operand 88 states and 95 transitions. Second operand 11 states. [2018-06-25 08:41:16,885 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:41:16,885 INFO ]: Finished difference Result 106 states and 112 transitions. [2018-06-25 08:41:16,885 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 08:41:16,885 INFO ]: Start accepts. Automaton has 11 states. Word has length 37 [2018-06-25 08:41:16,885 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:41:16,886 INFO ]: With dead ends: 106 [2018-06-25 08:41:16,886 INFO ]: Without dead ends: 79 [2018-06-25 08:41:16,886 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-25 08:41:16,886 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-25 08:41:16,888 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 71. [2018-06-25 08:41:16,888 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-25 08:41:16,888 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-06-25 08:41:16,888 INFO ]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 37 [2018-06-25 08:41:16,888 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:41:16,888 INFO ]: Abstraction has 71 states and 75 transitions. [2018-06-25 08:41:16,888 INFO ]: Interpolant automaton has 11 states. [2018-06-25 08:41:16,889 INFO ]: Start isEmpty. Operand 71 states and 75 transitions. [2018-06-25 08:41:16,889 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 08:41:16,889 INFO ]: Found error trace [2018-06-25 08:41:16,889 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:41:16,890 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:41:16,890 INFO ]: Analyzing trace with hash 963727485, now seen corresponding path program 2 times [2018-06-25 08:41:16,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:41:16,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:41:16,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:16,890 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:41:16,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:16,912 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:17,435 INFO ]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:41:17,435 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:41:17,435 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:41:17,441 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:41:17,582 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:41:17,582 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:17,588 INFO ]: Computing forward predicates... [2018-06-25 08:41:18,314 INFO ]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 08:41:18,335 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:41:18,335 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 38 [2018-06-25 08:41:18,335 INFO ]: Interpolant automaton has 38 states [2018-06-25 08:41:18,335 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-25 08:41:18,336 INFO ]: CoverageRelationStatistics Valid=84, Invalid=1322, Unknown=0, NotChecked=0, Total=1406 [2018-06-25 08:41:18,336 INFO ]: Start difference. First operand 71 states and 75 transitions. Second operand 38 states. [2018-06-25 08:41:20,219 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:41:20,219 INFO ]: Finished difference Result 81 states and 84 transitions. [2018-06-25 08:41:20,221 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-25 08:41:20,221 INFO ]: Start accepts. Automaton has 38 states. Word has length 37 [2018-06-25 08:41:20,221 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:41:20,222 INFO ]: With dead ends: 81 [2018-06-25 08:41:20,222 INFO ]: Without dead ends: 56 [2018-06-25 08:41:20,223 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 11 SyntacticMatches, 18 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=679, Invalid=3743, Unknown=0, NotChecked=0, Total=4422 [2018-06-25 08:41:20,223 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-25 08:41:20,224 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-06-25 08:41:20,224 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-25 08:41:20,224 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-06-25 08:41:20,224 INFO ]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 37 [2018-06-25 08:41:20,224 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:41:20,224 INFO ]: Abstraction has 55 states and 57 transitions. [2018-06-25 08:41:20,224 INFO ]: Interpolant automaton has 38 states. [2018-06-25 08:41:20,224 INFO ]: Start isEmpty. Operand 55 states and 57 transitions. [2018-06-25 08:41:20,225 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 08:41:20,225 INFO ]: Found error trace [2018-06-25 08:41:20,225 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:41:20,225 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:41:20,225 INFO ]: Analyzing trace with hash -670212227, now seen corresponding path program 2 times [2018-06-25 08:41:20,225 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:41:20,225 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:41:20,226 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:20,226 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:41:20,226 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:20,247 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:20,851 INFO ]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:41:20,851 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:41:20,851 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:41:20,857 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:41:20,957 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:41:20,957 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:20,963 INFO ]: Computing forward predicates... [2018-06-25 08:41:21,636 INFO ]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 08:41:21,656 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:41:21,656 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 38 [2018-06-25 08:41:21,656 INFO ]: Interpolant automaton has 38 states [2018-06-25 08:41:21,656 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-25 08:41:21,657 INFO ]: CoverageRelationStatistics Valid=84, Invalid=1322, Unknown=0, NotChecked=0, Total=1406 [2018-06-25 08:41:21,657 INFO ]: Start difference. First operand 55 states and 57 transitions. Second operand 38 states. [2018-06-25 08:41:23,154 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:41:23,154 INFO ]: Finished difference Result 64 states and 65 transitions. [2018-06-25 08:41:23,154 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-25 08:41:23,154 INFO ]: Start accepts. Automaton has 38 states. Word has length 37 [2018-06-25 08:41:23,154 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:41:23,154 INFO ]: With dead ends: 64 [2018-06-25 08:41:23,154 INFO ]: Without dead ends: 38 [2018-06-25 08:41:23,155 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 11 SyntacticMatches, 18 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=616, Invalid=3416, Unknown=0, NotChecked=0, Total=4032 [2018-06-25 08:41:23,155 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-25 08:41:23,156 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-25 08:41:23,156 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-25 08:41:23,157 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-25 08:41:23,157 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 37 [2018-06-25 08:41:23,157 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:41:23,157 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-25 08:41:23,157 INFO ]: Interpolant automaton has 38 states. [2018-06-25 08:41:23,157 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-25 08:41:23,157 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 08:41:23,157 INFO ]: Found error trace [2018-06-25 08:41:23,157 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:41:23,157 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:41:23,157 INFO ]: Analyzing trace with hash -301424515, now seen corresponding path program 2 times [2018-06-25 08:41:23,157 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:41:23,157 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:41:23,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:23,160 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:41:23,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:41:23,182 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:23,662 INFO ]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:41:23,662 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:41:23,662 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:41:23,668 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:41:23,768 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:41:23,768 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:41:23,774 INFO ]: Computing forward predicates... [2018-06-25 08:41:24,910 INFO ]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 08:41:24,930 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:41:24,930 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 38 [2018-06-25 08:41:24,930 INFO ]: Interpolant automaton has 38 states [2018-06-25 08:41:24,930 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-25 08:41:24,930 INFO ]: CoverageRelationStatistics Valid=84, Invalid=1322, Unknown=0, NotChecked=0, Total=1406 [2018-06-25 08:41:24,930 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-06-25 08:41:26,720 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:41:26,720 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-25 08:41:26,720 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 08:41:26,720 INFO ]: Start accepts. Automaton has 38 states. Word has length 37 [2018-06-25 08:41:26,720 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:41:26,720 INFO ]: With dead ends: 37 [2018-06-25 08:41:26,720 INFO ]: Without dead ends: 0 [2018-06-25 08:41:26,721 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 11 SyntacticMatches, 18 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=577, Invalid=3205, Unknown=0, NotChecked=0, Total=3782 [2018-06-25 08:41:26,721 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 08:41:26,722 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 08:41:26,722 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 08:41:26,722 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 08:41:26,722 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-06-25 08:41:26,722 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:41:26,722 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 08:41:26,722 INFO ]: Interpolant automaton has 38 states. [2018-06-25 08:41:26,722 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 08:41:26,722 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 08:41:26,726 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 08:41:26 BoogieIcfgContainer [2018-06-25 08:41:26,726 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 08:41:26,727 INFO ]: Toolchain (without parser) took 36257.51 ms. Allocated memory was 308.3 MB in the beginning and 655.9 MB in the end (delta: 347.6 MB). Free memory was 241.6 MB in the beginning and 263.7 MB in the end (delta: -22.1 MB). Peak memory consumption was 325.5 MB. Max. memory is 3.6 GB. [2018-06-25 08:41:26,728 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 308.3 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 08:41:26,728 INFO ]: ChcToBoogie took 102.01 ms. Allocated memory is still 308.3 MB. Free memory was 241.6 MB in the beginning and 238.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:41:26,728 INFO ]: Boogie Preprocessor took 67.12 ms. Allocated memory is still 308.3 MB. Free memory was 238.6 MB in the beginning and 237.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-25 08:41:26,729 INFO ]: RCFGBuilder took 836.68 ms. Allocated memory is still 308.3 MB. Free memory was 236.6 MB in the beginning and 195.0 MB in the end (delta: 41.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 3.6 GB. [2018-06-25 08:41:26,729 INFO ]: TraceAbstraction took 35241.62 ms. Allocated memory was 308.3 MB in the beginning and 655.9 MB in the end (delta: 347.6 MB). Free memory was 195.0 MB in the beginning and 263.7 MB in the end (delta: -68.7 MB). Peak memory consumption was 278.9 MB. Max. memory is 3.6 GB. [2018-06-25 08:41:26,739 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.3 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 102.01 ms. Allocated memory is still 308.3 MB. Free memory was 241.6 MB in the beginning and 238.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 67.12 ms. Allocated memory is still 308.3 MB. Free memory was 238.6 MB in the beginning and 237.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 836.68 ms. Allocated memory is still 308.3 MB. Free memory was 236.6 MB in the beginning and 195.0 MB in the end (delta: 41.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 3.6 GB. * TraceAbstraction took 35241.62 ms. Allocated memory was 308.3 MB in the beginning and 655.9 MB in the end (delta: 347.6 MB). Free memory was 195.0 MB in the beginning and 263.7 MB in the end (delta: -68.7 MB). Peak memory consumption was 278.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. SAFE Result, 35.1s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 20.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 656 SDtfs, 5210 SDslu, 10726 SDs, 0 SdLazy, 4473 SolverSat, 1162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 920 GetRequests, 124 SyntacticMatches, 105 SemanticMatches, 691 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6254 ImplicationChecksByTransitivity, 25.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 877 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 781 NumberOfCodeBlocks, 781 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 756 ConstructedInterpolants, 87 QuantifiedInterpolants, 148005 SizeOfPredicates, 603 NumberOfNonLiveVariables, 7912 ConjunctsInSsa, 642 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 69/159 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/07.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_08-41-26-747.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/07.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_08-41-26-747.csv Received shutdown request...