java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/hopv/lia/mochi/map_map.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:34:32,661 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:34:32,663 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:34:32,675 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:34:32,675 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:34:32,676 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:34:32,677 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:34:32,681 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:34:32,682 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:34:32,684 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:34:32,685 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:34:32,685 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:34:32,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:34:32,687 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:34:32,692 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:34:32,693 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:34:32,695 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:34:32,706 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:34:32,707 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:34:32,708 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:34:32,710 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:34:32,712 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:34:32,712 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:34:32,713 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:34:32,713 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:34:32,719 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:34:32,719 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:34:32,720 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:34:32,721 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:34:32,721 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:34:32,722 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:34:32,726 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:34:32,726 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:34:32,727 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:34:32,727 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:34:32,728 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:34:32,748 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:34:32,748 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:34:32,748 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:34:32,749 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:34:32,753 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:34:32,754 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:34:32,754 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:34:32,754 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:34:32,755 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:34:32,755 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:34:32,755 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:34:32,755 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:34:32,755 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:34:32,755 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:34:32,756 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:34:32,759 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:34:32,759 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:34:32,760 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:34:32,760 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:34:32,761 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:34:32,761 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:34:32,816 INFO ]: Repository-Root is: /tmp [2018-06-22 11:34:32,831 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:34:32,836 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:34:32,837 INFO ]: Initializing SmtParser... [2018-06-22 11:34:32,838 INFO ]: SmtParser initialized [2018-06-22 11:34:32,838 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/map_map.smt2 [2018-06-22 11:34:32,840 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:34:32,923 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/map_map.smt2 unknown [2018-06-22 11:34:33,050 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/map_map.smt2 [2018-06-22 11:34:33,058 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:34:33,066 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:34:33,067 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:34:33,067 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:34:33,067 INFO ]: ChcToBoogie initialized [2018-06-22 11:34:33,069 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:34:33" (1/1) ... [2018-06-22 11:34:33,110 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:34:33 Unit [2018-06-22 11:34:33,110 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:34:33,110 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:34:33,110 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:34:33,111 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:34:33,134 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:34:33" (1/1) ... [2018-06-22 11:34:33,134 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:34:33" (1/1) ... [2018-06-22 11:34:33,141 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:34:33" (1/1) ... [2018-06-22 11:34:33,142 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:34:33" (1/1) ... [2018-06-22 11:34:33,144 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:34:33" (1/1) ... [2018-06-22 11:34:33,145 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:34:33" (1/1) ... [2018-06-22 11:34:33,146 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:34:33" (1/1) ... [2018-06-22 11:34:33,149 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:34:33,149 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:34:33,149 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:34:33,149 INFO ]: RCFGBuilder initialized [2018-06-22 11:34:33,150 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:34:33" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:34:33,174 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:34:33,174 INFO ]: Found specification of procedure False [2018-06-22 11:34:33,174 INFO ]: Found implementation of procedure False [2018-06-22 11:34:33,174 INFO ]: Specification and implementation of procedure mapDLRunknownCLN2 given in one single declaration [2018-06-22 11:34:33,174 INFO ]: Found specification of procedure mapDLRunknownCLN2 [2018-06-22 11:34:33,174 INFO ]: Found implementation of procedure mapDLRunknownCLN2 [2018-06-22 11:34:33,174 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:34:33,174 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:34:33,174 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:34:33,418 INFO ]: Using library mode [2018-06-22 11:34:33,419 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:34:33 BoogieIcfgContainer [2018-06-22 11:34:33,419 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:34:33,420 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:34:33,420 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:34:33,423 INFO ]: TraceAbstraction initialized [2018-06-22 11:34:33,423 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:34:33" (1/3) ... [2018-06-22 11:34:33,426 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201b5fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:34:33, skipping insertion in model container [2018-06-22 11:34:33,426 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:34:33" (2/3) ... [2018-06-22 11:34:33,427 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201b5fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:34:33, skipping insertion in model container [2018-06-22 11:34:33,427 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:34:33" (3/3) ... [2018-06-22 11:34:33,429 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:34:33,438 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:34:33,446 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:34:33,501 INFO ]: Using default assertion order modulation [2018-06-22 11:34:33,501 INFO ]: Interprodecural is true [2018-06-22 11:34:33,501 INFO ]: Hoare is false [2018-06-22 11:34:33,502 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:34:33,502 INFO ]: Backedges is TWOTRACK [2018-06-22 11:34:33,502 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:34:33,502 INFO ]: Difference is false [2018-06-22 11:34:33,502 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:34:33,502 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:34:33,519 INFO ]: Start isEmpty. Operand 14 states. [2018-06-22 11:34:33,542 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:34:33,542 INFO ]: Found error trace [2018-06-22 11:34:33,543 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:34:33,543 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:33,558 INFO ]: Analyzing trace with hash 58001195, now seen corresponding path program 1 times [2018-06-22 11:34:33,560 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:33,561 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:33,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:33,604 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:34:33,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:33,617 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:33,636 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:34:33,638 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:34:33,638 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:34:33,639 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:34:33,650 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:34:33,650 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:34:33,652 INFO ]: Start difference. First operand 14 states. Second operand 2 states. [2018-06-22 11:34:33,674 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:33,675 INFO ]: Finished difference Result 12 states and 14 transitions. [2018-06-22 11:34:33,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:34:33,676 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:34:33,676 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:33,695 INFO ]: With dead ends: 12 [2018-06-22 11:34:33,695 INFO ]: Without dead ends: 12 [2018-06-22 11:34:33,697 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:34:33,712 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 11:34:33,745 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 11:34:33,746 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 11:34:33,750 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-06-22 11:34:33,751 INFO ]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 5 [2018-06-22 11:34:33,752 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:33,752 INFO ]: Abstraction has 12 states and 14 transitions. [2018-06-22 11:34:33,752 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:34:33,752 INFO ]: Start isEmpty. Operand 12 states and 14 transitions. [2018-06-22 11:34:33,753 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:34:33,753 INFO ]: Found error trace [2018-06-22 11:34:33,753 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:33,753 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:33,753 INFO ]: Analyzing trace with hash -2124064327, now seen corresponding path program 1 times [2018-06-22 11:34:33,754 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:33,754 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:33,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:33,754 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:34:33,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:33,772 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:33,870 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:34:33,870 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:34:33,870 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:34:33,872 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:34:33,872 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:34:33,872 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:34:33,872 INFO ]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2018-06-22 11:34:33,969 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:33,969 INFO ]: Finished difference Result 17 states and 22 transitions. [2018-06-22 11:34:33,970 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:34:33,970 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:34:33,970 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:33,972 INFO ]: With dead ends: 17 [2018-06-22 11:34:33,972 INFO ]: Without dead ends: 17 [2018-06-22 11:34:33,973 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:34:33,973 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 11:34:33,981 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-22 11:34:33,981 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 11:34:33,981 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-06-22 11:34:33,982 INFO ]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 13 [2018-06-22 11:34:33,982 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:33,982 INFO ]: Abstraction has 15 states and 20 transitions. [2018-06-22 11:34:33,982 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:34:33,982 INFO ]: Start isEmpty. Operand 15 states and 20 transitions. [2018-06-22 11:34:33,983 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:34:33,983 INFO ]: Found error trace [2018-06-22 11:34:33,983 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:33,983 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:33,983 INFO ]: Analyzing trace with hash -1217111621, now seen corresponding path program 1 times [2018-06-22 11:34:33,983 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:33,983 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:33,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:33,984 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:34:33,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:34,000 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:34,413 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:34:34,413 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:34,413 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:34:34,432 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:34:34,464 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:34,475 INFO ]: Computing forward predicates... [2018-06-22 11:34:34,722 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:34:34,743 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:34,743 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 11:34:34,743 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:34:34,743 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:34:34,743 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:34:34,744 INFO ]: Start difference. First operand 15 states and 20 transitions. Second operand 10 states. [2018-06-22 11:34:35,164 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:35,164 INFO ]: Finished difference Result 17 states and 24 transitions. [2018-06-22 11:34:35,165 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:34:35,165 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:34:35,165 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:35,165 INFO ]: With dead ends: 17 [2018-06-22 11:34:35,165 INFO ]: Without dead ends: 14 [2018-06-22 11:34:35,166 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:34:35,166 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 11:34:35,168 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 11:34:35,168 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 11:34:35,168 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-06-22 11:34:35,168 INFO ]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 17 [2018-06-22 11:34:35,168 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:35,168 INFO ]: Abstraction has 14 states and 17 transitions. [2018-06-22 11:34:35,168 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:34:35,168 INFO ]: Start isEmpty. Operand 14 states and 17 transitions. [2018-06-22 11:34:35,169 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:34:35,169 INFO ]: Found error trace [2018-06-22 11:34:35,169 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:35,169 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:35,169 INFO ]: Analyzing trace with hash 1650105275, now seen corresponding path program 2 times [2018-06-22 11:34:35,169 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:35,169 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:35,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:35,170 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:34:35,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:35,179 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:35,226 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:34:35,227 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:35,227 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:34:35,247 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:34:35,277 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:34:35,277 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:35,279 INFO ]: Computing forward predicates... [2018-06-22 11:34:35,772 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:34:35,795 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:35,795 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-06-22 11:34:35,796 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:34:35,796 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:34:35,796 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:34:35,796 INFO ]: Start difference. First operand 14 states and 17 transitions. Second operand 10 states. [2018-06-22 11:34:35,916 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:35,916 INFO ]: Finished difference Result 14 states and 16 transitions. [2018-06-22 11:34:35,917 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:34:35,917 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:34:35,917 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:35,918 INFO ]: With dead ends: 14 [2018-06-22 11:34:35,918 INFO ]: Without dead ends: 14 [2018-06-22 11:34:35,918 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:34:35,918 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 11:34:35,920 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 11:34:35,920 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 11:34:35,921 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-22 11:34:35,921 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 17 [2018-06-22 11:34:35,921 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:35,921 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-22 11:34:35,921 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:34:35,921 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-22 11:34:35,922 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:34:35,922 INFO ]: Found error trace [2018-06-22 11:34:35,922 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:35,922 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:35,922 INFO ]: Analyzing trace with hash -1206596931, now seen corresponding path program 3 times [2018-06-22 11:34:35,922 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:35,922 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:35,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:35,923 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:35,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:35,935 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:36,114 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:34:36,114 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:36,114 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:34:36,121 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:34:36,140 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:34:36,140 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:36,142 INFO ]: Computing forward predicates... [2018-06-22 11:34:36,253 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:34:36,273 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:36,273 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 11:34:36,274 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:34:36,274 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:34:36,274 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:34:36,274 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 10 states. [2018-06-22 11:34:36,430 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:36,430 INFO ]: Finished difference Result 19 states and 24 transitions. [2018-06-22 11:34:36,430 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:34:36,430 INFO ]: Start accepts. Automaton has 10 states. Word has length 21 [2018-06-22 11:34:36,430 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:36,431 INFO ]: With dead ends: 19 [2018-06-22 11:34:36,431 INFO ]: Without dead ends: 19 [2018-06-22 11:34:36,431 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:34:36,431 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:34:36,437 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-22 11:34:36,437 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:34:36,437 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-06-22 11:34:36,437 INFO ]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 21 [2018-06-22 11:34:36,438 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:36,438 INFO ]: Abstraction has 17 states and 22 transitions. [2018-06-22 11:34:36,438 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:34:36,438 INFO ]: Start isEmpty. Operand 17 states and 22 transitions. [2018-06-22 11:34:36,439 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:34:36,439 INFO ]: Found error trace [2018-06-22 11:34:36,439 INFO ]: trace histogram [5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:36,439 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:36,439 INFO ]: Analyzing trace with hash 275410111, now seen corresponding path program 4 times [2018-06-22 11:34:36,439 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:36,439 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:36,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:36,440 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:36,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:36,464 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:36,633 INFO ]: Checked inductivity of 33 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:34:36,633 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:36,633 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:34:36,640 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:34:36,656 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:34:36,656 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:36,659 INFO ]: Computing forward predicates... [2018-06-22 11:34:36,691 INFO ]: Checked inductivity of 33 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:34:36,718 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:36,718 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2018-06-22 11:34:36,718 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:34:36,718 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:34:36,718 INFO ]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:34:36,719 INFO ]: Start difference. First operand 17 states and 22 transitions. Second operand 12 states. [2018-06-22 11:34:36,858 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:36,858 INFO ]: Finished difference Result 17 states and 21 transitions. [2018-06-22 11:34:36,859 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:34:36,859 INFO ]: Start accepts. Automaton has 12 states. Word has length 25 [2018-06-22 11:34:36,859 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:36,859 INFO ]: With dead ends: 17 [2018-06-22 11:34:36,859 INFO ]: Without dead ends: 16 [2018-06-22 11:34:36,860 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:34:36,860 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 11:34:36,863 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 11:34:36,863 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 11:34:36,863 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-06-22 11:34:36,864 INFO ]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 25 [2018-06-22 11:34:36,864 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:36,864 INFO ]: Abstraction has 16 states and 19 transitions. [2018-06-22 11:34:36,864 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:34:36,864 INFO ]: Start isEmpty. Operand 16 states and 19 transitions. [2018-06-22 11:34:36,864 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:34:36,864 INFO ]: Found error trace [2018-06-22 11:34:36,865 INFO ]: trace histogram [5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:36,867 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:36,867 INFO ]: Analyzing trace with hash -782520641, now seen corresponding path program 5 times [2018-06-22 11:34:36,867 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:36,867 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:36,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:36,868 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:36,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:36,887 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:36,961 INFO ]: Checked inductivity of 33 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:34:36,961 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:36,961 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:34:36,967 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:34:37,030 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:34:37,030 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:37,032 INFO ]: Computing forward predicates... [2018-06-22 11:34:37,169 INFO ]: Checked inductivity of 33 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:34:37,190 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:37,190 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-06-22 11:34:37,190 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:34:37,190 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:34:37,190 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:34:37,190 INFO ]: Start difference. First operand 16 states and 19 transitions. Second operand 12 states. [2018-06-22 11:34:37,301 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:37,301 INFO ]: Finished difference Result 16 states and 18 transitions. [2018-06-22 11:34:37,304 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:34:37,304 INFO ]: Start accepts. Automaton has 12 states. Word has length 25 [2018-06-22 11:34:37,305 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:37,305 INFO ]: With dead ends: 16 [2018-06-22 11:34:37,305 INFO ]: Without dead ends: 16 [2018-06-22 11:34:37,305 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:34:37,305 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 11:34:37,308 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 11:34:37,308 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 11:34:37,308 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-06-22 11:34:37,308 INFO ]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 25 [2018-06-22 11:34:37,309 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:37,309 INFO ]: Abstraction has 16 states and 18 transitions. [2018-06-22 11:34:37,309 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:34:37,309 INFO ]: Start isEmpty. Operand 16 states and 18 transitions. [2018-06-22 11:34:37,309 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:34:37,309 INFO ]: Found error trace [2018-06-22 11:34:37,309 INFO ]: trace histogram [6, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:37,310 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:37,310 INFO ]: Analyzing trace with hash -1547993151, now seen corresponding path program 6 times [2018-06-22 11:34:37,310 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:37,310 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:37,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:37,311 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:37,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:37,326 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:37,503 INFO ]: Checked inductivity of 51 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:34:37,503 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:37,503 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:34:37,509 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:34:37,528 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 11:34:37,528 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:37,531 INFO ]: Computing forward predicates... [2018-06-22 11:34:37,722 INFO ]: Checked inductivity of 51 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:34:37,753 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:37,753 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-22 11:34:37,753 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:34:37,753 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:34:37,753 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:34:37,753 INFO ]: Start difference. First operand 16 states and 18 transitions. Second operand 12 states. [2018-06-22 11:34:37,895 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:37,895 INFO ]: Finished difference Result 21 states and 26 transitions. [2018-06-22 11:34:37,895 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:34:37,895 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-22 11:34:37,895 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:37,896 INFO ]: With dead ends: 21 [2018-06-22 11:34:37,896 INFO ]: Without dead ends: 21 [2018-06-22 11:34:37,896 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:34:37,896 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:34:37,901 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-22 11:34:37,901 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:34:37,901 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-06-22 11:34:37,901 INFO ]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 29 [2018-06-22 11:34:37,901 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:37,901 INFO ]: Abstraction has 19 states and 24 transitions. [2018-06-22 11:34:37,902 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:34:37,902 INFO ]: Start isEmpty. Operand 19 states and 24 transitions. [2018-06-22 11:34:37,902 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:34:37,903 INFO ]: Found error trace [2018-06-22 11:34:37,903 INFO ]: trace histogram [8, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:37,903 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:37,903 INFO ]: Analyzing trace with hash 1664416453, now seen corresponding path program 7 times [2018-06-22 11:34:37,903 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:37,903 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:37,904 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:37,904 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:37,904 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:37,916 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:38,008 INFO ]: Checked inductivity of 99 backedges. 20 proven. 47 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:34:38,008 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:38,008 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:34:38,015 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:34:38,034 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:38,036 INFO ]: Computing forward predicates... [2018-06-22 11:34:38,083 INFO ]: Checked inductivity of 99 backedges. 20 proven. 44 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-22 11:34:38,102 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:38,102 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 15 [2018-06-22 11:34:38,103 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:34:38,103 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:34:38,103 INFO ]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:34:38,103 INFO ]: Start difference. First operand 19 states and 24 transitions. Second operand 15 states. [2018-06-22 11:34:38,232 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:38,232 INFO ]: Finished difference Result 21 states and 27 transitions. [2018-06-22 11:34:38,232 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:34:38,232 INFO ]: Start accepts. Automaton has 15 states. Word has length 37 [2018-06-22 11:34:38,233 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:38,233 INFO ]: With dead ends: 21 [2018-06-22 11:34:38,233 INFO ]: Without dead ends: 20 [2018-06-22 11:34:38,234 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:34:38,234 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:34:38,238 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-22 11:34:38,239 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:34:38,239 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-06-22 11:34:38,239 INFO ]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 37 [2018-06-22 11:34:38,239 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:38,239 INFO ]: Abstraction has 18 states and 21 transitions. [2018-06-22 11:34:38,239 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:34:38,239 INFO ]: Start isEmpty. Operand 18 states and 21 transitions. [2018-06-22 11:34:38,240 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:34:38,241 INFO ]: Found error trace [2018-06-22 11:34:38,241 INFO ]: trace histogram [8, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:38,241 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:38,241 INFO ]: Analyzing trace with hash -2079229755, now seen corresponding path program 8 times [2018-06-22 11:34:38,241 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:38,241 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:38,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:38,242 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:34:38,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:38,254 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:38,439 INFO ]: Checked inductivity of 99 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 11:34:38,439 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:38,439 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:34:38,448 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:34:38,462 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:34:38,462 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:38,466 INFO ]: Computing forward predicates... [2018-06-22 11:34:38,702 INFO ]: Checked inductivity of 99 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 11:34:38,721 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:38,722 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-22 11:34:38,722 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:34:38,722 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:34:38,722 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:34:38,722 INFO ]: Start difference. First operand 18 states and 21 transitions. Second operand 14 states. [2018-06-22 11:34:39,177 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:39,177 INFO ]: Finished difference Result 23 states and 30 transitions. [2018-06-22 11:34:39,177 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:34:39,177 INFO ]: Start accepts. Automaton has 14 states. Word has length 37 [2018-06-22 11:34:39,177 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:39,178 INFO ]: With dead ends: 23 [2018-06-22 11:34:39,178 INFO ]: Without dead ends: 23 [2018-06-22 11:34:39,178 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 12 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:34:39,179 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:34:39,184 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-22 11:34:39,184 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:34:39,184 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-06-22 11:34:39,185 INFO ]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 37 [2018-06-22 11:34:39,185 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:39,185 INFO ]: Abstraction has 21 states and 28 transitions. [2018-06-22 11:34:39,185 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:34:39,185 INFO ]: Start isEmpty. Operand 21 states and 28 transitions. [2018-06-22 11:34:39,186 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:34:39,186 INFO ]: Found error trace [2018-06-22 11:34:39,186 INFO ]: trace histogram [9, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:39,186 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:39,186 INFO ]: Analyzing trace with hash -1215603001, now seen corresponding path program 9 times [2018-06-22 11:34:39,186 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:39,186 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:39,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:39,187 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:39,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:39,213 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:39,356 INFO ]: Checked inductivity of 129 backedges. 20 proven. 67 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-22 11:34:39,356 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:39,356 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:34:39,363 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:34:39,383 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-22 11:34:39,383 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:39,386 INFO ]: Computing forward predicates... [2018-06-22 11:34:39,436 INFO ]: Checked inductivity of 129 backedges. 20 proven. 64 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 11:34:39,457 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:39,457 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 16 [2018-06-22 11:34:39,457 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:34:39,457 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:34:39,457 INFO ]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:34:39,457 INFO ]: Start difference. First operand 21 states and 28 transitions. Second operand 16 states. [2018-06-22 11:34:39,822 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:39,822 INFO ]: Finished difference Result 23 states and 29 transitions. [2018-06-22 11:34:39,823 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:34:39,823 INFO ]: Start accepts. Automaton has 16 states. Word has length 41 [2018-06-22 11:34:39,824 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:39,824 INFO ]: With dead ends: 23 [2018-06-22 11:34:39,824 INFO ]: Without dead ends: 23 [2018-06-22 11:34:39,825 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:34:39,825 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:34:39,830 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-22 11:34:39,830 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:34:39,830 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-06-22 11:34:39,830 INFO ]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 41 [2018-06-22 11:34:39,831 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:39,831 INFO ]: Abstraction has 21 states and 27 transitions. [2018-06-22 11:34:39,831 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:34:39,831 INFO ]: Start isEmpty. Operand 21 states and 27 transitions. [2018-06-22 11:34:39,831 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:34:39,831 INFO ]: Found error trace [2018-06-22 11:34:39,832 INFO ]: trace histogram [7, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:39,832 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:39,832 INFO ]: Analyzing trace with hash 1617888707, now seen corresponding path program 10 times [2018-06-22 11:34:39,832 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:39,832 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:39,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:39,832 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:39,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:39,852 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:40,117 INFO ]: Checked inductivity of 73 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 11:34:40,117 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:40,117 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:34:40,122 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:34:40,135 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:34:40,135 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:40,137 INFO ]: Computing forward predicates... [2018-06-22 11:34:40,167 INFO ]: Checked inductivity of 73 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:34:40,186 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:40,186 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2018-06-22 11:34:40,186 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:34:40,186 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:34:40,186 INFO ]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:34:40,186 INFO ]: Start difference. First operand 21 states and 27 transitions. Second operand 14 states. [2018-06-22 11:34:40,276 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:40,276 INFO ]: Finished difference Result 21 states and 25 transitions. [2018-06-22 11:34:40,277 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:34:40,277 INFO ]: Start accepts. Automaton has 14 states. Word has length 33 [2018-06-22 11:34:40,277 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:40,277 INFO ]: With dead ends: 21 [2018-06-22 11:34:40,277 INFO ]: Without dead ends: 20 [2018-06-22 11:34:40,278 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:34:40,278 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:34:40,279 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 11:34:40,279 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:34:40,281 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-06-22 11:34:40,281 INFO ]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 33 [2018-06-22 11:34:40,281 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:40,281 INFO ]: Abstraction has 20 states and 23 transitions. [2018-06-22 11:34:40,281 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:34:40,281 INFO ]: Start isEmpty. Operand 20 states and 23 transitions. [2018-06-22 11:34:40,281 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:34:40,281 INFO ]: Found error trace [2018-06-22 11:34:40,281 INFO ]: trace histogram [10, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:40,282 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:40,282 INFO ]: Analyzing trace with hash 474920393, now seen corresponding path program 11 times [2018-06-22 11:34:40,282 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:40,282 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:40,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:40,282 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:40,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:40,301 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:40,478 INFO ]: Checked inductivity of 163 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 11:34:40,478 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:40,499 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:34:40,505 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:34:40,532 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-06-22 11:34:40,532 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:40,537 INFO ]: Computing forward predicates... [2018-06-22 11:34:40,637 INFO ]: Checked inductivity of 163 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 11:34:40,657 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:40,657 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-22 11:34:40,657 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:34:40,657 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:34:40,657 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:34:40,657 INFO ]: Start difference. First operand 20 states and 23 transitions. Second operand 16 states. [2018-06-22 11:34:40,898 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:40,898 INFO ]: Finished difference Result 25 states and 32 transitions. [2018-06-22 11:34:40,898 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:34:40,898 INFO ]: Start accepts. Automaton has 16 states. Word has length 45 [2018-06-22 11:34:40,899 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:40,899 INFO ]: With dead ends: 25 [2018-06-22 11:34:40,899 INFO ]: Without dead ends: 25 [2018-06-22 11:34:40,900 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 15 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:34:40,900 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:34:40,904 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 11:34:40,904 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:34:40,904 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-06-22 11:34:40,904 INFO ]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 45 [2018-06-22 11:34:40,905 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:40,905 INFO ]: Abstraction has 23 states and 30 transitions. [2018-06-22 11:34:40,905 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:34:40,905 INFO ]: Start isEmpty. Operand 23 states and 30 transitions. [2018-06-22 11:34:40,906 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:34:40,906 INFO ]: Found error trace [2018-06-22 11:34:40,906 INFO ]: trace histogram [11, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:40,906 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:40,906 INFO ]: Analyzing trace with hash 1227242955, now seen corresponding path program 12 times [2018-06-22 11:34:40,906 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:40,906 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:40,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:40,907 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:40,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:40,922 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:41,229 INFO ]: Checked inductivity of 201 backedges. 30 proven. 104 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-22 11:34:41,230 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:41,230 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) [2018-06-22 11:34:41,245 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:34:41,273 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-06-22 11:34:41,273 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:41,275 INFO ]: Computing forward predicates... [2018-06-22 11:34:41,317 INFO ]: Checked inductivity of 201 backedges. 30 proven. 100 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-06-22 11:34:41,344 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:41,344 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 18 [2018-06-22 11:34:41,344 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:34:41,344 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:34:41,344 INFO ]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:34:41,344 INFO ]: Start difference. First operand 23 states and 30 transitions. Second operand 18 states. [2018-06-22 11:34:41,481 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:41,481 INFO ]: Finished difference Result 25 states and 31 transitions. [2018-06-22 11:34:41,482 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:34:41,482 INFO ]: Start accepts. Automaton has 18 states. Word has length 49 [2018-06-22 11:34:41,482 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:41,483 INFO ]: With dead ends: 25 [2018-06-22 11:34:41,483 INFO ]: Without dead ends: 25 [2018-06-22 11:34:41,483 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:34:41,483 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:34:41,487 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 11:34:41,487 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:34:41,490 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-06-22 11:34:41,490 INFO ]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 49 [2018-06-22 11:34:41,490 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:41,490 INFO ]: Abstraction has 23 states and 29 transitions. [2018-06-22 11:34:41,490 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:34:41,490 INFO ]: Start isEmpty. Operand 23 states and 29 transitions. [2018-06-22 11:34:41,491 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:34:41,491 INFO ]: Found error trace [2018-06-22 11:34:41,491 INFO ]: trace histogram [9, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:41,491 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:41,491 INFO ]: Analyzing trace with hash 1787601095, now seen corresponding path program 13 times [2018-06-22 11:34:41,491 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:41,491 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:41,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:41,492 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:41,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:41,499 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:41,587 INFO ]: Checked inductivity of 129 backedges. 20 proven. 66 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:34:41,587 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:41,587 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:34:41,599 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:34:41,613 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:41,615 INFO ]: Computing forward predicates... [2018-06-22 11:34:41,729 INFO ]: Checked inductivity of 129 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 11:34:41,760 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:41,760 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 16 [2018-06-22 11:34:41,760 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:34:41,760 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:34:41,760 INFO ]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:34:41,760 INFO ]: Start difference. First operand 23 states and 29 transitions. Second operand 16 states. [2018-06-22 11:34:41,890 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:41,890 INFO ]: Finished difference Result 23 states and 27 transitions. [2018-06-22 11:34:41,890 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:34:41,890 INFO ]: Start accepts. Automaton has 16 states. Word has length 41 [2018-06-22 11:34:41,890 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:41,891 INFO ]: With dead ends: 23 [2018-06-22 11:34:41,891 INFO ]: Without dead ends: 22 [2018-06-22 11:34:41,891 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:34:41,891 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 11:34:41,894 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-22 11:34:41,894 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:34:41,894 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-06-22 11:34:41,894 INFO ]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 41 [2018-06-22 11:34:41,895 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:41,895 INFO ]: Abstraction has 22 states and 25 transitions. [2018-06-22 11:34:41,895 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:34:41,895 INFO ]: Start isEmpty. Operand 22 states and 25 transitions. [2018-06-22 11:34:41,895 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:34:41,895 INFO ]: Found error trace [2018-06-22 11:34:41,895 INFO ]: trace histogram [12, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:41,896 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:41,896 INFO ]: Analyzing trace with hash -215271731, now seen corresponding path program 14 times [2018-06-22 11:34:41,896 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:41,896 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:41,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:41,896 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:34:41,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:41,909 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:42,099 INFO ]: Checked inductivity of 243 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-06-22 11:34:42,100 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:42,100 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:34:42,105 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:34:42,139 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:34:42,139 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:42,141 INFO ]: Computing forward predicates... [2018-06-22 11:34:42,238 INFO ]: Checked inductivity of 243 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-06-22 11:34:42,270 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:42,270 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-22 11:34:42,270 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:34:42,270 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:34:42,270 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:34:42,270 INFO ]: Start difference. First operand 22 states and 25 transitions. Second operand 18 states. [2018-06-22 11:34:42,592 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:42,592 INFO ]: Finished difference Result 27 states and 34 transitions. [2018-06-22 11:34:42,594 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:34:42,594 INFO ]: Start accepts. Automaton has 18 states. Word has length 53 [2018-06-22 11:34:42,594 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:42,594 INFO ]: With dead ends: 27 [2018-06-22 11:34:42,594 INFO ]: Without dead ends: 27 [2018-06-22 11:34:42,595 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 18 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:34:42,595 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:34:42,600 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:34:42,600 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:34:42,600 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-06-22 11:34:42,601 INFO ]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 53 [2018-06-22 11:34:42,601 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:42,601 INFO ]: Abstraction has 25 states and 32 transitions. [2018-06-22 11:34:42,601 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:34:42,601 INFO ]: Start isEmpty. Operand 25 states and 32 transitions. [2018-06-22 11:34:42,603 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:34:42,603 INFO ]: Found error trace [2018-06-22 11:34:42,603 INFO ]: trace histogram [14, 12, 12, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:42,603 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:42,603 INFO ]: Analyzing trace with hash -1932493359, now seen corresponding path program 15 times [2018-06-22 11:34:42,603 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:42,603 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:42,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:42,604 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:42,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:42,613 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:42,895 INFO ]: Checked inductivity of 339 backedges. 56 proven. 167 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-06-22 11:34:42,895 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:42,895 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:34:42,901 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:34:42,932 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-06-22 11:34:42,932 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:42,934 INFO ]: Computing forward predicates... [2018-06-22 11:34:42,981 INFO ]: Checked inductivity of 339 backedges. 56 proven. 161 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-06-22 11:34:43,000 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:43,001 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 21 [2018-06-22 11:34:43,001 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:34:43,001 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:34:43,001 INFO ]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:34:43,001 INFO ]: Start difference. First operand 25 states and 32 transitions. Second operand 21 states. [2018-06-22 11:34:43,207 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:43,207 INFO ]: Finished difference Result 29 states and 37 transitions. [2018-06-22 11:34:43,207 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:34:43,207 INFO ]: Start accepts. Automaton has 21 states. Word has length 61 [2018-06-22 11:34:43,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:43,207 INFO ]: With dead ends: 29 [2018-06-22 11:34:43,207 INFO ]: Without dead ends: 29 [2018-06-22 11:34:43,208 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:34:43,208 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:34:43,211 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-22 11:34:43,211 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:34:43,212 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-06-22 11:34:43,212 INFO ]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 61 [2018-06-22 11:34:43,212 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:43,212 INFO ]: Abstraction has 25 states and 31 transitions. [2018-06-22 11:34:43,212 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:34:43,212 INFO ]: Start isEmpty. Operand 25 states and 31 transitions. [2018-06-22 11:34:43,213 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:34:43,213 INFO ]: Found error trace [2018-06-22 11:34:43,213 INFO ]: trace histogram [11, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:43,213 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:43,213 INFO ]: Analyzing trace with hash -567509045, now seen corresponding path program 16 times [2018-06-22 11:34:43,213 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:43,213 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:43,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:43,214 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:43,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:43,223 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:43,392 INFO ]: Checked inductivity of 201 backedges. 30 proven. 103 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-22 11:34:43,392 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:43,392 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:34:43,398 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:34:43,414 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:34:43,414 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:43,417 INFO ]: Computing forward predicates... [2018-06-22 11:34:43,450 INFO ]: Checked inductivity of 201 backedges. 20 proven. 110 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-06-22 11:34:43,469 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:43,469 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 18 [2018-06-22 11:34:43,469 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:34:43,469 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:34:43,470 INFO ]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:34:43,470 INFO ]: Start difference. First operand 25 states and 31 transitions. Second operand 18 states. [2018-06-22 11:34:43,586 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:43,586 INFO ]: Finished difference Result 25 states and 29 transitions. [2018-06-22 11:34:43,587 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:34:43,587 INFO ]: Start accepts. Automaton has 18 states. Word has length 49 [2018-06-22 11:34:43,587 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:43,587 INFO ]: With dead ends: 25 [2018-06-22 11:34:43,587 INFO ]: Without dead ends: 24 [2018-06-22 11:34:43,587 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:34:43,587 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:34:43,589 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-22 11:34:43,589 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:34:43,590 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-06-22 11:34:43,590 INFO ]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 49 [2018-06-22 11:34:43,590 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:43,590 INFO ]: Abstraction has 24 states and 27 transitions. [2018-06-22 11:34:43,590 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:34:43,590 INFO ]: Start isEmpty. Operand 24 states and 27 transitions. [2018-06-22 11:34:43,591 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:34:43,591 INFO ]: Found error trace [2018-06-22 11:34:43,591 INFO ]: trace histogram [14, 12, 12, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:43,591 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:43,591 INFO ]: Analyzing trace with hash -1830880303, now seen corresponding path program 17 times [2018-06-22 11:34:43,591 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:43,591 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:43,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:43,592 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:43,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:43,602 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:43,969 INFO ]: Checked inductivity of 339 backedges. 0 proven. 218 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-06-22 11:34:43,969 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:43,969 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:34:43,975 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:34:44,005 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2018-06-22 11:34:44,005 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:44,008 INFO ]: Computing forward predicates... [2018-06-22 11:34:44,137 INFO ]: Checked inductivity of 339 backedges. 0 proven. 218 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-06-22 11:34:44,171 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:44,171 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-22 11:34:44,171 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:34:44,171 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:34:44,172 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:34:44,172 INFO ]: Start difference. First operand 24 states and 27 transitions. Second operand 20 states. [2018-06-22 11:34:44,555 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:44,555 INFO ]: Finished difference Result 29 states and 36 transitions. [2018-06-22 11:34:44,555 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:34:44,555 INFO ]: Start accepts. Automaton has 20 states. Word has length 61 [2018-06-22 11:34:44,555 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:44,555 INFO ]: With dead ends: 29 [2018-06-22 11:34:44,556 INFO ]: Without dead ends: 29 [2018-06-22 11:34:44,556 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 51 SyntacticMatches, 21 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:34:44,556 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:34:44,560 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-22 11:34:44,560 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:34:44,560 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2018-06-22 11:34:44,560 INFO ]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 61 [2018-06-22 11:34:44,561 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:44,561 INFO ]: Abstraction has 27 states and 34 transitions. [2018-06-22 11:34:44,561 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:34:44,561 INFO ]: Start isEmpty. Operand 27 states and 34 transitions. [2018-06-22 11:34:44,561 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:34:44,561 INFO ]: Found error trace [2018-06-22 11:34:44,561 INFO ]: trace histogram [16, 14, 14, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:44,562 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:44,562 INFO ]: Analyzing trace with hash -953055531, now seen corresponding path program 18 times [2018-06-22 11:34:44,562 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:44,562 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:44,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:44,562 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:44,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:44,573 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:45,272 INFO ]: Checked inductivity of 451 backedges. 72 proven. 223 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-06-22 11:34:45,273 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:45,273 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:34:45,278 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:34:45,342 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-06-22 11:34:45,342 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:45,345 INFO ]: Computing forward predicates... [2018-06-22 11:34:45,417 INFO ]: Checked inductivity of 451 backedges. 72 proven. 216 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-06-22 11:34:45,440 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:45,440 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 23 [2018-06-22 11:34:45,440 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:34:45,440 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:34:45,440 INFO ]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:34:45,441 INFO ]: Start difference. First operand 27 states and 34 transitions. Second operand 23 states. [2018-06-22 11:34:45,607 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:45,607 INFO ]: Finished difference Result 31 states and 39 transitions. [2018-06-22 11:34:45,607 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:34:45,607 INFO ]: Start accepts. Automaton has 23 states. Word has length 69 [2018-06-22 11:34:45,608 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:45,608 INFO ]: With dead ends: 31 [2018-06-22 11:34:45,608 INFO ]: Without dead ends: 31 [2018-06-22 11:34:45,608 INFO ]: 0 DeclaredPredicates, 111 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:34:45,608 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:34:45,612 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 11:34:45,612 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:34:45,612 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-06-22 11:34:45,612 INFO ]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 69 [2018-06-22 11:34:45,612 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:45,612 INFO ]: Abstraction has 27 states and 33 transitions. [2018-06-22 11:34:45,612 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:34:45,612 INFO ]: Start isEmpty. Operand 27 states and 33 transitions. [2018-06-22 11:34:45,613 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:34:45,613 INFO ]: Found error trace [2018-06-22 11:34:45,613 INFO ]: trace histogram [13, 11, 11, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:45,613 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:45,613 INFO ]: Analyzing trace with hash 2101781199, now seen corresponding path program 19 times [2018-06-22 11:34:45,613 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:45,613 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:45,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:45,614 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:45,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:45,622 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:45,797 INFO ]: Checked inductivity of 289 backedges. 42 proven. 148 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-06-22 11:34:45,797 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:45,797 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:34:45,803 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:34:45,822 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:45,824 INFO ]: Computing forward predicates... [2018-06-22 11:34:45,867 INFO ]: Checked inductivity of 289 backedges. 30 proven. 156 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-06-22 11:34:45,896 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:45,896 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 20 [2018-06-22 11:34:45,897 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:34:45,897 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:34:45,897 INFO ]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:34:45,897 INFO ]: Start difference. First operand 27 states and 33 transitions. Second operand 20 states. [2018-06-22 11:34:46,153 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:46,153 INFO ]: Finished difference Result 27 states and 31 transitions. [2018-06-22 11:34:46,153 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:34:46,153 INFO ]: Start accepts. Automaton has 20 states. Word has length 57 [2018-06-22 11:34:46,153 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:46,154 INFO ]: With dead ends: 27 [2018-06-22 11:34:46,154 INFO ]: Without dead ends: 26 [2018-06-22 11:34:46,154 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:34:46,154 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:34:46,157 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-22 11:34:46,157 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:34:46,158 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-06-22 11:34:46,158 INFO ]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 57 [2018-06-22 11:34:46,158 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:46,158 INFO ]: Abstraction has 26 states and 29 transitions. [2018-06-22 11:34:46,158 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:34:46,158 INFO ]: Start isEmpty. Operand 26 states and 29 transitions. [2018-06-22 11:34:46,158 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:34:46,158 INFO ]: Found error trace [2018-06-22 11:34:46,158 INFO ]: trace histogram [15, 13, 13, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:46,158 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:46,158 INFO ]: Analyzing trace with hash 491981267, now seen corresponding path program 20 times [2018-06-22 11:34:46,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:46,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:46,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:46,159 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:34:46,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:46,168 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:46,356 INFO ]: Checked inductivity of 393 backedges. 56 proven. 201 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-06-22 11:34:46,356 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:46,356 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:34:46,364 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:34:46,386 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:34:46,386 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:46,389 INFO ]: Computing forward predicates... [2018-06-22 11:34:46,447 INFO ]: Checked inductivity of 393 backedges. 42 proven. 210 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-06-22 11:34:46,466 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:46,466 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 22 [2018-06-22 11:34:46,467 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:34:46,467 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:34:46,467 INFO ]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:34:46,467 INFO ]: Start difference. First operand 26 states and 29 transitions. Second operand 22 states. [2018-06-22 11:34:46,639 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:46,640 INFO ]: Finished difference Result 26 states and 28 transitions. [2018-06-22 11:34:46,642 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:34:46,642 INFO ]: Start accepts. Automaton has 22 states. Word has length 65 [2018-06-22 11:34:46,642 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:46,642 INFO ]: With dead ends: 26 [2018-06-22 11:34:46,642 INFO ]: Without dead ends: 26 [2018-06-22 11:34:46,643 INFO ]: 0 DeclaredPredicates, 104 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:34:46,643 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:34:46,645 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-22 11:34:46,645 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:34:46,645 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-06-22 11:34:46,646 INFO ]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 65 [2018-06-22 11:34:46,646 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:46,646 INFO ]: Abstraction has 26 states and 28 transitions. [2018-06-22 11:34:46,646 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:34:46,646 INFO ]: Start isEmpty. Operand 26 states and 28 transitions. [2018-06-22 11:34:46,646 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:34:46,647 INFO ]: Found error trace [2018-06-22 11:34:46,647 INFO ]: trace histogram [16, 14, 14, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:46,647 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:46,647 INFO ]: Analyzing trace with hash -920517419, now seen corresponding path program 21 times [2018-06-22 11:34:46,647 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:46,647 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:46,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:46,647 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:46,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:46,660 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:46,967 INFO ]: Checked inductivity of 451 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-06-22 11:34:46,967 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:46,967 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-22 11:34:46,972 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:34:47,003 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-06-22 11:34:47,003 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:47,006 INFO ]: Computing forward predicates... [2018-06-22 11:34:47,268 INFO ]: Checked inductivity of 451 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-06-22 11:34:47,295 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:47,295 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-06-22 11:34:47,295 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:34:47,296 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:34:47,296 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:34:47,296 INFO ]: Start difference. First operand 26 states and 28 transitions. Second operand 22 states. [2018-06-22 11:34:47,666 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:47,667 INFO ]: Finished difference Result 31 states and 36 transitions. [2018-06-22 11:34:47,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:34:47,667 INFO ]: Start accepts. Automaton has 22 states. Word has length 69 [2018-06-22 11:34:47,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:47,667 INFO ]: With dead ends: 31 [2018-06-22 11:34:47,667 INFO ]: Without dead ends: 31 [2018-06-22 11:34:47,668 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 58 SyntacticMatches, 24 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:34:47,668 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:34:47,672 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-06-22 11:34:47,672 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:34:47,675 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-06-22 11:34:47,675 INFO ]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 69 [2018-06-22 11:34:47,675 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:47,675 INFO ]: Abstraction has 29 states and 34 transitions. [2018-06-22 11:34:47,675 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:34:47,675 INFO ]: Start isEmpty. Operand 29 states and 34 transitions. [2018-06-22 11:34:47,676 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 11:34:47,676 INFO ]: Found error trace [2018-06-22 11:34:47,676 INFO ]: trace histogram [17, 15, 15, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:47,676 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:47,676 INFO ]: Analyzing trace with hash -2076151081, now seen corresponding path program 22 times [2018-06-22 11:34:47,676 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:47,676 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:47,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:47,676 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:47,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:47,692 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:48,569 INFO ]: Checked inductivity of 513 backedges. 72 proven. 263 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-06-22 11:34:48,569 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:48,569 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-22 11:34:48,575 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:34:48,612 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:34:48,612 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:48,615 INFO ]: Computing forward predicates... [2018-06-22 11:34:48,677 INFO ]: Checked inductivity of 513 backedges. 72 proven. 256 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-06-22 11:34:48,696 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:48,696 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 24 [2018-06-22 11:34:48,696 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:34:48,696 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:34:48,697 INFO ]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:34:48,697 INFO ]: Start difference. First operand 29 states and 34 transitions. Second operand 24 states. [2018-06-22 11:34:48,876 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:48,876 INFO ]: Finished difference Result 29 states and 33 transitions. [2018-06-22 11:34:48,876 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:34:48,876 INFO ]: Start accepts. Automaton has 24 states. Word has length 73 [2018-06-22 11:34:48,876 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:48,876 INFO ]: With dead ends: 29 [2018-06-22 11:34:48,876 INFO ]: Without dead ends: 28 [2018-06-22 11:34:48,877 INFO ]: 0 DeclaredPredicates, 117 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=255, Invalid=867, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:34:48,877 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:34:48,879 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-22 11:34:48,879 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:34:48,880 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-06-22 11:34:48,880 INFO ]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 73 [2018-06-22 11:34:48,880 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:48,880 INFO ]: Abstraction has 28 states and 31 transitions. [2018-06-22 11:34:48,880 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:34:48,880 INFO ]: Start isEmpty. Operand 28 states and 31 transitions. [2018-06-22 11:34:48,881 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:34:48,881 INFO ]: Found error trace [2018-06-22 11:34:48,881 INFO ]: trace histogram [18, 16, 16, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:48,881 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:48,881 INFO ]: Analyzing trace with hash -416525863, now seen corresponding path program 23 times [2018-06-22 11:34:48,881 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:48,881 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:48,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:48,881 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:48,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:48,894 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:49,209 INFO ]: Checked inductivity of 579 backedges. 0 proven. 370 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-06-22 11:34:49,209 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:49,209 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-22 11:34:49,215 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:34:49,257 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2018-06-22 11:34:49,257 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:49,260 INFO ]: Computing forward predicates... [2018-06-22 11:34:49,463 INFO ]: Checked inductivity of 579 backedges. 0 proven. 370 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-06-22 11:34:49,483 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:49,483 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-06-22 11:34:49,484 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:34:49,484 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:34:49,484 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:34:49,484 INFO ]: Start difference. First operand 28 states and 31 transitions. Second operand 24 states. [2018-06-22 11:34:49,868 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:49,868 INFO ]: Finished difference Result 33 states and 40 transitions. [2018-06-22 11:34:49,868 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:34:49,868 INFO ]: Start accepts. Automaton has 24 states. Word has length 77 [2018-06-22 11:34:49,868 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:49,868 INFO ]: With dead ends: 33 [2018-06-22 11:34:49,868 INFO ]: Without dead ends: 33 [2018-06-22 11:34:49,869 INFO ]: 0 DeclaredPredicates, 125 GetRequests, 65 SyntacticMatches, 27 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=1077, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:34:49,869 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:34:49,875 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-06-22 11:34:49,875 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:34:49,875 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-06-22 11:34:49,876 INFO ]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 77 [2018-06-22 11:34:49,876 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:49,876 INFO ]: Abstraction has 31 states and 38 transitions. [2018-06-22 11:34:49,876 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:34:49,876 INFO ]: Start isEmpty. Operand 31 states and 38 transitions. [2018-06-22 11:34:49,876 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 11:34:49,876 INFO ]: Found error trace [2018-06-22 11:34:49,877 INFO ]: trace histogram [19, 17, 17, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:49,877 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:49,877 INFO ]: Analyzing trace with hash -123969061, now seen corresponding path program 24 times [2018-06-22 11:34:49,877 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:49,877 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:49,878 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:49,878 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:49,878 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:49,890 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:50,312 INFO ]: Checked inductivity of 649 backedges. 90 proven. 332 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2018-06-22 11:34:50,312 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:50,312 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-22 11:34:50,317 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:34:50,362 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-06-22 11:34:50,363 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:50,365 INFO ]: Computing forward predicates... [2018-06-22 11:34:50,410 INFO ]: Checked inductivity of 649 backedges. 90 proven. 324 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-06-22 11:34:50,428 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:50,428 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 26 [2018-06-22 11:34:50,428 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:34:50,428 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:34:50,428 INFO ]: CoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:34:50,428 INFO ]: Start difference. First operand 31 states and 38 transitions. Second operand 26 states. [2018-06-22 11:34:50,656 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:50,656 INFO ]: Finished difference Result 33 states and 39 transitions. [2018-06-22 11:34:50,656 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:34:50,656 INFO ]: Start accepts. Automaton has 26 states. Word has length 81 [2018-06-22 11:34:50,656 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:50,657 INFO ]: With dead ends: 33 [2018-06-22 11:34:50,657 INFO ]: Without dead ends: 33 [2018-06-22 11:34:50,657 INFO ]: 0 DeclaredPredicates, 130 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=302, Invalid=1030, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:34:50,657 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:34:50,659 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-06-22 11:34:50,659 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:34:50,660 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-06-22 11:34:50,660 INFO ]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 81 [2018-06-22 11:34:50,660 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:50,660 INFO ]: Abstraction has 31 states and 37 transitions. [2018-06-22 11:34:50,660 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:34:50,660 INFO ]: Start isEmpty. Operand 31 states and 37 transitions. [2018-06-22 11:34:50,660 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 11:34:50,660 INFO ]: Found error trace [2018-06-22 11:34:50,660 INFO ]: trace histogram [17, 15, 15, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:50,661 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:50,661 INFO ]: Analyzing trace with hash -414599977, now seen corresponding path program 25 times [2018-06-22 11:34:50,661 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:50,661 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:50,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:50,661 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:50,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:50,670 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:50,908 INFO ]: Checked inductivity of 513 backedges. 72 proven. 262 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-06-22 11:34:50,908 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:50,908 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-22 11:34:50,914 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:34:50,938 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:50,941 INFO ]: Computing forward predicates... [2018-06-22 11:34:50,970 INFO ]: Checked inductivity of 513 backedges. 56 proven. 272 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-06-22 11:34:50,989 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:50,989 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 24 [2018-06-22 11:34:50,989 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:34:50,989 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:34:50,990 INFO ]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:34:50,990 INFO ]: Start difference. First operand 31 states and 37 transitions. Second operand 24 states. [2018-06-22 11:34:51,180 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:51,180 INFO ]: Finished difference Result 31 states and 35 transitions. [2018-06-22 11:34:51,181 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:34:51,181 INFO ]: Start accepts. Automaton has 24 states. Word has length 73 [2018-06-22 11:34:51,181 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:51,181 INFO ]: With dead ends: 31 [2018-06-22 11:34:51,181 INFO ]: Without dead ends: 30 [2018-06-22 11:34:51,181 INFO ]: 0 DeclaredPredicates, 117 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=874, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:34:51,181 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:34:51,183 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 11:34:51,183 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:34:51,183 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-06-22 11:34:51,184 INFO ]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 73 [2018-06-22 11:34:51,184 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:51,184 INFO ]: Abstraction has 30 states and 33 transitions. [2018-06-22 11:34:51,184 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:34:51,184 INFO ]: Start isEmpty. Operand 30 states and 33 transitions. [2018-06-22 11:34:51,184 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:34:51,184 INFO ]: Found error trace [2018-06-22 11:34:51,184 INFO ]: trace histogram [20, 18, 18, 18, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:51,184 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:51,185 INFO ]: Analyzing trace with hash 28697309, now seen corresponding path program 26 times [2018-06-22 11:34:51,185 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:51,185 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:51,185 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:51,185 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:34:51,185 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:51,196 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:51,718 INFO ]: Checked inductivity of 723 backedges. 0 proven. 461 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-06-22 11:34:51,718 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:51,718 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-22 11:34:51,724 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:34:51,753 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:34:51,753 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:51,757 INFO ]: Computing forward predicates... [2018-06-22 11:34:51,960 INFO ]: Checked inductivity of 723 backedges. 0 proven. 461 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-06-22 11:34:51,993 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:51,993 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-06-22 11:34:51,993 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:34:51,993 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:34:51,994 INFO ]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:34:51,994 INFO ]: Start difference. First operand 30 states and 33 transitions. Second operand 26 states. [2018-06-22 11:34:53,038 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:53,038 INFO ]: Finished difference Result 35 states and 42 transitions. [2018-06-22 11:34:53,038 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:34:53,038 INFO ]: Start accepts. Automaton has 26 states. Word has length 85 [2018-06-22 11:34:53,038 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:53,038 INFO ]: With dead ends: 35 [2018-06-22 11:34:53,038 INFO ]: Without dead ends: 35 [2018-06-22 11:34:53,039 INFO ]: 0 DeclaredPredicates, 138 GetRequests, 72 SyntacticMatches, 30 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=124, Invalid=1282, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:34:53,039 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:34:53,041 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 11:34:53,042 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:34:53,042 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-06-22 11:34:53,042 INFO ]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 85 [2018-06-22 11:34:53,042 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:53,042 INFO ]: Abstraction has 33 states and 40 transitions. [2018-06-22 11:34:53,042 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:34:53,042 INFO ]: Start isEmpty. Operand 33 states and 40 transitions. [2018-06-22 11:34:53,043 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 11:34:53,043 INFO ]: Found error trace [2018-06-22 11:34:53,043 INFO ]: trace histogram [21, 19, 19, 19, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:53,043 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:53,043 INFO ]: Analyzing trace with hash 1834259679, now seen corresponding path program 27 times [2018-06-22 11:34:53,043 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:53,043 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:53,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:53,044 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:53,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:53,054 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:53,987 INFO ]: Checked inductivity of 801 backedges. 110 proven. 409 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-06-22 11:34:53,987 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:53,987 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-22 11:34:53,994 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:34:54,140 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-06-22 11:34:54,140 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:54,144 INFO ]: Computing forward predicates... [2018-06-22 11:34:54,225 INFO ]: Checked inductivity of 801 backedges. 110 proven. 400 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-06-22 11:34:54,253 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:54,253 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 28 [2018-06-22 11:34:54,253 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:34:54,253 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:34:54,254 INFO ]: CoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:34:54,254 INFO ]: Start difference. First operand 33 states and 40 transitions. Second operand 28 states. [2018-06-22 11:34:54,746 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:54,746 INFO ]: Finished difference Result 35 states and 41 transitions. [2018-06-22 11:34:54,746 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:34:54,746 INFO ]: Start accepts. Automaton has 28 states. Word has length 89 [2018-06-22 11:34:54,746 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:54,746 INFO ]: With dead ends: 35 [2018-06-22 11:34:54,746 INFO ]: Without dead ends: 35 [2018-06-22 11:34:54,747 INFO ]: 0 DeclaredPredicates, 143 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=353, Invalid=1207, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:34:54,747 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:34:54,750 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 11:34:54,750 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:34:54,750 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-06-22 11:34:54,750 INFO ]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 89 [2018-06-22 11:34:54,750 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:54,750 INFO ]: Abstraction has 33 states and 39 transitions. [2018-06-22 11:34:54,750 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:34:54,750 INFO ]: Start isEmpty. Operand 33 states and 39 transitions. [2018-06-22 11:34:54,751 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 11:34:54,751 INFO ]: Found error trace [2018-06-22 11:34:54,751 INFO ]: trace histogram [19, 17, 17, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:54,751 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:54,751 INFO ]: Analyzing trace with hash -1750948901, now seen corresponding path program 28 times [2018-06-22 11:34:54,751 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:54,751 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:54,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:54,752 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:54,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:54,762 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:55,219 INFO ]: Checked inductivity of 649 backedges. 90 proven. 331 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-06-22 11:34:55,219 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:55,219 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-22 11:34:55,227 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:34:55,254 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:34:55,254 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:55,257 INFO ]: Computing forward predicates... [2018-06-22 11:34:55,307 INFO ]: Checked inductivity of 649 backedges. 72 proven. 342 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-06-22 11:34:55,338 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:55,338 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 26 [2018-06-22 11:34:55,338 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:34:55,338 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:34:55,338 INFO ]: CoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:34:55,338 INFO ]: Start difference. First operand 33 states and 39 transitions. Second operand 26 states. [2018-06-22 11:34:55,825 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:55,825 INFO ]: Finished difference Result 33 states and 37 transitions. [2018-06-22 11:34:55,845 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:34:55,845 INFO ]: Start accepts. Automaton has 26 states. Word has length 81 [2018-06-22 11:34:55,845 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:55,846 INFO ]: With dead ends: 33 [2018-06-22 11:34:55,846 INFO ]: Without dead ends: 32 [2018-06-22 11:34:55,846 INFO ]: 0 DeclaredPredicates, 130 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=294, Invalid=1038, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:34:55,847 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:34:55,848 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-22 11:34:55,849 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:34:55,849 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-06-22 11:34:55,849 INFO ]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 81 [2018-06-22 11:34:55,849 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:55,849 INFO ]: Abstraction has 32 states and 35 transitions. [2018-06-22 11:34:55,849 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:34:55,849 INFO ]: Start isEmpty. Operand 32 states and 35 transitions. [2018-06-22 11:34:55,851 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 11:34:55,851 INFO ]: Found error trace [2018-06-22 11:34:55,851 INFO ]: trace histogram [22, 20, 20, 20, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:55,852 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:55,852 INFO ]: Analyzing trace with hash 821475297, now seen corresponding path program 29 times [2018-06-22 11:34:55,852 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:55,852 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:55,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:55,852 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:55,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:55,864 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:56,479 INFO ]: Checked inductivity of 883 backedges. 0 proven. 562 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-06-22 11:34:56,479 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:56,479 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-22 11:34:56,485 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:34:56,535 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2018-06-22 11:34:56,535 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:56,538 INFO ]: Computing forward predicates... [2018-06-22 11:34:56,834 INFO ]: Checked inductivity of 883 backedges. 0 proven. 562 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-06-22 11:34:56,868 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:56,868 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-06-22 11:34:56,868 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:34:56,868 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:34:56,868 INFO ]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:34:56,868 INFO ]: Start difference. First operand 32 states and 35 transitions. Second operand 28 states. [2018-06-22 11:34:57,634 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:57,634 INFO ]: Finished difference Result 37 states and 44 transitions. [2018-06-22 11:34:57,635 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:34:57,635 INFO ]: Start accepts. Automaton has 28 states. Word has length 93 [2018-06-22 11:34:57,635 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:57,635 INFO ]: With dead ends: 37 [2018-06-22 11:34:57,635 INFO ]: Without dead ends: 37 [2018-06-22 11:34:57,635 INFO ]: 0 DeclaredPredicates, 151 GetRequests, 79 SyntacticMatches, 33 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=135, Invalid=1505, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:34:57,636 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:34:57,638 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-06-22 11:34:57,638 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:34:57,638 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-06-22 11:34:57,638 INFO ]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 93 [2018-06-22 11:34:57,638 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:57,638 INFO ]: Abstraction has 35 states and 42 transitions. [2018-06-22 11:34:57,639 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:34:57,639 INFO ]: Start isEmpty. Operand 35 states and 42 transitions. [2018-06-22 11:34:57,639 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 11:34:57,639 INFO ]: Found error trace [2018-06-22 11:34:57,639 INFO ]: trace histogram [23, 21, 21, 21, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:57,641 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:57,641 INFO ]: Analyzing trace with hash 1390480355, now seen corresponding path program 30 times [2018-06-22 11:34:57,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:57,641 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:57,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:57,641 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:57,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:57,650 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:57,991 INFO ]: Checked inductivity of 969 backedges. 132 proven. 494 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-06-22 11:34:57,992 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:57,992 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-22 11:34:57,997 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:34:58,062 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2018-06-22 11:34:58,062 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:58,066 INFO ]: Computing forward predicates... [2018-06-22 11:34:58,188 INFO ]: Checked inductivity of 969 backedges. 132 proven. 484 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2018-06-22 11:34:58,207 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:58,208 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 30 [2018-06-22 11:34:58,208 INFO ]: Interpolant automaton has 30 states [2018-06-22 11:34:58,208 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 11:34:58,208 INFO ]: CoverageRelationStatistics Valid=190, Invalid=680, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:34:58,208 INFO ]: Start difference. First operand 35 states and 42 transitions. Second operand 30 states. [2018-06-22 11:34:58,548 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:58,548 INFO ]: Finished difference Result 37 states and 43 transitions. [2018-06-22 11:34:58,549 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:34:58,549 INFO ]: Start accepts. Automaton has 30 states. Word has length 97 [2018-06-22 11:34:58,549 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:58,549 INFO ]: With dead ends: 37 [2018-06-22 11:34:58,549 INFO ]: Without dead ends: 37 [2018-06-22 11:34:58,550 INFO ]: 0 DeclaredPredicates, 156 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=408, Invalid=1398, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:34:58,550 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:34:58,552 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-06-22 11:34:58,552 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:34:58,552 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-06-22 11:34:58,552 INFO ]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 97 [2018-06-22 11:34:58,553 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:58,553 INFO ]: Abstraction has 35 states and 41 transitions. [2018-06-22 11:34:58,553 INFO ]: Interpolant automaton has 30 states. [2018-06-22 11:34:58,553 INFO ]: Start isEmpty. Operand 35 states and 41 transitions. [2018-06-22 11:34:58,553 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 11:34:58,553 INFO ]: Found error trace [2018-06-22 11:34:58,553 INFO ]: trace histogram [21, 19, 19, 19, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:58,553 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:58,553 INFO ]: Analyzing trace with hash -1101670689, now seen corresponding path program 31 times [2018-06-22 11:34:58,553 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:58,553 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:58,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:58,554 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:34:58,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:58,564 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:59,230 INFO ]: Checked inductivity of 801 backedges. 110 proven. 408 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2018-06-22 11:34:59,230 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:34:59,230 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-22 11:34:59,235 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:34:59,287 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:34:59,291 INFO ]: Computing forward predicates... [2018-06-22 11:34:59,438 INFO ]: Checked inductivity of 801 backedges. 90 proven. 420 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-06-22 11:34:59,469 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:34:59,469 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 28 [2018-06-22 11:34:59,469 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:34:59,469 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:34:59,469 INFO ]: CoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:34:59,469 INFO ]: Start difference. First operand 35 states and 41 transitions. Second operand 28 states. [2018-06-22 11:34:59,813 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:34:59,813 INFO ]: Finished difference Result 35 states and 39 transitions. [2018-06-22 11:34:59,814 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:34:59,814 INFO ]: Start accepts. Automaton has 28 states. Word has length 89 [2018-06-22 11:34:59,814 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:34:59,814 INFO ]: With dead ends: 35 [2018-06-22 11:34:59,814 INFO ]: Without dead ends: 34 [2018-06-22 11:34:59,815 INFO ]: 0 DeclaredPredicates, 143 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=344, Invalid=1216, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:34:59,815 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:34:59,816 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-22 11:34:59,816 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:34:59,816 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-06-22 11:34:59,816 INFO ]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 89 [2018-06-22 11:34:59,817 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:34:59,817 INFO ]: Abstraction has 34 states and 37 transitions. [2018-06-22 11:34:59,817 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:34:59,817 INFO ]: Start isEmpty. Operand 34 states and 37 transitions. [2018-06-22 11:34:59,817 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 11:34:59,817 INFO ]: Found error trace [2018-06-22 11:34:59,817 INFO ]: trace histogram [24, 22, 22, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:34:59,817 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:34:59,817 INFO ]: Analyzing trace with hash -794373915, now seen corresponding path program 32 times [2018-06-22 11:34:59,817 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:34:59,817 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:34:59,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:59,818 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:34:59,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:34:59,829 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:00,571 INFO ]: Checked inductivity of 1059 backedges. 0 proven. 673 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2018-06-22 11:35:00,571 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:35:00,571 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-22 11:35:00,576 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:35:00,630 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:35:00,630 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:00,634 INFO ]: Computing forward predicates... [2018-06-22 11:35:00,862 INFO ]: Checked inductivity of 1059 backedges. 0 proven. 673 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2018-06-22 11:35:00,882 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:35:00,882 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-06-22 11:35:00,882 INFO ]: Interpolant automaton has 30 states [2018-06-22 11:35:00,882 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 11:35:00,882 INFO ]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:35:00,883 INFO ]: Start difference. First operand 34 states and 37 transitions. Second operand 30 states. [2018-06-22 11:35:01,283 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 11:35:01,737 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:35:01,737 INFO ]: Finished difference Result 39 states and 46 transitions. [2018-06-22 11:35:01,737 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:35:01,737 INFO ]: Start accepts. Automaton has 30 states. Word has length 101 [2018-06-22 11:35:01,737 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:35:01,737 INFO ]: With dead ends: 39 [2018-06-22 11:35:01,737 INFO ]: Without dead ends: 39 [2018-06-22 11:35:01,738 INFO ]: 0 DeclaredPredicates, 164 GetRequests, 86 SyntacticMatches, 36 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=146, Invalid=1746, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 11:35:01,738 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:35:01,741 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-06-22 11:35:01,741 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:35:01,741 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-06-22 11:35:01,741 INFO ]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 101 [2018-06-22 11:35:01,741 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:35:01,741 INFO ]: Abstraction has 37 states and 44 transitions. [2018-06-22 11:35:01,741 INFO ]: Interpolant automaton has 30 states. [2018-06-22 11:35:01,741 INFO ]: Start isEmpty. Operand 37 states and 44 transitions. [2018-06-22 11:35:01,744 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 11:35:01,744 INFO ]: Found error trace [2018-06-22 11:35:01,744 INFO ]: trace histogram [25, 23, 23, 23, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:35:01,744 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:35:01,744 INFO ]: Analyzing trace with hash -1925593369, now seen corresponding path program 33 times [2018-06-22 11:35:01,744 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:35:01,744 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:35:01,745 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:01,745 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:35:01,745 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:01,756 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:02,268 INFO ]: Checked inductivity of 1153 backedges. 156 proven. 587 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2018-06-22 11:35:02,269 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:35:02,269 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) [2018-06-22 11:35:02,282 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:35:02,336 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-06-22 11:35:02,336 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:02,339 INFO ]: Computing forward predicates... [2018-06-22 11:35:02,377 INFO ]: Checked inductivity of 1153 backedges. 156 proven. 576 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2018-06-22 11:35:02,396 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:35:02,397 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 32 [2018-06-22 11:35:02,397 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:35:02,397 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:35:02,397 INFO ]: CoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:35:02,397 INFO ]: Start difference. First operand 37 states and 44 transitions. Second operand 32 states. [2018-06-22 11:35:03,010 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:35:03,010 INFO ]: Finished difference Result 39 states and 45 transitions. [2018-06-22 11:35:03,011 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:35:03,011 INFO ]: Start accepts. Automaton has 32 states. Word has length 105 [2018-06-22 11:35:03,011 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:35:03,011 INFO ]: With dead ends: 39 [2018-06-22 11:35:03,011 INFO ]: Without dead ends: 39 [2018-06-22 11:35:03,012 INFO ]: 0 DeclaredPredicates, 169 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=467, Invalid=1603, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:35:03,012 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:35:03,014 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-06-22 11:35:03,014 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:35:03,015 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-06-22 11:35:03,015 INFO ]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 105 [2018-06-22 11:35:03,015 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:35:03,015 INFO ]: Abstraction has 37 states and 43 transitions. [2018-06-22 11:35:03,015 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:35:03,015 INFO ]: Start isEmpty. Operand 37 states and 43 transitions. [2018-06-22 11:35:03,016 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 11:35:03,016 INFO ]: Found error trace [2018-06-22 11:35:03,016 INFO ]: trace histogram [23, 21, 21, 21, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:35:03,016 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:35:03,016 INFO ]: Analyzing trace with hash -19182109, now seen corresponding path program 34 times [2018-06-22 11:35:03,016 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:35:03,016 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:35:03,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:03,017 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:35:03,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:03,028 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:03,503 INFO ]: Checked inductivity of 969 backedges. 132 proven. 493 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2018-06-22 11:35:03,503 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:35:03,503 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-22 11:35:03,510 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:35:03,542 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:35:03,542 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:03,545 INFO ]: Computing forward predicates... [2018-06-22 11:35:03,592 INFO ]: Checked inductivity of 969 backedges. 110 proven. 506 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2018-06-22 11:35:03,613 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:35:03,613 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 30 [2018-06-22 11:35:03,613 INFO ]: Interpolant automaton has 30 states [2018-06-22 11:35:03,614 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 11:35:03,614 INFO ]: CoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:35:03,614 INFO ]: Start difference. First operand 37 states and 43 transitions. Second operand 30 states. [2018-06-22 11:35:03,848 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:35:03,848 INFO ]: Finished difference Result 37 states and 41 transitions. [2018-06-22 11:35:03,849 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:35:03,849 INFO ]: Start accepts. Automaton has 30 states. Word has length 97 [2018-06-22 11:35:03,849 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:35:03,850 INFO ]: With dead ends: 37 [2018-06-22 11:35:03,850 INFO ]: Without dead ends: 36 [2018-06-22 11:35:03,850 INFO ]: 0 DeclaredPredicates, 156 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=398, Invalid=1408, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:35:03,850 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:35:03,851 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 11:35:03,851 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:35:03,851 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-06-22 11:35:03,851 INFO ]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 97 [2018-06-22 11:35:03,852 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:35:03,852 INFO ]: Abstraction has 36 states and 39 transitions. [2018-06-22 11:35:03,852 INFO ]: Interpolant automaton has 30 states. [2018-06-22 11:35:03,852 INFO ]: Start isEmpty. Operand 36 states and 39 transitions. [2018-06-22 11:35:03,852 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 11:35:03,852 INFO ]: Found error trace [2018-06-22 11:35:03,852 INFO ]: trace histogram [26, 24, 24, 24, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:35:03,852 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:35:03,852 INFO ]: Analyzing trace with hash -1073861143, now seen corresponding path program 35 times [2018-06-22 11:35:03,852 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:35:03,852 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:35:03,853 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:03,853 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:35:03,853 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:03,863 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:04,418 INFO ]: Checked inductivity of 1251 backedges. 0 proven. 794 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2018-06-22 11:35:04,418 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:35:04,418 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-22 11:35:04,424 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:35:04,483 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2018-06-22 11:35:04,483 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:04,487 INFO ]: Computing forward predicates... [2018-06-22 11:35:04,813 INFO ]: Checked inductivity of 1251 backedges. 0 proven. 794 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2018-06-22 11:35:04,834 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:35:04,834 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-06-22 11:35:04,834 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:35:04,834 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:35:04,834 INFO ]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:35:04,834 INFO ]: Start difference. First operand 36 states and 39 transitions. Second operand 32 states. [2018-06-22 11:35:05,568 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:35:05,569 INFO ]: Finished difference Result 41 states and 48 transitions. [2018-06-22 11:35:05,569 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:35:05,569 INFO ]: Start accepts. Automaton has 32 states. Word has length 109 [2018-06-22 11:35:05,569 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:35:05,569 INFO ]: With dead ends: 41 [2018-06-22 11:35:05,569 INFO ]: Without dead ends: 41 [2018-06-22 11:35:05,570 INFO ]: 0 DeclaredPredicates, 177 GetRequests, 93 SyntacticMatches, 39 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=157, Invalid=2005, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 11:35:05,570 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:35:05,573 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-06-22 11:35:05,573 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:35:05,574 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-06-22 11:35:05,574 INFO ]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 109 [2018-06-22 11:35:05,574 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:35:05,574 INFO ]: Abstraction has 39 states and 46 transitions. [2018-06-22 11:35:05,574 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:35:05,574 INFO ]: Start isEmpty. Operand 39 states and 46 transitions. [2018-06-22 11:35:05,575 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 11:35:05,575 INFO ]: Found error trace [2018-06-22 11:35:05,575 INFO ]: trace histogram [28, 26, 26, 26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:35:05,575 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:35:05,575 INFO ]: Analyzing trace with hash 65163501, now seen corresponding path program 36 times [2018-06-22 11:35:05,575 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:35:05,575 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:35:05,575 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:05,575 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:35:05,575 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:05,586 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:06,312 INFO ]: Checked inductivity of 1459 backedges. 210 proven. 727 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2018-06-22 11:35:06,312 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:35:06,312 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-22 11:35:06,317 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:35:06,380 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 38 check-sat command(s) [2018-06-22 11:35:06,380 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:06,384 INFO ]: Computing forward predicates... [2018-06-22 11:35:06,794 INFO ]: Checked inductivity of 1459 backedges. 210 proven. 714 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2018-06-22 11:35:06,825 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:35:06,825 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 35 [2018-06-22 11:35:06,826 INFO ]: Interpolant automaton has 35 states [2018-06-22 11:35:06,826 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 11:35:06,826 INFO ]: CoverageRelationStatistics Valid=264, Invalid=926, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:35:06,826 INFO ]: Start difference. First operand 39 states and 46 transitions. Second operand 35 states. [2018-06-22 11:35:07,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:35:07,955 INFO ]: Finished difference Result 43 states and 51 transitions. [2018-06-22 11:35:07,955 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:35:07,955 INFO ]: Start accepts. Automaton has 35 states. Word has length 117 [2018-06-22 11:35:07,955 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:35:07,955 INFO ]: With dead ends: 43 [2018-06-22 11:35:07,955 INFO ]: Without dead ends: 43 [2018-06-22 11:35:07,956 INFO ]: 0 DeclaredPredicates, 189 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=568, Invalid=1982, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 11:35:07,956 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:35:07,958 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-06-22 11:35:07,958 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:35:07,959 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-06-22 11:35:07,959 INFO ]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 117 [2018-06-22 11:35:07,959 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:35:07,959 INFO ]: Abstraction has 39 states and 45 transitions. [2018-06-22 11:35:07,959 INFO ]: Interpolant automaton has 35 states. [2018-06-22 11:35:07,959 INFO ]: Start isEmpty. Operand 39 states and 45 transitions. [2018-06-22 11:35:07,960 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 11:35:07,960 INFO ]: Found error trace [2018-06-22 11:35:07,961 INFO ]: trace histogram [25, 23, 23, 23, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:35:07,961 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:35:07,961 INFO ]: Analyzing trace with hash 1344997607, now seen corresponding path program 37 times [2018-06-22 11:35:07,961 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:35:07,961 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:35:07,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:07,961 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:35:07,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:07,972 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:08,378 INFO ]: Checked inductivity of 1153 backedges. 156 proven. 586 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2018-06-22 11:35:08,378 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:35:08,378 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-22 11:35:08,385 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:35:08,421 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:08,425 INFO ]: Computing forward predicates... [2018-06-22 11:35:08,608 INFO ]: Checked inductivity of 1153 backedges. 132 proven. 600 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2018-06-22 11:35:08,636 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:35:08,636 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 32 [2018-06-22 11:35:08,636 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:35:08,636 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:35:08,637 INFO ]: CoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:35:08,637 INFO ]: Start difference. First operand 39 states and 45 transitions. Second operand 32 states. [2018-06-22 11:35:09,138 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:35:09,184 INFO ]: Finished difference Result 39 states and 43 transitions. [2018-06-22 11:35:09,185 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:35:09,185 INFO ]: Start accepts. Automaton has 32 states. Word has length 105 [2018-06-22 11:35:09,185 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:35:09,186 INFO ]: With dead ends: 39 [2018-06-22 11:35:09,186 INFO ]: Without dead ends: 38 [2018-06-22 11:35:09,186 INFO ]: 0 DeclaredPredicates, 169 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=456, Invalid=1614, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:35:09,186 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:35:09,188 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-22 11:35:09,188 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:35:09,188 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-06-22 11:35:09,188 INFO ]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 105 [2018-06-22 11:35:09,189 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:35:09,189 INFO ]: Abstraction has 38 states and 41 transitions. [2018-06-22 11:35:09,189 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:35:09,189 INFO ]: Start isEmpty. Operand 38 states and 41 transitions. [2018-06-22 11:35:09,189 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 11:35:09,189 INFO ]: Found error trace [2018-06-22 11:35:09,189 INFO ]: trace histogram [28, 26, 26, 26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:35:09,189 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:35:09,189 INFO ]: Analyzing trace with hash -1581986067, now seen corresponding path program 38 times [2018-06-22 11:35:09,190 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:35:09,190 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:35:09,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:09,190 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:35:09,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:09,199 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:09,918 INFO ]: Checked inductivity of 1459 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-06-22 11:35:09,919 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:35:09,919 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-22 11:35:09,925 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:35:09,965 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:35:09,965 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:09,970 INFO ]: Computing forward predicates... [2018-06-22 11:35:10,347 INFO ]: Checked inductivity of 1459 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-06-22 11:35:10,366 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:35:10,366 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-06-22 11:35:10,367 INFO ]: Interpolant automaton has 34 states [2018-06-22 11:35:10,367 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 11:35:10,367 INFO ]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:35:10,367 INFO ]: Start difference. First operand 38 states and 41 transitions. Second operand 34 states. [2018-06-22 11:35:11,055 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:35:11,055 INFO ]: Finished difference Result 43 states and 50 transitions. [2018-06-22 11:35:11,056 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:35:11,056 INFO ]: Start accepts. Automaton has 34 states. Word has length 117 [2018-06-22 11:35:11,056 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:35:11,056 INFO ]: With dead ends: 43 [2018-06-22 11:35:11,056 INFO ]: Without dead ends: 43 [2018-06-22 11:35:11,057 INFO ]: 0 DeclaredPredicates, 190 GetRequests, 100 SyntacticMatches, 42 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=168, Invalid=2282, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:35:11,057 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:35:11,058 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-06-22 11:35:11,058 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:35:11,059 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-06-22 11:35:11,059 INFO ]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 117 [2018-06-22 11:35:11,059 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:35:11,059 INFO ]: Abstraction has 41 states and 48 transitions. [2018-06-22 11:35:11,059 INFO ]: Interpolant automaton has 34 states. [2018-06-22 11:35:11,059 INFO ]: Start isEmpty. Operand 41 states and 48 transitions. [2018-06-22 11:35:11,059 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 11:35:11,059 INFO ]: Found error trace [2018-06-22 11:35:11,059 INFO ]: trace histogram [30, 28, 28, 28, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:35:11,059 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:35:11,059 INFO ]: Analyzing trace with hash 1780233713, now seen corresponding path program 39 times [2018-06-22 11:35:11,059 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:35:11,059 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:35:11,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:11,060 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:35:11,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:11,069 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:12,201 INFO ]: Checked inductivity of 1683 backedges. 240 proven. 839 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked. [2018-06-22 11:35:12,201 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:35:12,201 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-22 11:35:12,207 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:35:12,367 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-06-22 11:35:12,367 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:12,370 INFO ]: Computing forward predicates... [2018-06-22 11:35:12,436 INFO ]: Checked inductivity of 1683 backedges. 240 proven. 825 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2018-06-22 11:35:12,458 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:35:12,459 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35] total 37 [2018-06-22 11:35:12,459 INFO ]: Interpolant automaton has 37 states [2018-06-22 11:35:12,459 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 11:35:12,459 INFO ]: CoverageRelationStatistics Valid=297, Invalid=1035, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:35:12,459 INFO ]: Start difference. First operand 41 states and 48 transitions. Second operand 37 states. [2018-06-22 11:35:12,750 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:35:12,751 INFO ]: Finished difference Result 45 states and 53 transitions. [2018-06-22 11:35:12,751 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:35:12,751 INFO ]: Start accepts. Automaton has 37 states. Word has length 125 [2018-06-22 11:35:12,751 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:35:12,751 INFO ]: With dead ends: 45 [2018-06-22 11:35:12,751 INFO ]: Without dead ends: 45 [2018-06-22 11:35:12,752 INFO ]: 0 DeclaredPredicates, 202 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=637, Invalid=2225, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 11:35:12,752 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 11:35:12,754 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-06-22 11:35:12,754 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:35:12,755 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-06-22 11:35:12,755 INFO ]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 125 [2018-06-22 11:35:12,755 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:35:12,755 INFO ]: Abstraction has 41 states and 47 transitions. [2018-06-22 11:35:12,755 INFO ]: Interpolant automaton has 37 states. [2018-06-22 11:35:12,755 INFO ]: Start isEmpty. Operand 41 states and 47 transitions. [2018-06-22 11:35:12,756 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 11:35:12,756 INFO ]: Found error trace [2018-06-22 11:35:12,756 INFO ]: trace histogram [27, 25, 25, 25, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:35:12,756 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:35:12,756 INFO ]: Analyzing trace with hash 1019021291, now seen corresponding path program 40 times [2018-06-22 11:35:12,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:35:12,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:35:12,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:12,757 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:35:12,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:12,767 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:13,146 INFO ]: Checked inductivity of 1353 backedges. 182 proven. 687 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2018-06-22 11:35:13,146 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:35:13,146 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:35:13,152 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:35:13,189 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:35:13,189 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:13,193 INFO ]: Computing forward predicates... [2018-06-22 11:35:13,237 INFO ]: Checked inductivity of 1353 backedges. 156 proven. 702 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-06-22 11:35:13,255 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:35:13,256 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 34 [2018-06-22 11:35:13,256 INFO ]: Interpolant automaton has 34 states [2018-06-22 11:35:13,256 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 11:35:13,256 INFO ]: CoverageRelationStatistics Valid=236, Invalid=886, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:35:13,256 INFO ]: Start difference. First operand 41 states and 47 transitions. Second operand 34 states. [2018-06-22 11:35:13,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:35:13,797 INFO ]: Finished difference Result 41 states and 45 transitions. [2018-06-22 11:35:13,797 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:35:13,797 INFO ]: Start accepts. Automaton has 34 states. Word has length 113 [2018-06-22 11:35:13,798 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:35:13,798 INFO ]: With dead ends: 41 [2018-06-22 11:35:13,798 INFO ]: Without dead ends: 40 [2018-06-22 11:35:13,798 INFO ]: 0 DeclaredPredicates, 182 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=518, Invalid=1834, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 11:35:13,798 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:35:13,799 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-22 11:35:13,799 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:35:13,799 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-06-22 11:35:13,799 INFO ]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 113 [2018-06-22 11:35:13,800 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:35:13,800 INFO ]: Abstraction has 40 states and 43 transitions. [2018-06-22 11:35:13,800 INFO ]: Interpolant automaton has 34 states. [2018-06-22 11:35:13,800 INFO ]: Start isEmpty. Operand 40 states and 43 transitions. [2018-06-22 11:35:13,800 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 11:35:13,800 INFO ]: Found error trace [2018-06-22 11:35:13,800 INFO ]: trace histogram [30, 28, 28, 28, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:35:13,800 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:35:13,800 INFO ]: Analyzing trace with hash 469939185, now seen corresponding path program 41 times [2018-06-22 11:35:13,800 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:35:13,800 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:35:13,801 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:13,801 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:35:13,801 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:13,813 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:14,726 INFO ]: Checked inductivity of 1683 backedges. 0 proven. 1066 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2018-06-22 11:35:14,726 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:35:14,726 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:35:14,739 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:35:14,815 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 44 check-sat command(s) [2018-06-22 11:35:14,815 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:14,819 INFO ]: Computing forward predicates... [2018-06-22 11:35:15,140 INFO ]: Checked inductivity of 1683 backedges. 0 proven. 1066 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2018-06-22 11:35:15,159 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:35:15,159 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-06-22 11:35:15,159 INFO ]: Interpolant automaton has 36 states [2018-06-22 11:35:15,159 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 11:35:15,160 INFO ]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:35:15,160 INFO ]: Start difference. First operand 40 states and 43 transitions. Second operand 36 states. [2018-06-22 11:35:15,889 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:35:15,889 INFO ]: Finished difference Result 45 states and 52 transitions. [2018-06-22 11:35:15,889 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:35:15,889 INFO ]: Start accepts. Automaton has 36 states. Word has length 125 [2018-06-22 11:35:15,890 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:35:15,890 INFO ]: With dead ends: 45 [2018-06-22 11:35:15,890 INFO ]: Without dead ends: 45 [2018-06-22 11:35:15,890 INFO ]: 0 DeclaredPredicates, 203 GetRequests, 107 SyntacticMatches, 45 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=179, Invalid=2577, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 11:35:15,890 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 11:35:15,892 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-06-22 11:35:15,892 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:35:15,892 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-06-22 11:35:15,892 INFO ]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 125 [2018-06-22 11:35:15,892 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:35:15,892 INFO ]: Abstraction has 43 states and 50 transitions. [2018-06-22 11:35:15,892 INFO ]: Interpolant automaton has 36 states. [2018-06-22 11:35:15,893 INFO ]: Start isEmpty. Operand 43 states and 50 transitions. [2018-06-22 11:35:15,893 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 11:35:15,893 INFO ]: Found error trace [2018-06-22 11:35:15,893 INFO ]: trace histogram [32, 30, 30, 30, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:35:15,893 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:35:15,893 INFO ]: Analyzing trace with hash -1327014155, now seen corresponding path program 42 times [2018-06-22 11:35:15,893 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:35:15,893 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:35:15,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:15,893 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:35:15,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:15,904 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:16,632 INFO ]: Checked inductivity of 1923 backedges. 272 proven. 959 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2018-06-22 11:35:16,632 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:35:16,632 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:35:16,639 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:35:16,719 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 44 check-sat command(s) [2018-06-22 11:35:16,719 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:16,723 INFO ]: Computing forward predicates... [2018-06-22 11:35:16,919 INFO ]: Checked inductivity of 1923 backedges. 272 proven. 944 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2018-06-22 11:35:16,950 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:35:16,950 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 39 [2018-06-22 11:35:16,950 INFO ]: Interpolant automaton has 39 states [2018-06-22 11:35:16,950 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 11:35:16,951 INFO ]: CoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:35:16,951 INFO ]: Start difference. First operand 43 states and 50 transitions. Second operand 39 states. [2018-06-22 11:35:17,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:35:17,437 INFO ]: Finished difference Result 47 states and 55 transitions. [2018-06-22 11:35:17,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:35:17,437 INFO ]: Start accepts. Automaton has 39 states. Word has length 133 [2018-06-22 11:35:17,438 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:35:17,438 INFO ]: With dead ends: 47 [2018-06-22 11:35:17,438 INFO ]: Without dead ends: 47 [2018-06-22 11:35:17,438 INFO ]: 0 DeclaredPredicates, 215 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=710, Invalid=2482, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 11:35:17,438 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:35:17,441 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:35:17,441 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:35:17,441 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-06-22 11:35:17,441 INFO ]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 133 [2018-06-22 11:35:17,441 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:35:17,441 INFO ]: Abstraction has 43 states and 49 transitions. [2018-06-22 11:35:17,441 INFO ]: Interpolant automaton has 39 states. [2018-06-22 11:35:17,441 INFO ]: Start isEmpty. Operand 43 states and 49 transitions. [2018-06-22 11:35:17,443 INFO ]: Finished isEmpty. Found accepting run of length 122 [2018-06-22 11:35:17,443 INFO ]: Found error trace [2018-06-22 11:35:17,443 INFO ]: trace histogram [29, 27, 27, 27, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:35:17,443 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:35:17,443 INFO ]: Analyzing trace with hash 579422959, now seen corresponding path program 43 times [2018-06-22 11:35:17,443 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:35:17,443 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:35:17,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:17,443 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:35:17,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:17,453 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:17,808 INFO ]: Checked inductivity of 1569 backedges. 210 proven. 796 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2018-06-22 11:35:17,808 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:35:17,808 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:35:17,815 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:35:17,853 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:17,857 INFO ]: Computing forward predicates... [2018-06-22 11:35:17,922 INFO ]: Checked inductivity of 1569 backedges. 182 proven. 812 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2018-06-22 11:35:17,955 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:35:17,955 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 36 [2018-06-22 11:35:17,955 INFO ]: Interpolant automaton has 36 states [2018-06-22 11:35:17,956 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 11:35:17,956 INFO ]: CoverageRelationStatistics Valid=267, Invalid=993, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:35:17,956 INFO ]: Start difference. First operand 43 states and 49 transitions. Second operand 36 states. [2018-06-22 11:35:18,368 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:35:18,368 INFO ]: Finished difference Result 43 states and 47 transitions. [2018-06-22 11:35:18,368 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:35:18,368 INFO ]: Start accepts. Automaton has 36 states. Word has length 121 [2018-06-22 11:35:18,369 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:35:18,369 INFO ]: With dead ends: 43 [2018-06-22 11:35:18,369 INFO ]: Without dead ends: 42 [2018-06-22 11:35:18,369 INFO ]: 0 DeclaredPredicates, 195 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=584, Invalid=2068, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 11:35:18,369 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:35:18,371 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 11:35:18,371 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:35:18,372 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-06-22 11:35:18,372 INFO ]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 121 [2018-06-22 11:35:18,372 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:35:18,372 INFO ]: Abstraction has 42 states and 45 transitions. [2018-06-22 11:35:18,372 INFO ]: Interpolant automaton has 36 states. [2018-06-22 11:35:18,372 INFO ]: Start isEmpty. Operand 42 states and 45 transitions. [2018-06-22 11:35:18,372 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 11:35:18,372 INFO ]: Found error trace [2018-06-22 11:35:18,372 INFO ]: trace histogram [32, 30, 30, 30, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:35:18,373 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:35:18,373 INFO ]: Analyzing trace with hash 413129973, now seen corresponding path program 44 times [2018-06-22 11:35:18,373 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:35:18,373 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:35:18,373 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:18,373 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:35:18,373 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:18,385 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:19,833 INFO ]: Checked inductivity of 1923 backedges. 0 proven. 1217 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2018-06-22 11:35:19,833 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:35:19,833 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:35:19,840 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:35:19,885 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:35:19,885 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:19,889 INFO ]: Computing forward predicates... [2018-06-22 11:35:20,239 INFO ]: Checked inductivity of 1923 backedges. 0 proven. 1217 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2018-06-22 11:35:20,257 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:35:20,257 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-06-22 11:35:20,258 INFO ]: Interpolant automaton has 38 states [2018-06-22 11:35:20,258 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 11:35:20,258 INFO ]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:35:20,258 INFO ]: Start difference. First operand 42 states and 45 transitions. Second operand 38 states. [2018-06-22 11:35:21,048 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:35:21,048 INFO ]: Finished difference Result 47 states and 54 transitions. [2018-06-22 11:35:21,048 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:35:21,048 INFO ]: Start accepts. Automaton has 38 states. Word has length 133 [2018-06-22 11:35:21,048 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:35:21,049 INFO ]: With dead ends: 47 [2018-06-22 11:35:21,049 INFO ]: Without dead ends: 47 [2018-06-22 11:35:21,049 INFO ]: 0 DeclaredPredicates, 216 GetRequests, 114 SyntacticMatches, 48 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=190, Invalid=2890, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 11:35:21,049 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:35:21,051 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-06-22 11:35:21,051 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:35:21,052 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-06-22 11:35:21,052 INFO ]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 133 [2018-06-22 11:35:21,052 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:35:21,052 INFO ]: Abstraction has 45 states and 52 transitions. [2018-06-22 11:35:21,052 INFO ]: Interpolant automaton has 38 states. [2018-06-22 11:35:21,052 INFO ]: Start isEmpty. Operand 45 states and 52 transitions. [2018-06-22 11:35:21,053 INFO ]: Finished isEmpty. Found accepting run of length 138 [2018-06-22 11:35:21,053 INFO ]: Found error trace [2018-06-22 11:35:21,053 INFO ]: trace histogram [33, 31, 31, 31, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:35:21,053 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:35:21,053 INFO ]: Analyzing trace with hash 1618434807, now seen corresponding path program 45 times [2018-06-22 11:35:21,053 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:35:21,053 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:35:21,054 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:21,054 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:35:21,054 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:21,065 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:21,475 INFO ]: Checked inductivity of 2049 backedges. 272 proven. 1039 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2018-06-22 11:35:21,475 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:35:21,475 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:35:21,481 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:35:21,553 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-06-22 11:35:21,553 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:21,556 INFO ]: Computing forward predicates... [2018-06-22 11:35:21,625 INFO ]: Checked inductivity of 2049 backedges. 272 proven. 1024 refuted. 0 times theorem prover too weak. 753 trivial. 0 not checked. [2018-06-22 11:35:21,651 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:35:21,651 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38] total 40 [2018-06-22 11:35:21,651 INFO ]: Interpolant automaton has 40 states [2018-06-22 11:35:21,651 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 11:35:21,651 INFO ]: CoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:35:21,652 INFO ]: Start difference. First operand 45 states and 52 transitions. Second operand 40 states. [2018-06-22 11:35:22,085 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:35:22,085 INFO ]: Finished difference Result 47 states and 53 transitions. [2018-06-22 11:35:22,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:35:22,085 INFO ]: Start accepts. Automaton has 40 states. Word has length 137 [2018-06-22 11:35:22,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:35:22,086 INFO ]: With dead ends: 47 [2018-06-22 11:35:22,086 INFO ]: Without dead ends: 47 [2018-06-22 11:35:22,086 INFO ]: 0 DeclaredPredicates, 221 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=743, Invalid=2563, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 11:35:22,086 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:35:22,087 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-06-22 11:35:22,088 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:35:22,088 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-06-22 11:35:22,088 INFO ]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 137 [2018-06-22 11:35:22,088 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:35:22,088 INFO ]: Abstraction has 45 states and 51 transitions. [2018-06-22 11:35:22,088 INFO ]: Interpolant automaton has 40 states. [2018-06-22 11:35:22,088 INFO ]: Start isEmpty. Operand 45 states and 51 transitions. [2018-06-22 11:35:22,089 INFO ]: Finished isEmpty. Found accepting run of length 130 [2018-06-22 11:35:22,089 INFO ]: Found error trace [2018-06-22 11:35:22,089 INFO ]: trace histogram [31, 29, 29, 29, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:35:22,089 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:35:22,089 INFO ]: Analyzing trace with hash 1929892339, now seen corresponding path program 46 times [2018-06-22 11:35:22,089 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:35:22,089 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:35:22,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:22,091 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:35:22,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:22,100 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:22,507 INFO ]: Checked inductivity of 1801 backedges. 240 proven. 913 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-06-22 11:35:22,507 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:35:22,507 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:35:22,512 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:35:22,557 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:35:22,557 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:22,561 INFO ]: Computing forward predicates... [2018-06-22 11:35:22,655 INFO ]: Checked inductivity of 1801 backedges. 210 proven. 930 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2018-06-22 11:35:22,674 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:35:22,674 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 38 [2018-06-22 11:35:22,675 INFO ]: Interpolant automaton has 38 states [2018-06-22 11:35:22,675 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 11:35:22,675 INFO ]: CoverageRelationStatistics Valid=300, Invalid=1106, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:35:22,675 INFO ]: Start difference. First operand 45 states and 51 transitions. Second operand 38 states. [2018-06-22 11:35:23,045 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:35:23,045 INFO ]: Finished difference Result 45 states and 49 transitions. [2018-06-22 11:35:23,046 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:35:23,046 INFO ]: Start accepts. Automaton has 38 states. Word has length 129 [2018-06-22 11:35:23,046 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:35:23,046 INFO ]: With dead ends: 45 [2018-06-22 11:35:23,046 INFO ]: Without dead ends: 44 [2018-06-22 11:35:23,047 INFO ]: 0 DeclaredPredicates, 208 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=654, Invalid=2316, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 11:35:23,047 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:35:23,049 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-22 11:35:23,049 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:35:23,049 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-06-22 11:35:23,049 INFO ]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 129 [2018-06-22 11:35:23,049 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:35:23,049 INFO ]: Abstraction has 44 states and 47 transitions. [2018-06-22 11:35:23,049 INFO ]: Interpolant automaton has 38 states. [2018-06-22 11:35:23,049 INFO ]: Start isEmpty. Operand 44 states and 47 transitions. [2018-06-22 11:35:23,050 INFO ]: Finished isEmpty. Found accepting run of length 142 [2018-06-22 11:35:23,050 INFO ]: Found error trace [2018-06-22 11:35:23,050 INFO ]: trace histogram [34, 32, 32, 32, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:35:23,050 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:35:23,050 INFO ]: Analyzing trace with hash 79972857, now seen corresponding path program 47 times [2018-06-22 11:35:23,050 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:35:23,050 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:35:23,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:23,051 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:35:23,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:23,059 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:23,799 INFO ]: Checked inductivity of 2179 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-06-22 11:35:23,799 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:35:23,799 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:35:23,805 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:35:23,896 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2018-06-22 11:35:23,896 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:23,902 INFO ]: Computing forward predicates... [2018-06-22 11:35:24,338 INFO ]: Checked inductivity of 2179 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-06-22 11:35:24,356 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:35:24,356 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-06-22 11:35:24,357 INFO ]: Interpolant automaton has 40 states [2018-06-22 11:35:24,357 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 11:35:24,357 INFO ]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:35:24,357 INFO ]: Start difference. First operand 44 states and 47 transitions. Second operand 40 states. [2018-06-22 11:35:25,199 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:35:25,199 INFO ]: Finished difference Result 49 states and 56 transitions. [2018-06-22 11:35:25,199 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:35:25,199 INFO ]: Start accepts. Automaton has 40 states. Word has length 141 [2018-06-22 11:35:25,200 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:35:25,200 INFO ]: With dead ends: 49 [2018-06-22 11:35:25,200 INFO ]: Without dead ends: 49 [2018-06-22 11:35:25,200 INFO ]: 0 DeclaredPredicates, 229 GetRequests, 121 SyntacticMatches, 51 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=201, Invalid=3221, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 11:35:25,200 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:35:25,202 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-06-22 11:35:25,202 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:35:25,203 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-06-22 11:35:25,203 INFO ]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 141 [2018-06-22 11:35:25,203 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:35:25,203 INFO ]: Abstraction has 47 states and 54 transitions. [2018-06-22 11:35:25,203 INFO ]: Interpolant automaton has 40 states. [2018-06-22 11:35:25,203 INFO ]: Start isEmpty. Operand 47 states and 54 transitions. [2018-06-22 11:35:25,204 INFO ]: Finished isEmpty. Found accepting run of length 146 [2018-06-22 11:35:25,204 INFO ]: Found error trace [2018-06-22 11:35:25,204 INFO ]: trace histogram [35, 33, 33, 33, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:35:25,204 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:35:25,204 INFO ]: Analyzing trace with hash -388666885, now seen corresponding path program 48 times [2018-06-22 11:35:25,204 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:35:25,204 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:35:25,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:25,205 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:35:25,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:25,216 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:26,227 INFO ]: Checked inductivity of 2313 backedges. 306 proven. 1172 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2018-06-22 11:35:26,227 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:35:26,227 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:35:26,232 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:35:26,560 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 50 check-sat command(s) [2018-06-22 11:35:26,560 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:26,565 INFO ]: Computing forward predicates... [2018-06-22 11:35:26,626 INFO ]: Checked inductivity of 2313 backedges. 306 proven. 1156 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2018-06-22 11:35:26,644 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:35:26,644 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40] total 42 [2018-06-22 11:35:26,645 INFO ]: Interpolant automaton has 42 states [2018-06-22 11:35:26,645 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 11:35:26,645 INFO ]: CoverageRelationStatistics Valid=388, Invalid=1334, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 11:35:26,645 INFO ]: Start difference. First operand 47 states and 54 transitions. Second operand 42 states. [2018-06-22 11:35:27,168 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:35:27,169 INFO ]: Finished difference Result 49 states and 55 transitions. [2018-06-22 11:35:27,169 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:35:27,169 INFO ]: Start accepts. Automaton has 42 states. Word has length 145 [2018-06-22 11:35:27,169 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:35:27,169 INFO ]: With dead ends: 49 [2018-06-22 11:35:27,169 INFO ]: Without dead ends: 49 [2018-06-22 11:35:27,170 INFO ]: 0 DeclaredPredicates, 234 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=822, Invalid=2838, Unknown=0, NotChecked=0, Total=3660 [2018-06-22 11:35:27,170 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:35:27,172 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-06-22 11:35:27,172 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:35:27,172 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-06-22 11:35:27,172 INFO ]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 145 [2018-06-22 11:35:27,173 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:35:27,173 INFO ]: Abstraction has 47 states and 53 transitions. [2018-06-22 11:35:27,173 INFO ]: Interpolant automaton has 42 states. [2018-06-22 11:35:27,173 INFO ]: Start isEmpty. Operand 47 states and 53 transitions. [2018-06-22 11:35:27,173 INFO ]: Finished isEmpty. Found accepting run of length 138 [2018-06-22 11:35:27,173 INFO ]: Found error trace [2018-06-22 11:35:27,173 INFO ]: trace histogram [33, 31, 31, 31, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:35:27,173 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:35:27,173 INFO ]: Analyzing trace with hash -214917897, now seen corresponding path program 49 times [2018-06-22 11:35:27,173 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:35:27,173 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:35:27,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:27,174 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:35:27,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:27,183 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:27,788 INFO ]: Checked inductivity of 2049 backedges. 272 proven. 1038 refuted. 0 times theorem prover too weak. 739 trivial. 0 not checked. [2018-06-22 11:35:27,788 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:35:27,788 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:35:27,797 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:35:27,853 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:35:27,858 INFO ]: Computing forward predicates... [2018-06-22 11:35:27,926 INFO ]: Checked inductivity of 2049 backedges. 240 proven. 1056 refuted. 0 times theorem prover too weak. 753 trivial. 0 not checked. [2018-06-22 11:35:27,945 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:35:27,945 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38] total 40 [2018-06-22 11:35:27,945 INFO ]: Interpolant automaton has 40 states [2018-06-22 11:35:27,946 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 11:35:27,946 INFO ]: CoverageRelationStatistics Valid=335, Invalid=1225, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:35:27,946 INFO ]: Start difference. First operand 47 states and 53 transitions. Second operand 40 states. [2018-06-22 11:35:28,324 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:35:28,324 INFO ]: Finished difference Result 47 states and 51 transitions. [2018-06-22 11:35:28,326 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:35:28,326 INFO ]: Start accepts. Automaton has 40 states. Word has length 137 [2018-06-22 11:35:28,326 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:35:28,326 INFO ]: With dead ends: 47 [2018-06-22 11:35:28,326 INFO ]: Without dead ends: 46 [2018-06-22 11:35:28,327 INFO ]: 0 DeclaredPredicates, 221 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=728, Invalid=2578, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 11:35:28,327 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:35:28,329 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-06-22 11:35:28,329 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:35:28,329 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-06-22 11:35:28,329 INFO ]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 137 [2018-06-22 11:35:28,330 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:35:28,330 INFO ]: Abstraction has 46 states and 49 transitions. [2018-06-22 11:35:28,330 INFO ]: Interpolant automaton has 40 states. [2018-06-22 11:35:28,330 INFO ]: Start isEmpty. Operand 46 states and 49 transitions. [2018-06-22 11:35:28,330 INFO ]: Finished isEmpty. Found accepting run of length 150 [2018-06-22 11:35:28,330 INFO ]: Found error trace [2018-06-22 11:35:28,330 INFO ]: trace histogram [36, 34, 34, 34, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:35:28,330 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:35:28,331 INFO ]: Analyzing trace with hash 287832829, now seen corresponding path program 50 times [2018-06-22 11:35:28,331 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:35:28,331 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:35:28,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:28,331 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:35:28,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:35:28,345 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 11:35:29,205 WARN ]: Verification canceled [2018-06-22 11:35:29,209 WARN ]: Timeout [2018-06-22 11:35:29,209 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:35:29 BoogieIcfgContainer [2018-06-22 11:35:29,209 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:35:29,210 INFO ]: Toolchain (without parser) took 56151.46 ms. Allocated memory was 306.7 MB in the beginning and 666.9 MB in the end (delta: 360.2 MB). Free memory was 263.1 MB in the beginning and 533.0 MB in the end (delta: -269.9 MB). Peak memory consumption was 90.3 MB. Max. memory is 3.6 GB. [2018-06-22 11:35:29,211 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 306.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:35:29,211 INFO ]: ChcToBoogie took 43.49 ms. Allocated memory is still 306.7 MB. Free memory was 263.1 MB in the beginning and 261.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:35:29,211 INFO ]: Boogie Preprocessor took 38.27 ms. Allocated memory is still 306.7 MB. Free memory was 261.1 MB in the beginning and 259.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:35:29,212 INFO ]: RCFGBuilder took 269.44 ms. Allocated memory is still 306.7 MB. Free memory was 259.1 MB in the beginning and 253.1 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:35:29,212 INFO ]: TraceAbstraction took 55789.49 ms. Allocated memory was 306.7 MB in the beginning and 666.9 MB in the end (delta: 360.2 MB). Free memory was 253.1 MB in the beginning and 533.0 MB in the end (delta: -279.9 MB). Peak memory consumption was 80.3 MB. Max. memory is 3.6 GB. [2018-06-22 11:35:29,214 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 306.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 43.49 ms. Allocated memory is still 306.7 MB. Free memory was 263.1 MB in the beginning and 261.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 38.27 ms. Allocated memory is still 306.7 MB. Free memory was 261.1 MB in the beginning and 259.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 269.44 ms. Allocated memory is still 306.7 MB. Free memory was 259.1 MB in the beginning and 253.1 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 55789.49 ms. Allocated memory was 306.7 MB in the beginning and 666.9 MB in the end (delta: 360.2 MB). Free memory was 253.1 MB in the beginning and 533.0 MB in the end (delta: -279.9 MB). Peak memory consumption was 80.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 150 with TraceHistMax 36, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 14 locations, 1 error locations. TIMEOUT Result, 55.7s OverallTime, 52 OverallIterations, 36 TraceHistogramMax, 19.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1031 SDtfs, 958 SDslu, 10962 SDs, 0 SdLazy, 13886 SolverSat, 1405 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6341 GetRequests, 4185 SyntacticMatches, 456 SemanticMatches, 1700 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10062 ImplicationChecksByTransitivity, 35.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 51 MinimizatonAttempts, 72 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 29.5s InterpolantComputationTime, 7876 NumberOfCodeBlocks, 7752 NumberOfCodeBlocksAsserted, 692 NumberOfCheckSat, 7776 ConstructedInterpolants, 0 QuantifiedInterpolants, 2785544 SizeOfPredicates, 1051 NumberOfNonLiveVariables, 13936 ConjunctsInSsa, 2629 ConjunctsInUnsatCore, 100 InterpolantComputations, 2 PerfectInterpolantSequences, 35966/79725 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/map_map.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-35-29-224.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/map_map.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-35-29-224.csv Completed graceful shutdown