java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/loop3_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 08:56:26,660 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 08:56:26,662 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 08:56:26,674 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 08:56:26,674 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 08:56:26,675 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 08:56:26,678 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 08:56:26,680 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 08:56:26,682 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 08:56:26,682 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 08:56:26,684 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 08:56:26,685 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 08:56:26,685 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 08:56:26,686 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 08:56:26,687 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 08:56:26,691 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 08:56:26,693 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 08:56:26,694 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 08:56:26,707 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 08:56:26,708 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 08:56:26,709 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 08:56:26,711 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 08:56:26,711 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 08:56:26,711 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 08:56:26,712 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 08:56:26,713 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 08:56:26,714 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 08:56:26,715 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 08:56:26,721 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 08:56:26,721 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 08:56:26,722 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 08:56:26,723 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 08:56:26,723 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 08:56:26,724 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 08:56:26,724 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 08:56:26,725 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 08:56:26,740 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 08:56:26,741 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 08:56:26,741 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 08:56:26,741 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 08:56:26,742 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 08:56:26,742 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 08:56:26,743 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 08:56:26,743 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 08:56:26,743 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 08:56:26,743 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 08:56:26,743 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 08:56:26,744 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 08:56:26,744 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 08:56:26,744 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 08:56:26,744 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 08:56:26,744 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 08:56:26,745 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 08:56:26,745 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 08:56:26,745 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 08:56:26,745 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 08:56:26,745 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 08:56:26,747 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 08:56:26,747 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 08:56:26,792 INFO ]: Repository-Root is: /tmp [2018-06-25 08:56:26,808 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 08:56:26,811 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 08:56:26,814 INFO ]: Initializing SmtParser... [2018-06-25 08:56:26,815 INFO ]: SmtParser initialized [2018-06-25 08:56:26,815 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/loop3_merged_safe.c-1.smt2 [2018-06-25 08:56:26,816 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 08:56:26,904 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop3_merged_safe.c-1.smt2 unknown [2018-06-25 08:56:27,116 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop3_merged_safe.c-1.smt2 [2018-06-25 08:56:27,122 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 08:56:27,127 INFO ]: Walking toolchain with 4 elements. [2018-06-25 08:56:27,128 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 08:56:27,128 INFO ]: Initializing ChcToBoogie... [2018-06-25 08:56:27,128 INFO ]: ChcToBoogie initialized [2018-06-25 08:56:27,131 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:56:27" (1/1) ... [2018-06-25 08:56:27,178 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:56:27 Unit [2018-06-25 08:56:27,178 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 08:56:27,179 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 08:56:27,179 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 08:56:27,179 INFO ]: Boogie Preprocessor initialized [2018-06-25 08:56:27,200 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:56:27" (1/1) ... [2018-06-25 08:56:27,200 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:56:27" (1/1) ... [2018-06-25 08:56:27,207 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:56:27" (1/1) ... [2018-06-25 08:56:27,208 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:56:27" (1/1) ... [2018-06-25 08:56:27,210 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:56:27" (1/1) ... [2018-06-25 08:56:27,213 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:56:27" (1/1) ... [2018-06-25 08:56:27,214 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:56:27" (1/1) ... [2018-06-25 08:56:27,216 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 08:56:27,217 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 08:56:27,217 INFO ]: Initializing RCFGBuilder... [2018-06-25 08:56:27,217 INFO ]: RCFGBuilder initialized [2018-06-25 08:56:27,218 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:56:27" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 08:56:27,231 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 08:56:27,231 INFO ]: Found specification of procedure gotoProc [2018-06-25 08:56:27,231 INFO ]: Found implementation of procedure gotoProc [2018-06-25 08:56:27,231 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 08:56:27,231 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 08:56:27,231 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 08:56:27,536 INFO ]: Using library mode [2018-06-25 08:56:27,536 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:56:27 BoogieIcfgContainer [2018-06-25 08:56:27,536 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 08:56:27,537 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 08:56:27,537 INFO ]: Initializing TraceAbstraction... [2018-06-25 08:56:27,541 INFO ]: TraceAbstraction initialized [2018-06-25 08:56:27,541 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:56:27" (1/3) ... [2018-06-25 08:56:27,542 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3914f4a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 08:56:27, skipping insertion in model container [2018-06-25 08:56:27,542 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:56:27" (2/3) ... [2018-06-25 08:56:27,542 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3914f4a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 08:56:27, skipping insertion in model container [2018-06-25 08:56:27,543 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:56:27" (3/3) ... [2018-06-25 08:56:27,544 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 08:56:27,552 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 08:56:27,559 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 08:56:27,596 INFO ]: Using default assertion order modulation [2018-06-25 08:56:27,596 INFO ]: Interprodecural is true [2018-06-25 08:56:27,596 INFO ]: Hoare is false [2018-06-25 08:56:27,596 INFO ]: Compute interpolants for FPandBP [2018-06-25 08:56:27,596 INFO ]: Backedges is TWOTRACK [2018-06-25 08:56:27,596 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 08:56:27,596 INFO ]: Difference is false [2018-06-25 08:56:27,596 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 08:56:27,596 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 08:56:27,607 INFO ]: Start isEmpty. Operand 14 states. [2018-06-25 08:56:27,618 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 08:56:27,618 INFO ]: Found error trace [2018-06-25 08:56:27,619 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:27,619 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:27,623 INFO ]: Analyzing trace with hash 813935866, now seen corresponding path program 1 times [2018-06-25 08:56:27,624 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:27,625 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:27,659 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:27,659 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:27,659 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:27,699 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:27,930 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:27,932 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:56:27,932 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 08:56:27,933 INFO ]: Interpolant automaton has 5 states [2018-06-25 08:56:27,944 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 08:56:27,944 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 08:56:27,946 INFO ]: Start difference. First operand 14 states. Second operand 5 states. [2018-06-25 08:56:28,252 WARN ]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-06-25 08:56:28,468 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:28,469 INFO ]: Finished difference Result 24 states and 31 transitions. [2018-06-25 08:56:28,469 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 08:56:28,470 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-25 08:56:28,470 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:28,480 INFO ]: With dead ends: 24 [2018-06-25 08:56:28,480 INFO ]: Without dead ends: 22 [2018-06-25 08:56:28,482 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-25 08:56:28,500 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 08:56:28,521 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-06-25 08:56:28,522 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 08:56:28,522 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2018-06-25 08:56:28,525 INFO ]: Start accepts. Automaton has 14 states and 20 transitions. Word has length 9 [2018-06-25 08:56:28,525 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:28,525 INFO ]: Abstraction has 14 states and 20 transitions. [2018-06-25 08:56:28,525 INFO ]: Interpolant automaton has 5 states. [2018-06-25 08:56:28,526 INFO ]: Start isEmpty. Operand 14 states and 20 transitions. [2018-06-25 08:56:28,526 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 08:56:28,526 INFO ]: Found error trace [2018-06-25 08:56:28,526 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:28,526 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:28,526 INFO ]: Analyzing trace with hash 819476992, now seen corresponding path program 1 times [2018-06-25 08:56:28,526 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:28,526 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:28,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:28,527 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:28,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:28,539 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:28,862 WARN ]: Spent 250.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-06-25 08:56:28,920 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:28,920 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:56:28,920 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 08:56:28,922 INFO ]: Interpolant automaton has 5 states [2018-06-25 08:56:28,922 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 08:56:28,922 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 08:56:28,922 INFO ]: Start difference. First operand 14 states and 20 transitions. Second operand 5 states. [2018-06-25 08:56:29,139 WARN ]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-25 08:56:29,234 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:29,234 INFO ]: Finished difference Result 17 states and 23 transitions. [2018-06-25 08:56:29,235 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 08:56:29,235 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-25 08:56:29,235 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:29,235 INFO ]: With dead ends: 17 [2018-06-25 08:56:29,235 INFO ]: Without dead ends: 16 [2018-06-25 08:56:29,236 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 08:56:29,236 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 08:56:29,238 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-06-25 08:56:29,238 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 08:56:29,239 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-06-25 08:56:29,239 INFO ]: Start accepts. Automaton has 15 states and 21 transitions. Word has length 9 [2018-06-25 08:56:29,239 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:29,239 INFO ]: Abstraction has 15 states and 21 transitions. [2018-06-25 08:56:29,239 INFO ]: Interpolant automaton has 5 states. [2018-06-25 08:56:29,239 INFO ]: Start isEmpty. Operand 15 states and 21 transitions. [2018-06-25 08:56:29,239 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 08:56:29,239 INFO ]: Found error trace [2018-06-25 08:56:29,239 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:29,240 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:29,240 INFO ]: Analyzing trace with hash 561219987, now seen corresponding path program 1 times [2018-06-25 08:56:29,240 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:29,240 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:29,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:29,240 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:29,241 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:29,258 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:29,307 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:29,307 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:56:29,308 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 08:56:29,308 INFO ]: Interpolant automaton has 4 states [2018-06-25 08:56:29,308 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 08:56:29,308 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 08:56:29,308 INFO ]: Start difference. First operand 15 states and 21 transitions. Second operand 4 states. [2018-06-25 08:56:29,399 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:29,399 INFO ]: Finished difference Result 17 states and 22 transitions. [2018-06-25 08:56:29,400 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 08:56:29,400 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 08:56:29,400 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:29,400 INFO ]: With dead ends: 17 [2018-06-25 08:56:29,400 INFO ]: Without dead ends: 16 [2018-06-25 08:56:29,401 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 08:56:29,401 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 08:56:29,403 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-06-25 08:56:29,403 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 08:56:29,403 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-06-25 08:56:29,404 INFO ]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 9 [2018-06-25 08:56:29,404 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:29,404 INFO ]: Abstraction has 14 states and 19 transitions. [2018-06-25 08:56:29,404 INFO ]: Interpolant automaton has 4 states. [2018-06-25 08:56:29,404 INFO ]: Start isEmpty. Operand 14 states and 19 transitions. [2018-06-25 08:56:29,404 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 08:56:29,404 INFO ]: Found error trace [2018-06-25 08:56:29,404 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:29,404 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:29,404 INFO ]: Analyzing trace with hash -600143550, now seen corresponding path program 1 times [2018-06-25 08:56:29,404 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:29,404 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:29,405 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:29,405 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:29,405 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:29,434 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:29,787 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:29,787 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:29,787 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-25 08:56:29,808 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:29,851 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:29,859 INFO ]: Computing forward predicates... [2018-06-25 08:56:30,051 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:30,073 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 08:56:30,073 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-06-25 08:56:30,073 INFO ]: Interpolant automaton has 11 states [2018-06-25 08:56:30,073 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 08:56:30,074 INFO ]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-25 08:56:30,074 INFO ]: Start difference. First operand 14 states and 19 transitions. Second operand 11 states. [2018-06-25 08:56:30,443 WARN ]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-25 08:56:30,610 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:30,610 INFO ]: Finished difference Result 29 states and 36 transitions. [2018-06-25 08:56:30,611 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 08:56:30,611 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-25 08:56:30,611 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:30,611 INFO ]: With dead ends: 29 [2018-06-25 08:56:30,612 INFO ]: Without dead ends: 27 [2018-06-25 08:56:30,612 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-06-25 08:56:30,612 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-25 08:56:30,614 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-06-25 08:56:30,614 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 08:56:30,615 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-06-25 08:56:30,615 INFO ]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 11 [2018-06-25 08:56:30,615 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:30,615 INFO ]: Abstraction has 17 states and 23 transitions. [2018-06-25 08:56:30,615 INFO ]: Interpolant automaton has 11 states. [2018-06-25 08:56:30,615 INFO ]: Start isEmpty. Operand 17 states and 23 transitions. [2018-06-25 08:56:30,616 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 08:56:30,616 INFO ]: Found error trace [2018-06-25 08:56:30,616 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:30,616 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:30,616 INFO ]: Analyzing trace with hash -594602424, now seen corresponding path program 1 times [2018-06-25 08:56:30,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:30,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:30,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:30,617 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:30,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:30,626 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:30,749 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:30,749 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:30,749 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:56:30,756 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:30,780 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:30,783 INFO ]: Computing forward predicates... [2018-06-25 08:56:30,819 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 08:56:30,837 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 08:56:30,837 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2018-06-25 08:56:30,838 INFO ]: Interpolant automaton has 8 states [2018-06-25 08:56:30,838 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 08:56:30,838 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-25 08:56:30,838 INFO ]: Start difference. First operand 17 states and 23 transitions. Second operand 8 states. [2018-06-25 08:56:30,986 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:30,986 INFO ]: Finished difference Result 20 states and 26 transitions. [2018-06-25 08:56:30,987 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 08:56:30,987 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-25 08:56:30,987 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:30,987 INFO ]: With dead ends: 20 [2018-06-25 08:56:30,987 INFO ]: Without dead ends: 15 [2018-06-25 08:56:30,988 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-06-25 08:56:30,988 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 08:56:30,989 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 08:56:30,989 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 08:56:30,990 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-06-25 08:56:30,990 INFO ]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 11 [2018-06-25 08:56:30,990 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:30,990 INFO ]: Abstraction has 15 states and 20 transitions. [2018-06-25 08:56:30,990 INFO ]: Interpolant automaton has 8 states. [2018-06-25 08:56:30,990 INFO ]: Start isEmpty. Operand 15 states and 20 transitions. [2018-06-25 08:56:30,990 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 08:56:30,990 INFO ]: Found error trace [2018-06-25 08:56:30,990 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:30,990 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:30,990 INFO ]: Analyzing trace with hash 322977813, now seen corresponding path program 1 times [2018-06-25 08:56:30,990 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:30,990 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:30,991 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:30,991 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:30,991 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:31,001 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:31,152 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:31,152 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:31,152 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:56:31,163 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:31,190 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:31,192 INFO ]: Computing forward predicates... [2018-06-25 08:56:31,246 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:31,266 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:31,266 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-25 08:56:31,266 INFO ]: Interpolant automaton has 12 states [2018-06-25 08:56:31,266 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 08:56:31,267 INFO ]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-25 08:56:31,267 INFO ]: Start difference. First operand 15 states and 20 transitions. Second operand 12 states. [2018-06-25 08:56:31,446 WARN ]: Spent 161.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-06-25 08:56:31,585 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:31,585 INFO ]: Finished difference Result 29 states and 39 transitions. [2018-06-25 08:56:31,586 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 08:56:31,586 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-25 08:56:31,586 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:31,587 INFO ]: With dead ends: 29 [2018-06-25 08:56:31,587 INFO ]: Without dead ends: 28 [2018-06-25 08:56:31,588 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-06-25 08:56:31,588 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-25 08:56:31,590 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-06-25 08:56:31,590 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 08:56:31,590 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2018-06-25 08:56:31,591 INFO ]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 11 [2018-06-25 08:56:31,591 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:31,591 INFO ]: Abstraction has 18 states and 23 transitions. [2018-06-25 08:56:31,591 INFO ]: Interpolant automaton has 12 states. [2018-06-25 08:56:31,591 INFO ]: Start isEmpty. Operand 18 states and 23 transitions. [2018-06-25 08:56:31,591 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 08:56:31,591 INFO ]: Found error trace [2018-06-25 08:56:31,591 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:31,591 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:31,591 INFO ]: Analyzing trace with hash -1425003695, now seen corresponding path program 1 times [2018-06-25 08:56:31,591 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:31,591 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:31,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:31,592 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:31,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:31,601 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:31,632 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 08:56:31,632 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:56:31,632 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 08:56:31,633 INFO ]: Interpolant automaton has 5 states [2018-06-25 08:56:31,633 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 08:56:31,633 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 08:56:31,633 INFO ]: Start difference. First operand 18 states and 23 transitions. Second operand 5 states. [2018-06-25 08:56:31,668 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:31,668 INFO ]: Finished difference Result 24 states and 29 transitions. [2018-06-25 08:56:31,668 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 08:56:31,668 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-25 08:56:31,668 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:31,669 INFO ]: With dead ends: 24 [2018-06-25 08:56:31,669 INFO ]: Without dead ends: 23 [2018-06-25 08:56:31,669 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 08:56:31,669 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 08:56:31,671 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 15. [2018-06-25 08:56:31,671 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 08:56:31,671 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-06-25 08:56:31,671 INFO ]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 11 [2018-06-25 08:56:31,672 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:31,672 INFO ]: Abstraction has 15 states and 18 transitions. [2018-06-25 08:56:31,672 INFO ]: Interpolant automaton has 5 states. [2018-06-25 08:56:31,672 INFO ]: Start isEmpty. Operand 15 states and 18 transitions. [2018-06-25 08:56:31,672 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 08:56:31,672 INFO ]: Found error trace [2018-06-25 08:56:31,672 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:31,672 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:31,672 INFO ]: Analyzing trace with hash -1419462569, now seen corresponding path program 1 times [2018-06-25 08:56:31,672 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:31,672 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:31,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:31,673 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:31,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:31,681 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:31,760 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:31,760 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:31,760 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:56:31,767 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:31,792 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:31,794 INFO ]: Computing forward predicates... [2018-06-25 08:56:32,067 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:32,098 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:32,098 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-06-25 08:56:32,099 INFO ]: Interpolant automaton has 11 states [2018-06-25 08:56:32,099 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 08:56:32,099 INFO ]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-25 08:56:32,099 INFO ]: Start difference. First operand 15 states and 18 transitions. Second operand 11 states. [2018-06-25 08:56:32,513 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:32,513 INFO ]: Finished difference Result 31 states and 36 transitions. [2018-06-25 08:56:32,513 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 08:56:32,513 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-25 08:56:32,513 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:32,513 INFO ]: With dead ends: 31 [2018-06-25 08:56:32,513 INFO ]: Without dead ends: 29 [2018-06-25 08:56:32,514 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-06-25 08:56:32,514 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 08:56:32,516 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 15. [2018-06-25 08:56:32,516 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 08:56:32,516 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-06-25 08:56:32,516 INFO ]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 11 [2018-06-25 08:56:32,516 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:32,516 INFO ]: Abstraction has 15 states and 18 transitions. [2018-06-25 08:56:32,516 INFO ]: Interpolant automaton has 11 states. [2018-06-25 08:56:32,516 INFO ]: Start isEmpty. Operand 15 states and 18 transitions. [2018-06-25 08:56:32,517 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 08:56:32,517 INFO ]: Found error trace [2018-06-25 08:56:32,517 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:32,517 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:32,517 INFO ]: Analyzing trace with hash 41111203, now seen corresponding path program 1 times [2018-06-25 08:56:32,517 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:32,517 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:32,518 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:32,518 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:32,518 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:32,526 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:32,562 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:32,563 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:32,563 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:56:32,571 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:32,583 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:32,585 INFO ]: Computing forward predicates... [2018-06-25 08:56:32,618 INFO ]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:32,640 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:32,640 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-25 08:56:32,640 INFO ]: Interpolant automaton has 11 states [2018-06-25 08:56:32,640 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 08:56:32,641 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-25 08:56:32,641 INFO ]: Start difference. First operand 15 states and 18 transitions. Second operand 11 states. [2018-06-25 08:56:32,717 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:32,717 INFO ]: Finished difference Result 22 states and 25 transitions. [2018-06-25 08:56:32,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 08:56:32,718 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-25 08:56:32,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:32,718 INFO ]: With dead ends: 22 [2018-06-25 08:56:32,718 INFO ]: Without dead ends: 15 [2018-06-25 08:56:32,719 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-06-25 08:56:32,719 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 08:56:32,720 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 08:56:32,720 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 08:56:32,720 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-06-25 08:56:32,720 INFO ]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13 [2018-06-25 08:56:32,721 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:32,721 INFO ]: Abstraction has 15 states and 17 transitions. [2018-06-25 08:56:32,721 INFO ]: Interpolant automaton has 11 states. [2018-06-25 08:56:32,721 INFO ]: Start isEmpty. Operand 15 states and 17 transitions. [2018-06-25 08:56:32,721 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 08:56:32,721 INFO ]: Found error trace [2018-06-25 08:56:32,721 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:32,721 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:32,721 INFO ]: Analyzing trace with hash -436905249, now seen corresponding path program 2 times [2018-06-25 08:56:32,721 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:32,721 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:32,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:32,722 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:32,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:32,730 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:32,802 INFO ]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 08:56:32,802 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:32,802 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:56:32,808 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:56:32,822 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:56:32,822 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:32,824 INFO ]: Computing forward predicates... [2018-06-25 08:56:33,179 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:33,199 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:33,199 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-06-25 08:56:33,199 INFO ]: Interpolant automaton has 14 states [2018-06-25 08:56:33,199 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 08:56:33,199 INFO ]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-06-25 08:56:33,199 INFO ]: Start difference. First operand 15 states and 17 transitions. Second operand 14 states. [2018-06-25 08:56:33,398 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-06-25 08:56:33,979 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:33,979 INFO ]: Finished difference Result 27 states and 30 transitions. [2018-06-25 08:56:34,071 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 08:56:34,071 INFO ]: Start accepts. Automaton has 14 states. Word has length 13 [2018-06-25 08:56:34,071 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:34,072 INFO ]: With dead ends: 27 [2018-06-25 08:56:34,072 INFO ]: Without dead ends: 16 [2018-06-25 08:56:34,072 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2018-06-25 08:56:34,072 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 08:56:34,074 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-06-25 08:56:34,074 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 08:56:34,074 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-25 08:56:34,075 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-25 08:56:34,075 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:34,075 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-25 08:56:34,075 INFO ]: Interpolant automaton has 14 states. [2018-06-25 08:56:34,075 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-25 08:56:34,075 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 08:56:34,075 INFO ]: Found error trace [2018-06-25 08:56:34,075 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:34,075 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:34,075 INFO ]: Analyzing trace with hash 1804863542, now seen corresponding path program 1 times [2018-06-25 08:56:34,075 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:34,075 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:34,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:34,076 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:56:34,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:34,093 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:34,235 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:34,235 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:34,235 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:56:34,244 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:34,274 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:34,276 INFO ]: Computing forward predicates... [2018-06-25 08:56:34,349 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:34,368 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:34,368 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-25 08:56:34,368 INFO ]: Interpolant automaton has 16 states [2018-06-25 08:56:34,369 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 08:56:34,369 INFO ]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-06-25 08:56:34,369 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 16 states. [2018-06-25 08:56:34,603 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:34,603 INFO ]: Finished difference Result 28 states and 31 transitions. [2018-06-25 08:56:34,603 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 08:56:34,603 INFO ]: Start accepts. Automaton has 16 states. Word has length 14 [2018-06-25 08:56:34,603 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:34,604 INFO ]: With dead ends: 28 [2018-06-25 08:56:34,604 INFO ]: Without dead ends: 27 [2018-06-25 08:56:34,604 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-06-25 08:56:34,604 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-25 08:56:34,606 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-06-25 08:56:34,606 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 08:56:34,606 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-06-25 08:56:34,606 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2018-06-25 08:56:34,606 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:34,606 INFO ]: Abstraction has 18 states and 20 transitions. [2018-06-25 08:56:34,606 INFO ]: Interpolant automaton has 16 states. [2018-06-25 08:56:34,606 INFO ]: Start isEmpty. Operand 18 states and 20 transitions. [2018-06-25 08:56:34,606 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 08:56:34,606 INFO ]: Found error trace [2018-06-25 08:56:34,606 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:34,607 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:34,607 INFO ]: Analyzing trace with hash 646611203, now seen corresponding path program 1 times [2018-06-25 08:56:34,607 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:34,607 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:34,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:34,609 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:34,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:34,618 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:34,764 INFO ]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:34,764 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:34,764 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:56:34,770 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:34,803 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:34,805 INFO ]: Computing forward predicates... [2018-06-25 08:56:35,010 INFO ]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:35,029 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:35,029 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-25 08:56:35,029 INFO ]: Interpolant automaton has 12 states [2018-06-25 08:56:35,029 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 08:56:35,029 INFO ]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-06-25 08:56:35,030 INFO ]: Start difference. First operand 18 states and 20 transitions. Second operand 12 states. [2018-06-25 08:56:35,143 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:35,143 INFO ]: Finished difference Result 30 states and 33 transitions. [2018-06-25 08:56:35,144 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 08:56:35,144 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-25 08:56:35,144 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:35,144 INFO ]: With dead ends: 30 [2018-06-25 08:56:35,144 INFO ]: Without dead ends: 29 [2018-06-25 08:56:35,144 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2018-06-25 08:56:35,145 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 08:56:35,146 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 17. [2018-06-25 08:56:35,146 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 08:56:35,146 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-25 08:56:35,147 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2018-06-25 08:56:35,147 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:35,147 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-25 08:56:35,147 INFO ]: Interpolant automaton has 12 states. [2018-06-25 08:56:35,147 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-25 08:56:35,147 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 08:56:35,147 INFO ]: Found error trace [2018-06-25 08:56:35,147 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:35,147 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:35,147 INFO ]: Analyzing trace with hash 1469067006, now seen corresponding path program 2 times [2018-06-25 08:56:35,147 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:35,147 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:35,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:35,148 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:35,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:35,156 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:35,231 INFO ]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:35,232 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:35,232 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:56:35,238 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:56:35,275 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:56:35,275 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:35,277 INFO ]: Computing forward predicates... [2018-06-25 08:56:35,339 INFO ]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:35,357 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:35,357 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-25 08:56:35,358 INFO ]: Interpolant automaton has 14 states [2018-06-25 08:56:35,358 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 08:56:35,358 INFO ]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-06-25 08:56:35,358 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 14 states. [2018-06-25 08:56:35,482 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:35,482 INFO ]: Finished difference Result 27 states and 29 transitions. [2018-06-25 08:56:35,483 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 08:56:35,483 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-25 08:56:35,483 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:35,483 INFO ]: With dead ends: 27 [2018-06-25 08:56:35,483 INFO ]: Without dead ends: 18 [2018-06-25 08:56:35,484 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2018-06-25 08:56:35,484 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 08:56:35,485 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-25 08:56:35,485 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 08:56:35,486 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-06-25 08:56:35,486 INFO ]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-06-25 08:56:35,486 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:35,486 INFO ]: Abstraction has 18 states and 19 transitions. [2018-06-25 08:56:35,486 INFO ]: Interpolant automaton has 14 states. [2018-06-25 08:56:35,486 INFO ]: Start isEmpty. Operand 18 states and 19 transitions. [2018-06-25 08:56:35,486 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 08:56:35,486 INFO ]: Found error trace [2018-06-25 08:56:35,486 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:35,486 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:35,486 INFO ]: Analyzing trace with hash 785098891, now seen corresponding path program 2 times [2018-06-25 08:56:35,486 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:35,486 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:35,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:35,487 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:56:35,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:35,498 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:35,657 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:35,657 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:35,657 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-25 08:56:35,662 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:56:35,681 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:56:35,681 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:35,684 INFO ]: Computing forward predicates... [2018-06-25 08:56:35,889 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:35,908 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:35,908 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-06-25 08:56:35,908 INFO ]: Interpolant automaton has 21 states [2018-06-25 08:56:35,909 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 08:56:35,909 INFO ]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-06-25 08:56:35,909 INFO ]: Start difference. First operand 18 states and 19 transitions. Second operand 21 states. [2018-06-25 08:56:36,225 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:36,225 INFO ]: Finished difference Result 33 states and 36 transitions. [2018-06-25 08:56:36,226 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 08:56:36,226 INFO ]: Start accepts. Automaton has 21 states. Word has length 17 [2018-06-25 08:56:36,226 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:36,226 INFO ]: With dead ends: 33 [2018-06-25 08:56:36,226 INFO ]: Without dead ends: 32 [2018-06-25 08:56:36,227 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2018-06-25 08:56:36,227 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-25 08:56:36,229 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 21. [2018-06-25 08:56:36,229 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 08:56:36,229 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-06-25 08:56:36,230 INFO ]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2018-06-25 08:56:36,230 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:36,230 INFO ]: Abstraction has 21 states and 23 transitions. [2018-06-25 08:56:36,230 INFO ]: Interpolant automaton has 21 states. [2018-06-25 08:56:36,230 INFO ]: Start isEmpty. Operand 21 states and 23 transitions. [2018-06-25 08:56:36,231 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 08:56:36,231 INFO ]: Found error trace [2018-06-25 08:56:36,231 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:36,231 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:36,231 INFO ]: Analyzing trace with hash 1056923806, now seen corresponding path program 3 times [2018-06-25 08:56:36,231 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:36,231 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:36,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:36,232 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:56:36,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:36,242 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:36,333 INFO ]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:36,333 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:36,333 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-25 08:56:36,338 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 08:56:36,358 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 08:56:36,358 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:36,360 INFO ]: Computing forward predicates... [2018-06-25 08:56:36,756 INFO ]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:36,775 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:36,776 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-25 08:56:36,776 INFO ]: Interpolant automaton has 15 states [2018-06-25 08:56:36,776 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 08:56:36,776 INFO ]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-06-25 08:56:36,776 INFO ]: Start difference. First operand 21 states and 23 transitions. Second operand 15 states. [2018-06-25 08:56:36,981 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:36,981 INFO ]: Finished difference Result 35 states and 38 transitions. [2018-06-25 08:56:36,982 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 08:56:36,982 INFO ]: Start accepts. Automaton has 15 states. Word has length 18 [2018-06-25 08:56:36,983 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:36,983 INFO ]: With dead ends: 35 [2018-06-25 08:56:36,983 INFO ]: Without dead ends: 34 [2018-06-25 08:56:36,984 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=248, Invalid=622, Unknown=0, NotChecked=0, Total=870 [2018-06-25 08:56:36,984 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 08:56:36,985 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-06-25 08:56:36,985 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 08:56:36,986 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-06-25 08:56:36,986 INFO ]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2018-06-25 08:56:36,986 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:36,986 INFO ]: Abstraction has 20 states and 21 transitions. [2018-06-25 08:56:36,986 INFO ]: Interpolant automaton has 15 states. [2018-06-25 08:56:36,986 INFO ]: Start isEmpty. Operand 20 states and 21 transitions. [2018-06-25 08:56:36,986 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 08:56:36,986 INFO ]: Found error trace [2018-06-25 08:56:36,986 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:36,986 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:36,986 INFO ]: Analyzing trace with hash 727780883, now seen corresponding path program 4 times [2018-06-25 08:56:36,986 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:36,986 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:36,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:36,987 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:56:36,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:36,996 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:37,167 INFO ]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:37,167 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:37,167 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-25 08:56:37,173 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 08:56:37,193 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 08:56:37,193 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:37,195 INFO ]: Computing forward predicates... [2018-06-25 08:56:37,247 INFO ]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:37,268 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:37,268 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-06-25 08:56:37,268 INFO ]: Interpolant automaton has 17 states [2018-06-25 08:56:37,268 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 08:56:37,268 INFO ]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-06-25 08:56:37,268 INFO ]: Start difference. First operand 20 states and 21 transitions. Second operand 17 states. [2018-06-25 08:56:37,445 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:37,446 INFO ]: Finished difference Result 32 states and 34 transitions. [2018-06-25 08:56:37,446 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 08:56:37,446 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-25 08:56:37,446 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:37,446 INFO ]: With dead ends: 32 [2018-06-25 08:56:37,446 INFO ]: Without dead ends: 21 [2018-06-25 08:56:37,446 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2018-06-25 08:56:37,446 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 08:56:37,448 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-25 08:56:37,448 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 08:56:37,448 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-25 08:56:37,448 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-06-25 08:56:37,448 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:37,448 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-25 08:56:37,448 INFO ]: Interpolant automaton has 17 states. [2018-06-25 08:56:37,448 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-25 08:56:37,448 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 08:56:37,448 INFO ]: Found error trace [2018-06-25 08:56:37,448 INFO ]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:37,449 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:37,449 INFO ]: Analyzing trace with hash -41480858, now seen corresponding path program 5 times [2018-06-25 08:56:37,449 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:37,449 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:37,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:37,449 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:56:37,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:37,460 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:37,728 INFO ]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:37,728 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:37,728 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-25 08:56:37,743 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 08:56:37,766 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-25 08:56:37,766 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:37,769 INFO ]: Computing forward predicates... [2018-06-25 08:56:37,987 INFO ]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:38,006 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:38,006 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2018-06-25 08:56:38,006 INFO ]: Interpolant automaton has 26 states [2018-06-25 08:56:38,006 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-25 08:56:38,006 INFO ]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2018-06-25 08:56:38,007 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 26 states. [2018-06-25 08:56:38,345 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:38,345 INFO ]: Finished difference Result 38 states and 41 transitions. [2018-06-25 08:56:38,348 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 08:56:38,348 INFO ]: Start accepts. Automaton has 26 states. Word has length 20 [2018-06-25 08:56:38,348 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:38,348 INFO ]: With dead ends: 38 [2018-06-25 08:56:38,348 INFO ]: Without dead ends: 37 [2018-06-25 08:56:38,349 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=1388, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 08:56:38,349 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-25 08:56:38,351 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 24. [2018-06-25 08:56:38,351 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 08:56:38,351 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-06-25 08:56:38,351 INFO ]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2018-06-25 08:56:38,352 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:38,352 INFO ]: Abstraction has 24 states and 26 transitions. [2018-06-25 08:56:38,352 INFO ]: Interpolant automaton has 26 states. [2018-06-25 08:56:38,352 INFO ]: Start isEmpty. Operand 24 states and 26 transitions. [2018-06-25 08:56:38,354 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 08:56:38,354 INFO ]: Found error trace [2018-06-25 08:56:38,354 INFO ]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:38,354 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:38,354 INFO ]: Analyzing trace with hash 1881208947, now seen corresponding path program 6 times [2018-06-25 08:56:38,354 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:38,355 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:38,355 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:38,355 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:56:38,355 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:38,378 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:38,518 INFO ]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:38,518 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:38,518 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) [2018-06-25 08:56:38,532 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:56:38,562 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-25 08:56:38,562 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:38,565 INFO ]: Computing forward predicates... [2018-06-25 08:56:38,614 INFO ]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:38,638 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:38,638 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 18 [2018-06-25 08:56:38,638 INFO ]: Interpolant automaton has 18 states [2018-06-25 08:56:38,638 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-25 08:56:38,638 INFO ]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-06-25 08:56:38,638 INFO ]: Start difference. First operand 24 states and 26 transitions. Second operand 18 states. [2018-06-25 08:56:38,928 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:38,928 INFO ]: Finished difference Result 40 states and 43 transitions. [2018-06-25 08:56:38,930 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-25 08:56:38,931 INFO ]: Start accepts. Automaton has 18 states. Word has length 21 [2018-06-25 08:56:38,931 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:38,931 INFO ]: With dead ends: 40 [2018-06-25 08:56:38,931 INFO ]: Without dead ends: 39 [2018-06-25 08:56:38,932 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=381, Invalid=951, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 08:56:38,932 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-25 08:56:38,934 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 23. [2018-06-25 08:56:38,934 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 08:56:38,934 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-25 08:56:38,934 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2018-06-25 08:56:38,934 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:38,934 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-25 08:56:38,934 INFO ]: Interpolant automaton has 18 states. [2018-06-25 08:56:38,934 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-25 08:56:38,937 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 08:56:38,937 INFO ]: Found error trace [2018-06-25 08:56:38,937 INFO ]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:38,937 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:38,938 INFO ]: Analyzing trace with hash 953591854, now seen corresponding path program 7 times [2018-06-25 08:56:38,938 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:38,938 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:38,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:38,938 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:56:38,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:38,955 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:40,202 INFO ]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:40,202 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:40,202 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-25 08:56:40,208 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:40,236 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:40,239 INFO ]: Computing forward predicates... [2018-06-25 08:56:40,297 INFO ]: Checked inductivity of 28 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:40,317 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:40,317 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 20 [2018-06-25 08:56:40,317 INFO ]: Interpolant automaton has 20 states [2018-06-25 08:56:40,317 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 08:56:40,317 INFO ]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-06-25 08:56:40,317 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 20 states. [2018-06-25 08:56:40,567 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:40,567 INFO ]: Finished difference Result 37 states and 39 transitions. [2018-06-25 08:56:40,567 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 08:56:40,567 INFO ]: Start accepts. Automaton has 20 states. Word has length 22 [2018-06-25 08:56:40,567 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:40,567 INFO ]: With dead ends: 37 [2018-06-25 08:56:40,567 INFO ]: Without dead ends: 24 [2018-06-25 08:56:40,568 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=231, Invalid=761, Unknown=0, NotChecked=0, Total=992 [2018-06-25 08:56:40,568 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 08:56:40,569 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-25 08:56:40,569 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 08:56:40,569 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-06-25 08:56:40,569 INFO ]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-06-25 08:56:40,569 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:40,569 INFO ]: Abstraction has 24 states and 25 transitions. [2018-06-25 08:56:40,569 INFO ]: Interpolant automaton has 20 states. [2018-06-25 08:56:40,569 INFO ]: Start isEmpty. Operand 24 states and 25 transitions. [2018-06-25 08:56:40,570 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 08:56:40,570 INFO ]: Found error trace [2018-06-25 08:56:40,570 INFO ]: trace histogram [5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:40,570 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:40,570 INFO ]: Analyzing trace with hash 1822557179, now seen corresponding path program 8 times [2018-06-25 08:56:40,570 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:40,570 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:40,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:40,571 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:40,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:40,586 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:41,813 INFO ]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:41,813 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:41,813 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-25 08:56:41,819 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:56:41,844 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:56:41,844 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:41,847 INFO ]: Computing forward predicates... [2018-06-25 08:56:42,092 INFO ]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:42,111 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:42,111 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 31 [2018-06-25 08:56:42,112 INFO ]: Interpolant automaton has 31 states [2018-06-25 08:56:42,112 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-25 08:56:42,112 INFO ]: CoverageRelationStatistics Valid=71, Invalid=859, Unknown=0, NotChecked=0, Total=930 [2018-06-25 08:56:42,112 INFO ]: Start difference. First operand 24 states and 25 transitions. Second operand 31 states. [2018-06-25 08:56:42,659 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:42,659 INFO ]: Finished difference Result 43 states and 46 transitions. [2018-06-25 08:56:42,660 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 08:56:42,660 INFO ]: Start accepts. Automaton has 31 states. Word has length 23 [2018-06-25 08:56:42,660 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:42,660 INFO ]: With dead ends: 43 [2018-06-25 08:56:42,660 INFO ]: Without dead ends: 42 [2018-06-25 08:56:42,661 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=206, Invalid=2050, Unknown=0, NotChecked=0, Total=2256 [2018-06-25 08:56:42,661 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-25 08:56:42,663 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 27. [2018-06-25 08:56:42,663 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-25 08:56:42,664 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-06-25 08:56:42,664 INFO ]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 23 [2018-06-25 08:56:42,664 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:42,664 INFO ]: Abstraction has 27 states and 29 transitions. [2018-06-25 08:56:42,664 INFO ]: Interpolant automaton has 31 states. [2018-06-25 08:56:42,664 INFO ]: Start isEmpty. Operand 27 states and 29 transitions. [2018-06-25 08:56:42,664 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 08:56:42,664 INFO ]: Found error trace [2018-06-25 08:56:42,664 INFO ]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:42,664 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:42,665 INFO ]: Analyzing trace with hash -1304288818, now seen corresponding path program 9 times [2018-06-25 08:56:42,665 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:42,665 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:42,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:42,665 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:56:42,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:42,679 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:43,544 INFO ]: Checked inductivity of 35 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:43,544 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:43,544 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-25 08:56:43,549 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 08:56:43,603 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-25 08:56:43,604 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:43,606 INFO ]: Computing forward predicates... [2018-06-25 08:56:43,773 INFO ]: Checked inductivity of 35 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:43,792 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:43,793 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 21 [2018-06-25 08:56:43,793 INFO ]: Interpolant automaton has 21 states [2018-06-25 08:56:43,793 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 08:56:43,793 INFO ]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-06-25 08:56:43,793 INFO ]: Start difference. First operand 27 states and 29 transitions. Second operand 21 states. [2018-06-25 08:56:44,128 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:44,128 INFO ]: Finished difference Result 45 states and 48 transitions. [2018-06-25 08:56:44,128 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-25 08:56:44,128 INFO ]: Start accepts. Automaton has 21 states. Word has length 24 [2018-06-25 08:56:44,128 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:44,128 INFO ]: With dead ends: 45 [2018-06-25 08:56:44,128 INFO ]: Without dead ends: 44 [2018-06-25 08:56:44,129 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=545, Invalid=1347, Unknown=0, NotChecked=0, Total=1892 [2018-06-25 08:56:44,129 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-25 08:56:44,132 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 26. [2018-06-25 08:56:44,132 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-25 08:56:44,133 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-06-25 08:56:44,133 INFO ]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2018-06-25 08:56:44,133 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:44,133 INFO ]: Abstraction has 26 states and 27 transitions. [2018-06-25 08:56:44,133 INFO ]: Interpolant automaton has 21 states. [2018-06-25 08:56:44,133 INFO ]: Start isEmpty. Operand 26 states and 27 transitions. [2018-06-25 08:56:44,133 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 08:56:44,133 INFO ]: Found error trace [2018-06-25 08:56:44,133 INFO ]: trace histogram [6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:44,133 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:44,134 INFO ]: Analyzing trace with hash 1292782979, now seen corresponding path program 10 times [2018-06-25 08:56:44,134 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:44,134 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:44,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:44,134 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:56:44,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:44,150 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:44,589 INFO ]: Checked inductivity of 42 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:44,589 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:44,589 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-25 08:56:44,594 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 08:56:44,620 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 08:56:44,620 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:44,623 INFO ]: Computing forward predicates... [2018-06-25 08:56:44,680 INFO ]: Checked inductivity of 42 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:44,698 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:44,698 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 23 [2018-06-25 08:56:44,699 INFO ]: Interpolant automaton has 23 states [2018-06-25 08:56:44,699 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-25 08:56:44,699 INFO ]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2018-06-25 08:56:44,699 INFO ]: Start difference. First operand 26 states and 27 transitions. Second operand 23 states. [2018-06-25 08:56:44,942 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:44,942 INFO ]: Finished difference Result 42 states and 44 transitions. [2018-06-25 08:56:44,946 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-25 08:56:44,946 INFO ]: Start accepts. Automaton has 23 states. Word has length 25 [2018-06-25 08:56:44,946 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:44,946 INFO ]: With dead ends: 42 [2018-06-25 08:56:44,946 INFO ]: Without dead ends: 27 [2018-06-25 08:56:44,947 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=303, Invalid=1029, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 08:56:44,947 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-25 08:56:44,949 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-25 08:56:44,949 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-25 08:56:44,949 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-25 08:56:44,949 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 25 [2018-06-25 08:56:44,949 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:44,949 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-25 08:56:44,949 INFO ]: Interpolant automaton has 23 states. [2018-06-25 08:56:44,949 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-25 08:56:44,950 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 08:56:44,950 INFO ]: Found error trace [2018-06-25 08:56:44,950 INFO ]: trace histogram [6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:44,950 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:44,950 INFO ]: Analyzing trace with hash -1424080234, now seen corresponding path program 11 times [2018-06-25 08:56:44,950 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:44,950 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:44,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:44,951 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:56:44,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:44,971 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:45,270 INFO ]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:45,270 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:45,270 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-25 08:56:45,278 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 08:56:45,310 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-25 08:56:45,310 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:45,314 INFO ]: Computing forward predicates... [2018-06-25 08:56:45,630 INFO ]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:45,662 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:45,662 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 36 [2018-06-25 08:56:45,662 INFO ]: Interpolant automaton has 36 states [2018-06-25 08:56:45,662 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-25 08:56:45,662 INFO ]: CoverageRelationStatistics Valid=83, Invalid=1177, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 08:56:45,662 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 36 states. [2018-06-25 08:56:46,393 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:46,394 INFO ]: Finished difference Result 48 states and 51 transitions. [2018-06-25 08:56:46,394 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-25 08:56:46,394 INFO ]: Start accepts. Automaton has 36 states. Word has length 26 [2018-06-25 08:56:46,394 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:46,394 INFO ]: With dead ends: 48 [2018-06-25 08:56:46,394 INFO ]: Without dead ends: 47 [2018-06-25 08:56:46,398 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=240, Invalid=2840, Unknown=0, NotChecked=0, Total=3080 [2018-06-25 08:56:46,398 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-25 08:56:46,401 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-06-25 08:56:46,401 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-25 08:56:46,401 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-06-25 08:56:46,401 INFO ]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 26 [2018-06-25 08:56:46,402 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:46,402 INFO ]: Abstraction has 30 states and 32 transitions. [2018-06-25 08:56:46,402 INFO ]: Interpolant automaton has 36 states. [2018-06-25 08:56:46,402 INFO ]: Start isEmpty. Operand 30 states and 32 transitions. [2018-06-25 08:56:46,402 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 08:56:46,402 INFO ]: Found error trace [2018-06-25 08:56:46,402 INFO ]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:46,402 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:46,402 INFO ]: Analyzing trace with hash 252506083, now seen corresponding path program 12 times [2018-06-25 08:56:46,402 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:46,402 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:46,403 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:46,403 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:56:46,403 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:46,414 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:47,075 INFO ]: Checked inductivity of 51 backedges. 15 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:47,075 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:47,075 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-25 08:56:47,082 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 08:56:47,115 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-25 08:56:47,115 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:47,117 INFO ]: Computing forward predicates... [2018-06-25 08:56:47,172 INFO ]: Checked inductivity of 51 backedges. 15 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:47,192 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:47,192 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 24 [2018-06-25 08:56:47,192 INFO ]: Interpolant automaton has 24 states [2018-06-25 08:56:47,192 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 08:56:47,192 INFO ]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-06-25 08:56:47,192 INFO ]: Start difference. First operand 30 states and 32 transitions. Second operand 24 states. [2018-06-25 08:56:48,121 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:48,121 INFO ]: Finished difference Result 50 states and 53 transitions. [2018-06-25 08:56:48,121 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-25 08:56:48,121 INFO ]: Start accepts. Automaton has 24 states. Word has length 27 [2018-06-25 08:56:48,121 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:48,122 INFO ]: With dead ends: 50 [2018-06-25 08:56:48,122 INFO ]: Without dead ends: 49 [2018-06-25 08:56:48,122 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=740, Invalid=1810, Unknown=0, NotChecked=0, Total=2550 [2018-06-25 08:56:48,122 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-25 08:56:48,124 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 29. [2018-06-25 08:56:48,124 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-25 08:56:48,125 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-25 08:56:48,125 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2018-06-25 08:56:48,125 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:48,125 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-25 08:56:48,125 INFO ]: Interpolant automaton has 24 states. [2018-06-25 08:56:48,125 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-25 08:56:48,125 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 08:56:48,125 INFO ]: Found error trace [2018-06-25 08:56:48,125 INFO ]: trace histogram [7, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:48,125 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:48,125 INFO ]: Analyzing trace with hash -579514018, now seen corresponding path program 13 times [2018-06-25 08:56:48,125 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:48,125 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:48,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:48,126 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:56:48,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:48,138 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:48,326 INFO ]: Checked inductivity of 59 backedges. 25 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:48,326 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:48,326 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:56:48,331 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:48,362 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:48,364 INFO ]: Computing forward predicates... [2018-06-25 08:56:48,737 INFO ]: Checked inductivity of 59 backedges. 36 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:48,756 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:48,756 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 26 [2018-06-25 08:56:48,757 INFO ]: Interpolant automaton has 26 states [2018-06-25 08:56:48,757 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-25 08:56:48,757 INFO ]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2018-06-25 08:56:48,757 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 26 states. [2018-06-25 08:56:49,089 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:49,089 INFO ]: Finished difference Result 47 states and 49 transitions. [2018-06-25 08:56:49,089 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-25 08:56:49,089 INFO ]: Start accepts. Automaton has 26 states. Word has length 28 [2018-06-25 08:56:49,089 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:49,090 INFO ]: With dead ends: 47 [2018-06-25 08:56:49,090 INFO ]: Without dead ends: 30 [2018-06-25 08:56:49,090 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=386, Invalid=1336, Unknown=0, NotChecked=0, Total=1722 [2018-06-25 08:56:49,090 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-25 08:56:49,092 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-25 08:56:49,092 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-25 08:56:49,092 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-06-25 08:56:49,092 INFO ]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2018-06-25 08:56:49,093 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:49,093 INFO ]: Abstraction has 30 states and 31 transitions. [2018-06-25 08:56:49,093 INFO ]: Interpolant automaton has 26 states. [2018-06-25 08:56:49,093 INFO ]: Start isEmpty. Operand 30 states and 31 transitions. [2018-06-25 08:56:49,093 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-25 08:56:49,093 INFO ]: Found error trace [2018-06-25 08:56:49,093 INFO ]: trace histogram [7, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:49,093 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:49,093 INFO ]: Analyzing trace with hash 7200619, now seen corresponding path program 14 times [2018-06-25 08:56:49,093 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:49,093 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:49,096 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:49,096 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:49,096 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:49,113 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:49,514 INFO ]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:49,514 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:49,514 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:56:49,520 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:56:49,557 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:56:49,557 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:49,560 INFO ]: Computing forward predicates... [2018-06-25 08:56:50,411 INFO ]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:50,430 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:50,430 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 41 [2018-06-25 08:56:50,430 INFO ]: Interpolant automaton has 41 states [2018-06-25 08:56:50,430 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-25 08:56:50,431 INFO ]: CoverageRelationStatistics Valid=95, Invalid=1545, Unknown=0, NotChecked=0, Total=1640 [2018-06-25 08:56:50,431 INFO ]: Start difference. First operand 30 states and 31 transitions. Second operand 41 states. [2018-06-25 08:56:51,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:51,069 INFO ]: Finished difference Result 53 states and 56 transitions. [2018-06-25 08:56:51,070 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-25 08:56:51,070 INFO ]: Start accepts. Automaton has 41 states. Word has length 29 [2018-06-25 08:56:51,070 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:51,070 INFO ]: With dead ends: 53 [2018-06-25 08:56:51,070 INFO ]: Without dead ends: 52 [2018-06-25 08:56:51,071 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=274, Invalid=3758, Unknown=0, NotChecked=0, Total=4032 [2018-06-25 08:56:51,071 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-25 08:56:51,072 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 33. [2018-06-25 08:56:51,073 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-25 08:56:51,073 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-06-25 08:56:51,073 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2018-06-25 08:56:51,073 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:51,073 INFO ]: Abstraction has 33 states and 35 transitions. [2018-06-25 08:56:51,073 INFO ]: Interpolant automaton has 41 states. [2018-06-25 08:56:51,073 INFO ]: Start isEmpty. Operand 33 states and 35 transitions. [2018-06-25 08:56:51,074 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-25 08:56:51,074 INFO ]: Found error trace [2018-06-25 08:56:51,074 INFO ]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:51,074 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:51,074 INFO ]: Analyzing trace with hash 1015485182, now seen corresponding path program 15 times [2018-06-25 08:56:51,074 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:51,074 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:51,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:51,074 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:56:51,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:51,089 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:51,739 INFO ]: Checked inductivity of 70 backedges. 21 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:51,739 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:51,739 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:56:51,744 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 08:56:51,782 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-25 08:56:51,782 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:51,785 INFO ]: Computing forward predicates... [2018-06-25 08:56:51,906 INFO ]: Checked inductivity of 70 backedges. 21 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:51,924 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:51,924 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 27 [2018-06-25 08:56:51,925 INFO ]: Interpolant automaton has 27 states [2018-06-25 08:56:51,925 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-25 08:56:51,925 INFO ]: CoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2018-06-25 08:56:51,925 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 27 states. [2018-06-25 08:56:52,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:52,463 INFO ]: Finished difference Result 55 states and 58 transitions. [2018-06-25 08:56:52,463 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-25 08:56:52,463 INFO ]: Start accepts. Automaton has 27 states. Word has length 30 [2018-06-25 08:56:52,463 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:52,463 INFO ]: With dead ends: 55 [2018-06-25 08:56:52,463 INFO ]: Without dead ends: 54 [2018-06-25 08:56:52,464 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=966, Invalid=2340, Unknown=0, NotChecked=0, Total=3306 [2018-06-25 08:56:52,464 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-25 08:56:52,466 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 32. [2018-06-25 08:56:52,466 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-25 08:56:52,466 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-06-25 08:56:52,466 INFO ]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2018-06-25 08:56:52,466 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:52,466 INFO ]: Abstraction has 32 states and 33 transitions. [2018-06-25 08:56:52,466 INFO ]: Interpolant automaton has 27 states. [2018-06-25 08:56:52,466 INFO ]: Start isEmpty. Operand 32 states and 33 transitions. [2018-06-25 08:56:52,468 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-25 08:56:52,468 INFO ]: Found error trace [2018-06-25 08:56:52,468 INFO ]: trace histogram [8, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:52,468 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:52,468 INFO ]: Analyzing trace with hash 491850995, now seen corresponding path program 16 times [2018-06-25 08:56:52,468 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:52,468 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:52,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:52,469 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:56:52,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:52,481 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:53,481 INFO ]: Checked inductivity of 79 backedges. 36 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:53,481 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:53,481 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:56:53,492 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 08:56:53,529 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 08:56:53,529 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:53,533 INFO ]: Computing forward predicates... [2018-06-25 08:56:53,592 INFO ]: Checked inductivity of 79 backedges. 49 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:53,612 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:53,612 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 29 [2018-06-25 08:56:53,612 INFO ]: Interpolant automaton has 29 states [2018-06-25 08:56:53,612 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-25 08:56:53,612 INFO ]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2018-06-25 08:56:53,612 INFO ]: Start difference. First operand 32 states and 33 transitions. Second operand 29 states. [2018-06-25 08:56:53,945 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:53,945 INFO ]: Finished difference Result 52 states and 54 transitions. [2018-06-25 08:56:53,945 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 08:56:53,945 INFO ]: Start accepts. Automaton has 29 states. Word has length 31 [2018-06-25 08:56:53,945 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:53,945 INFO ]: With dead ends: 52 [2018-06-25 08:56:53,945 INFO ]: Without dead ends: 33 [2018-06-25 08:56:53,946 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=480, Invalid=1682, Unknown=0, NotChecked=0, Total=2162 [2018-06-25 08:56:53,946 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-25 08:56:53,946 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-25 08:56:53,946 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-25 08:56:53,947 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-06-25 08:56:53,947 INFO ]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2018-06-25 08:56:53,947 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:53,947 INFO ]: Abstraction has 33 states and 34 transitions. [2018-06-25 08:56:53,947 INFO ]: Interpolant automaton has 29 states. [2018-06-25 08:56:53,947 INFO ]: Start isEmpty. Operand 33 states and 34 transitions. [2018-06-25 08:56:53,947 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-25 08:56:53,947 INFO ]: Found error trace [2018-06-25 08:56:53,947 INFO ]: trace histogram [8, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:53,947 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:53,947 INFO ]: Analyzing trace with hash -1209292858, now seen corresponding path program 17 times [2018-06-25 08:56:53,947 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:53,947 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:53,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:53,948 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:56:53,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:53,961 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:54,383 INFO ]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:54,383 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:54,395 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:56:54,401 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 08:56:54,550 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-25 08:56:54,550 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:54,556 INFO ]: Computing forward predicates... [2018-06-25 08:56:55,334 INFO ]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:55,354 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:55,354 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 46 [2018-06-25 08:56:55,354 INFO ]: Interpolant automaton has 46 states [2018-06-25 08:56:55,354 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-25 08:56:55,355 INFO ]: CoverageRelationStatistics Valid=107, Invalid=1963, Unknown=0, NotChecked=0, Total=2070 [2018-06-25 08:56:55,355 INFO ]: Start difference. First operand 33 states and 34 transitions. Second operand 46 states. [2018-06-25 08:56:56,286 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:56,286 INFO ]: Finished difference Result 58 states and 61 transitions. [2018-06-25 08:56:56,287 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-25 08:56:56,287 INFO ]: Start accepts. Automaton has 46 states. Word has length 32 [2018-06-25 08:56:56,287 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:56,287 INFO ]: With dead ends: 58 [2018-06-25 08:56:56,287 INFO ]: Without dead ends: 57 [2018-06-25 08:56:56,289 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=308, Invalid=4804, Unknown=0, NotChecked=0, Total=5112 [2018-06-25 08:56:56,289 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-25 08:56:56,290 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 36. [2018-06-25 08:56:56,290 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-25 08:56:56,290 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-06-25 08:56:56,290 INFO ]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 32 [2018-06-25 08:56:56,290 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:56,290 INFO ]: Abstraction has 36 states and 38 transitions. [2018-06-25 08:56:56,290 INFO ]: Interpolant automaton has 46 states. [2018-06-25 08:56:56,290 INFO ]: Start isEmpty. Operand 36 states and 38 transitions. [2018-06-25 08:56:56,291 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-25 08:56:56,291 INFO ]: Found error trace [2018-06-25 08:56:56,291 INFO ]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:56,291 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:56,291 INFO ]: Analyzing trace with hash 1889822547, now seen corresponding path program 18 times [2018-06-25 08:56:56,291 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:56,291 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:56,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:56,292 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:56:56,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:56,304 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:56,570 INFO ]: Checked inductivity of 92 backedges. 28 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:56,570 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:56,570 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:56:56,576 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 08:56:56,629 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-25 08:56:56,629 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:56,632 INFO ]: Computing forward predicates... [2018-06-25 08:56:56,714 INFO ]: Checked inductivity of 92 backedges. 28 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:56,735 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:56,735 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 30 [2018-06-25 08:56:56,735 INFO ]: Interpolant automaton has 30 states [2018-06-25 08:56:56,735 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-25 08:56:56,735 INFO ]: CoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2018-06-25 08:56:56,735 INFO ]: Start difference. First operand 36 states and 38 transitions. Second operand 30 states. [2018-06-25 08:56:57,302 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:57,302 INFO ]: Finished difference Result 60 states and 63 transitions. [2018-06-25 08:56:57,302 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-25 08:56:57,302 INFO ]: Start accepts. Automaton has 30 states. Word has length 33 [2018-06-25 08:56:57,302 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:57,302 INFO ]: With dead ends: 60 [2018-06-25 08:56:57,302 INFO ]: Without dead ends: 59 [2018-06-25 08:56:57,304 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1223, Invalid=2937, Unknown=0, NotChecked=0, Total=4160 [2018-06-25 08:56:57,304 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-25 08:56:57,306 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 35. [2018-06-25 08:56:57,306 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-25 08:56:57,307 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-06-25 08:56:57,307 INFO ]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 33 [2018-06-25 08:56:57,307 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:57,307 INFO ]: Abstraction has 35 states and 36 transitions. [2018-06-25 08:56:57,307 INFO ]: Interpolant automaton has 30 states. [2018-06-25 08:56:57,307 INFO ]: Start isEmpty. Operand 35 states and 36 transitions. [2018-06-25 08:56:57,308 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 08:56:57,308 INFO ]: Found error trace [2018-06-25 08:56:57,308 INFO ]: trace histogram [9, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:57,308 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:57,308 INFO ]: Analyzing trace with hash -327275890, now seen corresponding path program 19 times [2018-06-25 08:56:57,308 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:57,308 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:57,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:57,308 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:56:57,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:57,320 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:58,004 INFO ]: Checked inductivity of 102 backedges. 49 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:58,004 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:58,004 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:56:58,010 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:58,056 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:58,059 INFO ]: Computing forward predicates... [2018-06-25 08:56:58,164 INFO ]: Checked inductivity of 102 backedges. 64 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:58,183 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:56:58,183 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 32 [2018-06-25 08:56:58,183 INFO ]: Interpolant automaton has 32 states [2018-06-25 08:56:58,183 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-25 08:56:58,183 INFO ]: CoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2018-06-25 08:56:58,184 INFO ]: Start difference. First operand 35 states and 36 transitions. Second operand 32 states. [2018-06-25 08:56:58,693 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:56:58,693 INFO ]: Finished difference Result 57 states and 59 transitions. [2018-06-25 08:56:58,693 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-25 08:56:58,693 INFO ]: Start accepts. Automaton has 32 states. Word has length 34 [2018-06-25 08:56:58,693 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:56:58,694 INFO ]: With dead ends: 57 [2018-06-25 08:56:58,694 INFO ]: Without dead ends: 36 [2018-06-25 08:56:58,694 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=585, Invalid=2067, Unknown=0, NotChecked=0, Total=2652 [2018-06-25 08:56:58,694 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-25 08:56:58,695 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-25 08:56:58,695 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-25 08:56:58,696 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-06-25 08:56:58,696 INFO ]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-06-25 08:56:58,696 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:56:58,696 INFO ]: Abstraction has 36 states and 37 transitions. [2018-06-25 08:56:58,696 INFO ]: Interpolant automaton has 32 states. [2018-06-25 08:56:58,696 INFO ]: Start isEmpty. Operand 36 states and 37 transitions. [2018-06-25 08:56:58,696 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 08:56:58,696 INFO ]: Found error trace [2018-06-25 08:56:58,696 INFO ]: trace histogram [9, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:56:58,696 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:56:58,696 INFO ]: Analyzing trace with hash 1510292187, now seen corresponding path program 20 times [2018-06-25 08:56:58,696 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:56:58,696 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:56:58,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:58,697 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:56:58,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:56:58,711 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:59,281 INFO ]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:56:59,281 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:56:59,281 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:56:59,287 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:56:59,327 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:56:59,327 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:56:59,331 INFO ]: Computing forward predicates... [2018-06-25 08:57:00,204 INFO ]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:00,223 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:57:00,223 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 51 [2018-06-25 08:57:00,223 INFO ]: Interpolant automaton has 51 states [2018-06-25 08:57:00,223 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-25 08:57:00,224 INFO ]: CoverageRelationStatistics Valid=119, Invalid=2431, Unknown=0, NotChecked=0, Total=2550 [2018-06-25 08:57:00,224 INFO ]: Start difference. First operand 36 states and 37 transitions. Second operand 51 states. [2018-06-25 08:57:01,300 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:57:01,301 INFO ]: Finished difference Result 63 states and 66 transitions. [2018-06-25 08:57:01,303 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-25 08:57:01,303 INFO ]: Start accepts. Automaton has 51 states. Word has length 35 [2018-06-25 08:57:01,303 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:57:01,303 INFO ]: With dead ends: 63 [2018-06-25 08:57:01,303 INFO ]: Without dead ends: 62 [2018-06-25 08:57:01,304 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=342, Invalid=5978, Unknown=0, NotChecked=0, Total=6320 [2018-06-25 08:57:01,304 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-25 08:57:01,306 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 39. [2018-06-25 08:57:01,306 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-25 08:57:01,306 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-06-25 08:57:01,306 INFO ]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 35 [2018-06-25 08:57:01,306 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:57:01,306 INFO ]: Abstraction has 39 states and 41 transitions. [2018-06-25 08:57:01,306 INFO ]: Interpolant automaton has 51 states. [2018-06-25 08:57:01,306 INFO ]: Start isEmpty. Operand 39 states and 41 transitions. [2018-06-25 08:57:01,306 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:57:01,306 INFO ]: Found error trace [2018-06-25 08:57:01,307 INFO ]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:57:01,307 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:57:01,307 INFO ]: Analyzing trace with hash -1654639570, now seen corresponding path program 21 times [2018-06-25 08:57:01,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:57:01,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:57:01,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:01,307 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:57:01,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:01,318 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:02,673 INFO ]: Checked inductivity of 117 backedges. 36 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:02,673 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:57:02,673 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:57:02,678 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 08:57:02,727 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-25 08:57:02,727 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:02,730 INFO ]: Computing forward predicates... [2018-06-25 08:57:02,789 INFO ]: Checked inductivity of 117 backedges. 36 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:02,809 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:57:02,809 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 33 [2018-06-25 08:57:02,809 INFO ]: Interpolant automaton has 33 states [2018-06-25 08:57:02,809 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-25 08:57:02,809 INFO ]: CoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 08:57:02,809 INFO ]: Start difference. First operand 39 states and 41 transitions. Second operand 33 states. [2018-06-25 08:57:03,440 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:57:03,440 INFO ]: Finished difference Result 65 states and 68 transitions. [2018-06-25 08:57:03,441 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-25 08:57:03,441 INFO ]: Start accepts. Automaton has 33 states. Word has length 36 [2018-06-25 08:57:03,441 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:57:03,441 INFO ]: With dead ends: 65 [2018-06-25 08:57:03,441 INFO ]: Without dead ends: 64 [2018-06-25 08:57:03,442 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1511, Invalid=3601, Unknown=0, NotChecked=0, Total=5112 [2018-06-25 08:57:03,442 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-25 08:57:03,443 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 38. [2018-06-25 08:57:03,443 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-25 08:57:03,443 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-06-25 08:57:03,443 INFO ]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2018-06-25 08:57:03,443 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:57:03,443 INFO ]: Abstraction has 38 states and 39 transitions. [2018-06-25 08:57:03,443 INFO ]: Interpolant automaton has 33 states. [2018-06-25 08:57:03,443 INFO ]: Start isEmpty. Operand 38 states and 39 transitions. [2018-06-25 08:57:03,444 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 08:57:03,444 INFO ]: Found error trace [2018-06-25 08:57:03,444 INFO ]: trace histogram [10, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:57:03,444 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:57:03,444 INFO ]: Analyzing trace with hash 1853836387, now seen corresponding path program 22 times [2018-06-25 08:57:03,444 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:57:03,444 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:57:03,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:03,444 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:57:03,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:03,456 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:03,867 INFO ]: Checked inductivity of 128 backedges. 64 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:03,867 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:57:03,867 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:57:03,873 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 08:57:03,913 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 08:57:03,913 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:03,916 INFO ]: Computing forward predicates... [2018-06-25 08:57:04,006 INFO ]: Checked inductivity of 128 backedges. 81 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:04,025 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:57:04,025 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 35 [2018-06-25 08:57:04,025 INFO ]: Interpolant automaton has 35 states [2018-06-25 08:57:04,025 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-25 08:57:04,025 INFO ]: CoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 08:57:04,026 INFO ]: Start difference. First operand 38 states and 39 transitions. Second operand 35 states. [2018-06-25 08:57:04,526 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:57:04,526 INFO ]: Finished difference Result 62 states and 64 transitions. [2018-06-25 08:57:04,526 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-25 08:57:04,526 INFO ]: Start accepts. Automaton has 35 states. Word has length 37 [2018-06-25 08:57:04,526 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:57:04,526 INFO ]: With dead ends: 62 [2018-06-25 08:57:04,526 INFO ]: Without dead ends: 39 [2018-06-25 08:57:04,527 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=701, Invalid=2491, Unknown=0, NotChecked=0, Total=3192 [2018-06-25 08:57:04,527 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-25 08:57:04,527 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-25 08:57:04,527 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-25 08:57:04,528 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-06-25 08:57:04,528 INFO ]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 37 [2018-06-25 08:57:04,528 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:57:04,528 INFO ]: Abstraction has 39 states and 40 transitions. [2018-06-25 08:57:04,528 INFO ]: Interpolant automaton has 35 states. [2018-06-25 08:57:04,528 INFO ]: Start isEmpty. Operand 39 states and 40 transitions. [2018-06-25 08:57:04,528 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-25 08:57:04,528 INFO ]: Found error trace [2018-06-25 08:57:04,528 INFO ]: trace histogram [10, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:57:04,528 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:57:04,528 INFO ]: Analyzing trace with hash 1191263478, now seen corresponding path program 23 times [2018-06-25 08:57:04,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:57:04,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:57:04,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:04,529 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:57:04,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:04,541 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:05,149 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:05,149 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:57:05,149 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:57:05,154 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 08:57:05,205 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-06-25 08:57:05,205 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:05,211 INFO ]: Computing forward predicates... [2018-06-25 08:57:06,491 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:06,510 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:57:06,510 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 56 [2018-06-25 08:57:06,510 INFO ]: Interpolant automaton has 56 states [2018-06-25 08:57:06,510 INFO ]: Constructing interpolant automaton starting with 56 interpolants. [2018-06-25 08:57:06,510 INFO ]: CoverageRelationStatistics Valid=131, Invalid=2949, Unknown=0, NotChecked=0, Total=3080 [2018-06-25 08:57:06,510 INFO ]: Start difference. First operand 39 states and 40 transitions. Second operand 56 states. [2018-06-25 08:57:07,720 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:57:07,720 INFO ]: Finished difference Result 68 states and 71 transitions. [2018-06-25 08:57:07,720 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-25 08:57:07,720 INFO ]: Start accepts. Automaton has 56 states. Word has length 38 [2018-06-25 08:57:07,720 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:57:07,721 INFO ]: With dead ends: 68 [2018-06-25 08:57:07,721 INFO ]: Without dead ends: 67 [2018-06-25 08:57:07,721 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1361 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=376, Invalid=7280, Unknown=0, NotChecked=0, Total=7656 [2018-06-25 08:57:07,721 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-25 08:57:07,723 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 42. [2018-06-25 08:57:07,723 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-25 08:57:07,723 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-06-25 08:57:07,723 INFO ]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 38 [2018-06-25 08:57:07,723 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:57:07,723 INFO ]: Abstraction has 42 states and 44 transitions. [2018-06-25 08:57:07,723 INFO ]: Interpolant automaton has 56 states. [2018-06-25 08:57:07,723 INFO ]: Start isEmpty. Operand 42 states and 44 transitions. [2018-06-25 08:57:07,724 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-25 08:57:07,725 INFO ]: Found error trace [2018-06-25 08:57:07,725 INFO ]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:57:07,725 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:57:07,725 INFO ]: Analyzing trace with hash 2126339779, now seen corresponding path program 24 times [2018-06-25 08:57:07,725 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:57:07,725 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:57:07,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:07,726 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:57:07,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:07,737 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:08,099 INFO ]: Checked inductivity of 145 backedges. 45 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:08,099 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:57:08,099 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:57:08,105 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 08:57:08,161 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-06-25 08:57:08,161 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:08,165 INFO ]: Computing forward predicates... [2018-06-25 08:57:08,228 INFO ]: Checked inductivity of 145 backedges. 45 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:08,247 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:57:08,247 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 36 [2018-06-25 08:57:08,247 INFO ]: Interpolant automaton has 36 states [2018-06-25 08:57:08,247 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-25 08:57:08,248 INFO ]: CoverageRelationStatistics Valid=227, Invalid=1033, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 08:57:08,248 INFO ]: Start difference. First operand 42 states and 44 transitions. Second operand 36 states. [2018-06-25 08:57:09,033 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:57:09,033 INFO ]: Finished difference Result 70 states and 73 transitions. [2018-06-25 08:57:09,033 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-25 08:57:09,034 INFO ]: Start accepts. Automaton has 36 states. Word has length 39 [2018-06-25 08:57:09,034 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:57:09,034 INFO ]: With dead ends: 70 [2018-06-25 08:57:09,034 INFO ]: Without dead ends: 69 [2018-06-25 08:57:09,034 INFO ]: 0 DeclaredPredicates, 115 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1830, Invalid=4332, Unknown=0, NotChecked=0, Total=6162 [2018-06-25 08:57:09,034 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-25 08:57:09,035 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 41. [2018-06-25 08:57:09,036 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-25 08:57:09,036 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-06-25 08:57:09,036 INFO ]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2018-06-25 08:57:09,036 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:57:09,036 INFO ]: Abstraction has 41 states and 42 transitions. [2018-06-25 08:57:09,036 INFO ]: Interpolant automaton has 36 states. [2018-06-25 08:57:09,036 INFO ]: Start isEmpty. Operand 41 states and 42 transitions. [2018-06-25 08:57:09,036 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-25 08:57:09,036 INFO ]: Found error trace [2018-06-25 08:57:09,036 INFO ]: trace histogram [11, 11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:57:09,036 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:57:09,036 INFO ]: Analyzing trace with hash 209925054, now seen corresponding path program 25 times [2018-06-25 08:57:09,037 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:57:09,037 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:57:09,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:09,037 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:57:09,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:09,059 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:10,226 INFO ]: Checked inductivity of 157 backedges. 81 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:10,226 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:57:10,249 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:57:10,255 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:57:10,299 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:10,302 INFO ]: Computing forward predicates... [2018-06-25 08:57:10,533 INFO ]: Checked inductivity of 157 backedges. 100 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:10,552 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:57:10,552 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 38 [2018-06-25 08:57:10,552 INFO ]: Interpolant automaton has 38 states [2018-06-25 08:57:10,552 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-25 08:57:10,552 INFO ]: CoverageRelationStatistics Valid=212, Invalid=1194, Unknown=0, NotChecked=0, Total=1406 [2018-06-25 08:57:10,552 INFO ]: Start difference. First operand 41 states and 42 transitions. Second operand 38 states. [2018-06-25 08:57:11,102 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:57:11,102 INFO ]: Finished difference Result 67 states and 69 transitions. [2018-06-25 08:57:11,102 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-25 08:57:11,102 INFO ]: Start accepts. Automaton has 38 states. Word has length 40 [2018-06-25 08:57:11,102 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:57:11,102 INFO ]: With dead ends: 67 [2018-06-25 08:57:11,102 INFO ]: Without dead ends: 42 [2018-06-25 08:57:11,103 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=828, Invalid=2954, Unknown=0, NotChecked=0, Total=3782 [2018-06-25 08:57:11,103 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-25 08:57:11,104 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-25 08:57:11,104 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-25 08:57:11,104 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-06-25 08:57:11,104 INFO ]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 40 [2018-06-25 08:57:11,104 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:57:11,104 INFO ]: Abstraction has 42 states and 43 transitions. [2018-06-25 08:57:11,105 INFO ]: Interpolant automaton has 38 states. [2018-06-25 08:57:11,105 INFO ]: Start isEmpty. Operand 42 states and 43 transitions. [2018-06-25 08:57:11,105 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-25 08:57:11,105 INFO ]: Found error trace [2018-06-25 08:57:11,105 INFO ]: trace histogram [11, 11, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:57:11,105 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:57:11,105 INFO ]: Analyzing trace with hash 1170085451, now seen corresponding path program 26 times [2018-06-25 08:57:11,105 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:57:11,105 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:57:11,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:11,106 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:57:11,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:11,134 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:11,980 INFO ]: Checked inductivity of 166 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:11,980 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:57:11,980 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:57:11,985 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:57:12,033 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:57:12,033 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:12,039 INFO ]: Computing forward predicates... [2018-06-25 08:57:12,925 INFO ]: Checked inductivity of 166 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:12,943 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:57:12,943 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 61 [2018-06-25 08:57:12,943 INFO ]: Interpolant automaton has 61 states [2018-06-25 08:57:12,944 INFO ]: Constructing interpolant automaton starting with 61 interpolants. [2018-06-25 08:57:12,944 INFO ]: CoverageRelationStatistics Valid=143, Invalid=3517, Unknown=0, NotChecked=0, Total=3660 [2018-06-25 08:57:12,944 INFO ]: Start difference. First operand 42 states and 43 transitions. Second operand 61 states. [2018-06-25 08:57:14,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:57:14,306 INFO ]: Finished difference Result 73 states and 76 transitions. [2018-06-25 08:57:14,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-25 08:57:14,306 INFO ]: Start accepts. Automaton has 61 states. Word has length 41 [2018-06-25 08:57:14,307 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:57:14,307 INFO ]: With dead ends: 73 [2018-06-25 08:57:14,307 INFO ]: Without dead ends: 72 [2018-06-25 08:57:14,308 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1635 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=410, Invalid=8710, Unknown=0, NotChecked=0, Total=9120 [2018-06-25 08:57:14,308 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-25 08:57:14,310 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 45. [2018-06-25 08:57:14,310 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-25 08:57:14,310 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-06-25 08:57:14,310 INFO ]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 41 [2018-06-25 08:57:14,310 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:57:14,310 INFO ]: Abstraction has 45 states and 47 transitions. [2018-06-25 08:57:14,310 INFO ]: Interpolant automaton has 61 states. [2018-06-25 08:57:14,310 INFO ]: Start isEmpty. Operand 45 states and 47 transitions. [2018-06-25 08:57:14,311 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-25 08:57:14,311 INFO ]: Found error trace [2018-06-25 08:57:14,311 INFO ]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:57:14,311 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:57:14,311 INFO ]: Analyzing trace with hash 870286686, now seen corresponding path program 27 times [2018-06-25 08:57:14,311 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:57:14,311 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:57:14,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:14,312 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:57:14,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:14,326 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:14,743 INFO ]: Checked inductivity of 176 backedges. 55 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:14,743 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:57:14,743 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:57:14,749 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 08:57:14,811 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-25 08:57:14,811 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:14,815 INFO ]: Computing forward predicates... [2018-06-25 08:57:14,886 INFO ]: Checked inductivity of 176 backedges. 55 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:14,906 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:57:14,906 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 39 [2018-06-25 08:57:14,906 INFO ]: Interpolant automaton has 39 states [2018-06-25 08:57:14,907 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-25 08:57:14,907 INFO ]: CoverageRelationStatistics Valid=265, Invalid=1217, Unknown=0, NotChecked=0, Total=1482 [2018-06-25 08:57:14,907 INFO ]: Start difference. First operand 45 states and 47 transitions. Second operand 39 states. [2018-06-25 08:57:15,756 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:57:15,756 INFO ]: Finished difference Result 75 states and 78 transitions. [2018-06-25 08:57:15,756 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-25 08:57:15,756 INFO ]: Start accepts. Automaton has 39 states. Word has length 42 [2018-06-25 08:57:15,756 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:57:15,757 INFO ]: With dead ends: 75 [2018-06-25 08:57:15,757 INFO ]: Without dead ends: 74 [2018-06-25 08:57:15,757 INFO ]: 0 DeclaredPredicates, 125 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1735 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2180, Invalid=5130, Unknown=0, NotChecked=0, Total=7310 [2018-06-25 08:57:15,757 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-25 08:57:15,759 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 44. [2018-06-25 08:57:15,759 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-25 08:57:15,759 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-06-25 08:57:15,759 INFO ]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2018-06-25 08:57:15,760 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:57:15,760 INFO ]: Abstraction has 44 states and 45 transitions. [2018-06-25 08:57:15,760 INFO ]: Interpolant automaton has 39 states. [2018-06-25 08:57:15,760 INFO ]: Start isEmpty. Operand 44 states and 45 transitions. [2018-06-25 08:57:15,761 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-25 08:57:15,761 INFO ]: Found error trace [2018-06-25 08:57:15,761 INFO ]: trace histogram [12, 12, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:57:15,761 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:57:15,762 INFO ]: Analyzing trace with hash 1332677587, now seen corresponding path program 28 times [2018-06-25 08:57:15,762 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:57:15,762 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:57:15,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:15,762 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:57:15,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:15,777 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:16,566 INFO ]: Checked inductivity of 189 backedges. 100 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:16,566 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:57:16,566 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:57:16,575 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 08:57:16,624 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 08:57:16,624 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:16,628 INFO ]: Computing forward predicates... [2018-06-25 08:57:16,699 INFO ]: Checked inductivity of 189 backedges. 121 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:16,718 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:57:16,718 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 41 [2018-06-25 08:57:16,718 INFO ]: Interpolant automaton has 41 states [2018-06-25 08:57:16,719 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-25 08:57:16,719 INFO ]: CoverageRelationStatistics Valid=248, Invalid=1392, Unknown=0, NotChecked=0, Total=1640 [2018-06-25 08:57:16,719 INFO ]: Start difference. First operand 44 states and 45 transitions. Second operand 41 states. [2018-06-25 08:57:17,064 WARN ]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-25 08:57:17,510 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:57:17,510 INFO ]: Finished difference Result 72 states and 74 transitions. [2018-06-25 08:57:17,510 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-25 08:57:17,510 INFO ]: Start accepts. Automaton has 41 states. Word has length 43 [2018-06-25 08:57:17,510 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:57:17,511 INFO ]: With dead ends: 72 [2018-06-25 08:57:17,511 INFO ]: Without dead ends: 45 [2018-06-25 08:57:17,511 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=966, Invalid=3456, Unknown=0, NotChecked=0, Total=4422 [2018-06-25 08:57:17,511 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-25 08:57:17,512 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-25 08:57:17,512 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-25 08:57:17,512 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-06-25 08:57:17,513 INFO ]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2018-06-25 08:57:17,513 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:57:17,513 INFO ]: Abstraction has 45 states and 46 transitions. [2018-06-25 08:57:17,513 INFO ]: Interpolant automaton has 41 states. [2018-06-25 08:57:17,513 INFO ]: Start isEmpty. Operand 45 states and 46 transitions. [2018-06-25 08:57:17,513 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 08:57:17,513 INFO ]: Found error trace [2018-06-25 08:57:17,513 INFO ]: trace histogram [12, 12, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:57:17,513 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:57:17,513 INFO ]: Analyzing trace with hash 988873254, now seen corresponding path program 29 times [2018-06-25 08:57:17,513 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:57:17,513 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:57:17,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:17,514 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:57:17,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:17,531 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:18,894 INFO ]: Checked inductivity of 199 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:18,894 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:57:18,894 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:57:18,899 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 08:57:18,959 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-25 08:57:18,959 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:18,963 INFO ]: Computing forward predicates... [2018-06-25 08:57:19,930 INFO ]: Checked inductivity of 199 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:19,949 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:57:19,949 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 66 [2018-06-25 08:57:19,949 INFO ]: Interpolant automaton has 66 states [2018-06-25 08:57:19,950 INFO ]: Constructing interpolant automaton starting with 66 interpolants. [2018-06-25 08:57:19,950 INFO ]: CoverageRelationStatistics Valid=155, Invalid=4135, Unknown=0, NotChecked=0, Total=4290 [2018-06-25 08:57:19,950 INFO ]: Start difference. First operand 45 states and 46 transitions. Second operand 66 states. [2018-06-25 08:57:21,659 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:57:21,659 INFO ]: Finished difference Result 78 states and 81 transitions. [2018-06-25 08:57:21,662 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-25 08:57:21,662 INFO ]: Start accepts. Automaton has 66 states. Word has length 44 [2018-06-25 08:57:21,662 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:57:21,662 INFO ]: With dead ends: 78 [2018-06-25 08:57:21,663 INFO ]: Without dead ends: 77 [2018-06-25 08:57:21,663 INFO ]: 0 DeclaredPredicates, 121 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1934 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=444, Invalid=10268, Unknown=0, NotChecked=0, Total=10712 [2018-06-25 08:57:21,663 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-25 08:57:21,665 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 48. [2018-06-25 08:57:21,665 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-25 08:57:21,665 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-06-25 08:57:21,665 INFO ]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 44 [2018-06-25 08:57:21,665 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:57:21,665 INFO ]: Abstraction has 48 states and 50 transitions. [2018-06-25 08:57:21,665 INFO ]: Interpolant automaton has 66 states. [2018-06-25 08:57:21,665 INFO ]: Start isEmpty. Operand 48 states and 50 transitions. [2018-06-25 08:57:21,666 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-25 08:57:21,666 INFO ]: Found error trace [2018-06-25 08:57:21,666 INFO ]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:57:21,666 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:57:21,666 INFO ]: Analyzing trace with hash -1079126477, now seen corresponding path program 30 times [2018-06-25 08:57:21,666 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:57:21,666 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:57:21,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:21,666 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:57:21,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:21,679 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:22,144 INFO ]: Checked inductivity of 210 backedges. 66 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:22,144 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:57:22,144 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:57:22,150 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 08:57:22,213 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-25 08:57:22,213 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:22,217 INFO ]: Computing forward predicates... [2018-06-25 08:57:22,300 INFO ]: Checked inductivity of 210 backedges. 66 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:22,318 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:57:22,318 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 42 [2018-06-25 08:57:22,319 INFO ]: Interpolant automaton has 42 states [2018-06-25 08:57:22,319 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-25 08:57:22,319 INFO ]: CoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2018-06-25 08:57:22,319 INFO ]: Start difference. First operand 48 states and 50 transitions. Second operand 42 states. [2018-06-25 08:57:23,346 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:57:23,346 INFO ]: Finished difference Result 80 states and 83 transitions. [2018-06-25 08:57:23,347 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-06-25 08:57:23,347 INFO ]: Start accepts. Automaton has 42 states. Word has length 45 [2018-06-25 08:57:23,347 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:57:23,347 INFO ]: With dead ends: 80 [2018-06-25 08:57:23,347 INFO ]: Without dead ends: 79 [2018-06-25 08:57:23,347 INFO ]: 0 DeclaredPredicates, 135 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2049 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2561, Invalid=5995, Unknown=0, NotChecked=0, Total=8556 [2018-06-25 08:57:23,347 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-25 08:57:23,349 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 47. [2018-06-25 08:57:23,349 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-25 08:57:23,349 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-06-25 08:57:23,349 INFO ]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 45 [2018-06-25 08:57:23,349 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:57:23,349 INFO ]: Abstraction has 47 states and 48 transitions. [2018-06-25 08:57:23,349 INFO ]: Interpolant automaton has 42 states. [2018-06-25 08:57:23,349 INFO ]: Start isEmpty. Operand 47 states and 48 transitions. [2018-06-25 08:57:23,350 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-25 08:57:23,350 INFO ]: Found error trace [2018-06-25 08:57:23,350 INFO ]: trace histogram [13, 13, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:57:23,350 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:57:23,350 INFO ]: Analyzing trace with hash -1013551890, now seen corresponding path program 31 times [2018-06-25 08:57:23,350 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:57:23,350 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:57:23,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:23,350 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:57:23,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:23,363 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:23,860 INFO ]: Checked inductivity of 224 backedges. 121 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:23,861 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:57:23,861 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:57:23,866 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:57:23,927 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:57:23,933 INFO ]: Computing forward predicates... [2018-06-25 08:57:24,016 INFO ]: Checked inductivity of 224 backedges. 144 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:57:24,034 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:57:24,034 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 44 [2018-06-25 08:57:24,034 INFO ]: Interpolant automaton has 44 states [2018-06-25 08:57:24,034 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-25 08:57:24,034 INFO ]: CoverageRelationStatistics Valid=287, Invalid=1605, Unknown=0, NotChecked=0, Total=1892 [2018-06-25 08:57:24,034 INFO ]: Start difference. First operand 47 states and 48 transitions. Second operand 44 states. [2018-06-25 08:57:24,757 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:57:24,757 INFO ]: Finished difference Result 77 states and 79 transitions. [2018-06-25 08:57:24,757 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-25 08:57:24,757 INFO ]: Start accepts. Automaton has 44 states. Word has length 46 [2018-06-25 08:57:24,757 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:57:24,757 INFO ]: With dead ends: 77 [2018-06-25 08:57:24,757 INFO ]: Without dead ends: 48 [2018-06-25 08:57:24,757 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1115, Invalid=3997, Unknown=0, NotChecked=0, Total=5112 [2018-06-25 08:57:24,758 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-25 08:57:24,759 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-25 08:57:24,759 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-25 08:57:24,759 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-06-25 08:57:24,759 INFO ]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2018-06-25 08:57:24,759 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:57:24,759 INFO ]: Abstraction has 48 states and 49 transitions. [2018-06-25 08:57:24,759 INFO ]: Interpolant automaton has 44 states. [2018-06-25 08:57:24,759 INFO ]: Start isEmpty. Operand 48 states and 49 transitions. [2018-06-25 08:57:24,759 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-25 08:57:24,759 INFO ]: Found error trace [2018-06-25 08:57:24,759 INFO ]: trace histogram [13, 13, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:57:24,759 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:57:24,759 INFO ]: Analyzing trace with hash 208564667, now seen corresponding path program 32 times [2018-06-25 08:57:24,759 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:57:24,759 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:57:24,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:24,760 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:57:24,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:57:24,775 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-25 08:57:25,194 WARN ]: Verification canceled [2018-06-25 08:57:25,197 WARN ]: Timeout [2018-06-25 08:57:25,198 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 08:57:25 BoogieIcfgContainer [2018-06-25 08:57:25,198 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 08:57:25,198 INFO ]: Toolchain (without parser) took 58075.79 ms. Allocated memory was 308.8 MB in the beginning and 612.9 MB in the end (delta: 304.1 MB). Free memory was 264.3 MB in the beginning and 300.1 MB in the end (delta: -35.7 MB). Peak memory consumption was 268.4 MB. Max. memory is 3.6 GB. [2018-06-25 08:57:25,199 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 08:57:25,199 INFO ]: ChcToBoogie took 50.73 ms. Allocated memory is still 308.8 MB. Free memory was 264.3 MB in the beginning and 261.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:57:25,199 INFO ]: Boogie Preprocessor took 37.38 ms. Allocated memory is still 308.8 MB. Free memory was 261.3 MB in the beginning and 260.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-25 08:57:25,200 INFO ]: RCFGBuilder took 319.45 ms. Allocated memory is still 308.8 MB. Free memory was 260.3 MB in the beginning and 250.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 3.6 GB. [2018-06-25 08:57:25,200 INFO ]: TraceAbstraction took 57660.23 ms. Allocated memory was 308.8 MB in the beginning and 612.9 MB in the end (delta: 304.1 MB). Free memory was 250.2 MB in the beginning and 300.1 MB in the end (delta: -49.9 MB). Peak memory consumption was 254.2 MB. Max. memory is 3.6 GB. [2018-06-25 08:57:25,202 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 50.73 ms. Allocated memory is still 308.8 MB. Free memory was 264.3 MB in the beginning and 261.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.38 ms. Allocated memory is still 308.8 MB. Free memory was 261.3 MB in the beginning and 260.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 319.45 ms. Allocated memory is still 308.8 MB. Free memory was 260.3 MB in the beginning and 250.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57660.23 ms. Allocated memory was 308.8 MB in the beginning and 612.9 MB in the end (delta: 304.1 MB). Free memory was 250.2 MB in the beginning and 300.1 MB in the end (delta: -49.9 MB). Peak memory consumption was 254.2 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 48 with TraceHistMax 13, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 29 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. TIMEOUT Result, 57.6s OverallTime, 44 OverallIterations, 13 TraceHistogramMax, 23.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 482 SDtfs, 1212 SDslu, 6579 SDs, 0 SdLazy, 14193 SolverSat, 1949 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2760 GetRequests, 844 SyntacticMatches, 12 SemanticMatches, 1904 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23073 ImplicationChecksByTransitivity, 43.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 43 MinimizatonAttempts, 505 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 30.2s InterpolantComputationTime, 2158 NumberOfCodeBlocks, 2158 NumberOfCodeBlocksAsserted, 204 NumberOfCheckSat, 2076 ConstructedInterpolants, 6 QuantifiedInterpolants, 304011 SizeOfPredicates, 1308 NumberOfNonLiveVariables, 11856 ConjunctsInSsa, 2879 ConjunctsInUnsatCore, 82 InterpolantComputations, 6 PerfectInterpolantSequences, 1734/5705 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/loop3_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_08-57-25-293.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop3_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_08-57-25-293.csv Completed graceful shutdown