java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2-big2_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:57:15,606 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:57:15,608 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:57:15,623 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:57:15,623 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:57:15,624 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:57:15,625 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:57:15,627 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:57:15,629 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:57:15,629 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:57:15,631 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:57:15,631 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:57:15,632 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:57:15,633 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:57:15,636 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:57:15,637 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:57:15,639 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:57:15,642 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:57:15,644 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:57:15,645 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:57:15,646 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:57:15,648 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:57:15,649 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:57:15,649 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:57:15,650 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:57:15,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:57:15,651 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:57:15,652 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:57:15,653 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:57:15,653 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:57:15,654 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:57:15,654 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:57:15,655 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:57:15,655 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:57:15,656 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:57:15,656 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 10:57:15,671 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:57:15,671 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:57:15,672 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:57:15,672 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:57:15,676 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:57:15,676 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:57:15,676 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:57:15,676 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:57:15,677 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:57:15,677 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:57:15,677 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:57:15,677 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:57:15,677 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:57:15,677 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:57:15,678 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:57:15,678 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:57:15,678 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:57:15,678 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:57:15,678 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:57:15,680 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:57:15,681 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:57:15,728 INFO ]: Repository-Root is: /tmp [2018-06-22 10:57:15,744 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:57:15,749 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:57:15,751 INFO ]: Initializing SmtParser... [2018-06-22 10:57:15,751 INFO ]: SmtParser initialized [2018-06-22 10:57:15,752 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2-big2_merged_safe.c-1.smt2 [2018-06-22 10:57:15,753 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 10:57:15,837 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2-big2_merged_safe.c-1.smt2 unknown [2018-06-22 10:57:16,011 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2-big2_merged_safe.c-1.smt2 [2018-06-22 10:57:16,015 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:57:16,021 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:57:16,021 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:57:16,021 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:57:16,022 INFO ]: ChcToBoogie initialized [2018-06-22 10:57:16,024 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:57:16" (1/1) ... [2018-06-22 10:57:16,074 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:57:16 Unit [2018-06-22 10:57:16,074 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:57:16,074 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:57:16,074 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:57:16,074 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:57:16,097 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:57:16" (1/1) ... [2018-06-22 10:57:16,098 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:57:16" (1/1) ... [2018-06-22 10:57:16,107 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:57:16" (1/1) ... [2018-06-22 10:57:16,108 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:57:16" (1/1) ... [2018-06-22 10:57:16,110 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:57:16" (1/1) ... [2018-06-22 10:57:16,114 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:57:16" (1/1) ... [2018-06-22 10:57:16,115 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:57:16" (1/1) ... [2018-06-22 10:57:16,117 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:57:16,117 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:57:16,117 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:57:16,117 INFO ]: RCFGBuilder initialized [2018-06-22 10:57:16,122 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:57:16" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 10:57:16,137 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:57:16,137 INFO ]: Found specification of procedure False [2018-06-22 10:57:16,137 INFO ]: Found implementation of procedure False [2018-06-22 10:57:16,137 INFO ]: Specification and implementation of procedure inv_main23 given in one single declaration [2018-06-22 10:57:16,137 INFO ]: Found specification of procedure inv_main23 [2018-06-22 10:57:16,137 INFO ]: Found implementation of procedure inv_main23 [2018-06-22 10:57:16,137 INFO ]: Specification and implementation of procedure inv_main19 given in one single declaration [2018-06-22 10:57:16,137 INFO ]: Found specification of procedure inv_main19 [2018-06-22 10:57:16,137 INFO ]: Found implementation of procedure inv_main19 [2018-06-22 10:57:16,137 INFO ]: Specification and implementation of procedure inv_main12 given in one single declaration [2018-06-22 10:57:16,137 INFO ]: Found specification of procedure inv_main12 [2018-06-22 10:57:16,137 INFO ]: Found implementation of procedure inv_main12 [2018-06-22 10:57:16,137 INFO ]: Specification and implementation of procedure inv_main6 given in one single declaration [2018-06-22 10:57:16,137 INFO ]: Found specification of procedure inv_main6 [2018-06-22 10:57:16,137 INFO ]: Found implementation of procedure inv_main6 [2018-06-22 10:57:16,137 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:57:16,137 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:57:16,137 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:57:16,597 INFO ]: Using library mode [2018-06-22 10:57:16,598 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:57:16 BoogieIcfgContainer [2018-06-22 10:57:16,598 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:57:16,600 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:57:16,600 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:57:16,603 INFO ]: TraceAbstraction initialized [2018-06-22 10:57:16,603 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:57:16" (1/3) ... [2018-06-22 10:57:16,604 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c38bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:57:16, skipping insertion in model container [2018-06-22 10:57:16,604 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:57:16" (2/3) ... [2018-06-22 10:57:16,605 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c38bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:57:16, skipping insertion in model container [2018-06-22 10:57:16,605 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:57:16" (3/3) ... [2018-06-22 10:57:16,606 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:57:16,616 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:57:16,626 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:57:16,666 INFO ]: Using default assertion order modulation [2018-06-22 10:57:16,667 INFO ]: Interprodecural is true [2018-06-22 10:57:16,667 INFO ]: Hoare is false [2018-06-22 10:57:16,667 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:57:16,667 INFO ]: Backedges is TWOTRACK [2018-06-22 10:57:16,667 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:57:16,667 INFO ]: Difference is false [2018-06-22 10:57:16,667 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:57:16,668 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:57:16,681 INFO ]: Start isEmpty. Operand 29 states. [2018-06-22 10:57:16,692 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 10:57:16,693 INFO ]: Found error trace [2018-06-22 10:57:16,694 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 10:57:16,694 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:16,698 INFO ]: Analyzing trace with hash 91985224, now seen corresponding path program 1 times [2018-06-22 10:57:16,701 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:16,701 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:16,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:16,733 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:16,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:16,747 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:16,770 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:57:16,772 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:16,772 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 10:57:16,773 INFO ]: Interpolant automaton has 2 states [2018-06-22 10:57:16,784 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 10:57:16,785 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 10:57:16,788 INFO ]: Start difference. First operand 29 states. Second operand 2 states. [2018-06-22 10:57:16,815 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:16,815 INFO ]: Finished difference Result 27 states and 36 transitions. [2018-06-22 10:57:16,815 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 10:57:16,817 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 10:57:16,817 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:16,830 INFO ]: With dead ends: 27 [2018-06-22 10:57:16,830 INFO ]: Without dead ends: 27 [2018-06-22 10:57:16,832 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 10:57:16,844 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 10:57:16,876 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 10:57:16,877 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 10:57:16,878 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2018-06-22 10:57:16,879 INFO ]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 5 [2018-06-22 10:57:16,879 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:16,880 INFO ]: Abstraction has 27 states and 36 transitions. [2018-06-22 10:57:16,880 INFO ]: Interpolant automaton has 2 states. [2018-06-22 10:57:16,880 INFO ]: Start isEmpty. Operand 27 states and 36 transitions. [2018-06-22 10:57:16,882 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:57:16,882 INFO ]: Found error trace [2018-06-22 10:57:16,882 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:16,882 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:16,882 INFO ]: Analyzing trace with hash 439774711, now seen corresponding path program 1 times [2018-06-22 10:57:16,882 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:16,882 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:16,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:16,883 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:16,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:16,920 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:17,034 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:57:17,034 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:17,034 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 10:57:17,039 INFO ]: Interpolant automaton has 4 states [2018-06-22 10:57:17,039 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 10:57:17,039 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 10:57:17,040 INFO ]: Start difference. First operand 27 states and 36 transitions. Second operand 4 states. [2018-06-22 10:57:17,350 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:17,350 INFO ]: Finished difference Result 31 states and 42 transitions. [2018-06-22 10:57:17,350 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 10:57:17,350 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 10:57:17,350 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:17,351 INFO ]: With dead ends: 31 [2018-06-22 10:57:17,351 INFO ]: Without dead ends: 31 [2018-06-22 10:57:17,352 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 10:57:17,352 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 10:57:17,366 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-06-22 10:57:17,366 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 10:57:17,368 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2018-06-22 10:57:17,368 INFO ]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 21 [2018-06-22 10:57:17,369 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:17,369 INFO ]: Abstraction has 29 states and 40 transitions. [2018-06-22 10:57:17,369 INFO ]: Interpolant automaton has 4 states. [2018-06-22 10:57:17,369 INFO ]: Start isEmpty. Operand 29 states and 40 transitions. [2018-06-22 10:57:17,371 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:57:17,371 INFO ]: Found error trace [2018-06-22 10:57:17,371 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:17,371 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:17,371 INFO ]: Analyzing trace with hash 1113929172, now seen corresponding path program 1 times [2018-06-22 10:57:17,371 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:17,371 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:17,372 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:17,372 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:17,372 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:17,392 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:17,778 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:57:17,778 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:17,778 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 10:57:17,778 INFO ]: Interpolant automaton has 8 states [2018-06-22 10:57:17,779 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 10:57:17,784 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:57:17,784 INFO ]: Start difference. First operand 29 states and 40 transitions. Second operand 8 states. [2018-06-22 10:57:18,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:18,053 INFO ]: Finished difference Result 37 states and 50 transitions. [2018-06-22 10:57:18,054 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:57:18,054 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 10:57:18,054 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:18,055 INFO ]: With dead ends: 37 [2018-06-22 10:57:18,055 INFO ]: Without dead ends: 34 [2018-06-22 10:57:18,055 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:57:18,055 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 10:57:18,061 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-06-22 10:57:18,061 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 10:57:18,062 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-06-22 10:57:18,062 INFO ]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 21 [2018-06-22 10:57:18,062 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:18,062 INFO ]: Abstraction has 28 states and 36 transitions. [2018-06-22 10:57:18,062 INFO ]: Interpolant automaton has 8 states. [2018-06-22 10:57:18,062 INFO ]: Start isEmpty. Operand 28 states and 36 transitions. [2018-06-22 10:57:18,063 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:57:18,063 INFO ]: Found error trace [2018-06-22 10:57:18,063 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:18,063 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:18,063 INFO ]: Analyzing trace with hash 1133602497, now seen corresponding path program 1 times [2018-06-22 10:57:18,063 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:18,063 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:18,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:18,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:18,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:18,078 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:18,348 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:57:18,348 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:18,348 INFO ]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-06-22 10:57:18,349 INFO ]: Interpolant automaton has 9 states [2018-06-22 10:57:18,349 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 10:57:18,349 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:57:18,349 INFO ]: Start difference. First operand 28 states and 36 transitions. Second operand 9 states. [2018-06-22 10:57:18,800 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-22 10:57:18,963 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:18,963 INFO ]: Finished difference Result 38 states and 48 transitions. [2018-06-22 10:57:18,964 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 10:57:18,964 INFO ]: Start accepts. Automaton has 9 states. Word has length 21 [2018-06-22 10:57:18,964 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:18,965 INFO ]: With dead ends: 38 [2018-06-22 10:57:18,965 INFO ]: Without dead ends: 38 [2018-06-22 10:57:18,966 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:57:18,966 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 10:57:18,971 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-06-22 10:57:18,971 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 10:57:18,972 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2018-06-22 10:57:18,973 INFO ]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 21 [2018-06-22 10:57:18,973 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:18,973 INFO ]: Abstraction has 36 states and 46 transitions. [2018-06-22 10:57:18,973 INFO ]: Interpolant automaton has 9 states. [2018-06-22 10:57:18,973 INFO ]: Start isEmpty. Operand 36 states and 46 transitions. [2018-06-22 10:57:18,974 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:57:18,974 INFO ]: Found error trace [2018-06-22 10:57:18,974 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:18,974 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:18,974 INFO ]: Analyzing trace with hash 786688604, now seen corresponding path program 1 times [2018-06-22 10:57:18,974 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:18,974 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:18,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:18,975 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:18,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:18,985 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:19,120 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:57:19,120 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:19,121 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 10:57:19,121 INFO ]: Interpolant automaton has 8 states [2018-06-22 10:57:19,121 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 10:57:19,121 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:57:19,121 INFO ]: Start difference. First operand 36 states and 46 transitions. Second operand 8 states. [2018-06-22 10:57:19,245 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:19,245 INFO ]: Finished difference Result 40 states and 49 transitions. [2018-06-22 10:57:19,246 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:57:19,246 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 10:57:19,246 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:19,247 INFO ]: With dead ends: 40 [2018-06-22 10:57:19,247 INFO ]: Without dead ends: 38 [2018-06-22 10:57:19,247 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:57:19,247 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 10:57:19,252 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-06-22 10:57:19,252 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 10:57:19,253 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2018-06-22 10:57:19,253 INFO ]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 21 [2018-06-22 10:57:19,254 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:19,254 INFO ]: Abstraction has 36 states and 45 transitions. [2018-06-22 10:57:19,254 INFO ]: Interpolant automaton has 8 states. [2018-06-22 10:57:19,254 INFO ]: Start isEmpty. Operand 36 states and 45 transitions. [2018-06-22 10:57:19,255 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:57:19,255 INFO ]: Found error trace [2018-06-22 10:57:19,255 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] [2018-06-22 10:57:19,255 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:19,256 INFO ]: Analyzing trace with hash 2127487811, now seen corresponding path program 1 times [2018-06-22 10:57:19,256 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:19,256 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:19,256 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:19,256 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:19,256 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:19,275 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:19,462 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:57:19,462 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:19,462 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 10:57:19,462 INFO ]: Interpolant automaton has 10 states [2018-06-22 10:57:19,462 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 10:57:19,463 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 10:57:19,463 INFO ]: Start difference. First operand 36 states and 45 transitions. Second operand 10 states. [2018-06-22 10:57:19,703 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:19,703 INFO ]: Finished difference Result 42 states and 51 transitions. [2018-06-22 10:57:19,704 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:57:19,704 INFO ]: Start accepts. Automaton has 10 states. Word has length 25 [2018-06-22 10:57:19,704 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:19,705 INFO ]: With dead ends: 42 [2018-06-22 10:57:19,705 INFO ]: Without dead ends: 42 [2018-06-22 10:57:19,705 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:19,705 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 10:57:19,711 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 36. [2018-06-22 10:57:19,711 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 10:57:19,712 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2018-06-22 10:57:19,712 INFO ]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 25 [2018-06-22 10:57:19,712 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:19,712 INFO ]: Abstraction has 36 states and 45 transitions. [2018-06-22 10:57:19,712 INFO ]: Interpolant automaton has 10 states. [2018-06-22 10:57:19,712 INFO ]: Start isEmpty. Operand 36 states and 45 transitions. [2018-06-22 10:57:19,713 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:57:19,713 INFO ]: Found error trace [2018-06-22 10:57:19,713 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] [2018-06-22 10:57:19,713 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:19,713 INFO ]: Analyzing trace with hash 1880043614, now seen corresponding path program 1 times [2018-06-22 10:57:19,713 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:19,713 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:19,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:19,714 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:19,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:19,725 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:19,798 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:57:19,798 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:57:19,798 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:57:19,806 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:19,836 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:19,843 INFO ]: Computing forward predicates... [2018-06-22 10:57:19,910 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:57:19,932 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:57:19,932 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 10:57:19,932 INFO ]: Interpolant automaton has 10 states [2018-06-22 10:57:19,932 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 10:57:19,932 INFO ]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-22 10:57:19,933 INFO ]: Start difference. First operand 36 states and 45 transitions. Second operand 10 states. [2018-06-22 10:57:20,038 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:20,038 INFO ]: Finished difference Result 38 states and 46 transitions. [2018-06-22 10:57:20,040 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:57:20,041 INFO ]: Start accepts. Automaton has 10 states. Word has length 25 [2018-06-22 10:57:20,041 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:20,041 INFO ]: With dead ends: 38 [2018-06-22 10:57:20,041 INFO ]: Without dead ends: 38 [2018-06-22 10:57:20,042 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:57:20,042 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 10:57:20,046 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 32. [2018-06-22 10:57:20,046 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 10:57:20,047 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-06-22 10:57:20,047 INFO ]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 25 [2018-06-22 10:57:20,047 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:20,047 INFO ]: Abstraction has 32 states and 39 transitions. [2018-06-22 10:57:20,047 INFO ]: Interpolant automaton has 10 states. [2018-06-22 10:57:20,047 INFO ]: Start isEmpty. Operand 32 states and 39 transitions. [2018-06-22 10:57:20,048 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 10:57:20,048 INFO ]: Found error trace [2018-06-22 10:57:20,048 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] [2018-06-22 10:57:20,048 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:20,049 INFO ]: Analyzing trace with hash 1450096812, now seen corresponding path program 1 times [2018-06-22 10:57:20,049 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:20,049 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:20,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:20,049 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:20,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:20,083 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:20,258 INFO ]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 10:57:20,258 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:20,258 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:57:20,259 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:57:20,259 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:57:20,259 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:57:20,259 INFO ]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2018-06-22 10:57:20,709 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:20,709 INFO ]: Finished difference Result 42 states and 51 transitions. [2018-06-22 10:57:20,709 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:57:20,709 INFO ]: Start accepts. Automaton has 7 states. Word has length 33 [2018-06-22 10:57:20,709 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:20,710 INFO ]: With dead ends: 42 [2018-06-22 10:57:20,710 INFO ]: Without dead ends: 42 [2018-06-22 10:57:20,710 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:57:20,710 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 10:57:20,716 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-06-22 10:57:20,716 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 10:57:20,717 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2018-06-22 10:57:20,717 INFO ]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 33 [2018-06-22 10:57:20,717 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:20,717 INFO ]: Abstraction has 38 states and 47 transitions. [2018-06-22 10:57:20,717 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:57:20,717 INFO ]: Start isEmpty. Operand 38 states and 47 transitions. [2018-06-22 10:57:20,718 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 10:57:20,718 INFO ]: Found error trace [2018-06-22 10:57:20,718 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:20,719 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:20,719 INFO ]: Analyzing trace with hash 1769699446, now seen corresponding path program 1 times [2018-06-22 10:57:20,719 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:20,719 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:20,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:20,719 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:20,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:20,729 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:20,789 INFO ]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 10:57:20,789 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:20,789 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:57:20,789 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:57:20,789 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:57:20,789 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:57:20,789 INFO ]: Start difference. First operand 38 states and 47 transitions. Second operand 6 states. [2018-06-22 10:57:20,825 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:20,825 INFO ]: Finished difference Result 44 states and 53 transitions. [2018-06-22 10:57:20,826 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:57:20,826 INFO ]: Start accepts. Automaton has 6 states. Word has length 33 [2018-06-22 10:57:20,826 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:20,827 INFO ]: With dead ends: 44 [2018-06-22 10:57:20,827 INFO ]: Without dead ends: 42 [2018-06-22 10:57:20,827 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:57:20,827 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 10:57:20,832 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-06-22 10:57:20,832 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 10:57:20,834 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2018-06-22 10:57:20,834 INFO ]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 33 [2018-06-22 10:57:20,834 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:20,834 INFO ]: Abstraction has 40 states and 49 transitions. [2018-06-22 10:57:20,834 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:57:20,834 INFO ]: Start isEmpty. Operand 40 states and 49 transitions. [2018-06-22 10:57:20,835 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 10:57:20,835 INFO ]: Found error trace [2018-06-22 10:57:20,835 INFO ]: trace histogram [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] [2018-06-22 10:57:20,835 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:20,835 INFO ]: Analyzing trace with hash 347142008, now seen corresponding path program 1 times [2018-06-22 10:57:20,835 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:20,835 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:20,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:20,836 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:20,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:20,853 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:21,208 INFO ]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:57:21,208 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:57:21,208 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:57:21,223 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:21,249 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:21,252 INFO ]: Computing forward predicates... [2018-06-22 10:57:21,520 INFO ]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 10:57:21,539 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:57:21,539 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-06-22 10:57:21,540 INFO ]: Interpolant automaton has 24 states [2018-06-22 10:57:21,540 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 10:57:21,540 INFO ]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:57:21,540 INFO ]: Start difference. First operand 40 states and 49 transitions. Second operand 24 states. [2018-06-22 10:57:22,331 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:22,331 INFO ]: Finished difference Result 66 states and 78 transitions. [2018-06-22 10:57:22,332 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 10:57:22,332 INFO ]: Start accepts. Automaton has 24 states. Word has length 37 [2018-06-22 10:57:22,332 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:22,333 INFO ]: With dead ends: 66 [2018-06-22 10:57:22,333 INFO ]: Without dead ends: 66 [2018-06-22 10:57:22,334 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=1265, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 10:57:22,334 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 10:57:22,344 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-06-22 10:57:22,344 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 10:57:22,345 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-06-22 10:57:22,345 INFO ]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 37 [2018-06-22 10:57:22,345 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:22,345 INFO ]: Abstraction has 60 states and 72 transitions. [2018-06-22 10:57:22,345 INFO ]: Interpolant automaton has 24 states. [2018-06-22 10:57:22,345 INFO ]: Start isEmpty. Operand 60 states and 72 transitions. [2018-06-22 10:57:22,347 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 10:57:22,347 INFO ]: Found error trace [2018-06-22 10:57:22,347 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-22 10:57:22,347 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:22,347 INFO ]: Analyzing trace with hash -1221189357, now seen corresponding path program 1 times [2018-06-22 10:57:22,347 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:22,347 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:22,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:22,348 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:22,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:22,359 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:22,534 INFO ]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 10:57:22,534 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:57:22,534 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:57:22,541 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:22,561 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:22,564 INFO ]: Computing forward predicates... [2018-06-22 10:57:22,716 INFO ]: Checked inductivity of 13 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 10:57:22,736 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:57:22,736 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2018-06-22 10:57:22,737 INFO ]: Interpolant automaton has 21 states [2018-06-22 10:57:22,737 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 10:57:22,737 INFO ]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-06-22 10:57:22,738 INFO ]: Start difference. First operand 60 states and 72 transitions. Second operand 21 states. [2018-06-22 10:57:23,094 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:23,094 INFO ]: Finished difference Result 64 states and 73 transitions. [2018-06-22 10:57:23,095 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 10:57:23,095 INFO ]: Start accepts. Automaton has 21 states. Word has length 37 [2018-06-22 10:57:23,095 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:23,095 INFO ]: With dead ends: 64 [2018-06-22 10:57:23,095 INFO ]: Without dead ends: 52 [2018-06-22 10:57:23,096 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2018-06-22 10:57:23,096 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 10:57:23,102 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-06-22 10:57:23,102 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 10:57:23,103 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-06-22 10:57:23,103 INFO ]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 37 [2018-06-22 10:57:23,103 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:23,103 INFO ]: Abstraction has 48 states and 57 transitions. [2018-06-22 10:57:23,103 INFO ]: Interpolant automaton has 21 states. [2018-06-22 10:57:23,103 INFO ]: Start isEmpty. Operand 48 states and 57 transitions. [2018-06-22 10:57:23,105 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 10:57:23,105 INFO ]: Found error trace [2018-06-22 10:57:23,105 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:23,105 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:23,105 INFO ]: Analyzing trace with hash 1993465967, now seen corresponding path program 2 times [2018-06-22 10:57:23,105 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:23,105 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:23,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:23,106 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:23,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:23,122 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:23,607 INFO ]: Checked inductivity of 44 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 10:57:23,607 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:57:23,607 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:57:23,612 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:57:23,656 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:57:23,656 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:23,661 INFO ]: Computing forward predicates... [2018-06-22 10:57:24,252 INFO ]: Checked inductivity of 44 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 10:57:24,271 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:57:24,271 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2018-06-22 10:57:24,272 INFO ]: Interpolant automaton has 32 states [2018-06-22 10:57:24,272 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 10:57:24,272 INFO ]: CoverageRelationStatistics Valid=69, Invalid=923, Unknown=0, NotChecked=0, Total=992 [2018-06-22 10:57:24,272 INFO ]: Start difference. First operand 48 states and 57 transitions. Second operand 32 states. [2018-06-22 10:57:25,449 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:25,449 INFO ]: Finished difference Result 80 states and 92 transitions. [2018-06-22 10:57:25,450 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 10:57:25,450 INFO ]: Start accepts. Automaton has 32 states. Word has length 53 [2018-06-22 10:57:25,450 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:25,451 INFO ]: With dead ends: 80 [2018-06-22 10:57:25,451 INFO ]: Without dead ends: 80 [2018-06-22 10:57:25,452 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=227, Invalid=2323, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 10:57:25,452 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-22 10:57:25,464 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-06-22 10:57:25,464 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 10:57:25,465 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2018-06-22 10:57:25,465 INFO ]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 53 [2018-06-22 10:57:25,465 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:25,465 INFO ]: Abstraction has 74 states and 86 transitions. [2018-06-22 10:57:25,465 INFO ]: Interpolant automaton has 32 states. [2018-06-22 10:57:25,465 INFO ]: Start isEmpty. Operand 74 states and 86 transitions. [2018-06-22 10:57:25,467 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 10:57:25,467 INFO ]: Found error trace [2018-06-22 10:57:25,467 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:25,467 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:25,468 INFO ]: Analyzing trace with hash 1383968778, now seen corresponding path program 2 times [2018-06-22 10:57:25,468 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:25,468 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:25,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:25,468 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:57:25,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:25,483 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:25,744 INFO ]: Checked inductivity of 42 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:57:25,744 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:57:25,744 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:57:25,752 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:57:25,789 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:57:25,789 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:25,794 INFO ]: Computing forward predicates... [2018-06-22 10:57:26,241 INFO ]: Checked inductivity of 42 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 10:57:26,266 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:57:26,266 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 30 [2018-06-22 10:57:26,266 INFO ]: Interpolant automaton has 30 states [2018-06-22 10:57:26,266 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 10:57:26,267 INFO ]: CoverageRelationStatistics Valid=78, Invalid=792, Unknown=0, NotChecked=0, Total=870 [2018-06-22 10:57:26,267 INFO ]: Start difference. First operand 74 states and 86 transitions. Second operand 30 states. [2018-06-22 10:57:26,808 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:26,808 INFO ]: Finished difference Result 78 states and 87 transitions. [2018-06-22 10:57:26,810 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 10:57:26,810 INFO ]: Start accepts. Automaton has 30 states. Word has length 53 [2018-06-22 10:57:26,810 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:26,811 INFO ]: With dead ends: 78 [2018-06-22 10:57:26,811 INFO ]: Without dead ends: 60 [2018-06-22 10:57:26,811 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=175, Invalid=1805, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 10:57:26,812 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 10:57:26,825 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-06-22 10:57:26,825 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 10:57:26,826 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-06-22 10:57:26,826 INFO ]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 53 [2018-06-22 10:57:26,826 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:26,826 INFO ]: Abstraction has 56 states and 65 transitions. [2018-06-22 10:57:26,826 INFO ]: Interpolant automaton has 30 states. [2018-06-22 10:57:26,826 INFO ]: Start isEmpty. Operand 56 states and 65 transitions. [2018-06-22 10:57:26,828 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 10:57:26,828 INFO ]: Found error trace [2018-06-22 10:57:26,828 INFO ]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:26,828 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:26,828 INFO ]: Analyzing trace with hash -808840794, now seen corresponding path program 3 times [2018-06-22 10:57:26,828 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:26,828 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:26,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:26,829 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:57:26,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:26,858 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:27,123 WARN ]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-06-22 10:57:27,507 INFO ]: Checked inductivity of 90 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-22 10:57:27,507 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:57:27,507 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:57:27,513 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:57:27,546 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 10:57:27,547 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:27,551 INFO ]: Computing forward predicates... [2018-06-22 10:57:28,114 INFO ]: Checked inductivity of 90 backedges. 36 proven. 15 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 10:57:28,133 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:57:28,133 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 40 [2018-06-22 10:57:28,134 INFO ]: Interpolant automaton has 40 states [2018-06-22 10:57:28,134 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 10:57:28,134 INFO ]: CoverageRelationStatistics Valid=95, Invalid=1465, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 10:57:28,134 INFO ]: Start difference. First operand 56 states and 65 transitions. Second operand 40 states. [2018-06-22 10:57:30,115 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:30,115 INFO ]: Finished difference Result 94 states and 106 transitions. [2018-06-22 10:57:30,119 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 10:57:30,119 INFO ]: Start accepts. Automaton has 40 states. Word has length 69 [2018-06-22 10:57:30,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:30,119 INFO ]: With dead ends: 94 [2018-06-22 10:57:30,119 INFO ]: Without dead ends: 94 [2018-06-22 10:57:30,120 INFO ]: 0 DeclaredPredicates, 119 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=337, Invalid=3695, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 10:57:30,120 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 10:57:30,127 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 88. [2018-06-22 10:57:30,127 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-22 10:57:30,128 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2018-06-22 10:57:30,128 INFO ]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 69 [2018-06-22 10:57:30,128 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:30,128 INFO ]: Abstraction has 88 states and 100 transitions. [2018-06-22 10:57:30,128 INFO ]: Interpolant automaton has 40 states. [2018-06-22 10:57:30,128 INFO ]: Start isEmpty. Operand 88 states and 100 transitions. [2018-06-22 10:57:30,130 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 10:57:30,130 INFO ]: Found error trace [2018-06-22 10:57:30,130 INFO ]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:30,130 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:30,130 INFO ]: Analyzing trace with hash -24082623, now seen corresponding path program 3 times [2018-06-22 10:57:30,130 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:30,130 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:30,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:30,131 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:57:30,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:30,162 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:30,471 INFO ]: Checked inductivity of 87 backedges. 36 proven. 19 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 10:57:30,471 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:57:30,471 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-22 10:57:30,484 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:57:30,534 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 10:57:30,534 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:30,539 INFO ]: Computing forward predicates... [2018-06-22 10:57:30,911 INFO ]: Checked inductivity of 87 backedges. 8 proven. 31 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-22 10:57:30,930 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:57:30,930 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16] total 37 [2018-06-22 10:57:30,931 INFO ]: Interpolant automaton has 37 states [2018-06-22 10:57:30,931 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 10:57:30,931 INFO ]: CoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 10:57:30,931 INFO ]: Start difference. First operand 88 states and 100 transitions. Second operand 37 states. [2018-06-22 10:57:31,896 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:31,896 INFO ]: Finished difference Result 92 states and 101 transitions. [2018-06-22 10:57:31,897 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 10:57:31,897 INFO ]: Start accepts. Automaton has 37 states. Word has length 69 [2018-06-22 10:57:31,897 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:31,898 INFO ]: With dead ends: 92 [2018-06-22 10:57:31,898 INFO ]: Without dead ends: 68 [2018-06-22 10:57:31,898 INFO ]: 0 DeclaredPredicates, 115 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=248, Invalid=3058, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 10:57:31,898 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 10:57:31,902 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 64. [2018-06-22 10:57:31,902 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 10:57:31,903 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-06-22 10:57:31,903 INFO ]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 69 [2018-06-22 10:57:31,903 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:31,903 INFO ]: Abstraction has 64 states and 73 transitions. [2018-06-22 10:57:31,903 INFO ]: Interpolant automaton has 37 states. [2018-06-22 10:57:31,903 INFO ]: Start isEmpty. Operand 64 states and 73 transitions. [2018-06-22 10:57:31,904 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 10:57:31,904 INFO ]: Found error trace [2018-06-22 10:57:31,904 INFO ]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:31,904 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:31,904 INFO ]: Analyzing trace with hash -195855587, now seen corresponding path program 4 times [2018-06-22 10:57:31,904 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:31,904 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:31,905 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:31,905 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:57:31,905 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:31,924 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:32,477 INFO ]: Checked inductivity of 152 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-06-22 10:57:32,477 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:57:32,477 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-22 10:57:32,483 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:57:32,524 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:57:32,524 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:32,530 INFO ]: Computing forward predicates... [2018-06-22 10:57:33,266 INFO ]: Checked inductivity of 152 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-22 10:57:33,285 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:57:33,285 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 48 [2018-06-22 10:57:33,286 INFO ]: Interpolant automaton has 48 states [2018-06-22 10:57:33,286 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-22 10:57:33,287 INFO ]: CoverageRelationStatistics Valid=125, Invalid=2131, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 10:57:33,287 INFO ]: Start difference. First operand 64 states and 73 transitions. Second operand 48 states. [2018-06-22 10:57:35,341 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:35,341 INFO ]: Finished difference Result 108 states and 120 transitions. [2018-06-22 10:57:35,342 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 10:57:35,342 INFO ]: Start accepts. Automaton has 48 states. Word has length 85 [2018-06-22 10:57:35,342 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:35,342 INFO ]: With dead ends: 108 [2018-06-22 10:57:35,342 INFO ]: Without dead ends: 108 [2018-06-22 10:57:35,344 INFO ]: 0 DeclaredPredicates, 146 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=471, Invalid=5381, Unknown=0, NotChecked=0, Total=5852 [2018-06-22 10:57:35,344 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 10:57:35,353 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 102. [2018-06-22 10:57:35,353 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-22 10:57:35,359 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2018-06-22 10:57:35,360 INFO ]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 85 [2018-06-22 10:57:35,360 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:35,360 INFO ]: Abstraction has 102 states and 114 transitions. [2018-06-22 10:57:35,360 INFO ]: Interpolant automaton has 48 states. [2018-06-22 10:57:35,360 INFO ]: Start isEmpty. Operand 102 states and 114 transitions. [2018-06-22 10:57:35,361 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 10:57:35,361 INFO ]: Found error trace [2018-06-22 10:57:35,362 INFO ]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:35,362 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:35,362 INFO ]: Analyzing trace with hash 673748664, now seen corresponding path program 4 times [2018-06-22 10:57:35,362 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:35,362 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:35,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:35,362 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:57:35,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:35,384 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:36,524 INFO ]: Checked inductivity of 148 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-06-22 10:57:36,524 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:57:36,547 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-22 10:57:36,553 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:57:36,591 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:57:36,591 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:36,595 INFO ]: Computing forward predicates... [2018-06-22 10:57:37,127 INFO ]: Checked inductivity of 148 backedges. 10 proven. 54 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-06-22 10:57:37,146 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:57:37,147 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19] total 44 [2018-06-22 10:57:37,147 INFO ]: Interpolant automaton has 44 states [2018-06-22 10:57:37,147 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 10:57:37,148 INFO ]: CoverageRelationStatistics Valid=134, Invalid=1758, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 10:57:37,148 INFO ]: Start difference. First operand 102 states and 114 transitions. Second operand 44 states. [2018-06-22 10:57:38,260 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:38,260 INFO ]: Finished difference Result 106 states and 115 transitions. [2018-06-22 10:57:38,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 10:57:38,261 INFO ]: Start accepts. Automaton has 44 states. Word has length 85 [2018-06-22 10:57:38,262 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:38,262 INFO ]: With dead ends: 106 [2018-06-22 10:57:38,262 INFO ]: Without dead ends: 76 [2018-06-22 10:57:38,263 INFO ]: 0 DeclaredPredicates, 143 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=330, Invalid=4640, Unknown=0, NotChecked=0, Total=4970 [2018-06-22 10:57:38,264 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-22 10:57:38,269 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-06-22 10:57:38,269 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 10:57:38,270 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-06-22 10:57:38,270 INFO ]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 85 [2018-06-22 10:57:38,270 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:38,270 INFO ]: Abstraction has 72 states and 81 transitions. [2018-06-22 10:57:38,270 INFO ]: Interpolant automaton has 44 states. [2018-06-22 10:57:38,270 INFO ]: Start isEmpty. Operand 72 states and 81 transitions. [2018-06-22 10:57:38,271 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 10:57:38,271 INFO ]: Found error trace [2018-06-22 10:57:38,271 INFO ]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:38,271 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:38,271 INFO ]: Analyzing trace with hash 1863060692, now seen corresponding path program 5 times [2018-06-22 10:57:38,271 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:38,271 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:38,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:38,272 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:57:38,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:38,296 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:38,539 WARN ]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-06-22 10:57:39,238 INFO ]: Checked inductivity of 230 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-06-22 10:57:39,239 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:57:39,239 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:57:39,246 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:57:39,299 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 10:57:39,299 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:39,305 INFO ]: Computing forward predicates... [2018-06-22 10:57:40,272 INFO ]: Checked inductivity of 230 backedges. 90 proven. 35 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-06-22 10:57:40,293 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:57:40,293 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 56 [2018-06-22 10:57:40,294 INFO ]: Interpolant automaton has 56 states [2018-06-22 10:57:40,294 INFO ]: Constructing interpolant automaton starting with 56 interpolants. [2018-06-22 10:57:40,294 INFO ]: CoverageRelationStatistics Valid=159, Invalid=2921, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 10:57:40,294 INFO ]: Start difference. First operand 72 states and 81 transitions. Second operand 56 states. [2018-06-22 10:57:42,641 WARN ]: Spent 213.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 51 [2018-06-22 10:57:43,464 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:43,464 INFO ]: Finished difference Result 122 states and 134 transitions. [2018-06-22 10:57:43,466 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-22 10:57:43,466 INFO ]: Start accepts. Automaton has 56 states. Word has length 101 [2018-06-22 10:57:43,466 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:43,467 INFO ]: With dead ends: 122 [2018-06-22 10:57:43,467 INFO ]: Without dead ends: 122 [2018-06-22 10:57:43,468 INFO ]: 0 DeclaredPredicates, 173 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=629, Invalid=7381, Unknown=0, NotChecked=0, Total=8010 [2018-06-22 10:57:43,468 INFO ]: Start minimizeSevpa. Operand 122 states. [2018-06-22 10:57:43,475 INFO ]: Finished minimizeSevpa. Reduced states from 122 to 116. [2018-06-22 10:57:43,476 INFO ]: Start removeUnreachable. Operand 116 states. [2018-06-22 10:57:43,477 INFO ]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2018-06-22 10:57:43,477 INFO ]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 101 [2018-06-22 10:57:43,477 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:43,477 INFO ]: Abstraction has 116 states and 128 transitions. [2018-06-22 10:57:43,477 INFO ]: Interpolant automaton has 56 states. [2018-06-22 10:57:43,477 INFO ]: Start isEmpty. Operand 116 states and 128 transitions. [2018-06-22 10:57:43,479 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 10:57:43,479 INFO ]: Found error trace [2018-06-22 10:57:43,479 INFO ]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:43,481 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:43,481 INFO ]: Analyzing trace with hash -236728721, now seen corresponding path program 5 times [2018-06-22 10:57:43,481 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:43,481 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:43,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:43,482 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:57:43,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:43,499 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:44,302 INFO ]: Checked inductivity of 225 backedges. 90 proven. 43 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-06-22 10:57:44,302 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:57:44,302 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:57:44,308 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:57:44,359 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 10:57:44,359 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:44,364 INFO ]: Computing forward predicates... [2018-06-22 10:57:44,902 INFO ]: Checked inductivity of 225 backedges. 12 proven. 83 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-06-22 10:57:44,921 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:57:44,922 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 22] total 51 [2018-06-22 10:57:44,922 INFO ]: Interpolant automaton has 51 states [2018-06-22 10:57:44,922 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-22 10:57:44,923 INFO ]: CoverageRelationStatistics Valid=168, Invalid=2382, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 10:57:44,923 INFO ]: Start difference. First operand 116 states and 128 transitions. Second operand 51 states. [2018-06-22 10:57:46,217 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:46,217 INFO ]: Finished difference Result 120 states and 129 transitions. [2018-06-22 10:57:46,217 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-22 10:57:46,217 INFO ]: Start accepts. Automaton has 51 states. Word has length 101 [2018-06-22 10:57:46,217 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:46,218 INFO ]: With dead ends: 120 [2018-06-22 10:57:46,218 INFO ]: Without dead ends: 84 [2018-06-22 10:57:46,220 INFO ]: 0 DeclaredPredicates, 171 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1784 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=421, Invalid=6551, Unknown=0, NotChecked=0, Total=6972 [2018-06-22 10:57:46,220 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-22 10:57:46,225 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 80. [2018-06-22 10:57:46,225 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 10:57:46,226 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2018-06-22 10:57:46,226 INFO ]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 101 [2018-06-22 10:57:46,227 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:46,227 INFO ]: Abstraction has 80 states and 89 transitions. [2018-06-22 10:57:46,227 INFO ]: Interpolant automaton has 51 states. [2018-06-22 10:57:46,227 INFO ]: Start isEmpty. Operand 80 states and 89 transitions. [2018-06-22 10:57:46,228 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 10:57:46,228 INFO ]: Found error trace [2018-06-22 10:57:46,228 INFO ]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:46,228 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:46,228 INFO ]: Analyzing trace with hash 125155019, now seen corresponding path program 6 times [2018-06-22 10:57:46,228 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:46,228 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:46,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:46,229 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:57:46,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:46,256 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:47,066 INFO ]: Checked inductivity of 324 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-06-22 10:57:47,066 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:57:47,066 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:57:47,072 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 10:57:47,134 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 10:57:47,134 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:47,141 INFO ]: Computing forward predicates... [2018-06-22 10:57:48,447 INFO ]: Checked inductivity of 324 backedges. 126 proven. 48 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-06-22 10:57:48,467 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:57:48,467 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32] total 64 [2018-06-22 10:57:48,467 INFO ]: Interpolant automaton has 64 states [2018-06-22 10:57:48,468 INFO ]: Constructing interpolant automaton starting with 64 interpolants. [2018-06-22 10:57:48,468 INFO ]: CoverageRelationStatistics Valid=197, Invalid=3835, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 10:57:48,468 INFO ]: Start difference. First operand 80 states and 89 transitions. Second operand 64 states. [2018-06-22 10:57:51,743 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:51,744 INFO ]: Finished difference Result 136 states and 148 transitions. [2018-06-22 10:57:51,744 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-06-22 10:57:51,744 INFO ]: Start accepts. Automaton has 64 states. Word has length 117 [2018-06-22 10:57:51,744 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:51,745 INFO ]: With dead ends: 136 [2018-06-22 10:57:51,745 INFO ]: Without dead ends: 136 [2018-06-22 10:57:51,746 INFO ]: 0 DeclaredPredicates, 200 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1436 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=811, Invalid=9695, Unknown=0, NotChecked=0, Total=10506 [2018-06-22 10:57:51,746 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-22 10:57:51,754 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 130. [2018-06-22 10:57:51,754 INFO ]: Start removeUnreachable. Operand 130 states. [2018-06-22 10:57:51,755 INFO ]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2018-06-22 10:57:51,755 INFO ]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 117 [2018-06-22 10:57:51,756 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:51,756 INFO ]: Abstraction has 130 states and 142 transitions. [2018-06-22 10:57:51,756 INFO ]: Interpolant automaton has 64 states. [2018-06-22 10:57:51,756 INFO ]: Start isEmpty. Operand 130 states and 142 transitions. [2018-06-22 10:57:51,757 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 10:57:51,757 INFO ]: Found error trace [2018-06-22 10:57:51,757 INFO ]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:51,757 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:51,758 INFO ]: Analyzing trace with hash -1153163674, now seen corresponding path program 6 times [2018-06-22 10:57:51,758 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:51,758 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:51,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:51,758 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:57:51,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:51,788 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:52,343 INFO ]: Checked inductivity of 318 backedges. 126 proven. 58 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-06-22 10:57:52,343 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:57:52,343 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:57:52,349 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 10:57:52,405 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 10:57:52,405 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:52,411 INFO ]: Computing forward predicates... [2018-06-22 10:57:53,064 INFO ]: Checked inductivity of 318 backedges. 14 proven. 118 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-06-22 10:57:53,084 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:57:53,084 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 25] total 58 [2018-06-22 10:57:53,084 INFO ]: Interpolant automaton has 58 states [2018-06-22 10:57:53,084 INFO ]: Constructing interpolant automaton starting with 58 interpolants. [2018-06-22 10:57:53,085 INFO ]: CoverageRelationStatistics Valid=206, Invalid=3100, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 10:57:53,085 INFO ]: Start difference. First operand 130 states and 142 transitions. Second operand 58 states. [2018-06-22 10:57:54,589 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:54,589 INFO ]: Finished difference Result 134 states and 143 transitions. [2018-06-22 10:57:54,590 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-22 10:57:54,590 INFO ]: Start accepts. Automaton has 58 states. Word has length 117 [2018-06-22 10:57:54,590 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:54,590 INFO ]: With dead ends: 134 [2018-06-22 10:57:54,590 INFO ]: Without dead ends: 92 [2018-06-22 10:57:54,591 INFO ]: 0 DeclaredPredicates, 199 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2447 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=521, Invalid=8791, Unknown=0, NotChecked=0, Total=9312 [2018-06-22 10:57:54,591 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-22 10:57:54,595 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-06-22 10:57:54,595 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-22 10:57:54,596 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-06-22 10:57:54,596 INFO ]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 117 [2018-06-22 10:57:54,596 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:54,596 INFO ]: Abstraction has 88 states and 97 transitions. [2018-06-22 10:57:54,596 INFO ]: Interpolant automaton has 58 states. [2018-06-22 10:57:54,596 INFO ]: Start isEmpty. Operand 88 states and 97 transitions. [2018-06-22 10:57:54,598 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:57:54,598 INFO ]: Found error trace [2018-06-22 10:57:54,598 INFO ]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:54,598 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:54,598 INFO ]: Analyzing trace with hash -1997117182, now seen corresponding path program 7 times [2018-06-22 10:57:54,598 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:54,598 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:54,599 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:54,599 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:57:54,599 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:54,627 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:54,936 WARN ]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-06-22 10:57:55,752 INFO ]: Checked inductivity of 434 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-06-22 10:57:55,752 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:57:55,752 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:57:55,759 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:55,817 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:55,823 INFO ]: Computing forward predicates... [2018-06-22 10:57:58,478 INFO ]: Checked inductivity of 434 backedges. 168 proven. 63 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-06-22 10:57:58,498 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:57:58,498 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 72 [2018-06-22 10:57:58,498 INFO ]: Interpolant automaton has 72 states [2018-06-22 10:57:58,499 INFO ]: Constructing interpolant automaton starting with 72 interpolants. [2018-06-22 10:57:58,499 INFO ]: CoverageRelationStatistics Valid=239, Invalid=4873, Unknown=0, NotChecked=0, Total=5112 [2018-06-22 10:57:58,499 INFO ]: Start difference. First operand 88 states and 97 transitions. Second operand 72 states. [2018-06-22 10:58:03,153 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:03,153 INFO ]: Finished difference Result 150 states and 162 transitions. [2018-06-22 10:58:03,155 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-06-22 10:58:03,155 INFO ]: Start accepts. Automaton has 72 states. Word has length 133 [2018-06-22 10:58:03,156 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:03,156 INFO ]: With dead ends: 150 [2018-06-22 10:58:03,156 INFO ]: Without dead ends: 150 [2018-06-22 10:58:03,158 INFO ]: 0 DeclaredPredicates, 227 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1890 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1017, Invalid=12323, Unknown=0, NotChecked=0, Total=13340 [2018-06-22 10:58:03,158 INFO ]: Start minimizeSevpa. Operand 150 states. [2018-06-22 10:58:03,169 INFO ]: Finished minimizeSevpa. Reduced states from 150 to 144. [2018-06-22 10:58:03,169 INFO ]: Start removeUnreachable. Operand 144 states. [2018-06-22 10:58:03,170 INFO ]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2018-06-22 10:58:03,170 INFO ]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 133 [2018-06-22 10:58:03,171 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:03,171 INFO ]: Abstraction has 144 states and 156 transitions. [2018-06-22 10:58:03,171 INFO ]: Interpolant automaton has 72 states. [2018-06-22 10:58:03,171 INFO ]: Start isEmpty. Operand 144 states and 156 transitions. [2018-06-22 10:58:03,172 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:58:03,172 INFO ]: Found error trace [2018-06-22 10:58:03,172 INFO ]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:03,172 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:03,172 INFO ]: Analyzing trace with hash -407931235, now seen corresponding path program 7 times [2018-06-22 10:58:03,172 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:03,172 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:03,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:03,173 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:03,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:03,205 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:03,941 INFO ]: Checked inductivity of 427 backedges. 168 proven. 75 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-06-22 10:58:03,941 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:03,941 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:03,947 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:04,008 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:04,014 INFO ]: Computing forward predicates... [2018-06-22 10:58:04,979 INFO ]: Checked inductivity of 427 backedges. 16 proven. 159 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-06-22 10:58:04,999 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:04,999 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 28] total 65 [2018-06-22 10:58:04,999 INFO ]: Interpolant automaton has 65 states [2018-06-22 10:58:04,999 INFO ]: Constructing interpolant automaton starting with 65 interpolants. [2018-06-22 10:58:04,999 INFO ]: CoverageRelationStatistics Valid=248, Invalid=3912, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 10:58:04,999 INFO ]: Start difference. First operand 144 states and 156 transitions. Second operand 65 states. [2018-06-22 10:58:06,717 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:06,718 INFO ]: Finished difference Result 148 states and 157 transitions. [2018-06-22 10:58:06,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-22 10:58:06,718 INFO ]: Start accepts. Automaton has 65 states. Word has length 133 [2018-06-22 10:58:06,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:06,718 INFO ]: With dead ends: 148 [2018-06-22 10:58:06,718 INFO ]: Without dead ends: 100 [2018-06-22 10:58:06,720 INFO ]: 0 DeclaredPredicates, 227 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3215 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=630, Invalid=11360, Unknown=0, NotChecked=0, Total=11990 [2018-06-22 10:58:06,720 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-22 10:58:06,724 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 96. [2018-06-22 10:58:06,724 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-22 10:58:06,725 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-06-22 10:58:06,725 INFO ]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 133 [2018-06-22 10:58:06,725 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:06,725 INFO ]: Abstraction has 96 states and 105 transitions. [2018-06-22 10:58:06,725 INFO ]: Interpolant automaton has 65 states. [2018-06-22 10:58:06,725 INFO ]: Start isEmpty. Operand 96 states and 105 transitions. [2018-06-22 10:58:06,726 INFO ]: Finished isEmpty. Found accepting run of length 150 [2018-06-22 10:58:06,726 INFO ]: Found error trace [2018-06-22 10:58:06,726 INFO ]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:06,726 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:06,727 INFO ]: Analyzing trace with hash -908586119, now seen corresponding path program 8 times [2018-06-22 10:58:06,727 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:06,727 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:06,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:06,727 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:06,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:06,762 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:07,046 WARN ]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-06-22 10:58:08,390 INFO ]: Checked inductivity of 560 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-06-22 10:58:08,390 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:08,390 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:08,409 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:58:08,512 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:58:08,512 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:08,522 INFO ]: Computing forward predicates... [2018-06-22 10:58:10,477 INFO ]: Checked inductivity of 560 backedges. 216 proven. 80 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-06-22 10:58:10,507 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:10,508 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 40] total 80 [2018-06-22 10:58:10,508 INFO ]: Interpolant automaton has 80 states [2018-06-22 10:58:10,508 INFO ]: Constructing interpolant automaton starting with 80 interpolants. [2018-06-22 10:58:10,508 INFO ]: CoverageRelationStatistics Valid=285, Invalid=6035, Unknown=0, NotChecked=0, Total=6320 [2018-06-22 10:58:10,508 INFO ]: Start difference. First operand 96 states and 105 transitions. Second operand 80 states. [2018-06-22 10:58:16,007 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:16,007 INFO ]: Finished difference Result 164 states and 176 transitions. [2018-06-22 10:58:16,007 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-06-22 10:58:16,007 INFO ]: Start accepts. Automaton has 80 states. Word has length 149 [2018-06-22 10:58:16,008 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:16,008 INFO ]: With dead ends: 164 [2018-06-22 10:58:16,008 INFO ]: Without dead ends: 164 [2018-06-22 10:58:16,009 INFO ]: 0 DeclaredPredicates, 254 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2406 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1247, Invalid=15265, Unknown=0, NotChecked=0, Total=16512 [2018-06-22 10:58:16,009 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-22 10:58:16,015 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 158. [2018-06-22 10:58:16,015 INFO ]: Start removeUnreachable. Operand 158 states. [2018-06-22 10:58:16,016 INFO ]: Finished removeUnreachable. Reduced from 158 states to 158 states and 170 transitions. [2018-06-22 10:58:16,016 INFO ]: Start accepts. Automaton has 158 states and 170 transitions. Word has length 149 [2018-06-22 10:58:16,016 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:16,016 INFO ]: Abstraction has 158 states and 170 transitions. [2018-06-22 10:58:16,016 INFO ]: Interpolant automaton has 80 states. [2018-06-22 10:58:16,016 INFO ]: Start isEmpty. Operand 158 states and 170 transitions. [2018-06-22 10:58:16,017 INFO ]: Finished isEmpty. Found accepting run of length 150 [2018-06-22 10:58:16,017 INFO ]: Found error trace [2018-06-22 10:58:16,018 INFO ]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:16,018 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:16,018 INFO ]: Analyzing trace with hash -445659372, now seen corresponding path program 8 times [2018-06-22 10:58:16,018 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:16,018 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:16,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:16,019 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:16,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:16,048 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:17,632 INFO ]: Checked inductivity of 552 backedges. 216 proven. 94 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-06-22 10:58:17,632 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:17,632 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:17,637 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:58:17,711 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:58:17,711 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:17,724 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-22 10:58:19,124 INFO ]: Timeout while computing interpolants [2018-06-22 10:58:19,325 WARN ]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:19,325 WARN ]: Verification canceled [2018-06-22 10:58:19,328 WARN ]: Timeout [2018-06-22 10:58:19,329 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:58:19 BoogieIcfgContainer [2018-06-22 10:58:19,329 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:58:19,329 INFO ]: Toolchain (without parser) took 63313.47 ms. Allocated memory was 305.7 MB in the beginning and 846.7 MB in the end (delta: 541.1 MB). Free memory was 260.1 MB in the beginning and 663.2 MB in the end (delta: -403.1 MB). Peak memory consumption was 137.9 MB. Max. memory is 3.6 GB. [2018-06-22 10:58:19,330 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 305.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:58:19,330 INFO ]: ChcToBoogie took 52.56 ms. Allocated memory is still 305.7 MB. Free memory was 260.1 MB in the beginning and 258.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:58:19,331 INFO ]: Boogie Preprocessor took 42.41 ms. Allocated memory is still 305.7 MB. Free memory was 258.1 MB in the beginning and 257.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 10:58:19,333 INFO ]: RCFGBuilder took 480.62 ms. Allocated memory is still 305.7 MB. Free memory was 257.1 MB in the beginning and 247.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 3.6 GB. [2018-06-22 10:58:19,333 INFO ]: TraceAbstraction took 62728.91 ms. Allocated memory was 305.7 MB in the beginning and 846.7 MB in the end (delta: 541.1 MB). Free memory was 247.0 MB in the beginning and 663.2 MB in the end (delta: -416.2 MB). Peak memory consumption was 124.9 MB. Max. memory is 3.6 GB. [2018-06-22 10:58:19,335 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 305.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 52.56 ms. Allocated memory is still 305.7 MB. Free memory was 260.1 MB in the beginning and 258.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 42.41 ms. Allocated memory is still 305.7 MB. Free memory was 258.1 MB in the beginning and 257.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 480.62 ms. Allocated memory is still 305.7 MB. Free memory was 257.1 MB in the beginning and 247.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 62728.91 ms. Allocated memory was 305.7 MB in the beginning and 846.7 MB in the end (delta: 541.1 MB). Free memory was 247.0 MB in the beginning and 663.2 MB in the end (delta: -416.2 MB). Peak memory consumption was 124.9 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 analyzing trace of length 150 with TraceHistMax 9, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 62 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. TIMEOUT Result, 62.6s OverallTime, 25 OverallIterations, 9 TraceHistogramMax, 32.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 847 SDtfs, 936 SDslu, 18855 SDs, 0 SdLazy, 12875 SolverSat, 1066 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2382 GetRequests, 1182 SyntacticMatches, 12 SemanticMatches, 1188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18285 ImplicationChecksByTransitivity, 43.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 106 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 24.6s InterpolantComputationTime, 2908 NumberOfCodeBlocks, 2908 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 2868 ConstructedInterpolants, 0 QuantifiedInterpolants, 1831584 SizeOfPredicates, 183 NumberOfNonLiveVariables, 6499 ConjunctsInSsa, 686 ConjunctsInUnsatCore, 40 InterpolantComputations, 8 PerfectInterpolantSequences, 4426/6246 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/barthe2-big2_merged_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-58-19-346.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe2-big2_merged_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-58-19-346.csv Completed graceful shutdown