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/HOLA/32.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:53:13,715 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:53:13,716 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:53:13,726 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:53:13,727 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:53:13,727 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:53:13,728 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:53:13,733 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:53:13,735 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:53:13,736 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:53:13,736 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:53:13,737 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:53:13,738 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:53:13,739 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:53:13,740 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:53:13,740 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:53:13,742 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:53:13,744 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:53:13,745 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:53:13,746 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:53:13,748 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:53:13,750 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:53:13,750 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:53:13,750 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:53:13,751 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:53:13,752 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:53:13,753 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:53:13,754 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:53:13,755 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:53:13,755 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:53:13,756 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:53:13,756 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:53:13,757 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:53:13,758 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:53:13,758 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:53:13,759 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:53:13,776 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:53:13,776 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:53:13,776 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:53:13,777 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:53:13,777 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:53:13,781 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:53:13,782 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:53:13,782 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:53:13,782 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:53:13,782 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:53:13,783 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:53:13,783 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:53:13,783 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:53:13,783 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:53:13,783 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:53:13,783 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:53:13,784 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:53:13,784 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:53:13,784 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:53:13,785 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:53:13,786 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:53:13,840 INFO ]: Repository-Root is: /tmp [2018-06-22 10:53:13,854 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:53:13,857 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:53:13,858 INFO ]: Initializing SmtParser... [2018-06-22 10:53:13,859 INFO ]: SmtParser initialized [2018-06-22 10:53:13,859 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/32.c.smt2 [2018-06-22 10:53:13,860 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:53:13,949 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/32.c.smt2 unknown [2018-06-22 10:53:14,375 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/32.c.smt2 [2018-06-22 10:53:14,380 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:53:14,385 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:53:14,385 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:53:14,385 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:53:14,385 INFO ]: ChcToBoogie initialized [2018-06-22 10:53:14,388 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:53:14" (1/1) ... [2018-06-22 10:53:14,435 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:53:14 Unit [2018-06-22 10:53:14,435 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:53:14,436 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:53:14,436 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:53:14,436 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:53:14,478 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:53:14" (1/1) ... [2018-06-22 10:53:14,479 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:53:14" (1/1) ... [2018-06-22 10:53:14,494 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:53:14" (1/1) ... [2018-06-22 10:53:14,494 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:53:14" (1/1) ... [2018-06-22 10:53:14,501 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:53:14" (1/1) ... [2018-06-22 10:53:14,514 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:53:14" (1/1) ... [2018-06-22 10:53:14,515 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:53:14" (1/1) ... [2018-06-22 10:53:14,518 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:53:14,518 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:53:14,518 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:53:14,518 INFO ]: RCFGBuilder initialized [2018-06-22 10:53:14,519 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:53:14" (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:53:14,535 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:53:14,535 INFO ]: Found specification of procedure False [2018-06-22 10:53:14,535 INFO ]: Found implementation of procedure False [2018-06-22 10:53:14,536 INFO ]: Specification and implementation of procedure h19 given in one single declaration [2018-06-22 10:53:14,536 INFO ]: Found specification of procedure h19 [2018-06-22 10:53:14,536 INFO ]: Found implementation of procedure h19 [2018-06-22 10:53:14,536 INFO ]: Specification and implementation of procedure h18 given in one single declaration [2018-06-22 10:53:14,536 INFO ]: Found specification of procedure h18 [2018-06-22 10:53:14,536 INFO ]: Found implementation of procedure h18 [2018-06-22 10:53:14,536 INFO ]: Specification and implementation of procedure h11 given in one single declaration [2018-06-22 10:53:14,536 INFO ]: Found specification of procedure h11 [2018-06-22 10:53:14,536 INFO ]: Found implementation of procedure h11 [2018-06-22 10:53:14,536 INFO ]: Specification and implementation of procedure h10 given in one single declaration [2018-06-22 10:53:14,536 INFO ]: Found specification of procedure h10 [2018-06-22 10:53:14,536 INFO ]: Found implementation of procedure h10 [2018-06-22 10:53:14,536 INFO ]: Specification and implementation of procedure h9 given in one single declaration [2018-06-22 10:53:14,536 INFO ]: Found specification of procedure h9 [2018-06-22 10:53:14,536 INFO ]: Found implementation of procedure h9 [2018-06-22 10:53:14,536 INFO ]: Specification and implementation of procedure h6 given in one single declaration [2018-06-22 10:53:14,536 INFO ]: Found specification of procedure h6 [2018-06-22 10:53:14,536 INFO ]: Found implementation of procedure h6 [2018-06-22 10:53:14,536 INFO ]: Specification and implementation of procedure h5 given in one single declaration [2018-06-22 10:53:14,536 INFO ]: Found specification of procedure h5 [2018-06-22 10:53:14,536 INFO ]: Found implementation of procedure h5 [2018-06-22 10:53:14,536 INFO ]: Specification and implementation of procedure h17 given in one single declaration [2018-06-22 10:53:14,536 INFO ]: Found specification of procedure h17 [2018-06-22 10:53:14,536 INFO ]: Found implementation of procedure h17 [2018-06-22 10:53:14,536 INFO ]: Specification and implementation of procedure h16 given in one single declaration [2018-06-22 10:53:14,536 INFO ]: Found specification of procedure h16 [2018-06-22 10:53:14,536 INFO ]: Found implementation of procedure h16 [2018-06-22 10:53:14,536 INFO ]: Specification and implementation of procedure h15 given in one single declaration [2018-06-22 10:53:14,537 INFO ]: Found specification of procedure h15 [2018-06-22 10:53:14,537 INFO ]: Found implementation of procedure h15 [2018-06-22 10:53:14,537 INFO ]: Specification and implementation of procedure h8 given in one single declaration [2018-06-22 10:53:14,537 INFO ]: Found specification of procedure h8 [2018-06-22 10:53:14,537 INFO ]: Found implementation of procedure h8 [2018-06-22 10:53:14,537 INFO ]: Specification and implementation of procedure h7 given in one single declaration [2018-06-22 10:53:14,537 INFO ]: Found specification of procedure h7 [2018-06-22 10:53:14,537 INFO ]: Found implementation of procedure h7 [2018-06-22 10:53:14,537 INFO ]: Specification and implementation of procedure h13 given in one single declaration [2018-06-22 10:53:14,537 INFO ]: Found specification of procedure h13 [2018-06-22 10:53:14,537 INFO ]: Found implementation of procedure h13 [2018-06-22 10:53:14,537 INFO ]: Specification and implementation of procedure h12 given in one single declaration [2018-06-22 10:53:14,537 INFO ]: Found specification of procedure h12 [2018-06-22 10:53:14,537 INFO ]: Found implementation of procedure h12 [2018-06-22 10:53:14,537 INFO ]: Specification and implementation of procedure h14 given in one single declaration [2018-06-22 10:53:14,537 INFO ]: Found specification of procedure h14 [2018-06-22 10:53:14,537 INFO ]: Found implementation of procedure h14 [2018-06-22 10:53:14,537 INFO ]: Specification and implementation of procedure h4 given in one single declaration [2018-06-22 10:53:14,537 INFO ]: Found specification of procedure h4 [2018-06-22 10:53:14,537 INFO ]: Found implementation of procedure h4 [2018-06-22 10:53:14,537 INFO ]: Specification and implementation of procedure h3 given in one single declaration [2018-06-22 10:53:14,537 INFO ]: Found specification of procedure h3 [2018-06-22 10:53:14,537 INFO ]: Found implementation of procedure h3 [2018-06-22 10:53:14,537 INFO ]: Specification and implementation of procedure h2 given in one single declaration [2018-06-22 10:53:14,537 INFO ]: Found specification of procedure h2 [2018-06-22 10:53:14,537 INFO ]: Found implementation of procedure h2 [2018-06-22 10:53:14,538 INFO ]: Specification and implementation of procedure h1 given in one single declaration [2018-06-22 10:53:14,538 INFO ]: Found specification of procedure h1 [2018-06-22 10:53:14,538 INFO ]: Found implementation of procedure h1 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:53:14,538 INFO ]: Specification and implementation of procedure h20 given in one single declaration [2018-06-22 10:53:14,547 INFO ]: Found specification of procedure h20 [2018-06-22 10:53:14,547 INFO ]: Found implementation of procedure h20 [2018-06-22 10:53:14,547 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:53:14,547 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:53:14,547 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 10:53:14,990 INFO ]: Using library mode [2018-06-22 10:53:14,991 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:53:14 BoogieIcfgContainer [2018-06-22 10:53:14,991 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:53:14,992 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:53:14,992 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:53:14,995 INFO ]: TraceAbstraction initialized [2018-06-22 10:53:14,995 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:53:14" (1/3) ... [2018-06-22 10:53:15,001 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc7e529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:53:15, skipping insertion in model container [2018-06-22 10:53:15,001 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:53:14" (2/3) ... [2018-06-22 10:53:15,002 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc7e529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:53:15, skipping insertion in model container [2018-06-22 10:53:15,002 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:53:14" (3/3) ... [2018-06-22 10:53:15,004 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:53:15,013 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:53:15,024 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:53:15,073 INFO ]: Using default assertion order modulation [2018-06-22 10:53:15,074 INFO ]: Interprodecural is true [2018-06-22 10:53:15,074 INFO ]: Hoare is false [2018-06-22 10:53:15,074 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:53:15,074 INFO ]: Backedges is TWOTRACK [2018-06-22 10:53:15,074 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:53:15,074 INFO ]: Difference is false [2018-06-22 10:53:15,074 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:53:15,074 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:53:15,101 INFO ]: Start isEmpty. Operand 96 states. [2018-06-22 10:53:15,125 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 10:53:15,125 INFO ]: Found error trace [2018-06-22 10:53:15,126 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:15,127 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:15,132 INFO ]: Analyzing trace with hash -379375782, now seen corresponding path program 1 times [2018-06-22 10:53:15,134 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:15,134 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:15,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:15,167 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:15,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:15,241 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:15,516 WARN ]: Spent 121.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 9 [2018-06-22 10:53:15,783 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:53:15,785 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:15,786 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 10:53:15,788 INFO ]: Interpolant automaton has 8 states [2018-06-22 10:53:15,798 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 10:53:15,799 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:53:15,801 INFO ]: Start difference. First operand 96 states. Second operand 8 states. [2018-06-22 10:53:16,217 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:16,217 INFO ]: Finished difference Result 98 states and 113 transitions. [2018-06-22 10:53:16,218 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:53:16,219 INFO ]: Start accepts. Automaton has 8 states. Word has length 49 [2018-06-22 10:53:16,220 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:16,233 INFO ]: With dead ends: 98 [2018-06-22 10:53:16,234 INFO ]: Without dead ends: 98 [2018-06-22 10:53:16,237 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:53:16,256 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 10:53:16,314 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-06-22 10:53:16,316 INFO ]: Start removeUnreachable. Operand 98 states. [2018-06-22 10:53:16,319 INFO ]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2018-06-22 10:53:16,320 INFO ]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 49 [2018-06-22 10:53:16,321 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:16,321 INFO ]: Abstraction has 98 states and 113 transitions. [2018-06-22 10:53:16,321 INFO ]: Interpolant automaton has 8 states. [2018-06-22 10:53:16,321 INFO ]: Start isEmpty. Operand 98 states and 113 transitions. [2018-06-22 10:53:16,326 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 10:53:16,326 INFO ]: Found error trace [2018-06-22 10:53:16,326 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:16,327 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:16,328 INFO ]: Analyzing trace with hash 1399029799, now seen corresponding path program 1 times [2018-06-22 10:53:16,328 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:16,328 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:16,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:16,329 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:16,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:16,371 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:16,498 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:53:16,498 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:16,499 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 10:53:16,501 INFO ]: Interpolant automaton has 5 states [2018-06-22 10:53:16,501 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 10:53:16,501 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:53:16,501 INFO ]: Start difference. First operand 98 states and 113 transitions. Second operand 5 states. [2018-06-22 10:53:16,675 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:16,675 INFO ]: Finished difference Result 102 states and 117 transitions. [2018-06-22 10:53:16,676 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 10:53:16,676 INFO ]: Start accepts. Automaton has 5 states. Word has length 77 [2018-06-22 10:53:16,676 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:16,678 INFO ]: With dead ends: 102 [2018-06-22 10:53:16,678 INFO ]: Without dead ends: 102 [2018-06-22 10:53:16,679 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:53:16,679 INFO ]: Start minimizeSevpa. Operand 102 states. [2018-06-22 10:53:16,692 INFO ]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-06-22 10:53:16,692 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-22 10:53:16,694 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2018-06-22 10:53:16,694 INFO ]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 77 [2018-06-22 10:53:16,695 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:16,695 INFO ]: Abstraction has 100 states and 115 transitions. [2018-06-22 10:53:16,696 INFO ]: Interpolant automaton has 5 states. [2018-06-22 10:53:16,696 INFO ]: Start isEmpty. Operand 100 states and 115 transitions. [2018-06-22 10:53:16,698 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 10:53:16,698 INFO ]: Found error trace [2018-06-22 10:53:16,699 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:16,699 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:16,699 INFO ]: Analyzing trace with hash 1134578255, now seen corresponding path program 1 times [2018-06-22 10:53:16,699 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:16,699 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:16,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:16,700 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:16,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:16,736 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:16,845 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:53:16,845 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:16,845 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 10:53:16,846 INFO ]: Interpolant automaton has 5 states [2018-06-22 10:53:16,846 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 10:53:16,846 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:53:16,846 INFO ]: Start difference. First operand 100 states and 115 transitions. Second operand 5 states. [2018-06-22 10:53:16,941 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:16,941 INFO ]: Finished difference Result 102 states and 116 transitions. [2018-06-22 10:53:16,982 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 10:53:16,982 INFO ]: Start accepts. Automaton has 5 states. Word has length 77 [2018-06-22 10:53:16,983 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:16,985 INFO ]: With dead ends: 102 [2018-06-22 10:53:16,985 INFO ]: Without dead ends: 102 [2018-06-22 10:53:16,985 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:53:16,985 INFO ]: Start minimizeSevpa. Operand 102 states. [2018-06-22 10:53:16,997 INFO ]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-06-22 10:53:16,997 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-22 10:53:16,999 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2018-06-22 10:53:16,999 INFO ]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 77 [2018-06-22 10:53:16,999 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:16,999 INFO ]: Abstraction has 100 states and 114 transitions. [2018-06-22 10:53:16,999 INFO ]: Interpolant automaton has 5 states. [2018-06-22 10:53:16,999 INFO ]: Start isEmpty. Operand 100 states and 114 transitions. [2018-06-22 10:53:17,002 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 10:53:17,002 INFO ]: Found error trace [2018-06-22 10:53:17,002 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:17,002 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:17,003 INFO ]: Analyzing trace with hash 391744766, now seen corresponding path program 1 times [2018-06-22 10:53:17,003 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:17,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:17,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:17,004 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:17,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:17,055 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:17,808 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:53:17,809 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:17,809 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:53:17,824 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:17,944 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:17,964 INFO ]: Computing forward predicates... [2018-06-22 10:53:19,013 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:53:19,046 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:19,046 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-06-22 10:53:19,046 INFO ]: Interpolant automaton has 29 states [2018-06-22 10:53:19,046 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 10:53:19,047 INFO ]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2018-06-22 10:53:19,047 INFO ]: Start difference. First operand 100 states and 114 transitions. Second operand 29 states. [2018-06-22 10:53:19,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:19,886 INFO ]: Finished difference Result 116 states and 133 transitions. [2018-06-22 10:53:19,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:53:19,886 INFO ]: Start accepts. Automaton has 29 states. Word has length 77 [2018-06-22 10:53:19,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:19,888 INFO ]: With dead ends: 116 [2018-06-22 10:53:19,888 INFO ]: Without dead ends: 116 [2018-06-22 10:53:19,889 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2018-06-22 10:53:19,889 INFO ]: Start minimizeSevpa. Operand 116 states. [2018-06-22 10:53:19,900 INFO ]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-06-22 10:53:19,900 INFO ]: Start removeUnreachable. Operand 114 states. [2018-06-22 10:53:19,902 INFO ]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2018-06-22 10:53:19,902 INFO ]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 77 [2018-06-22 10:53:19,902 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:19,902 INFO ]: Abstraction has 114 states and 131 transitions. [2018-06-22 10:53:19,902 INFO ]: Interpolant automaton has 29 states. [2018-06-22 10:53:19,902 INFO ]: Start isEmpty. Operand 114 states and 131 transitions. [2018-06-22 10:53:19,905 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 10:53:19,905 INFO ]: Found error trace [2018-06-22 10:53:19,905 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:19,905 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:19,905 INFO ]: Analyzing trace with hash 1410239538, now seen corresponding path program 1 times [2018-06-22 10:53:19,905 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:19,905 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:19,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:19,906 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:19,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:19,949 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:20,197 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:53:20,198 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:20,198 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:53:20,203 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:20,288 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:20,295 INFO ]: Computing forward predicates... [2018-06-22 10:53:20,731 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:53:20,750 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:20,750 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-06-22 10:53:20,750 INFO ]: Interpolant automaton has 29 states [2018-06-22 10:53:20,751 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 10:53:20,751 INFO ]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2018-06-22 10:53:20,751 INFO ]: Start difference. First operand 114 states and 131 transitions. Second operand 29 states. [2018-06-22 10:53:21,195 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:21,195 INFO ]: Finished difference Result 126 states and 143 transitions. [2018-06-22 10:53:21,196 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:53:21,196 INFO ]: Start accepts. Automaton has 29 states. Word has length 77 [2018-06-22 10:53:21,196 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:21,198 INFO ]: With dead ends: 126 [2018-06-22 10:53:21,198 INFO ]: Without dead ends: 126 [2018-06-22 10:53:21,198 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2018-06-22 10:53:21,199 INFO ]: Start minimizeSevpa. Operand 126 states. [2018-06-22 10:53:21,213 INFO ]: Finished minimizeSevpa. Reduced states from 126 to 118. [2018-06-22 10:53:21,213 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-22 10:53:21,215 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 135 transitions. [2018-06-22 10:53:21,215 INFO ]: Start accepts. Automaton has 118 states and 135 transitions. Word has length 77 [2018-06-22 10:53:21,215 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:21,215 INFO ]: Abstraction has 118 states and 135 transitions. [2018-06-22 10:53:21,215 INFO ]: Interpolant automaton has 29 states. [2018-06-22 10:53:21,215 INFO ]: Start isEmpty. Operand 118 states and 135 transitions. [2018-06-22 10:53:21,218 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 10:53:21,218 INFO ]: Found error trace [2018-06-22 10:53:21,218 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:21,218 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:21,218 INFO ]: Analyzing trace with hash -1614490477, now seen corresponding path program 1 times [2018-06-22 10:53:21,218 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:21,218 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:21,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:21,219 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:21,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:21,239 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:21,351 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:53:21,352 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:21,352 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 10:53:21,353 INFO ]: Interpolant automaton has 5 states [2018-06-22 10:53:21,353 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 10:53:21,353 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:53:21,353 INFO ]: Start difference. First operand 118 states and 135 transitions. Second operand 5 states. [2018-06-22 10:53:21,389 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:21,389 INFO ]: Finished difference Result 122 states and 138 transitions. [2018-06-22 10:53:21,395 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 10:53:21,395 INFO ]: Start accepts. Automaton has 5 states. Word has length 77 [2018-06-22 10:53:21,395 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:21,397 INFO ]: With dead ends: 122 [2018-06-22 10:53:21,397 INFO ]: Without dead ends: 121 [2018-06-22 10:53:21,397 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:53:21,397 INFO ]: Start minimizeSevpa. Operand 121 states. [2018-06-22 10:53:21,411 INFO ]: Finished minimizeSevpa. Reduced states from 121 to 117. [2018-06-22 10:53:21,411 INFO ]: Start removeUnreachable. Operand 117 states. [2018-06-22 10:53:21,412 INFO ]: Finished removeUnreachable. Reduced from 117 states to 117 states and 132 transitions. [2018-06-22 10:53:21,412 INFO ]: Start accepts. Automaton has 117 states and 132 transitions. Word has length 77 [2018-06-22 10:53:21,412 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:21,412 INFO ]: Abstraction has 117 states and 132 transitions. [2018-06-22 10:53:21,412 INFO ]: Interpolant automaton has 5 states. [2018-06-22 10:53:21,412 INFO ]: Start isEmpty. Operand 117 states and 132 transitions. [2018-06-22 10:53:21,414 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 10:53:21,414 INFO ]: Found error trace [2018-06-22 10:53:21,414 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:21,414 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:21,414 INFO ]: Analyzing trace with hash -1423876282, now seen corresponding path program 1 times [2018-06-22 10:53:21,414 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:21,414 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:21,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:21,415 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:21,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:21,432 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:21,566 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:53:21,566 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:21,566 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 10:53:21,567 INFO ]: Interpolant automaton has 5 states [2018-06-22 10:53:21,567 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 10:53:21,567 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:53:21,567 INFO ]: Start difference. First operand 117 states and 132 transitions. Second operand 5 states. [2018-06-22 10:53:21,583 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:21,583 INFO ]: Finished difference Result 121 states and 135 transitions. [2018-06-22 10:53:21,585 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 10:53:21,585 INFO ]: Start accepts. Automaton has 5 states. Word has length 77 [2018-06-22 10:53:21,585 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:21,586 INFO ]: With dead ends: 121 [2018-06-22 10:53:21,586 INFO ]: Without dead ends: 120 [2018-06-22 10:53:21,586 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:53:21,587 INFO ]: Start minimizeSevpa. Operand 120 states. [2018-06-22 10:53:21,597 INFO ]: Finished minimizeSevpa. Reduced states from 120 to 116. [2018-06-22 10:53:21,597 INFO ]: Start removeUnreachable. Operand 116 states. [2018-06-22 10:53:21,598 INFO ]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-06-22 10:53:21,598 INFO ]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 77 [2018-06-22 10:53:21,599 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:21,599 INFO ]: Abstraction has 116 states and 129 transitions. [2018-06-22 10:53:21,599 INFO ]: Interpolant automaton has 5 states. [2018-06-22 10:53:21,599 INFO ]: Start isEmpty. Operand 116 states and 129 transitions. [2018-06-22 10:53:21,600 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 10:53:21,600 INFO ]: Found error trace [2018-06-22 10:53:21,600 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:21,600 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:21,600 INFO ]: Analyzing trace with hash -1862101640, now seen corresponding path program 1 times [2018-06-22 10:53:21,601 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:21,601 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:21,601 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:21,601 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:21,601 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:21,617 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:21,925 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:53:21,925 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:21,925 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:53:21,932 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:21,979 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:21,985 INFO ]: Computing forward predicates... [2018-06-22 10:53:22,495 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:53:22,518 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:22,518 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-06-22 10:53:22,518 INFO ]: Interpolant automaton has 29 states [2018-06-22 10:53:22,519 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 10:53:22,519 INFO ]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2018-06-22 10:53:22,519 INFO ]: Start difference. First operand 116 states and 129 transitions. Second operand 29 states. [2018-06-22 10:53:22,839 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:22,839 INFO ]: Finished difference Result 130 states and 143 transitions. [2018-06-22 10:53:22,839 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:53:22,839 INFO ]: Start accepts. Automaton has 29 states. Word has length 77 [2018-06-22 10:53:22,840 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:22,841 INFO ]: With dead ends: 130 [2018-06-22 10:53:22,841 INFO ]: Without dead ends: 130 [2018-06-22 10:53:22,841 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2018-06-22 10:53:22,841 INFO ]: Start minimizeSevpa. Operand 130 states. [2018-06-22 10:53:22,850 INFO ]: Finished minimizeSevpa. Reduced states from 130 to 120. [2018-06-22 10:53:22,850 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-22 10:53:22,851 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2018-06-22 10:53:22,851 INFO ]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 77 [2018-06-22 10:53:22,851 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:22,851 INFO ]: Abstraction has 120 states and 133 transitions. [2018-06-22 10:53:22,851 INFO ]: Interpolant automaton has 29 states. [2018-06-22 10:53:22,851 INFO ]: Start isEmpty. Operand 120 states and 133 transitions. [2018-06-22 10:53:22,853 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:53:22,853 INFO ]: Found error trace [2018-06-22 10:53:22,853 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:22,853 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:22,853 INFO ]: Analyzing trace with hash -799662558, now seen corresponding path program 2 times [2018-06-22 10:53:22,853 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:22,853 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:22,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:22,854 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:22,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:22,873 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:23,016 INFO ]: Checked inductivity of 42 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 10:53:23,016 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:23,016 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:53:23,023 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:53:23,102 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:53:23,102 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:23,109 INFO ]: Computing forward predicates... [2018-06-22 10:53:23,134 INFO ]: Checked inductivity of 42 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 10:53:23,154 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:23,154 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 10:53:23,154 INFO ]: Interpolant automaton has 8 states [2018-06-22 10:53:23,154 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 10:53:23,154 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:53:23,154 INFO ]: Start difference. First operand 120 states and 133 transitions. Second operand 8 states. [2018-06-22 10:53:23,326 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:23,326 INFO ]: Finished difference Result 136 states and 151 transitions. [2018-06-22 10:53:23,326 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:53:23,326 INFO ]: Start accepts. Automaton has 8 states. Word has length 105 [2018-06-22 10:53:23,326 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:23,327 INFO ]: With dead ends: 136 [2018-06-22 10:53:23,327 INFO ]: Without dead ends: 136 [2018-06-22 10:53:23,327 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:53:23,328 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-22 10:53:23,336 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-06-22 10:53:23,336 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-22 10:53:23,338 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2018-06-22 10:53:23,338 INFO ]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 105 [2018-06-22 10:53:23,338 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:23,338 INFO ]: Abstraction has 136 states and 151 transitions. [2018-06-22 10:53:23,338 INFO ]: Interpolant automaton has 8 states. [2018-06-22 10:53:23,338 INFO ]: Start isEmpty. Operand 136 states and 151 transitions. [2018-06-22 10:53:23,340 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:53:23,340 INFO ]: Found error trace [2018-06-22 10:53:23,340 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:23,340 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:23,340 INFO ]: Analyzing trace with hash 727477078, now seen corresponding path program 1 times [2018-06-22 10:53:23,340 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:23,340 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:23,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:23,341 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:53:23,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:23,358 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:24,029 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 10:53:24,029 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:24,029 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 10:53:24,030 INFO ]: Interpolant automaton has 8 states [2018-06-22 10:53:24,030 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 10:53:24,030 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:53:24,030 INFO ]: Start difference. First operand 136 states and 151 transitions. Second operand 8 states. [2018-06-22 10:53:24,626 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:24,626 INFO ]: Finished difference Result 132 states and 145 transitions. [2018-06-22 10:53:24,626 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:53:24,626 INFO ]: Start accepts. Automaton has 8 states. Word has length 105 [2018-06-22 10:53:24,627 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:24,627 INFO ]: With dead ends: 132 [2018-06-22 10:53:24,627 INFO ]: Without dead ends: 132 [2018-06-22 10:53:24,628 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:53:24,628 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-22 10:53:24,637 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-06-22 10:53:24,637 INFO ]: Start removeUnreachable. Operand 132 states. [2018-06-22 10:53:24,638 INFO ]: Finished removeUnreachable. Reduced from 132 states to 132 states and 145 transitions. [2018-06-22 10:53:24,638 INFO ]: Start accepts. Automaton has 132 states and 145 transitions. Word has length 105 [2018-06-22 10:53:24,639 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:24,639 INFO ]: Abstraction has 132 states and 145 transitions. [2018-06-22 10:53:24,639 INFO ]: Interpolant automaton has 8 states. [2018-06-22 10:53:24,639 INFO ]: Start isEmpty. Operand 132 states and 145 transitions. [2018-06-22 10:53:24,639 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:53:24,639 INFO ]: Found error trace [2018-06-22 10:53:24,639 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:24,640 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:24,640 INFO ]: Analyzing trace with hash 1596098000, now seen corresponding path program 1 times [2018-06-22 10:53:24,640 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:24,640 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:24,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:24,640 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:24,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:24,661 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:25,141 INFO ]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 10:53:25,141 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:25,141 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:53:25,147 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:25,227 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:25,241 INFO ]: Computing forward predicates... [2018-06-22 10:53:25,902 INFO ]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 10:53:25,922 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:25,922 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2018-06-22 10:53:25,922 INFO ]: Interpolant automaton has 44 states [2018-06-22 10:53:25,922 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 10:53:25,923 INFO ]: CoverageRelationStatistics Valid=132, Invalid=1760, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 10:53:25,923 INFO ]: Start difference. First operand 132 states and 145 transitions. Second operand 44 states. [2018-06-22 10:53:26,637 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:26,637 INFO ]: Finished difference Result 158 states and 171 transitions. [2018-06-22 10:53:26,638 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 10:53:26,638 INFO ]: Start accepts. Automaton has 44 states. Word has length 105 [2018-06-22 10:53:26,638 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:26,639 INFO ]: With dead ends: 158 [2018-06-22 10:53:26,639 INFO ]: Without dead ends: 158 [2018-06-22 10:53:26,640 INFO ]: 0 DeclaredPredicates, 131 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=1926, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 10:53:26,640 INFO ]: Start minimizeSevpa. Operand 158 states. [2018-06-22 10:53:26,649 INFO ]: Finished minimizeSevpa. Reduced states from 158 to 142. [2018-06-22 10:53:26,649 INFO ]: Start removeUnreachable. Operand 142 states. [2018-06-22 10:53:26,650 INFO ]: Finished removeUnreachable. Reduced from 142 states to 142 states and 155 transitions. [2018-06-22 10:53:26,651 INFO ]: Start accepts. Automaton has 142 states and 155 transitions. Word has length 105 [2018-06-22 10:53:26,652 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:26,652 INFO ]: Abstraction has 142 states and 155 transitions. [2018-06-22 10:53:26,652 INFO ]: Interpolant automaton has 44 states. [2018-06-22 10:53:26,652 INFO ]: Start isEmpty. Operand 142 states and 155 transitions. [2018-06-22 10:53:26,653 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:53:26,653 INFO ]: Found error trace [2018-06-22 10:53:26,653 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:26,653 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:26,654 INFO ]: Analyzing trace with hash -1643761252, now seen corresponding path program 1 times [2018-06-22 10:53:26,654 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:26,654 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:26,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:26,654 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:26,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:26,671 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:27,007 INFO ]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 10:53:27,007 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:27,018 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:53:27,024 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:27,103 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:27,117 INFO ]: Computing forward predicates... [2018-06-22 10:53:27,633 INFO ]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 10:53:27,653 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:27,653 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2018-06-22 10:53:27,653 INFO ]: Interpolant automaton has 43 states [2018-06-22 10:53:27,654 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-22 10:53:27,654 INFO ]: CoverageRelationStatistics Valid=130, Invalid=1676, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 10:53:27,654 INFO ]: Start difference. First operand 142 states and 155 transitions. Second operand 43 states. [2018-06-22 10:53:28,047 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:28,047 INFO ]: Finished difference Result 176 states and 190 transitions. [2018-06-22 10:53:28,047 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 10:53:28,047 INFO ]: Start accepts. Automaton has 43 states. Word has length 105 [2018-06-22 10:53:28,047 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:28,048 INFO ]: With dead ends: 176 [2018-06-22 10:53:28,048 INFO ]: Without dead ends: 176 [2018-06-22 10:53:28,049 INFO ]: 0 DeclaredPredicates, 131 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=1837, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 10:53:28,049 INFO ]: Start minimizeSevpa. Operand 176 states. [2018-06-22 10:53:28,056 INFO ]: Finished minimizeSevpa. Reduced states from 176 to 146. [2018-06-22 10:53:28,056 INFO ]: Start removeUnreachable. Operand 146 states. [2018-06-22 10:53:28,058 INFO ]: Finished removeUnreachable. Reduced from 146 states to 146 states and 160 transitions. [2018-06-22 10:53:28,058 INFO ]: Start accepts. Automaton has 146 states and 160 transitions. Word has length 105 [2018-06-22 10:53:28,058 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:28,058 INFO ]: Abstraction has 146 states and 160 transitions. [2018-06-22 10:53:28,058 INFO ]: Interpolant automaton has 43 states. [2018-06-22 10:53:28,058 INFO ]: Start isEmpty. Operand 146 states and 160 transitions. [2018-06-22 10:53:28,060 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:53:28,060 INFO ]: Found error trace [2018-06-22 10:53:28,060 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:28,060 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:28,060 INFO ]: Analyzing trace with hash 701619350, now seen corresponding path program 2 times [2018-06-22 10:53:28,060 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:28,060 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:28,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:28,061 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:28,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:28,076 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:28,166 INFO ]: Checked inductivity of 42 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 10:53:28,166 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:28,166 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:53:28,173 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:53:28,234 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:53:28,234 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:28,237 INFO ]: Computing forward predicates... [2018-06-22 10:53:28,249 INFO ]: Checked inductivity of 42 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 10:53:28,268 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:28,268 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 10:53:28,268 INFO ]: Interpolant automaton has 8 states [2018-06-22 10:53:28,268 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 10:53:28,269 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:53:28,269 INFO ]: Start difference. First operand 146 states and 160 transitions. Second operand 8 states. [2018-06-22 10:53:28,317 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:28,317 INFO ]: Finished difference Result 146 states and 158 transitions. [2018-06-22 10:53:28,319 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:53:28,319 INFO ]: Start accepts. Automaton has 8 states. Word has length 105 [2018-06-22 10:53:28,319 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:28,320 INFO ]: With dead ends: 146 [2018-06-22 10:53:28,320 INFO ]: Without dead ends: 146 [2018-06-22 10:53:28,321 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:53:28,321 INFO ]: Start minimizeSevpa. Operand 146 states. [2018-06-22 10:53:28,331 INFO ]: Finished minimizeSevpa. Reduced states from 146 to 136. [2018-06-22 10:53:28,331 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-22 10:53:28,332 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2018-06-22 10:53:28,332 INFO ]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 105 [2018-06-22 10:53:28,333 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:28,333 INFO ]: Abstraction has 136 states and 148 transitions. [2018-06-22 10:53:28,333 INFO ]: Interpolant automaton has 8 states. [2018-06-22 10:53:28,333 INFO ]: Start isEmpty. Operand 136 states and 148 transitions. [2018-06-22 10:53:28,334 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:53:28,334 INFO ]: Found error trace [2018-06-22 10:53:28,334 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:28,334 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:28,334 INFO ]: Analyzing trace with hash 1513172779, now seen corresponding path program 1 times [2018-06-22 10:53:28,334 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:28,334 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:28,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:28,335 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:53:28,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:28,347 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:28,445 INFO ]: Checked inductivity of 41 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 10:53:28,445 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:53:28,445 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 10:53:28,445 INFO ]: Interpolant automaton has 5 states [2018-06-22 10:53:28,445 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 10:53:28,446 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:53:28,446 INFO ]: Start difference. First operand 136 states and 148 transitions. Second operand 5 states. [2018-06-22 10:53:28,477 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:28,477 INFO ]: Finished difference Result 136 states and 146 transitions. [2018-06-22 10:53:28,479 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 10:53:28,479 INFO ]: Start accepts. Automaton has 5 states. Word has length 105 [2018-06-22 10:53:28,479 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:28,480 INFO ]: With dead ends: 136 [2018-06-22 10:53:28,480 INFO ]: Without dead ends: 135 [2018-06-22 10:53:28,480 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:53:28,481 INFO ]: Start minimizeSevpa. Operand 135 states. [2018-06-22 10:53:28,486 INFO ]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-06-22 10:53:28,486 INFO ]: Start removeUnreachable. Operand 135 states. [2018-06-22 10:53:28,487 INFO ]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2018-06-22 10:53:28,487 INFO ]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 105 [2018-06-22 10:53:28,487 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:28,487 INFO ]: Abstraction has 135 states and 144 transitions. [2018-06-22 10:53:28,487 INFO ]: Interpolant automaton has 5 states. [2018-06-22 10:53:28,487 INFO ]: Start isEmpty. Operand 135 states and 144 transitions. [2018-06-22 10:53:28,489 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:53:28,489 INFO ]: Found error trace [2018-06-22 10:53:28,489 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:28,489 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:28,489 INFO ]: Analyzing trace with hash 1545718044, now seen corresponding path program 2 times [2018-06-22 10:53:28,489 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:28,489 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:28,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:28,490 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:28,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:28,504 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:28,859 INFO ]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 10:53:28,859 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:28,859 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:53:28,866 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:53:28,964 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:53:28,964 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:28,970 INFO ]: Computing forward predicates... [2018-06-22 10:53:29,524 INFO ]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 10:53:29,543 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:29,543 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2018-06-22 10:53:29,543 INFO ]: Interpolant automaton has 43 states [2018-06-22 10:53:29,543 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-22 10:53:29,544 INFO ]: CoverageRelationStatistics Valid=130, Invalid=1676, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 10:53:29,544 INFO ]: Start difference. First operand 135 states and 144 transitions. Second operand 43 states. [2018-06-22 10:53:29,942 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:29,942 INFO ]: Finished difference Result 165 states and 174 transitions. [2018-06-22 10:53:29,943 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 10:53:29,943 INFO ]: Start accepts. Automaton has 43 states. Word has length 105 [2018-06-22 10:53:29,943 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:29,944 INFO ]: With dead ends: 165 [2018-06-22 10:53:29,944 INFO ]: Without dead ends: 165 [2018-06-22 10:53:29,945 INFO ]: 0 DeclaredPredicates, 131 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=1837, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 10:53:29,945 INFO ]: Start minimizeSevpa. Operand 165 states. [2018-06-22 10:53:29,955 INFO ]: Finished minimizeSevpa. Reduced states from 165 to 159. [2018-06-22 10:53:29,955 INFO ]: Start removeUnreachable. Operand 159 states. [2018-06-22 10:53:29,956 INFO ]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2018-06-22 10:53:29,956 INFO ]: Start accepts. Automaton has 159 states and 168 transitions. Word has length 105 [2018-06-22 10:53:29,957 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:29,957 INFO ]: Abstraction has 159 states and 168 transitions. [2018-06-22 10:53:29,957 INFO ]: Interpolant automaton has 43 states. [2018-06-22 10:53:29,957 INFO ]: Start isEmpty. Operand 159 states and 168 transitions. [2018-06-22 10:53:29,958 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:53:29,958 INFO ]: Found error trace [2018-06-22 10:53:29,958 INFO ]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:29,958 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:29,958 INFO ]: Analyzing trace with hash -125339456, now seen corresponding path program 3 times [2018-06-22 10:53:29,958 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:29,958 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:29,959 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:29,959 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:53:29,959 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:29,982 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:30,464 INFO ]: Checked inductivity of 87 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 10:53:30,464 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:30,464 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:53:30,470 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:53:30,598 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 10:53:30,598 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:30,605 INFO ]: Computing forward predicates... [2018-06-22 10:53:31,703 INFO ]: Checked inductivity of 87 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 10:53:31,722 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:31,722 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 57 [2018-06-22 10:53:31,723 INFO ]: Interpolant automaton has 57 states [2018-06-22 10:53:31,723 INFO ]: Constructing interpolant automaton starting with 57 interpolants. [2018-06-22 10:53:31,723 INFO ]: CoverageRelationStatistics Valid=207, Invalid=2985, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 10:53:31,723 INFO ]: Start difference. First operand 159 states and 168 transitions. Second operand 57 states. [2018-06-22 10:53:32,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:32,247 INFO ]: Finished difference Result 193 states and 202 transitions. [2018-06-22 10:53:32,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 10:53:32,248 INFO ]: Start accepts. Automaton has 57 states. Word has length 133 [2018-06-22 10:53:32,248 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:32,249 INFO ]: With dead ends: 193 [2018-06-22 10:53:32,249 INFO ]: Without dead ends: 193 [2018-06-22 10:53:32,250 INFO ]: 0 DeclaredPredicates, 168 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=231, Invalid=3309, Unknown=0, NotChecked=0, Total=3540 [2018-06-22 10:53:32,251 INFO ]: Start minimizeSevpa. Operand 193 states. [2018-06-22 10:53:32,257 INFO ]: Finished minimizeSevpa. Reduced states from 193 to 169. [2018-06-22 10:53:32,257 INFO ]: Start removeUnreachable. Operand 169 states. [2018-06-22 10:53:32,259 INFO ]: Finished removeUnreachable. Reduced from 169 states to 169 states and 178 transitions. [2018-06-22 10:53:32,259 INFO ]: Start accepts. Automaton has 169 states and 178 transitions. Word has length 133 [2018-06-22 10:53:32,259 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:32,259 INFO ]: Abstraction has 169 states and 178 transitions. [2018-06-22 10:53:32,259 INFO ]: Interpolant automaton has 57 states. [2018-06-22 10:53:32,259 INFO ]: Start isEmpty. Operand 169 states and 178 transitions. [2018-06-22 10:53:32,260 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:53:32,260 INFO ]: Found error trace [2018-06-22 10:53:32,260 INFO ]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:32,261 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:32,261 INFO ]: Analyzing trace with hash -669883916, now seen corresponding path program 1 times [2018-06-22 10:53:32,261 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:32,261 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:32,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:32,261 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:53:32,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:32,283 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:32,511 WARN ]: Spent 150.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-22 10:53:32,916 INFO ]: Checked inductivity of 81 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 10:53:32,916 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:32,916 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:53:32,926 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:33,010 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:33,019 INFO ]: Computing forward predicates... [2018-06-22 10:53:33,969 INFO ]: Checked inductivity of 81 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 10:53:33,988 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:33,988 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 58 [2018-06-22 10:53:33,989 INFO ]: Interpolant automaton has 58 states [2018-06-22 10:53:33,989 INFO ]: Constructing interpolant automaton starting with 58 interpolants. [2018-06-22 10:53:33,989 INFO ]: CoverageRelationStatistics Valid=206, Invalid=3100, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 10:53:33,989 INFO ]: Start difference. First operand 169 states and 178 transitions. Second operand 58 states. [2018-06-22 10:53:34,570 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:34,571 INFO ]: Finished difference Result 207 states and 216 transitions. [2018-06-22 10:53:34,571 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 10:53:34,571 INFO ]: Start accepts. Automaton has 58 states. Word has length 133 [2018-06-22 10:53:34,571 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:34,572 INFO ]: With dead ends: 207 [2018-06-22 10:53:34,572 INFO ]: Without dead ends: 207 [2018-06-22 10:53:34,573 INFO ]: 0 DeclaredPredicates, 168 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=228, Invalid=3432, Unknown=0, NotChecked=0, Total=3660 [2018-06-22 10:53:34,573 INFO ]: Start minimizeSevpa. Operand 207 states. [2018-06-22 10:53:34,580 INFO ]: Finished minimizeSevpa. Reduced states from 207 to 149. [2018-06-22 10:53:34,580 INFO ]: Start removeUnreachable. Operand 149 states. [2018-06-22 10:53:34,581 INFO ]: Finished removeUnreachable. Reduced from 149 states to 149 states and 158 transitions. [2018-06-22 10:53:34,581 INFO ]: Start accepts. Automaton has 149 states and 158 transitions. Word has length 133 [2018-06-22 10:53:34,581 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:34,581 INFO ]: Abstraction has 149 states and 158 transitions. [2018-06-22 10:53:34,581 INFO ]: Interpolant automaton has 58 states. [2018-06-22 10:53:34,581 INFO ]: Start isEmpty. Operand 149 states and 158 transitions. [2018-06-22 10:53:34,582 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:53:34,582 INFO ]: Found error trace [2018-06-22 10:53:34,582 INFO ]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:34,582 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:34,582 INFO ]: Analyzing trace with hash -1798533446, now seen corresponding path program 4 times [2018-06-22 10:53:34,583 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:34,583 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:34,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:34,583 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:34,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:34,601 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:35,070 INFO ]: Checked inductivity of 87 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 10:53:35,071 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:35,071 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:53:35,076 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:53:35,160 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:53:35,160 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:35,167 INFO ]: Computing forward predicates... [2018-06-22 10:53:36,051 INFO ]: Checked inductivity of 87 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 10:53:36,071 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:36,071 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 57 [2018-06-22 10:53:36,071 INFO ]: Interpolant automaton has 57 states [2018-06-22 10:53:36,071 INFO ]: Constructing interpolant automaton starting with 57 interpolants. [2018-06-22 10:53:36,072 INFO ]: CoverageRelationStatistics Valid=207, Invalid=2985, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 10:53:36,072 INFO ]: Start difference. First operand 149 states and 158 transitions. Second operand 57 states. [2018-06-22 10:53:36,408 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:36,408 INFO ]: Finished difference Result 207 states and 216 transitions. [2018-06-22 10:53:36,408 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 10:53:36,409 INFO ]: Start accepts. Automaton has 57 states. Word has length 133 [2018-06-22 10:53:36,409 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:36,410 INFO ]: With dead ends: 207 [2018-06-22 10:53:36,410 INFO ]: Without dead ends: 207 [2018-06-22 10:53:36,411 INFO ]: 0 DeclaredPredicates, 168 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=231, Invalid=3309, Unknown=0, NotChecked=0, Total=3540 [2018-06-22 10:53:36,411 INFO ]: Start minimizeSevpa. Operand 207 states. [2018-06-22 10:53:36,419 INFO ]: Finished minimizeSevpa. Reduced states from 207 to 187. [2018-06-22 10:53:36,419 INFO ]: Start removeUnreachable. Operand 187 states. [2018-06-22 10:53:36,420 INFO ]: Finished removeUnreachable. Reduced from 187 states to 187 states and 196 transitions. [2018-06-22 10:53:36,420 INFO ]: Start accepts. Automaton has 187 states and 196 transitions. Word has length 133 [2018-06-22 10:53:36,420 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:36,420 INFO ]: Abstraction has 187 states and 196 transitions. [2018-06-22 10:53:36,420 INFO ]: Interpolant automaton has 57 states. [2018-06-22 10:53:36,420 INFO ]: Start isEmpty. Operand 187 states and 196 transitions. [2018-06-22 10:53:36,423 INFO ]: Finished isEmpty. Found accepting run of length 162 [2018-06-22 10:53:36,423 INFO ]: Found error trace [2018-06-22 10:53:36,423 INFO ]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:36,423 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:36,423 INFO ]: Analyzing trace with hash 996244702, now seen corresponding path program 5 times [2018-06-22 10:53:36,423 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:36,423 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:36,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:36,424 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:53:36,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:36,449 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:36,728 WARN ]: Spent 198.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-22 10:53:37,686 INFO ]: Checked inductivity of 160 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-06-22 10:53:37,686 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:37,746 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:53:37,752 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:53:37,848 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 10:53:37,848 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:37,855 INFO ]: Computing forward predicates... [2018-06-22 10:53:38,880 INFO ]: Checked inductivity of 160 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-06-22 10:53:38,900 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:38,900 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 71 [2018-06-22 10:53:38,900 INFO ]: Interpolant automaton has 71 states [2018-06-22 10:53:38,900 INFO ]: Constructing interpolant automaton starting with 71 interpolants. [2018-06-22 10:53:38,902 INFO ]: CoverageRelationStatistics Valid=299, Invalid=4671, Unknown=0, NotChecked=0, Total=4970 [2018-06-22 10:53:38,902 INFO ]: Start difference. First operand 187 states and 196 transitions. Second operand 71 states. [2018-06-22 10:53:39,522 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:39,522 INFO ]: Finished difference Result 235 states and 244 transitions. [2018-06-22 10:53:39,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 10:53:39,522 INFO ]: Start accepts. Automaton has 71 states. Word has length 161 [2018-06-22 10:53:39,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:39,523 INFO ]: With dead ends: 235 [2018-06-22 10:53:39,523 INFO ]: Without dead ends: 235 [2018-06-22 10:53:39,524 INFO ]: 0 DeclaredPredicates, 205 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=337, Invalid=5213, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 10:53:39,524 INFO ]: Start minimizeSevpa. Operand 235 states. [2018-06-22 10:53:39,534 INFO ]: Finished minimizeSevpa. Reduced states from 235 to 197. [2018-06-22 10:53:39,534 INFO ]: Start removeUnreachable. Operand 197 states. [2018-06-22 10:53:39,535 INFO ]: Finished removeUnreachable. Reduced from 197 states to 197 states and 206 transitions. [2018-06-22 10:53:39,535 INFO ]: Start accepts. Automaton has 197 states and 206 transitions. Word has length 161 [2018-06-22 10:53:39,536 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:39,536 INFO ]: Abstraction has 197 states and 206 transitions. [2018-06-22 10:53:39,536 INFO ]: Interpolant automaton has 71 states. [2018-06-22 10:53:39,536 INFO ]: Start isEmpty. Operand 197 states and 206 transitions. [2018-06-22 10:53:39,537 INFO ]: Finished isEmpty. Found accepting run of length 162 [2018-06-22 10:53:39,537 INFO ]: Found error trace [2018-06-22 10:53:39,537 INFO ]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:39,537 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:39,537 INFO ]: Analyzing trace with hash 364002066, now seen corresponding path program 2 times [2018-06-22 10:53:39,537 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:39,537 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:39,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:39,538 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:53:39,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:39,560 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:40,196 INFO ]: Checked inductivity of 154 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-06-22 10:53:40,196 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:40,196 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:53:40,202 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:53:40,289 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:53:40,289 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:40,296 INFO ]: Computing forward predicates... [2018-06-22 10:53:42,460 INFO ]: Checked inductivity of 154 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-06-22 10:53:42,500 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:42,500 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 72 [2018-06-22 10:53:42,500 INFO ]: Interpolant automaton has 72 states [2018-06-22 10:53:42,500 INFO ]: Constructing interpolant automaton starting with 72 interpolants. [2018-06-22 10:53:42,501 INFO ]: CoverageRelationStatistics Valid=298, Invalid=4814, Unknown=0, NotChecked=0, Total=5112 [2018-06-22 10:53:42,502 INFO ]: Start difference. First operand 197 states and 206 transitions. Second operand 72 states. [2018-06-22 10:53:43,466 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:43,466 INFO ]: Finished difference Result 249 states and 258 transitions. [2018-06-22 10:53:43,496 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 10:53:43,496 INFO ]: Start accepts. Automaton has 72 states. Word has length 161 [2018-06-22 10:53:43,497 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:43,498 INFO ]: With dead ends: 249 [2018-06-22 10:53:43,498 INFO ]: Without dead ends: 249 [2018-06-22 10:53:43,499 INFO ]: 0 DeclaredPredicates, 205 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=333, Invalid=5367, Unknown=0, NotChecked=0, Total=5700 [2018-06-22 10:53:43,500 INFO ]: Start minimizeSevpa. Operand 249 states. [2018-06-22 10:53:43,508 INFO ]: Finished minimizeSevpa. Reduced states from 249 to 163. [2018-06-22 10:53:43,508 INFO ]: Start removeUnreachable. Operand 163 states. [2018-06-22 10:53:43,510 INFO ]: Finished removeUnreachable. Reduced from 163 states to 163 states and 172 transitions. [2018-06-22 10:53:43,510 INFO ]: Start accepts. Automaton has 163 states and 172 transitions. Word has length 161 [2018-06-22 10:53:43,510 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:43,510 INFO ]: Abstraction has 163 states and 172 transitions. [2018-06-22 10:53:43,510 INFO ]: Interpolant automaton has 72 states. [2018-06-22 10:53:43,510 INFO ]: Start isEmpty. Operand 163 states and 172 transitions. [2018-06-22 10:53:43,511 INFO ]: Finished isEmpty. Found accepting run of length 162 [2018-06-22 10:53:43,511 INFO ]: Found error trace [2018-06-22 10:53:43,511 INFO ]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:43,511 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:43,512 INFO ]: Analyzing trace with hash 2070997982, now seen corresponding path program 6 times [2018-06-22 10:53:43,512 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:43,512 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:43,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:43,512 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:53:43,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:43,534 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:43,825 WARN ]: Spent 202.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-22 10:53:45,927 INFO ]: Checked inductivity of 160 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-06-22 10:53:45,927 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:45,928 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:53:45,938 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 10:53:46,039 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 10:53:46,039 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:46,046 INFO ]: Computing forward predicates... [2018-06-22 10:53:47,133 INFO ]: Checked inductivity of 160 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-06-22 10:53:47,152 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:47,152 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 71 [2018-06-22 10:53:47,153 INFO ]: Interpolant automaton has 71 states [2018-06-22 10:53:47,153 INFO ]: Constructing interpolant automaton starting with 71 interpolants. [2018-06-22 10:53:47,154 INFO ]: CoverageRelationStatistics Valid=299, Invalid=4671, Unknown=0, NotChecked=0, Total=4970 [2018-06-22 10:53:47,154 INFO ]: Start difference. First operand 163 states and 172 transitions. Second operand 71 states. [2018-06-22 10:53:47,717 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:47,717 INFO ]: Finished difference Result 249 states and 258 transitions. [2018-06-22 10:53:47,717 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 10:53:47,717 INFO ]: Start accepts. Automaton has 71 states. Word has length 161 [2018-06-22 10:53:47,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:47,719 INFO ]: With dead ends: 249 [2018-06-22 10:53:47,719 INFO ]: Without dead ends: 249 [2018-06-22 10:53:47,720 INFO ]: 0 DeclaredPredicates, 205 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=337, Invalid=5213, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 10:53:47,720 INFO ]: Start minimizeSevpa. Operand 249 states. [2018-06-22 10:53:47,728 INFO ]: Finished minimizeSevpa. Reduced states from 249 to 215. [2018-06-22 10:53:47,728 INFO ]: Start removeUnreachable. Operand 215 states. [2018-06-22 10:53:47,730 INFO ]: Finished removeUnreachable. Reduced from 215 states to 215 states and 224 transitions. [2018-06-22 10:53:47,730 INFO ]: Start accepts. Automaton has 215 states and 224 transitions. Word has length 161 [2018-06-22 10:53:47,730 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:47,730 INFO ]: Abstraction has 215 states and 224 transitions. [2018-06-22 10:53:47,730 INFO ]: Interpolant automaton has 71 states. [2018-06-22 10:53:47,730 INFO ]: Start isEmpty. Operand 215 states and 224 transitions. [2018-06-22 10:53:47,731 INFO ]: Finished isEmpty. Found accepting run of length 190 [2018-06-22 10:53:47,731 INFO ]: Found error trace [2018-06-22 10:53:47,732 INFO ]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:47,732 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:47,732 INFO ]: Analyzing trace with hash -92909316, now seen corresponding path program 7 times [2018-06-22 10:53:47,732 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:47,732 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:47,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:47,733 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:53:47,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:47,762 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:48,063 WARN ]: Spent 204.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-22 10:53:49,120 INFO ]: Checked inductivity of 261 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-06-22 10:53:49,121 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:49,121 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:53:49,141 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:49,248 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:49,257 INFO ]: Computing forward predicates... [2018-06-22 10:53:51,856 INFO ]: Checked inductivity of 261 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-06-22 10:53:51,876 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:51,876 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 85 [2018-06-22 10:53:51,877 INFO ]: Interpolant automaton has 85 states [2018-06-22 10:53:51,877 INFO ]: Constructing interpolant automaton starting with 85 interpolants. [2018-06-22 10:53:51,877 INFO ]: CoverageRelationStatistics Valid=412, Invalid=6728, Unknown=0, NotChecked=0, Total=7140 [2018-06-22 10:53:51,877 INFO ]: Start difference. First operand 215 states and 224 transitions. Second operand 85 states. [2018-06-22 10:53:52,387 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:52,387 INFO ]: Finished difference Result 277 states and 286 transitions. [2018-06-22 10:53:52,388 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 10:53:52,388 INFO ]: Start accepts. Automaton has 85 states. Word has length 189 [2018-06-22 10:53:52,389 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:52,390 INFO ]: With dead ends: 277 [2018-06-22 10:53:52,390 INFO ]: Without dead ends: 277 [2018-06-22 10:53:52,391 INFO ]: 0 DeclaredPredicates, 242 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2167 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=467, Invalid=7543, Unknown=0, NotChecked=0, Total=8010 [2018-06-22 10:53:52,391 INFO ]: Start minimizeSevpa. Operand 277 states. [2018-06-22 10:53:52,399 INFO ]: Finished minimizeSevpa. Reduced states from 277 to 177. [2018-06-22 10:53:52,399 INFO ]: Start removeUnreachable. Operand 177 states. [2018-06-22 10:53:52,402 INFO ]: Finished removeUnreachable. Reduced from 177 states to 177 states and 186 transitions. [2018-06-22 10:53:52,402 INFO ]: Start accepts. Automaton has 177 states and 186 transitions. Word has length 189 [2018-06-22 10:53:52,402 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:52,402 INFO ]: Abstraction has 177 states and 186 transitions. [2018-06-22 10:53:52,402 INFO ]: Interpolant automaton has 85 states. [2018-06-22 10:53:52,402 INFO ]: Start isEmpty. Operand 177 states and 186 transitions. [2018-06-22 10:53:52,403 INFO ]: Finished isEmpty. Found accepting run of length 190 [2018-06-22 10:53:52,403 INFO ]: Found error trace [2018-06-22 10:53:52,403 INFO ]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:52,403 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:52,404 INFO ]: Analyzing trace with hash 585559426, now seen corresponding path program 8 times [2018-06-22 10:53:52,404 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:52,404 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:52,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:52,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:53:52,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:52,429 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:52,701 WARN ]: Spent 196.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-22 10:53:53,444 INFO ]: Checked inductivity of 261 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-06-22 10:53:53,444 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:53,444 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:53:53,449 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:53:53,554 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:53:53,554 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:53,560 INFO ]: Computing forward predicates... [2018-06-22 10:53:55,361 INFO ]: Checked inductivity of 261 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-06-22 10:53:55,381 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:55,381 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 85 [2018-06-22 10:53:55,382 INFO ]: Interpolant automaton has 85 states [2018-06-22 10:53:55,382 INFO ]: Constructing interpolant automaton starting with 85 interpolants. [2018-06-22 10:53:55,382 INFO ]: CoverageRelationStatistics Valid=412, Invalid=6728, Unknown=0, NotChecked=0, Total=7140 [2018-06-22 10:53:55,382 INFO ]: Start difference. First operand 177 states and 186 transitions. Second operand 85 states. [2018-06-22 10:53:56,078 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:56,078 INFO ]: Finished difference Result 277 states and 286 transitions. [2018-06-22 10:53:56,078 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 10:53:56,078 INFO ]: Start accepts. Automaton has 85 states. Word has length 189 [2018-06-22 10:53:56,078 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:56,079 INFO ]: With dead ends: 277 [2018-06-22 10:53:56,079 INFO ]: Without dead ends: 277 [2018-06-22 10:53:56,080 INFO ]: 0 DeclaredPredicates, 242 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2165 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=467, Invalid=7543, Unknown=0, NotChecked=0, Total=8010 [2018-06-22 10:53:56,081 INFO ]: Start minimizeSevpa. Operand 277 states. [2018-06-22 10:53:56,089 INFO ]: Finished minimizeSevpa. Reduced states from 277 to 243. [2018-06-22 10:53:56,089 INFO ]: Start removeUnreachable. Operand 243 states. [2018-06-22 10:53:56,090 INFO ]: Finished removeUnreachable. Reduced from 243 states to 243 states and 252 transitions. [2018-06-22 10:53:56,090 INFO ]: Start accepts. Automaton has 243 states and 252 transitions. Word has length 189 [2018-06-22 10:53:56,091 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:56,092 INFO ]: Abstraction has 243 states and 252 transitions. [2018-06-22 10:53:56,092 INFO ]: Interpolant automaton has 85 states. [2018-06-22 10:53:56,092 INFO ]: Start isEmpty. Operand 243 states and 252 transitions. [2018-06-22 10:53:56,093 INFO ]: Finished isEmpty. Found accepting run of length 190 [2018-06-22 10:53:56,093 INFO ]: Found error trace [2018-06-22 10:53:56,093 INFO ]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:56,093 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:56,093 INFO ]: Analyzing trace with hash -895172426, now seen corresponding path program 3 times [2018-06-22 10:53:56,093 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:56,093 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:56,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:56,094 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:53:56,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:56,118 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:56,405 WARN ]: Spent 206.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-22 10:53:57,147 INFO ]: Checked inductivity of 249 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-06-22 10:53:57,147 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:53:57,147 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:53:57,152 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:53:57,270 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 10:53:57,270 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:57,277 INFO ]: Computing forward predicates... [2018-06-22 10:53:58,796 INFO ]: Checked inductivity of 249 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-06-22 10:53:58,816 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:53:58,907 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 86 [2018-06-22 10:53:58,908 INFO ]: Interpolant automaton has 86 states [2018-06-22 10:53:58,908 INFO ]: Constructing interpolant automaton starting with 86 interpolants. [2018-06-22 10:53:58,908 INFO ]: CoverageRelationStatistics Valid=408, Invalid=6902, Unknown=0, NotChecked=0, Total=7310 [2018-06-22 10:53:58,909 INFO ]: Start difference. First operand 243 states and 252 transitions. Second operand 86 states. [2018-06-22 10:53:59,534 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:53:59,534 INFO ]: Finished difference Result 305 states and 314 transitions. [2018-06-22 10:53:59,534 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-22 10:53:59,534 INFO ]: Start accepts. Automaton has 86 states. Word has length 189 [2018-06-22 10:53:59,535 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:53:59,536 INFO ]: With dead ends: 305 [2018-06-22 10:53:59,536 INFO ]: Without dead ends: 305 [2018-06-22 10:53:59,537 INFO ]: 0 DeclaredPredicates, 242 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=459, Invalid=7731, Unknown=0, NotChecked=0, Total=8190 [2018-06-22 10:53:59,537 INFO ]: Start minimizeSevpa. Operand 305 states. [2018-06-22 10:53:59,548 INFO ]: Finished minimizeSevpa. Reduced states from 305 to 243. [2018-06-22 10:53:59,548 INFO ]: Start removeUnreachable. Operand 243 states. [2018-06-22 10:53:59,549 INFO ]: Finished removeUnreachable. Reduced from 243 states to 243 states and 252 transitions. [2018-06-22 10:53:59,549 INFO ]: Start accepts. Automaton has 243 states and 252 transitions. Word has length 189 [2018-06-22 10:53:59,549 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:53:59,549 INFO ]: Abstraction has 243 states and 252 transitions. [2018-06-22 10:53:59,549 INFO ]: Interpolant automaton has 86 states. [2018-06-22 10:53:59,549 INFO ]: Start isEmpty. Operand 243 states and 252 transitions. [2018-06-22 10:53:59,551 INFO ]: Finished isEmpty. Found accepting run of length 218 [2018-06-22 10:53:59,551 INFO ]: Found error trace [2018-06-22 10:53:59,551 INFO ]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:53:59,551 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:53:59,551 INFO ]: Analyzing trace with hash -1054885548, now seen corresponding path program 4 times [2018-06-22 10:53:59,551 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:53:59,551 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:53:59,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:59,552 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:53:59,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:53:59,581 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:53:59,878 WARN ]: Spent 200.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-22 10:54:00,936 INFO ]: Checked inductivity of 369 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-22 10:54:00,937 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:54:00,937 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:54:00,942 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:54:01,069 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:54:01,069 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:01,079 INFO ]: Computing forward predicates... [2018-06-22 10:54:03,272 INFO ]: Checked inductivity of 369 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-22 10:54:03,291 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:54:03,291 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 100 [2018-06-22 10:54:03,292 INFO ]: Interpolant automaton has 100 states [2018-06-22 10:54:03,292 INFO ]: Constructing interpolant automaton starting with 100 interpolants. [2018-06-22 10:54:03,293 INFO ]: CoverageRelationStatistics Valid=536, Invalid=9364, Unknown=0, NotChecked=0, Total=9900 [2018-06-22 10:54:03,293 INFO ]: Start difference. First operand 243 states and 252 transitions. Second operand 100 states. [2018-06-22 10:54:04,065 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:04,066 INFO ]: Finished difference Result 319 states and 328 transitions. [2018-06-22 10:54:04,066 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-22 10:54:04,066 INFO ]: Start accepts. Automaton has 100 states. Word has length 217 [2018-06-22 10:54:04,066 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:04,068 INFO ]: With dead ends: 319 [2018-06-22 10:54:04,068 INFO ]: Without dead ends: 319 [2018-06-22 10:54:04,069 INFO ]: 0 DeclaredPredicates, 279 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3070 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=606, Invalid=10524, Unknown=0, NotChecked=0, Total=11130 [2018-06-22 10:54:04,069 INFO ]: Start minimizeSevpa. Operand 319 states. [2018-06-22 10:54:04,077 INFO ]: Finished minimizeSevpa. Reduced states from 319 to 253. [2018-06-22 10:54:04,077 INFO ]: Start removeUnreachable. Operand 253 states. [2018-06-22 10:54:04,079 INFO ]: Finished removeUnreachable. Reduced from 253 states to 253 states and 262 transitions. [2018-06-22 10:54:04,079 INFO ]: Start accepts. Automaton has 253 states and 262 transitions. Word has length 217 [2018-06-22 10:54:04,079 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:04,079 INFO ]: Abstraction has 253 states and 262 transitions. [2018-06-22 10:54:04,079 INFO ]: Interpolant automaton has 100 states. [2018-06-22 10:54:04,079 INFO ]: Start isEmpty. Operand 253 states and 262 transitions. [2018-06-22 10:54:04,081 INFO ]: Finished isEmpty. Found accepting run of length 218 [2018-06-22 10:54:04,081 INFO ]: Found error trace [2018-06-22 10:54:04,081 INFO ]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:04,081 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:04,081 INFO ]: Analyzing trace with hash -822243040, now seen corresponding path program 9 times [2018-06-22 10:54:04,081 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:04,081 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:04,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:04,082 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:54:04,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:04,107 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:04,416 WARN ]: Spent 200.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-22 10:54:05,315 INFO ]: Checked inductivity of 381 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-06-22 10:54:05,315 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:54:05,315 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:54:05,320 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:54:05,457 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 10:54:05,457 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:05,467 INFO ]: Computing forward predicates... [2018-06-22 10:54:06,391 INFO ]: Checked inductivity of 381 backedges. 54 proven. 48 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-06-22 10:54:06,411 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:54:06,411 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 26] total 75 [2018-06-22 10:54:06,412 INFO ]: Interpolant automaton has 75 states [2018-06-22 10:54:06,412 INFO ]: Constructing interpolant automaton starting with 75 interpolants. [2018-06-22 10:54:06,412 INFO ]: CoverageRelationStatistics Valid=251, Invalid=5299, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 10:54:06,412 INFO ]: Start difference. First operand 253 states and 262 transitions. Second operand 75 states. [2018-06-22 10:54:09,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:09,939 INFO ]: Finished difference Result 369 states and 380 transitions. [2018-06-22 10:54:09,939 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-06-22 10:54:09,939 INFO ]: Start accepts. Automaton has 75 states. Word has length 217 [2018-06-22 10:54:09,939 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:09,940 INFO ]: With dead ends: 369 [2018-06-22 10:54:09,940 INFO ]: Without dead ends: 369 [2018-06-22 10:54:09,941 INFO ]: 0 DeclaredPredicates, 335 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3534 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=773, Invalid=17859, Unknown=0, NotChecked=0, Total=18632 [2018-06-22 10:54:09,941 INFO ]: Start minimizeSevpa. Operand 369 states. [2018-06-22 10:54:09,949 INFO ]: Finished minimizeSevpa. Reduced states from 369 to 303. [2018-06-22 10:54:09,949 INFO ]: Start removeUnreachable. Operand 303 states. [2018-06-22 10:54:09,953 INFO ]: Finished removeUnreachable. Reduced from 303 states to 303 states and 314 transitions. [2018-06-22 10:54:09,953 INFO ]: Start accepts. Automaton has 303 states and 314 transitions. Word has length 217 [2018-06-22 10:54:09,953 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:09,953 INFO ]: Abstraction has 303 states and 314 transitions. [2018-06-22 10:54:09,953 INFO ]: Interpolant automaton has 75 states. [2018-06-22 10:54:09,953 INFO ]: Start isEmpty. Operand 303 states and 314 transitions. [2018-06-22 10:54:09,955 INFO ]: Finished isEmpty. Found accepting run of length 218 [2018-06-22 10:54:09,955 INFO ]: Found error trace [2018-06-22 10:54:09,955 INFO ]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:09,955 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:09,955 INFO ]: Analyzing trace with hash 746133408, now seen corresponding path program 10 times [2018-06-22 10:54:09,955 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:09,955 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:09,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:09,956 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:54:09,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:09,980 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:10,258 WARN ]: Spent 193.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-22 10:54:11,478 INFO ]: Checked inductivity of 381 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-06-22 10:54:11,478 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:54:11,478 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:54:11,485 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:54:11,610 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:54:11,610 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:11,618 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-22 10:54:12,045 INFO ]: Timeout while computing interpolants [2018-06-22 10:54:12,246 WARN ]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:54:12,246 WARN ]: Verification canceled [2018-06-22 10:54:12,393 WARN ]: Timeout [2018-06-22 10:54:12,393 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:54:12 BoogieIcfgContainer [2018-06-22 10:54:12,393 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:54:12,394 INFO ]: Toolchain (without parser) took 58013.72 ms. Allocated memory was 308.3 MB in the beginning and 1.0 GB in the end (delta: 708.8 MB). Free memory was 252.7 MB in the beginning and 977.8 MB in the end (delta: -725.1 MB). Peak memory consumption was 599.6 MB. Max. memory is 3.6 GB. [2018-06-22 10:54:12,394 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 308.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:54:12,395 INFO ]: ChcToBoogie took 50.18 ms. Allocated memory is still 308.3 MB. Free memory was 250.7 MB in the beginning and 248.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:54:12,395 INFO ]: Boogie Preprocessor took 82.00 ms. Allocated memory is still 308.3 MB. Free memory is still 248.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:54:12,395 INFO ]: RCFGBuilder took 472.38 ms. Allocated memory is still 308.3 MB. Free memory was 248.7 MB in the beginning and 226.7 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:54:12,395 INFO ]: TraceAbstraction took 57400.89 ms. Allocated memory was 308.3 MB in the beginning and 1.0 GB in the end (delta: 708.8 MB). Free memory was 226.7 MB in the beginning and 977.8 MB in the end (delta: -751.1 MB). Peak memory consumption was 573.6 MB. Max. memory is 3.6 GB. [2018-06-22 10:54:12,397 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 308.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 50.18 ms. Allocated memory is still 308.3 MB. Free memory was 250.7 MB in the beginning and 248.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 82.00 ms. Allocated memory is still 308.3 MB. Free memory is still 248.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 472.38 ms. Allocated memory is still 308.3 MB. Free memory was 248.7 MB in the beginning and 226.7 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57400.89 ms. Allocated memory was 308.3 MB in the beginning and 1.0 GB in the end (delta: 708.8 MB). Free memory was 226.7 MB in the beginning and 977.8 MB in the end (delta: -751.1 MB). Peak memory consumption was 573.6 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 218 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 64 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 96 locations, 1 error locations. TIMEOUT Result, 57.3s OverallTime, 27 OverallIterations, 7 TraceHistogramMax, 14.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2451 SDtfs, 91 SDslu, 52335 SDs, 0 SdLazy, 11537 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3400 GetRequests, 2230 SyntacticMatches, 18 SemanticMatches, 1152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20708 ImplicationChecksByTransitivity, 37.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=26, 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.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 682 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 36.1s InterpolantComputationTime, 5845 NumberOfCodeBlocks, 5845 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 5800 ConstructedInterpolants, 0 QuantifiedInterpolants, 2808140 SizeOfPredicates, 93 NumberOfNonLiveVariables, 16700 ConjunctsInSsa, 1097 ConjunctsInUnsatCore, 45 InterpolantComputations, 7 PerfectInterpolantSequences, 2663/5013 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/32.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-54-12-405.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/32.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-54-12-405.csv Completed graceful shutdown