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/31.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 08:47:30,629 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 08:47:30,631 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 08:47:30,641 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 08:47:30,641 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 08:47:30,642 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 08:47:30,643 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 08:47:30,645 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 08:47:30,646 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 08:47:30,647 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 08:47:30,648 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 08:47:30,648 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 08:47:30,649 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 08:47:30,653 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 08:47:30,653 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 08:47:30,654 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 08:47:30,656 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 08:47:30,660 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 08:47:30,661 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 08:47:30,672 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 08:47:30,673 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 08:47:30,675 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 08:47:30,676 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 08:47:30,676 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 08:47:30,677 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 08:47:30,677 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 08:47:30,678 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 08:47:30,679 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 08:47:30,680 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 08:47:30,680 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 08:47:30,680 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 08:47:30,681 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 08:47:30,681 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 08:47:30,682 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 08:47:30,682 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 08:47:30,683 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:47:30,696 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 08:47:30,696 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 08:47:30,696 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 08:47:30,696 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 08:47:30,697 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 08:47:30,698 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 08:47:30,698 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 08:47:30,698 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 08:47:30,698 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 08:47:30,698 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 08:47:30,699 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 08:47:30,699 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 08:47:30,699 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 08:47:30,699 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 08:47:30,699 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 08:47:30,700 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 08:47:30,700 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 08:47:30,700 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 08:47:30,700 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 08:47:30,700 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 08:47:30,700 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 08:47:30,705 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 08:47:30,706 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 08:47:30,756 INFO ]: Repository-Root is: /tmp [2018-06-25 08:47:30,772 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 08:47:30,777 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 08:47:30,779 INFO ]: Initializing SmtParser... [2018-06-25 08:47:30,779 INFO ]: SmtParser initialized [2018-06-25 08:47:30,780 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/31.c.smt2 [2018-06-25 08:47:30,781 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:47:30,871 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/31.c.smt2 unknown [2018-06-25 08:47:31,592 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/31.c.smt2 [2018-06-25 08:47:31,602 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 08:47:31,611 INFO ]: Walking toolchain with 4 elements. [2018-06-25 08:47:31,611 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 08:47:31,611 INFO ]: Initializing ChcToBoogie... [2018-06-25 08:47:31,612 INFO ]: ChcToBoogie initialized [2018-06-25 08:47:31,615 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:47:31" (1/1) ... [2018-06-25 08:47:31,712 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:47:31 Unit [2018-06-25 08:47:31,712 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 08:47:31,713 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 08:47:31,713 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 08:47:31,713 INFO ]: Boogie Preprocessor initialized [2018-06-25 08:47:31,728 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:47:31" (1/1) ... [2018-06-25 08:47:31,728 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:47:31" (1/1) ... [2018-06-25 08:47:31,738 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:47:31" (1/1) ... [2018-06-25 08:47:31,738 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:47:31" (1/1) ... [2018-06-25 08:47:31,747 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:47:31" (1/1) ... [2018-06-25 08:47:31,750 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:47:31" (1/1) ... [2018-06-25 08:47:31,753 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:47:31" (1/1) ... [2018-06-25 08:47:31,759 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 08:47:31,760 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 08:47:31,760 INFO ]: Initializing RCFGBuilder... [2018-06-25 08:47:31,760 INFO ]: RCFGBuilder initialized [2018-06-25 08:47:31,761 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:47:31" (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:47:31,784 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 08:47:31,785 INFO ]: Found specification of procedure gotoProc [2018-06-25 08:47:31,785 INFO ]: Found implementation of procedure gotoProc [2018-06-25 08:47:31,785 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 08:47:31,785 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 08:47:31,785 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:47:32,860 INFO ]: Using library mode [2018-06-25 08:47:32,861 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:47:32 BoogieIcfgContainer [2018-06-25 08:47:32,861 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 08:47:32,865 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 08:47:32,865 INFO ]: Initializing TraceAbstraction... [2018-06-25 08:47:32,868 INFO ]: TraceAbstraction initialized [2018-06-25 08:47:32,868 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:47:31" (1/3) ... [2018-06-25 08:47:32,869 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd6b39f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 08:47:32, skipping insertion in model container [2018-06-25 08:47:32,869 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:47:31" (2/3) ... [2018-06-25 08:47:32,869 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd6b39f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 08:47:32, skipping insertion in model container [2018-06-25 08:47:32,869 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:47:32" (3/3) ... [2018-06-25 08:47:32,871 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 08:47:32,880 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 08:47:32,889 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 08:47:32,931 INFO ]: Using default assertion order modulation [2018-06-25 08:47:32,932 INFO ]: Interprodecural is true [2018-06-25 08:47:32,932 INFO ]: Hoare is false [2018-06-25 08:47:32,932 INFO ]: Compute interpolants for FPandBP [2018-06-25 08:47:32,932 INFO ]: Backedges is TWOTRACK [2018-06-25 08:47:32,932 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 08:47:32,932 INFO ]: Difference is false [2018-06-25 08:47:32,932 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 08:47:32,932 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 08:47:32,946 INFO ]: Start isEmpty. Operand 51 states. [2018-06-25 08:47:32,964 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 08:47:32,964 INFO ]: Found error trace [2018-06-25 08:47:32,965 INFO ]: trace histogram [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, 1] [2018-06-25 08:47:32,965 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:47:32,971 INFO ]: Analyzing trace with hash -1832192068, now seen corresponding path program 1 times [2018-06-25 08:47:32,973 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:47:32,973 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:47:33,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:47:33,006 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:47:33,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:47:33,158 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:47:34,017 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:47:34,020 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:47:34,020 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-25 08:47:34,022 INFO ]: Interpolant automaton has 19 states [2018-06-25 08:47:34,034 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 08:47:34,035 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-25 08:47:34,037 INFO ]: Start difference. First operand 51 states. Second operand 19 states. [2018-06-25 08:47:34,577 WARN ]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-06-25 08:47:35,466 WARN ]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-06-25 08:47:36,500 WARN ]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-06-25 08:47:37,963 WARN ]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-06-25 08:47:39,382 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:47:39,383 INFO ]: Finished difference Result 271 states and 302 transitions. [2018-06-25 08:47:39,383 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-06-25 08:47:39,384 INFO ]: Start accepts. Automaton has 19 states. Word has length 27 [2018-06-25 08:47:39,385 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:47:39,407 INFO ]: With dead ends: 271 [2018-06-25 08:47:39,407 INFO ]: Without dead ends: 268 [2018-06-25 08:47:39,423 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1940 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1414, Invalid=4906, Unknown=0, NotChecked=0, Total=6320 [2018-06-25 08:47:39,443 INFO ]: Start minimizeSevpa. Operand 268 states. [2018-06-25 08:47:39,478 INFO ]: Finished minimizeSevpa. Reduced states from 268 to 63. [2018-06-25 08:47:39,480 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-25 08:47:39,481 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-06-25 08:47:39,482 INFO ]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 27 [2018-06-25 08:47:39,482 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:47:39,482 INFO ]: Abstraction has 63 states and 70 transitions. [2018-06-25 08:47:39,482 INFO ]: Interpolant automaton has 19 states. [2018-06-25 08:47:39,482 INFO ]: Start isEmpty. Operand 63 states and 70 transitions. [2018-06-25 08:47:39,483 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 08:47:39,483 INFO ]: Found error trace [2018-06-25 08:47:39,483 INFO ]: trace histogram [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, 1] [2018-06-25 08:47:39,484 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:47:39,484 INFO ]: Analyzing trace with hash 461379127, now seen corresponding path program 1 times [2018-06-25 08:47:39,484 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:47:39,484 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:47:39,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:47:39,485 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:47:39,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:47:39,515 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:47:39,894 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:47:39,894 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:47:39,894 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-25 08:47:39,896 INFO ]: Interpolant automaton has 19 states [2018-06-25 08:47:39,896 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 08:47:39,896 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-25 08:47:39,896 INFO ]: Start difference. First operand 63 states and 70 transitions. Second operand 19 states. [2018-06-25 08:47:41,734 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:47:41,734 INFO ]: Finished difference Result 401 states and 446 transitions. [2018-06-25 08:47:41,734 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-06-25 08:47:41,734 INFO ]: Start accepts. Automaton has 19 states. Word has length 27 [2018-06-25 08:47:41,734 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:47:41,739 INFO ]: With dead ends: 401 [2018-06-25 08:47:41,739 INFO ]: Without dead ends: 398 [2018-06-25 08:47:41,742 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3200 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1900, Invalid=7220, Unknown=0, NotChecked=0, Total=9120 [2018-06-25 08:47:41,742 INFO ]: Start minimizeSevpa. Operand 398 states. [2018-06-25 08:47:41,753 INFO ]: Finished minimizeSevpa. Reduced states from 398 to 65. [2018-06-25 08:47:41,753 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-25 08:47:41,754 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2018-06-25 08:47:41,754 INFO ]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 27 [2018-06-25 08:47:41,754 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:47:41,754 INFO ]: Abstraction has 65 states and 73 transitions. [2018-06-25 08:47:41,754 INFO ]: Interpolant automaton has 19 states. [2018-06-25 08:47:41,754 INFO ]: Start isEmpty. Operand 65 states and 73 transitions. [2018-06-25 08:47:41,755 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 08:47:41,755 INFO ]: Found error trace [2018-06-25 08:47:41,755 INFO ]: trace histogram [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, 1] [2018-06-25 08:47:41,755 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:47:41,755 INFO ]: Analyzing trace with hash 2047962743, now seen corresponding path program 1 times [2018-06-25 08:47:41,755 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:47:41,755 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:47:41,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:47:41,756 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:47:41,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:47:41,787 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:47:41,965 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:47:41,965 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:47:41,965 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-25 08:47:41,966 INFO ]: Interpolant automaton has 19 states [2018-06-25 08:47:41,966 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 08:47:41,966 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-25 08:47:41,966 INFO ]: Start difference. First operand 65 states and 73 transitions. Second operand 19 states. [2018-06-25 08:47:43,643 WARN ]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-06-25 08:47:44,641 WARN ]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-25 08:47:45,612 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:47:45,612 INFO ]: Finished difference Result 413 states and 460 transitions. [2018-06-25 08:47:45,612 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-06-25 08:47:45,612 INFO ]: Start accepts. Automaton has 19 states. Word has length 27 [2018-06-25 08:47:45,612 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:47:45,614 INFO ]: With dead ends: 413 [2018-06-25 08:47:45,614 INFO ]: Without dead ends: 410 [2018-06-25 08:47:45,616 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3173 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1900, Invalid=7220, Unknown=0, NotChecked=0, Total=9120 [2018-06-25 08:47:45,616 INFO ]: Start minimizeSevpa. Operand 410 states. [2018-06-25 08:47:45,625 INFO ]: Finished minimizeSevpa. Reduced states from 410 to 66. [2018-06-25 08:47:45,625 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-25 08:47:45,626 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2018-06-25 08:47:45,626 INFO ]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 27 [2018-06-25 08:47:45,626 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:47:45,626 INFO ]: Abstraction has 66 states and 74 transitions. [2018-06-25 08:47:45,626 INFO ]: Interpolant automaton has 19 states. [2018-06-25 08:47:45,626 INFO ]: Start isEmpty. Operand 66 states and 74 transitions. [2018-06-25 08:47:45,627 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 08:47:45,627 INFO ]: Found error trace [2018-06-25 08:47:45,627 INFO ]: trace histogram [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, 1, 1, 1, 1, 1] [2018-06-25 08:47:45,627 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:47:45,627 INFO ]: Analyzing trace with hash -462596948, now seen corresponding path program 1 times [2018-06-25 08:47:45,627 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:47:45,627 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:47:45,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:47:45,628 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:47:45,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:47:45,654 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:47:45,844 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:47:45,845 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:47:45,845 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-25 08:47:45,845 INFO ]: Interpolant automaton has 12 states [2018-06-25 08:47:45,845 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 08:47:45,845 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-25 08:47:45,845 INFO ]: Start difference. First operand 66 states and 74 transitions. Second operand 12 states. [2018-06-25 08:47:46,243 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-06-25 08:47:46,403 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:47:46,403 INFO ]: Finished difference Result 189 states and 210 transitions. [2018-06-25 08:47:46,403 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 08:47:46,403 INFO ]: Start accepts. Automaton has 12 states. Word has length 37 [2018-06-25 08:47:46,403 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:47:46,404 INFO ]: With dead ends: 189 [2018-06-25 08:47:46,404 INFO ]: Without dead ends: 187 [2018-06-25 08:47:46,405 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=318, Invalid=804, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 08:47:46,405 INFO ]: Start minimizeSevpa. Operand 187 states. [2018-06-25 08:47:46,411 INFO ]: Finished minimizeSevpa. Reduced states from 187 to 72. [2018-06-25 08:47:46,411 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-25 08:47:46,411 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-06-25 08:47:46,412 INFO ]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 37 [2018-06-25 08:47:46,412 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:47:46,412 INFO ]: Abstraction has 72 states and 81 transitions. [2018-06-25 08:47:46,412 INFO ]: Interpolant automaton has 12 states. [2018-06-25 08:47:46,412 INFO ]: Start isEmpty. Operand 72 states and 81 transitions. [2018-06-25 08:47:46,413 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 08:47:46,413 INFO ]: Found error trace [2018-06-25 08:47:46,413 INFO ]: trace histogram [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, 1, 1, 1] [2018-06-25 08:47:46,413 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:47:46,413 INFO ]: Analyzing trace with hash 632739175, now seen corresponding path program 1 times [2018-06-25 08:47:46,413 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:47:46,413 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:47:46,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:47:46,414 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:47:46,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:47:46,446 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:47:46,664 INFO ]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:47:46,664 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:47:46,664 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-25 08:47:46,664 INFO ]: Interpolant automaton has 12 states [2018-06-25 08:47:46,664 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 08:47:46,664 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-25 08:47:46,664 INFO ]: Start difference. First operand 72 states and 81 transitions. Second operand 12 states. [2018-06-25 08:47:46,853 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:47:46,854 INFO ]: Finished difference Result 170 states and 188 transitions. [2018-06-25 08:47:46,854 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 08:47:46,854 INFO ]: Start accepts. Automaton has 12 states. Word has length 37 [2018-06-25 08:47:46,854 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:47:46,854 INFO ]: With dead ends: 170 [2018-06-25 08:47:46,854 INFO ]: Without dead ends: 166 [2018-06-25 08:47:46,855 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2018-06-25 08:47:46,855 INFO ]: Start minimizeSevpa. Operand 166 states. [2018-06-25 08:47:46,859 INFO ]: Finished minimizeSevpa. Reduced states from 166 to 72. [2018-06-25 08:47:46,859 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-25 08:47:46,860 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2018-06-25 08:47:46,860 INFO ]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 37 [2018-06-25 08:47:46,860 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:47:46,860 INFO ]: Abstraction has 72 states and 80 transitions. [2018-06-25 08:47:46,860 INFO ]: Interpolant automaton has 12 states. [2018-06-25 08:47:46,860 INFO ]: Start isEmpty. Operand 72 states and 80 transitions. [2018-06-25 08:47:46,862 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-25 08:47:46,862 INFO ]: Found error trace [2018-06-25 08:47:46,862 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:47:46,862 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:47:46,862 INFO ]: Analyzing trace with hash 763049700, now seen corresponding path program 1 times [2018-06-25 08:47:46,862 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:47:46,862 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:47:46,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:47:46,863 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:47:46,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:47:46,905 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:47:48,043 INFO ]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:47:48,043 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:47:48,043 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:47:48,060 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:47:48,207 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:47:48,221 INFO ]: Computing forward predicates... [2018-06-25 08:47:49,554 INFO ]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:47:49,588 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:47:49,588 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 19] total 48 [2018-06-25 08:47:49,589 INFO ]: Interpolant automaton has 48 states [2018-06-25 08:47:49,589 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-25 08:47:49,590 INFO ]: CoverageRelationStatistics Valid=99, Invalid=2157, Unknown=0, NotChecked=0, Total=2256 [2018-06-25 08:47:49,590 INFO ]: Start difference. First operand 72 states and 80 transitions. Second operand 48 states. [2018-06-25 08:47:51,185 WARN ]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-06-25 08:47:51,750 WARN ]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-25 08:47:53,833 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-06-25 08:47:54,292 WARN ]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-06-25 08:47:55,276 WARN ]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-06-25 08:47:56,530 WARN ]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-06-25 08:47:59,835 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:47:59,835 INFO ]: Finished difference Result 396 states and 438 transitions. [2018-06-25 08:47:59,835 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-06-25 08:47:59,835 INFO ]: Start accepts. Automaton has 48 states. Word has length 39 [2018-06-25 08:47:59,835 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:47:59,837 INFO ]: With dead ends: 396 [2018-06-25 08:47:59,837 INFO ]: Without dead ends: 387 [2018-06-25 08:47:59,841 INFO ]: 0 DeclaredPredicates, 172 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4055 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=3110, Invalid=16912, Unknown=0, NotChecked=0, Total=20022 [2018-06-25 08:47:59,841 INFO ]: Start minimizeSevpa. Operand 387 states. [2018-06-25 08:47:59,848 INFO ]: Finished minimizeSevpa. Reduced states from 387 to 74. [2018-06-25 08:47:59,848 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-25 08:47:59,849 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2018-06-25 08:47:59,849 INFO ]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 39 [2018-06-25 08:47:59,849 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:47:59,849 INFO ]: Abstraction has 74 states and 83 transitions. [2018-06-25 08:47:59,849 INFO ]: Interpolant automaton has 48 states. [2018-06-25 08:47:59,849 INFO ]: Start isEmpty. Operand 74 states and 83 transitions. [2018-06-25 08:47:59,850 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 08:47:59,850 INFO ]: Found error trace [2018-06-25 08:47:59,850 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:47:59,850 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:47:59,851 INFO ]: Analyzing trace with hash -1060668520, now seen corresponding path program 1 times [2018-06-25 08:47:59,851 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:47:59,851 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:47:59,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:47:59,852 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:47:59,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:47:59,881 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:48:00,113 INFO ]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:48:00,113 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:48:00,113 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-25 08:48:00,114 INFO ]: Interpolant automaton has 19 states [2018-06-25 08:48:00,114 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 08:48:00,114 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-25 08:48:00,114 INFO ]: Start difference. First operand 74 states and 83 transitions. Second operand 19 states. [2018-06-25 08:48:01,745 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:48:01,745 INFO ]: Finished difference Result 359 states and 394 transitions. [2018-06-25 08:48:01,745 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-06-25 08:48:01,746 INFO ]: Start accepts. Automaton has 19 states. Word has length 44 [2018-06-25 08:48:01,746 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:48:01,747 INFO ]: With dead ends: 359 [2018-06-25 08:48:01,747 INFO ]: Without dead ends: 358 [2018-06-25 08:48:01,749 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2386 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1885, Invalid=5947, Unknown=0, NotChecked=0, Total=7832 [2018-06-25 08:48:01,753 INFO ]: Start minimizeSevpa. Operand 358 states. [2018-06-25 08:48:01,764 INFO ]: Finished minimizeSevpa. Reduced states from 358 to 90. [2018-06-25 08:48:01,764 INFO ]: Start removeUnreachable. Operand 90 states. [2018-06-25 08:48:01,764 INFO ]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2018-06-25 08:48:01,764 INFO ]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 44 [2018-06-25 08:48:01,765 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:48:01,765 INFO ]: Abstraction has 90 states and 101 transitions. [2018-06-25 08:48:01,765 INFO ]: Interpolant automaton has 19 states. [2018-06-25 08:48:01,765 INFO ]: Start isEmpty. Operand 90 states and 101 transitions. [2018-06-25 08:48:01,766 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 08:48:01,766 INFO ]: Found error trace [2018-06-25 08:48:01,766 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:48:01,766 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:48:01,767 INFO ]: Analyzing trace with hash 525915096, now seen corresponding path program 1 times [2018-06-25 08:48:01,767 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:48:01,767 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:48:01,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:48:01,767 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:48:01,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:48:01,790 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:48:02,092 INFO ]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:48:02,093 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:48:02,093 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-25 08:48:02,093 INFO ]: Interpolant automaton has 19 states [2018-06-25 08:48:02,093 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 08:48:02,093 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-25 08:48:02,093 INFO ]: Start difference. First operand 90 states and 101 transitions. Second operand 19 states. [2018-06-25 08:48:02,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:48:02,886 INFO ]: Finished difference Result 242 states and 265 transitions. [2018-06-25 08:48:02,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-25 08:48:02,886 INFO ]: Start accepts. Automaton has 19 states. Word has length 44 [2018-06-25 08:48:02,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:48:02,887 INFO ]: With dead ends: 242 [2018-06-25 08:48:02,888 INFO ]: Without dead ends: 236 [2018-06-25 08:48:02,888 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=784, Invalid=2078, Unknown=0, NotChecked=0, Total=2862 [2018-06-25 08:48:02,889 INFO ]: Start minimizeSevpa. Operand 236 states. [2018-06-25 08:48:02,897 INFO ]: Finished minimizeSevpa. Reduced states from 236 to 85. [2018-06-25 08:48:02,897 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-25 08:48:02,897 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-06-25 08:48:02,897 INFO ]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 44 [2018-06-25 08:48:02,898 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:48:02,898 INFO ]: Abstraction has 85 states and 95 transitions. [2018-06-25 08:48:02,898 INFO ]: Interpolant automaton has 19 states. [2018-06-25 08:48:02,898 INFO ]: Start isEmpty. Operand 85 states and 95 transitions. [2018-06-25 08:48:02,899 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 08:48:02,899 INFO ]: Found error trace [2018-06-25 08:48:02,899 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:48:02,899 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:48:02,899 INFO ]: Analyzing trace with hash -1555447171, now seen corresponding path program 1 times [2018-06-25 08:48:02,899 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:48:02,899 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:48:02,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:48:02,900 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:48:02,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:48:02,926 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:48:03,122 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:48:03,122 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:48:03,122 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-25 08:48:03,123 INFO ]: Interpolant automaton has 19 states [2018-06-25 08:48:03,123 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 08:48:03,123 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-25 08:48:03,123 INFO ]: Start difference. First operand 85 states and 95 transitions. Second operand 19 states. [2018-06-25 08:48:04,427 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:48:04,427 INFO ]: Finished difference Result 385 states and 428 transitions. [2018-06-25 08:48:04,427 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-25 08:48:04,427 INFO ]: Start accepts. Automaton has 19 states. Word has length 44 [2018-06-25 08:48:04,427 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:48:04,428 INFO ]: With dead ends: 385 [2018-06-25 08:48:04,428 INFO ]: Without dead ends: 381 [2018-06-25 08:48:04,429 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1008, Invalid=3024, Unknown=0, NotChecked=0, Total=4032 [2018-06-25 08:48:04,429 INFO ]: Start minimizeSevpa. Operand 381 states. [2018-06-25 08:48:04,436 INFO ]: Finished minimizeSevpa. Reduced states from 381 to 85. [2018-06-25 08:48:04,436 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-25 08:48:04,437 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-06-25 08:48:04,437 INFO ]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 44 [2018-06-25 08:48:04,437 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:48:04,437 INFO ]: Abstraction has 85 states and 95 transitions. [2018-06-25 08:48:04,437 INFO ]: Interpolant automaton has 19 states. [2018-06-25 08:48:04,437 INFO ]: Start isEmpty. Operand 85 states and 95 transitions. [2018-06-25 08:48:04,438 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 08:48:04,438 INFO ]: Found error trace [2018-06-25 08:48:04,438 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:48:04,438 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:48:04,438 INFO ]: Analyzing trace with hash 1661727293, now seen corresponding path program 1 times [2018-06-25 08:48:04,438 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:48:04,438 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:48:04,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:48:04,439 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:48:04,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:48:04,456 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:48:04,760 INFO ]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:48:04,760 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:48:04,760 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-25 08:48:04,761 INFO ]: Interpolant automaton has 19 states [2018-06-25 08:48:04,761 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 08:48:04,761 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-25 08:48:04,761 INFO ]: Start difference. First operand 85 states and 95 transitions. Second operand 19 states. [2018-06-25 08:48:06,041 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:48:06,041 INFO ]: Finished difference Result 359 states and 396 transitions. [2018-06-25 08:48:06,041 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-06-25 08:48:06,041 INFO ]: Start accepts. Automaton has 19 states. Word has length 44 [2018-06-25 08:48:06,041 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:48:06,042 INFO ]: With dead ends: 359 [2018-06-25 08:48:06,042 INFO ]: Without dead ends: 358 [2018-06-25 08:48:06,043 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1948 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1626, Invalid=5016, Unknown=0, NotChecked=0, Total=6642 [2018-06-25 08:48:06,043 INFO ]: Start minimizeSevpa. Operand 358 states. [2018-06-25 08:48:06,048 INFO ]: Finished minimizeSevpa. Reduced states from 358 to 101. [2018-06-25 08:48:06,048 INFO ]: Start removeUnreachable. Operand 101 states. [2018-06-25 08:48:06,048 INFO ]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2018-06-25 08:48:06,048 INFO ]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 44 [2018-06-25 08:48:06,049 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:48:06,049 INFO ]: Abstraction has 101 states and 113 transitions. [2018-06-25 08:48:06,049 INFO ]: Interpolant automaton has 19 states. [2018-06-25 08:48:06,049 INFO ]: Start isEmpty. Operand 101 states and 113 transitions. [2018-06-25 08:48:06,051 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 08:48:06,051 INFO ]: Found error trace [2018-06-25 08:48:06,051 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:48:06,051 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:48:06,051 INFO ]: Analyzing trace with hash -1046656387, now seen corresponding path program 1 times [2018-06-25 08:48:06,051 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:48:06,051 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:48:06,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:48:06,052 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:48:06,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:48:06,072 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:48:06,505 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:48:06,505 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:48:06,505 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-25 08:48:06,505 INFO ]: Interpolant automaton has 19 states [2018-06-25 08:48:06,505 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 08:48:06,505 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-25 08:48:06,506 INFO ]: Start difference. First operand 101 states and 113 transitions. Second operand 19 states. [2018-06-25 08:48:07,449 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:48:07,449 INFO ]: Finished difference Result 403 states and 448 transitions. [2018-06-25 08:48:07,450 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-25 08:48:07,450 INFO ]: Start accepts. Automaton has 19 states. Word has length 44 [2018-06-25 08:48:07,450 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:48:07,451 INFO ]: With dead ends: 403 [2018-06-25 08:48:07,451 INFO ]: Without dead ends: 399 [2018-06-25 08:48:07,452 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1008, Invalid=3024, Unknown=0, NotChecked=0, Total=4032 [2018-06-25 08:48:07,452 INFO ]: Start minimizeSevpa. Operand 399 states. [2018-06-25 08:48:07,466 INFO ]: Finished minimizeSevpa. Reduced states from 399 to 95. [2018-06-25 08:48:07,466 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-25 08:48:07,467 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2018-06-25 08:48:07,467 INFO ]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 44 [2018-06-25 08:48:07,467 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:48:07,467 INFO ]: Abstraction has 95 states and 106 transitions. [2018-06-25 08:48:07,467 INFO ]: Interpolant automaton has 19 states. [2018-06-25 08:48:07,467 INFO ]: Start isEmpty. Operand 95 states and 106 transitions. [2018-06-25 08:48:07,468 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-25 08:48:07,468 INFO ]: Found error trace [2018-06-25 08:48:07,468 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:48:07,468 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:48:07,468 INFO ]: Analyzing trace with hash 1389319122, now seen corresponding path program 1 times [2018-06-25 08:48:07,468 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:48:07,468 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:48:07,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:48:07,469 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:48:07,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:48:07,485 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:48:08,310 INFO ]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 08:48:08,310 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:48:08,310 INFO ]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-06-25 08:48:08,310 INFO ]: Interpolant automaton has 21 states [2018-06-25 08:48:08,310 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 08:48:08,310 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-25 08:48:08,310 INFO ]: Start difference. First operand 95 states and 106 transitions. Second operand 21 states. [2018-06-25 08:48:10,614 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:48:10,614 INFO ]: Finished difference Result 435 states and 478 transitions. [2018-06-25 08:48:10,614 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-06-25 08:48:10,614 INFO ]: Start accepts. Automaton has 21 states. Word has length 48 [2018-06-25 08:48:10,614 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:48:10,616 INFO ]: With dead ends: 435 [2018-06-25 08:48:10,616 INFO ]: Without dead ends: 434 [2018-06-25 08:48:10,617 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2889 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2228, Invalid=7474, Unknown=0, NotChecked=0, Total=9702 [2018-06-25 08:48:10,617 INFO ]: Start minimizeSevpa. Operand 434 states. [2018-06-25 08:48:10,625 INFO ]: Finished minimizeSevpa. Reduced states from 434 to 110. [2018-06-25 08:48:10,626 INFO ]: Start removeUnreachable. Operand 110 states. [2018-06-25 08:48:10,626 INFO ]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2018-06-25 08:48:10,626 INFO ]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 48 [2018-06-25 08:48:10,627 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:48:10,627 INFO ]: Abstraction has 110 states and 123 transitions. [2018-06-25 08:48:10,627 INFO ]: Interpolant automaton has 21 states. [2018-06-25 08:48:10,627 INFO ]: Start isEmpty. Operand 110 states and 123 transitions. [2018-06-25 08:48:10,627 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-25 08:48:10,627 INFO ]: Found error trace [2018-06-25 08:48:10,627 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:48:10,627 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:48:10,628 INFO ]: Analyzing trace with hash -1319064558, now seen corresponding path program 1 times [2018-06-25 08:48:10,628 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:48:10,628 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:48:10,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:48:10,632 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:48:10,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:48:10,655 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:48:10,986 INFO ]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 08:48:10,986 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:48:10,986 INFO ]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-06-25 08:48:10,987 INFO ]: Interpolant automaton has 21 states [2018-06-25 08:48:10,987 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 08:48:10,987 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-25 08:48:10,987 INFO ]: Start difference. First operand 110 states and 123 transitions. Second operand 21 states. [2018-06-25 08:48:11,566 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:48:11,566 INFO ]: Finished difference Result 179 states and 195 transitions. [2018-06-25 08:48:11,596 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-25 08:48:11,596 INFO ]: Start accepts. Automaton has 21 states. Word has length 48 [2018-06-25 08:48:11,596 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:48:11,597 INFO ]: With dead ends: 179 [2018-06-25 08:48:11,597 INFO ]: Without dead ends: 163 [2018-06-25 08:48:11,597 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=485, Invalid=1237, Unknown=0, NotChecked=0, Total=1722 [2018-06-25 08:48:11,597 INFO ]: Start minimizeSevpa. Operand 163 states. [2018-06-25 08:48:11,599 INFO ]: Finished minimizeSevpa. Reduced states from 163 to 101. [2018-06-25 08:48:11,599 INFO ]: Start removeUnreachable. Operand 101 states. [2018-06-25 08:48:11,600 INFO ]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2018-06-25 08:48:11,600 INFO ]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 48 [2018-06-25 08:48:11,600 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:48:11,600 INFO ]: Abstraction has 101 states and 111 transitions. [2018-06-25 08:48:11,600 INFO ]: Interpolant automaton has 21 states. [2018-06-25 08:48:11,600 INFO ]: Start isEmpty. Operand 101 states and 111 transitions. [2018-06-25 08:48:11,601 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-25 08:48:11,601 INFO ]: Found error trace [2018-06-25 08:48:11,601 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:48:11,601 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:48:11,601 INFO ]: Analyzing trace with hash 190423095, now seen corresponding path program 1 times [2018-06-25 08:48:11,601 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:48:11,601 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:48:11,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:48:11,602 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:48:11,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:48:11,628 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:48:12,010 INFO ]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:48:12,010 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:48:12,010 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:48:12,015 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:48:12,156 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:48:12,168 INFO ]: Computing forward predicates... [2018-06-25 08:48:12,271 INFO ]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:48:12,290 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:48:12,291 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 28 [2018-06-25 08:48:12,291 INFO ]: Interpolant automaton has 28 states [2018-06-25 08:48:12,291 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 08:48:12,291 INFO ]: CoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2018-06-25 08:48:12,291 INFO ]: Start difference. First operand 101 states and 111 transitions. Second operand 28 states. [2018-06-25 08:48:13,151 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:48:13,151 INFO ]: Finished difference Result 308 states and 337 transitions. [2018-06-25 08:48:13,151 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-25 08:48:13,151 INFO ]: Start accepts. Automaton has 28 states. Word has length 48 [2018-06-25 08:48:13,151 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:48:13,153 INFO ]: With dead ends: 308 [2018-06-25 08:48:13,153 INFO ]: Without dead ends: 293 [2018-06-25 08:48:13,153 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=770, Invalid=2536, Unknown=0, NotChecked=0, Total=3306 [2018-06-25 08:48:13,153 INFO ]: Start minimizeSevpa. Operand 293 states. [2018-06-25 08:48:13,158 INFO ]: Finished minimizeSevpa. Reduced states from 293 to 101. [2018-06-25 08:48:13,158 INFO ]: Start removeUnreachable. Operand 101 states. [2018-06-25 08:48:13,158 INFO ]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2018-06-25 08:48:13,158 INFO ]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 48 [2018-06-25 08:48:13,159 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:48:13,159 INFO ]: Abstraction has 101 states and 111 transitions. [2018-06-25 08:48:13,159 INFO ]: Interpolant automaton has 28 states. [2018-06-25 08:48:13,159 INFO ]: Start isEmpty. Operand 101 states and 111 transitions. [2018-06-25 08:48:13,159 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-25 08:48:13,159 INFO ]: Found error trace [2018-06-25 08:48:13,159 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:48:13,159 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:48:13,159 INFO ]: Analyzing trace with hash -1157763081, now seen corresponding path program 1 times [2018-06-25 08:48:13,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:48:13,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:48:13,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:48:13,162 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:48:13,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:48:13,178 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:48:13,470 INFO ]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 08:48:13,470 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:48:13,470 INFO ]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-06-25 08:48:13,470 INFO ]: Interpolant automaton has 21 states [2018-06-25 08:48:13,470 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 08:48:13,470 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-25 08:48:13,470 INFO ]: Start difference. First operand 101 states and 111 transitions. Second operand 21 states. [2018-06-25 08:48:15,684 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:48:15,684 INFO ]: Finished difference Result 475 states and 521 transitions. [2018-06-25 08:48:15,684 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-06-25 08:48:15,684 INFO ]: Start accepts. Automaton has 21 states. Word has length 48 [2018-06-25 08:48:15,684 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:48:15,685 INFO ]: With dead ends: 475 [2018-06-25 08:48:15,685 INFO ]: Without dead ends: 474 [2018-06-25 08:48:15,687 INFO ]: 0 DeclaredPredicates, 120 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4060 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2702, Invalid=9954, Unknown=0, NotChecked=0, Total=12656 [2018-06-25 08:48:15,687 INFO ]: Start minimizeSevpa. Operand 474 states. [2018-06-25 08:48:15,695 INFO ]: Finished minimizeSevpa. Reduced states from 474 to 103. [2018-06-25 08:48:15,695 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-25 08:48:15,695 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-06-25 08:48:15,695 INFO ]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 48 [2018-06-25 08:48:15,696 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:48:15,696 INFO ]: Abstraction has 103 states and 113 transitions. [2018-06-25 08:48:15,696 INFO ]: Interpolant automaton has 21 states. [2018-06-25 08:48:15,696 INFO ]: Start isEmpty. Operand 103 states and 113 transitions. [2018-06-25 08:48:15,696 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-25 08:48:15,696 INFO ]: Found error trace [2018-06-25 08:48:15,696 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:48:15,696 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:48:15,696 INFO ]: Analyzing trace with hash 428820535, now seen corresponding path program 1 times [2018-06-25 08:48:15,696 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:48:15,697 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:48:15,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:48:15,697 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:48:15,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:48:15,718 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:48:16,093 INFO ]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:48:16,093 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:48:16,093 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:48:16,099 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:48:16,225 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:48:16,233 INFO ]: Computing forward predicates... [2018-06-25 08:48:16,344 INFO ]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:48:16,364 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:48:16,364 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 28 [2018-06-25 08:48:16,364 INFO ]: Interpolant automaton has 28 states [2018-06-25 08:48:16,364 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 08:48:16,364 INFO ]: CoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2018-06-25 08:48:16,364 INFO ]: Start difference. First operand 103 states and 113 transitions. Second operand 28 states. [2018-06-25 08:48:17,221 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:48:17,221 INFO ]: Finished difference Result 295 states and 322 transitions. [2018-06-25 08:48:17,246 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-25 08:48:17,246 INFO ]: Start accepts. Automaton has 28 states. Word has length 48 [2018-06-25 08:48:17,246 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:48:17,247 INFO ]: With dead ends: 295 [2018-06-25 08:48:17,247 INFO ]: Without dead ends: 280 [2018-06-25 08:48:17,247 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=770, Invalid=2536, Unknown=0, NotChecked=0, Total=3306 [2018-06-25 08:48:17,248 INFO ]: Start minimizeSevpa. Operand 280 states. [2018-06-25 08:48:17,250 INFO ]: Finished minimizeSevpa. Reduced states from 280 to 92. [2018-06-25 08:48:17,250 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-25 08:48:17,251 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-06-25 08:48:17,251 INFO ]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 48 [2018-06-25 08:48:17,251 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:48:17,251 INFO ]: Abstraction has 92 states and 101 transitions. [2018-06-25 08:48:17,251 INFO ]: Interpolant automaton has 28 states. [2018-06-25 08:48:17,251 INFO ]: Start isEmpty. Operand 92 states and 101 transitions. [2018-06-25 08:48:17,251 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-25 08:48:17,251 INFO ]: Found error trace [2018-06-25 08:48:17,252 INFO ]: trace histogram [3, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-06-25 08:48:17,252 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:48:17,252 INFO ]: Analyzing trace with hash 1859568084, now seen corresponding path program 1 times [2018-06-25 08:48:17,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:48:17,252 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:48:17,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:48:17,252 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:48:17,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:48:17,275 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:48:18,623 INFO ]: Checked inductivity of 18 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 08:48:18,623 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:48:18,623 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-25 08:48:18,629 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:48:18,765 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:48:18,778 INFO ]: Computing forward predicates... [2018-06-25 08:48:19,862 INFO ]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:48:19,885 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:48:19,885 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 29] total 65 [2018-06-25 08:48:19,885 INFO ]: Interpolant automaton has 65 states [2018-06-25 08:48:19,886 INFO ]: Constructing interpolant automaton starting with 65 interpolants. [2018-06-25 08:48:19,886 INFO ]: CoverageRelationStatistics Valid=153, Invalid=4007, Unknown=0, NotChecked=0, Total=4160 [2018-06-25 08:48:19,886 INFO ]: Start difference. First operand 92 states and 101 transitions. Second operand 65 states. [2018-06-25 08:48:21,547 WARN ]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2018-06-25 08:48:23,106 WARN ]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-06-25 08:48:23,582 WARN ]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2018-06-25 08:48:24,501 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2018-06-25 08:48:24,741 WARN ]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-06-25 08:48:24,993 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-06-25 08:48:25,148 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2018-06-25 08:48:25,619 WARN ]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2018-06-25 08:48:26,218 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 165 Received shutdown request... [2018-06-25 08:48:31,659 WARN ]: Removed 9 from assertion stack [2018-06-25 08:48:31,659 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-06-25 08:48:31,659 WARN ]: Verification canceled [2018-06-25 08:48:31,662 WARN ]: Timeout [2018-06-25 08:48:31,663 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 08:48:31 BoogieIcfgContainer [2018-06-25 08:48:31,663 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 08:48:31,664 INFO ]: Toolchain (without parser) took 60061.18 ms. Allocated memory was 301.5 MB in the beginning and 810.5 MB in the end (delta: 509.1 MB). Free memory was 221.9 MB in the beginning and 289.8 MB in the end (delta: -67.8 MB). Peak memory consumption was 441.3 MB. Max. memory is 3.6 GB. [2018-06-25 08:48:31,664 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 301.5 MB. Free memory is still 267.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 08:48:31,664 INFO ]: ChcToBoogie took 101.08 ms. Allocated memory is still 301.5 MB. Free memory was 221.0 MB in the beginning and 217.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:48:31,665 INFO ]: Boogie Preprocessor took 46.40 ms. Allocated memory is still 301.5 MB. Free memory was 217.0 MB in the beginning and 215.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:48:31,665 INFO ]: RCFGBuilder took 1100.64 ms. Allocated memory was 301.5 MB in the beginning and 322.4 MB in the end (delta: 21.0 MB). Free memory was 215.0 MB in the beginning and 264.7 MB in the end (delta: -49.7 MB). Peak memory consumption was 40.4 MB. Max. memory is 3.6 GB. [2018-06-25 08:48:31,665 INFO ]: TraceAbstraction took 58798.02 ms. Allocated memory was 322.4 MB in the beginning and 810.5 MB in the end (delta: 488.1 MB). Free memory was 264.7 MB in the beginning and 289.8 MB in the end (delta: -25.1 MB). Peak memory consumption was 463.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:48:31,671 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 301.5 MB. Free memory is still 267.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 101.08 ms. Allocated memory is still 301.5 MB. Free memory was 221.0 MB in the beginning and 217.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.40 ms. Allocated memory is still 301.5 MB. Free memory was 217.0 MB in the beginning and 215.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1100.64 ms. Allocated memory was 301.5 MB in the beginning and 322.4 MB in the end (delta: 21.0 MB). Free memory was 215.0 MB in the beginning and 264.7 MB in the end (delta: -49.7 MB). Peak memory consumption was 40.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58798.02 ms. Allocated memory was 322.4 MB in the beginning and 810.5 MB in the end (delta: 488.1 MB). Free memory was 264.7 MB in the beginning and 289.8 MB in the end (delta: -25.1 MB). Peak memory consumption was 463.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 116 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 146. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. TIMEOUT Result, 58.7s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 46.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1764 SDtfs, 20177 SDslu, 37273 SDs, 0 SdLazy, 11037 SolverSat, 2720 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1557 GetRequests, 214 SyntacticMatches, 4 SemanticMatches, 1338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34992 ImplicationChecksByTransitivity, 46.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=12, 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, 3817 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 887 NumberOfCodeBlocks, 887 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 866 ConstructedInterpolants, 0 QuantifiedInterpolants, 103428 SizeOfPredicates, 140 NumberOfNonLiveVariables, 4770 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 21 InterpolantComputations, 13 PerfectInterpolantSequences, 134/166 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/31.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_08-48-31-680.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/31.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_08-48-31-680.csv Completed graceful shutdown