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_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big3.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 02:09:33,681 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 02:09:33,685 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 02:09:33,702 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 02:09:33,703 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 02:09:33,704 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 02:09:33,706 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 02:09:33,708 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 02:09:33,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 02:09:33,711 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 02:09:33,712 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 02:09:33,712 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 02:09:33,716 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 02:09:33,717 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 02:09:33,718 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 02:09:33,722 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 02:09:33,724 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 02:09:33,737 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 02:09:33,739 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 02:09:33,740 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 02:09:33,741 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 02:09:33,743 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 02:09:33,744 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 02:09:33,744 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 02:09:33,749 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 02:09:33,750 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 02:09:33,751 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 02:09:33,752 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 02:09:33,757 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 02:09:33,757 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 02:09:33,758 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 02:09:33,759 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 02:09:33,759 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 02:09:33,760 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 02:09:33,762 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 02:09:33,762 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 02:09:33,784 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 02:09:33,784 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 02:09:33,784 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 02:09:33,785 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 02:09:33,786 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 02:09:33,786 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 02:09:33,786 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 02:09:33,786 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 02:09:33,787 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:09:33,787 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 02:09:33,788 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 02:09:33,788 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 02:09:33,788 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 02:09:33,788 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 02:09:33,788 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 02:09:33,788 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 02:09:33,789 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 02:09:33,790 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 02:09:33,790 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 02:09:33,850 INFO ]: Repository-Root is: /tmp [2018-06-22 02:09:33,866 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 02:09:33,873 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 02:09:33,875 INFO ]: Initializing SmtParser... [2018-06-22 02:09:33,875 INFO ]: SmtParser initialized [2018-06-22 02:09:33,876 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big3.smt2 [2018-06-22 02:09:33,877 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 02:09:33,974 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big3.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@247a7b5a [2018-06-22 02:09:34,187 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big3.smt2 [2018-06-22 02:09:34,191 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 02:09:34,197 INFO ]: Walking toolchain with 4 elements. [2018-06-22 02:09:34,199 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 02:09:34,199 INFO ]: Initializing ChcToBoogie... [2018-06-22 02:09:34,199 INFO ]: ChcToBoogie initialized [2018-06-22 02:09:34,202 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:09:34" (1/1) ... [2018-06-22 02:09:34,263 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:34 Unit [2018-06-22 02:09:34,263 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 02:09:34,264 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 02:09:34,264 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 02:09:34,264 INFO ]: Boogie Preprocessor initialized [2018-06-22 02:09:34,286 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:34" (1/1) ... [2018-06-22 02:09:34,286 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:34" (1/1) ... [2018-06-22 02:09:34,294 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:34" (1/1) ... [2018-06-22 02:09:34,294 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:34" (1/1) ... [2018-06-22 02:09:34,298 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:34" (1/1) ... [2018-06-22 02:09:34,300 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:34" (1/1) ... [2018-06-22 02:09:34,302 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:34" (1/1) ... [2018-06-22 02:09:34,303 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 02:09:34,304 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 02:09:34,304 INFO ]: Initializing RCFGBuilder... [2018-06-22 02:09:34,304 INFO ]: RCFGBuilder initialized [2018-06-22 02:09:34,305 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:34" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:09:34,316 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 02:09:34,316 INFO ]: Found specification of procedure gotoProc [2018-06-22 02:09:34,316 INFO ]: Found implementation of procedure gotoProc [2018-06-22 02:09:34,316 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 02:09:34,316 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 02:09:34,317 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 02:09:34,781 INFO ]: Using library mode [2018-06-22 02:09:34,782 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:09:34 BoogieIcfgContainer [2018-06-22 02:09:34,782 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 02:09:34,783 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 02:09:34,784 INFO ]: Initializing TraceAbstraction... [2018-06-22 02:09:34,787 INFO ]: TraceAbstraction initialized [2018-06-22 02:09:34,787 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:09:34" (1/3) ... [2018-06-22 02:09:34,788 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243f54bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 02:09:34, skipping insertion in model container [2018-06-22 02:09:34,788 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:34" (2/3) ... [2018-06-22 02:09:34,788 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243f54bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:09:34, skipping insertion in model container [2018-06-22 02:09:34,788 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:09:34" (3/3) ... [2018-06-22 02:09:34,790 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 02:09:34,805 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 02:09:34,817 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 02:09:34,876 INFO ]: Using default assertion order modulation [2018-06-22 02:09:34,877 INFO ]: Interprodecural is true [2018-06-22 02:09:34,877 INFO ]: Hoare is false [2018-06-22 02:09:34,877 INFO ]: Compute interpolants for FPandBP [2018-06-22 02:09:34,877 INFO ]: Backedges is TWOTRACK [2018-06-22 02:09:34,877 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 02:09:34,877 INFO ]: Difference is false [2018-06-22 02:09:34,877 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 02:09:34,877 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 02:09:34,896 INFO ]: Start isEmpty. Operand 13 states. [2018-06-22 02:09:34,914 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:09:34,914 INFO ]: Found error trace [2018-06-22 02:09:34,915 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:34,915 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:34,923 INFO ]: Analyzing trace with hash -1169299140, now seen corresponding path program 1 times [2018-06-22 02:09:34,925 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:34,926 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:34,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:34,977 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:34,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:35,040 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:35,201 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:35,203 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:09:35,203 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 02:09:35,205 INFO ]: Interpolant automaton has 6 states [2018-06-22 02:09:35,216 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 02:09:35,216 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:09:35,219 INFO ]: Start difference. First operand 13 states. Second operand 6 states. [2018-06-22 02:09:35,756 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:35,756 INFO ]: Finished difference Result 24 states and 61 transitions. [2018-06-22 02:09:35,756 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 02:09:35,757 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-22 02:09:35,758 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:35,769 INFO ]: With dead ends: 24 [2018-06-22 02:09:35,769 INFO ]: Without dead ends: 23 [2018-06-22 02:09:35,771 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:09:35,789 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 02:09:35,809 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 14. [2018-06-22 02:09:35,811 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 02:09:35,811 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2018-06-22 02:09:35,813 INFO ]: Start accepts. Automaton has 14 states and 33 transitions. Word has length 10 [2018-06-22 02:09:35,814 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:35,814 INFO ]: Abstraction has 14 states and 33 transitions. [2018-06-22 02:09:35,814 INFO ]: Interpolant automaton has 6 states. [2018-06-22 02:09:35,814 INFO ]: Start isEmpty. Operand 14 states and 33 transitions. [2018-06-22 02:09:35,814 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:09:35,814 INFO ]: Found error trace [2018-06-22 02:09:35,814 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:35,814 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:35,815 INFO ]: Analyzing trace with hash 717526670, now seen corresponding path program 1 times [2018-06-22 02:09:35,815 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:35,815 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:35,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:35,816 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:35,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:35,846 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:35,955 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:35,955 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:09:35,955 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 02:09:35,957 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:09:35,957 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:09:35,957 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:09:35,957 INFO ]: Start difference. First operand 14 states and 33 transitions. Second operand 5 states. [2018-06-22 02:09:36,268 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:36,268 INFO ]: Finished difference Result 21 states and 53 transitions. [2018-06-22 02:09:36,268 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:09:36,268 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-22 02:09:36,269 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:36,269 INFO ]: With dead ends: 21 [2018-06-22 02:09:36,269 INFO ]: Without dead ends: 21 [2018-06-22 02:09:36,270 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:09:36,271 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 02:09:36,273 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-22 02:09:36,273 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 02:09:36,274 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 43 transitions. [2018-06-22 02:09:36,274 INFO ]: Start accepts. Automaton has 17 states and 43 transitions. Word has length 11 [2018-06-22 02:09:36,274 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:36,274 INFO ]: Abstraction has 17 states and 43 transitions. [2018-06-22 02:09:36,274 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:09:36,275 INFO ]: Start isEmpty. Operand 17 states and 43 transitions. [2018-06-22 02:09:36,275 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:09:36,275 INFO ]: Found error trace [2018-06-22 02:09:36,275 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:36,275 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:36,275 INFO ]: Analyzing trace with hash 469292504, now seen corresponding path program 1 times [2018-06-22 02:09:36,275 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:36,275 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:36,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:36,276 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:36,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:36,306 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:36,395 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:36,395 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:09:36,395 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:09:36,395 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:09:36,395 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:09:36,395 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:09:36,395 INFO ]: Start difference. First operand 17 states and 43 transitions. Second operand 4 states. [2018-06-22 02:09:36,571 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:36,571 INFO ]: Finished difference Result 27 states and 71 transitions. [2018-06-22 02:09:36,571 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:09:36,572 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-22 02:09:36,572 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:36,573 INFO ]: With dead ends: 27 [2018-06-22 02:09:36,573 INFO ]: Without dead ends: 27 [2018-06-22 02:09:36,573 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:09:36,573 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 02:09:36,577 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-06-22 02:09:36,577 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 02:09:36,578 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 50 transitions. [2018-06-22 02:09:36,578 INFO ]: Start accepts. Automaton has 20 states and 50 transitions. Word has length 11 [2018-06-22 02:09:36,578 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:36,578 INFO ]: Abstraction has 20 states and 50 transitions. [2018-06-22 02:09:36,578 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:09:36,578 INFO ]: Start isEmpty. Operand 20 states and 50 transitions. [2018-06-22 02:09:36,578 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:09:36,578 INFO ]: Found error trace [2018-06-22 02:09:36,579 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:36,579 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:36,579 INFO ]: Analyzing trace with hash -864298530, now seen corresponding path program 1 times [2018-06-22 02:09:36,579 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:36,579 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:36,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:36,580 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:36,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:36,601 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:36,649 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:36,649 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:09:36,649 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 02:09:36,649 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:09:36,649 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:09:36,649 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:09:36,649 INFO ]: Start difference. First operand 20 states and 50 transitions. Second operand 5 states. [2018-06-22 02:09:37,009 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:37,009 INFO ]: Finished difference Result 30 states and 78 transitions. [2018-06-22 02:09:37,010 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:09:37,010 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-22 02:09:37,010 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:37,011 INFO ]: With dead ends: 30 [2018-06-22 02:09:37,011 INFO ]: Without dead ends: 30 [2018-06-22 02:09:37,011 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:09:37,011 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 02:09:37,014 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-06-22 02:09:37,014 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 02:09:37,015 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 72 transitions. [2018-06-22 02:09:37,015 INFO ]: Start accepts. Automaton has 27 states and 72 transitions. Word has length 11 [2018-06-22 02:09:37,015 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:37,015 INFO ]: Abstraction has 27 states and 72 transitions. [2018-06-22 02:09:37,015 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:09:37,015 INFO ]: Start isEmpty. Operand 27 states and 72 transitions. [2018-06-22 02:09:37,016 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:09:37,016 INFO ]: Found error trace [2018-06-22 02:09:37,016 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:37,016 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:37,016 INFO ]: Analyzing trace with hash 2112538528, now seen corresponding path program 1 times [2018-06-22 02:09:37,016 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:37,016 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:37,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:37,017 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:37,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:37,043 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:37,096 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:37,097 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:37,097 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:09:37,105 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:37,127 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:37,132 INFO ]: Computing forward predicates... [2018-06-22 02:09:37,513 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:37,536 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:37,536 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-06-22 02:09:37,536 INFO ]: Interpolant automaton has 8 states [2018-06-22 02:09:37,536 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 02:09:37,537 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:09:37,537 INFO ]: Start difference. First operand 27 states and 72 transitions. Second operand 8 states. [2018-06-22 02:09:38,087 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:38,087 INFO ]: Finished difference Result 39 states and 106 transitions. [2018-06-22 02:09:38,088 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 02:09:38,088 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-22 02:09:38,088 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:38,089 INFO ]: With dead ends: 39 [2018-06-22 02:09:38,089 INFO ]: Without dead ends: 35 [2018-06-22 02:09:38,090 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:09:38,090 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 02:09:38,093 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-06-22 02:09:38,094 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 02:09:38,094 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 71 transitions. [2018-06-22 02:09:38,095 INFO ]: Start accepts. Automaton has 29 states and 71 transitions. Word has length 11 [2018-06-22 02:09:38,095 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:38,095 INFO ]: Abstraction has 29 states and 71 transitions. [2018-06-22 02:09:38,095 INFO ]: Interpolant automaton has 8 states. [2018-06-22 02:09:38,095 INFO ]: Start isEmpty. Operand 29 states and 71 transitions. [2018-06-22 02:09:38,095 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:09:38,095 INFO ]: Found error trace [2018-06-22 02:09:38,095 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:38,095 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:38,095 INFO ]: Analyzing trace with hash -2067912164, now seen corresponding path program 1 times [2018-06-22 02:09:38,096 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:38,096 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:38,096 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:38,096 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:38,096 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:38,108 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:38,199 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:38,199 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:38,199 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 02:09:38,213 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:38,249 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:38,251 INFO ]: Computing forward predicates... [2018-06-22 02:09:38,260 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:38,298 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:38,298 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 02:09:38,298 INFO ]: Interpolant automaton has 6 states [2018-06-22 02:09:38,298 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 02:09:38,299 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:09:38,299 INFO ]: Start difference. First operand 29 states and 71 transitions. Second operand 6 states. [2018-06-22 02:09:38,489 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:38,489 INFO ]: Finished difference Result 41 states and 95 transitions. [2018-06-22 02:09:38,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 02:09:38,492 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-22 02:09:38,492 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:38,493 INFO ]: With dead ends: 41 [2018-06-22 02:09:38,493 INFO ]: Without dead ends: 36 [2018-06-22 02:09:38,493 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:09:38,494 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 02:09:38,497 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-06-22 02:09:38,497 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 02:09:38,505 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 73 transitions. [2018-06-22 02:09:38,505 INFO ]: Start accepts. Automaton has 32 states and 73 transitions. Word has length 11 [2018-06-22 02:09:38,505 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:38,505 INFO ]: Abstraction has 32 states and 73 transitions. [2018-06-22 02:09:38,505 INFO ]: Interpolant automaton has 6 states. [2018-06-22 02:09:38,505 INFO ]: Start isEmpty. Operand 32 states and 73 transitions. [2018-06-22 02:09:38,506 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:09:38,506 INFO ]: Found error trace [2018-06-22 02:09:38,506 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:38,506 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:38,506 INFO ]: Analyzing trace with hash -579196312, now seen corresponding path program 1 times [2018-06-22 02:09:38,506 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:38,506 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:38,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:38,507 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:38,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:38,525 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:38,638 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:38,639 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:38,639 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 02:09:38,644 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:38,660 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:38,661 INFO ]: Computing forward predicates... [2018-06-22 02:09:38,671 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:38,692 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:38,692 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-22 02:09:38,692 INFO ]: Interpolant automaton has 6 states [2018-06-22 02:09:38,692 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 02:09:38,692 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:09:38,692 INFO ]: Start difference. First operand 32 states and 73 transitions. Second operand 6 states. [2018-06-22 02:09:38,790 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:38,791 INFO ]: Finished difference Result 38 states and 87 transitions. [2018-06-22 02:09:38,792 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:09:38,792 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-22 02:09:38,792 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:38,792 INFO ]: With dead ends: 38 [2018-06-22 02:09:38,793 INFO ]: Without dead ends: 33 [2018-06-22 02:09:38,793 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:09:38,793 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 02:09:38,797 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-06-22 02:09:38,797 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 02:09:38,798 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 60 transitions. [2018-06-22 02:09:38,798 INFO ]: Start accepts. Automaton has 29 states and 60 transitions. Word has length 11 [2018-06-22 02:09:38,798 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:38,798 INFO ]: Abstraction has 29 states and 60 transitions. [2018-06-22 02:09:38,798 INFO ]: Interpolant automaton has 6 states. [2018-06-22 02:09:38,798 INFO ]: Start isEmpty. Operand 29 states and 60 transitions. [2018-06-22 02:09:38,799 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:09:38,799 INFO ]: Found error trace [2018-06-22 02:09:38,799 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:38,799 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:38,799 INFO ]: Analyzing trace with hash 589113098, now seen corresponding path program 1 times [2018-06-22 02:09:38,799 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:38,799 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:38,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:38,800 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:38,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:38,830 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:39,183 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:39,183 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:39,183 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 02:09:39,189 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:39,204 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:39,206 INFO ]: Computing forward predicates... [2018-06-22 02:09:39,394 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:39,413 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:39,413 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 02:09:39,413 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:09:39,413 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:09:39,413 INFO ]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:09:39,413 INFO ]: Start difference. First operand 29 states and 60 transitions. Second operand 13 states. [2018-06-22 02:09:39,606 WARN ]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-06-22 02:09:39,960 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:39,960 INFO ]: Finished difference Result 70 states and 153 transitions. [2018-06-22 02:09:39,961 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 02:09:39,961 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-22 02:09:39,961 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:39,962 INFO ]: With dead ends: 70 [2018-06-22 02:09:39,962 INFO ]: Without dead ends: 67 [2018-06-22 02:09:39,962 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-06-22 02:09:39,963 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 02:09:39,972 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 35. [2018-06-22 02:09:39,972 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 02:09:39,973 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 76 transitions. [2018-06-22 02:09:39,973 INFO ]: Start accepts. Automaton has 35 states and 76 transitions. Word has length 12 [2018-06-22 02:09:39,973 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:39,973 INFO ]: Abstraction has 35 states and 76 transitions. [2018-06-22 02:09:39,973 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:09:39,973 INFO ]: Start isEmpty. Operand 35 states and 76 transitions. [2018-06-22 02:09:39,974 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:09:39,974 INFO ]: Found error trace [2018-06-22 02:09:39,974 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:39,974 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:39,974 INFO ]: Analyzing trace with hash -1027358856, now seen corresponding path program 1 times [2018-06-22 02:09:39,974 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:39,974 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:39,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:39,975 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:39,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:39,987 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:40,050 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:09:40,051 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:40,051 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 02:09:40,060 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:40,076 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:40,078 INFO ]: Computing forward predicates... [2018-06-22 02:09:40,106 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:09:40,127 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:40,127 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 02:09:40,127 INFO ]: Interpolant automaton has 8 states [2018-06-22 02:09:40,127 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 02:09:40,127 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:09:40,127 INFO ]: Start difference. First operand 35 states and 76 transitions. Second operand 8 states. [2018-06-22 02:09:40,253 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:40,253 INFO ]: Finished difference Result 42 states and 94 transitions. [2018-06-22 02:09:40,254 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 02:09:40,254 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-22 02:09:40,254 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:40,255 INFO ]: With dead ends: 42 [2018-06-22 02:09:40,255 INFO ]: Without dead ends: 36 [2018-06-22 02:09:40,255 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:09:40,255 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 02:09:40,258 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-06-22 02:09:40,258 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 02:09:40,259 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 57 transitions. [2018-06-22 02:09:40,259 INFO ]: Start accepts. Automaton has 28 states and 57 transitions. Word has length 12 [2018-06-22 02:09:40,259 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:40,259 INFO ]: Abstraction has 28 states and 57 transitions. [2018-06-22 02:09:40,259 INFO ]: Interpolant automaton has 8 states. [2018-06-22 02:09:40,259 INFO ]: Start isEmpty. Operand 28 states and 57 transitions. [2018-06-22 02:09:40,260 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 02:09:40,260 INFO ]: Found error trace [2018-06-22 02:09:40,260 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:40,260 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:40,260 INFO ]: Analyzing trace with hash 903259662, now seen corresponding path program 2 times [2018-06-22 02:09:40,260 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:40,260 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:40,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:40,261 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:40,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:40,270 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:40,305 INFO ]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:09:40,305 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:09:40,305 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 02:09:40,306 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:09:40,306 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:09:40,306 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:09:40,306 INFO ]: Start difference. First operand 28 states and 57 transitions. Second operand 5 states. [2018-06-22 02:09:40,350 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:40,350 INFO ]: Finished difference Result 38 states and 75 transitions. [2018-06-22 02:09:40,350 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:09:40,350 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 02:09:40,350 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:40,351 INFO ]: With dead ends: 38 [2018-06-22 02:09:40,351 INFO ]: Without dead ends: 38 [2018-06-22 02:09:40,351 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:09:40,351 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 02:09:40,354 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 32. [2018-06-22 02:09:40,354 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 02:09:40,354 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 64 transitions. [2018-06-22 02:09:40,354 INFO ]: Start accepts. Automaton has 32 states and 64 transitions. Word has length 13 [2018-06-22 02:09:40,354 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:40,354 INFO ]: Abstraction has 32 states and 64 transitions. [2018-06-22 02:09:40,355 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:09:40,355 INFO ]: Start isEmpty. Operand 32 states and 64 transitions. [2018-06-22 02:09:40,355 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 02:09:40,355 INFO ]: Found error trace [2018-06-22 02:09:40,355 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:40,355 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:40,355 INFO ]: Analyzing trace with hash -191189182, now seen corresponding path program 1 times [2018-06-22 02:09:40,355 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:40,355 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:40,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:40,357 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:40,357 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:40,365 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:40,694 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:09:40,695 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:40,695 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) [2018-06-22 02:09:40,709 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:09:40,741 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:40,743 INFO ]: Computing forward predicates... [2018-06-22 02:09:40,780 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:09:40,802 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:40,802 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 02:09:40,802 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:09:40,803 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:09:40,803 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:09:40,803 INFO ]: Start difference. First operand 32 states and 64 transitions. Second operand 7 states. [2018-06-22 02:09:40,915 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:40,915 INFO ]: Finished difference Result 54 states and 113 transitions. [2018-06-22 02:09:40,916 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:09:40,916 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 02:09:40,916 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:40,917 INFO ]: With dead ends: 54 [2018-06-22 02:09:40,917 INFO ]: Without dead ends: 51 [2018-06-22 02:09:40,917 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:09:40,918 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 02:09:40,921 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 37. [2018-06-22 02:09:40,921 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 02:09:40,922 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 73 transitions. [2018-06-22 02:09:40,922 INFO ]: Start accepts. Automaton has 37 states and 73 transitions. Word has length 13 [2018-06-22 02:09:40,922 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:40,922 INFO ]: Abstraction has 37 states and 73 transitions. [2018-06-22 02:09:40,922 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:09:40,922 INFO ]: Start isEmpty. Operand 37 states and 73 transitions. [2018-06-22 02:09:40,923 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 02:09:40,923 INFO ]: Found error trace [2018-06-22 02:09:40,923 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:40,923 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:40,923 INFO ]: Analyzing trace with hash 1709492381, now seen corresponding path program 1 times [2018-06-22 02:09:40,923 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:40,923 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:40,924 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:40,924 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:40,924 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:40,931 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:41,052 INFO ]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:09:41,052 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:09:41,052 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 02:09:41,052 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:09:41,052 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:09:41,052 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:09:41,052 INFO ]: Start difference. First operand 37 states and 73 transitions. Second operand 5 states. [2018-06-22 02:09:41,114 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:41,114 INFO ]: Finished difference Result 45 states and 90 transitions. [2018-06-22 02:09:41,114 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:09:41,114 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 02:09:41,114 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:41,115 INFO ]: With dead ends: 45 [2018-06-22 02:09:41,115 INFO ]: Without dead ends: 45 [2018-06-22 02:09:41,115 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:09:41,115 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 02:09:41,118 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-06-22 02:09:41,118 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 02:09:41,120 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 79 transitions. [2018-06-22 02:09:41,120 INFO ]: Start accepts. Automaton has 40 states and 79 transitions. Word has length 13 [2018-06-22 02:09:41,120 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:41,120 INFO ]: Abstraction has 40 states and 79 transitions. [2018-06-22 02:09:41,120 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:09:41,120 INFO ]: Start isEmpty. Operand 40 states and 79 transitions. [2018-06-22 02:09:41,120 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 02:09:41,121 INFO ]: Found error trace [2018-06-22 02:09:41,121 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:41,121 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:41,121 INFO ]: Analyzing trace with hash 1999513776, now seen corresponding path program 2 times [2018-06-22 02:09:41,121 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:41,121 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:41,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:41,122 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:41,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:41,131 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:41,277 INFO ]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:09:41,277 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:41,277 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 02:09:41,284 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:09:41,333 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:09:41,333 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:41,335 INFO ]: Computing forward predicates... [2018-06-22 02:09:41,607 INFO ]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:09:41,640 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:09:41,640 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-06-22 02:09:41,640 INFO ]: Interpolant automaton has 10 states [2018-06-22 02:09:41,640 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 02:09:41,640 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:09:41,640 INFO ]: Start difference. First operand 40 states and 79 transitions. Second operand 10 states. [2018-06-22 02:09:41,909 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:41,909 INFO ]: Finished difference Result 59 states and 120 transitions. [2018-06-22 02:09:41,909 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 02:09:41,909 INFO ]: Start accepts. Automaton has 10 states. Word has length 14 [2018-06-22 02:09:41,909 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:41,910 INFO ]: With dead ends: 59 [2018-06-22 02:09:41,910 INFO ]: Without dead ends: 59 [2018-06-22 02:09:41,910 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:09:41,910 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 02:09:41,913 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 43. [2018-06-22 02:09:41,913 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 02:09:41,914 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 86 transitions. [2018-06-22 02:09:41,914 INFO ]: Start accepts. Automaton has 43 states and 86 transitions. Word has length 14 [2018-06-22 02:09:41,914 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:41,914 INFO ]: Abstraction has 43 states and 86 transitions. [2018-06-22 02:09:41,914 INFO ]: Interpolant automaton has 10 states. [2018-06-22 02:09:41,914 INFO ]: Start isEmpty. Operand 43 states and 86 transitions. [2018-06-22 02:09:41,915 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 02:09:41,915 INFO ]: Found error trace [2018-06-22 02:09:41,915 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:41,915 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:41,915 INFO ]: Analyzing trace with hash -2067629752, now seen corresponding path program 1 times [2018-06-22 02:09:41,915 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:41,915 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:41,916 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:41,916 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:41,916 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:41,924 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:42,107 INFO ]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:09:42,107 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:42,107 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 02:09:42,120 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:42,154 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:42,156 INFO ]: Computing forward predicates... [2018-06-22 02:09:42,291 INFO ]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:09:42,310 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:42,310 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-06-22 02:09:42,310 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:09:42,310 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:09:42,310 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:09:42,310 INFO ]: Start difference. First operand 43 states and 86 transitions. Second operand 13 states. [2018-06-22 02:09:42,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:42,886 INFO ]: Finished difference Result 56 states and 114 transitions. [2018-06-22 02:09:42,887 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 02:09:42,887 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-22 02:09:42,888 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:42,888 INFO ]: With dead ends: 56 [2018-06-22 02:09:42,888 INFO ]: Without dead ends: 41 [2018-06-22 02:09:42,889 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2018-06-22 02:09:42,889 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 02:09:42,893 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 34. [2018-06-22 02:09:42,893 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 02:09:42,893 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 68 transitions. [2018-06-22 02:09:42,893 INFO ]: Start accepts. Automaton has 34 states and 68 transitions. Word has length 14 [2018-06-22 02:09:42,893 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:42,893 INFO ]: Abstraction has 34 states and 68 transitions. [2018-06-22 02:09:42,893 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:09:42,893 INFO ]: Start isEmpty. Operand 34 states and 68 transitions. [2018-06-22 02:09:42,894 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 02:09:42,894 INFO ]: Found error trace [2018-06-22 02:09:42,894 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:42,894 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:42,894 INFO ]: Analyzing trace with hash 801778565, now seen corresponding path program 1 times [2018-06-22 02:09:42,894 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:42,894 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:42,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:42,895 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:42,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:42,907 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:42,948 INFO ]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:09:42,948 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:09:42,948 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:09:42,948 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:09:42,948 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:09:42,948 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:09:42,948 INFO ]: Start difference. First operand 34 states and 68 transitions. Second operand 3 states. [2018-06-22 02:09:42,959 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:42,959 INFO ]: Finished difference Result 35 states and 70 transitions. [2018-06-22 02:09:42,959 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:09:42,960 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-22 02:09:42,960 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:42,960 INFO ]: With dead ends: 35 [2018-06-22 02:09:42,960 INFO ]: Without dead ends: 29 [2018-06-22 02:09:42,960 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:09:42,960 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 02:09:42,962 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-06-22 02:09:42,962 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 02:09:42,962 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 52 transitions. [2018-06-22 02:09:42,963 INFO ]: Start accepts. Automaton has 26 states and 52 transitions. Word has length 14 [2018-06-22 02:09:42,963 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:42,963 INFO ]: Abstraction has 26 states and 52 transitions. [2018-06-22 02:09:42,963 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:09:42,963 INFO ]: Start isEmpty. Operand 26 states and 52 transitions. [2018-06-22 02:09:42,963 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 02:09:42,963 INFO ]: Found error trace [2018-06-22 02:09:42,963 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:42,963 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:42,963 INFO ]: Analyzing trace with hash 2107820044, now seen corresponding path program 1 times [2018-06-22 02:09:42,963 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:42,963 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:42,964 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:42,964 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:42,964 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:42,973 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:43,056 INFO ]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:09:43,056 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:43,057 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 02:09:43,062 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:43,083 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:43,084 INFO ]: Computing forward predicates... [2018-06-22 02:09:43,114 INFO ]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:09:43,139 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:43,139 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-06-22 02:09:43,139 INFO ]: Interpolant automaton has 10 states [2018-06-22 02:09:43,139 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 02:09:43,139 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:09:43,139 INFO ]: Start difference. First operand 26 states and 52 transitions. Second operand 10 states. [2018-06-22 02:09:43,293 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:43,293 INFO ]: Finished difference Result 31 states and 65 transitions. [2018-06-22 02:09:43,293 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 02:09:43,293 INFO ]: Start accepts. Automaton has 10 states. Word has length 14 [2018-06-22 02:09:43,293 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:43,293 INFO ]: With dead ends: 31 [2018-06-22 02:09:43,293 INFO ]: Without dead ends: 23 [2018-06-22 02:09:43,294 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:09:43,294 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 02:09:43,296 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-22 02:09:43,296 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 02:09:43,296 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 42 transitions. [2018-06-22 02:09:43,296 INFO ]: Start accepts. Automaton has 21 states and 42 transitions. Word has length 14 [2018-06-22 02:09:43,296 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:43,296 INFO ]: Abstraction has 21 states and 42 transitions. [2018-06-22 02:09:43,296 INFO ]: Interpolant automaton has 10 states. [2018-06-22 02:09:43,296 INFO ]: Start isEmpty. Operand 21 states and 42 transitions. [2018-06-22 02:09:43,297 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 02:09:43,297 INFO ]: Found error trace [2018-06-22 02:09:43,297 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:43,297 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:43,297 INFO ]: Analyzing trace with hash 1374740606, now seen corresponding path program 1 times [2018-06-22 02:09:43,297 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:43,297 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:43,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:43,297 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:43,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:43,307 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:43,662 INFO ]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 02:09:43,662 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:43,662 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) [2018-06-22 02:09:43,676 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:09:43,716 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:43,718 INFO ]: Computing forward predicates... [2018-06-22 02:09:44,039 INFO ]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:09:44,061 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:09:44,061 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-06-22 02:09:44,061 INFO ]: Interpolant automaton has 9 states [2018-06-22 02:09:44,062 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 02:09:44,062 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:09:44,062 INFO ]: Start difference. First operand 21 states and 42 transitions. Second operand 9 states. [2018-06-22 02:09:44,283 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:44,283 INFO ]: Finished difference Result 33 states and 74 transitions. [2018-06-22 02:09:44,283 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 02:09:44,283 INFO ]: Start accepts. Automaton has 9 states. Word has length 16 [2018-06-22 02:09:44,283 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:44,284 INFO ]: With dead ends: 33 [2018-06-22 02:09:44,284 INFO ]: Without dead ends: 25 [2018-06-22 02:09:44,284 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:09:44,284 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 02:09:44,285 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-06-22 02:09:44,285 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 02:09:44,286 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 44 transitions. [2018-06-22 02:09:44,286 INFO ]: Start accepts. Automaton has 22 states and 44 transitions. Word has length 16 [2018-06-22 02:09:44,286 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:44,286 INFO ]: Abstraction has 22 states and 44 transitions. [2018-06-22 02:09:44,286 INFO ]: Interpolant automaton has 9 states. [2018-06-22 02:09:44,286 INFO ]: Start isEmpty. Operand 22 states and 44 transitions. [2018-06-22 02:09:44,286 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 02:09:44,286 INFO ]: Found error trace [2018-06-22 02:09:44,286 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:44,287 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:44,287 INFO ]: Analyzing trace with hash 588686586, now seen corresponding path program 1 times [2018-06-22 02:09:44,287 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:44,287 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:44,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:44,287 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:44,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:44,320 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:44,646 INFO ]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:09:44,646 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:44,646 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 02:09:44,652 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:44,688 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:44,692 INFO ]: Computing forward predicates... [2018-06-22 02:09:45,234 WARN ]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-22 02:09:47,604 INFO ]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:09:47,653 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:47,653 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-06-22 02:09:47,653 INFO ]: Interpolant automaton has 20 states [2018-06-22 02:09:47,653 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 02:09:47,653 INFO ]: CoverageRelationStatistics Valid=55, Invalid=323, Unknown=2, NotChecked=0, Total=380 [2018-06-22 02:09:47,653 INFO ]: Start difference. First operand 22 states and 44 transitions. Second operand 20 states. [2018-06-22 02:09:55,043 WARN ]: Spent 3.18 s on a formula simplification that was a NOOP. DAG size: 67 [2018-06-22 02:09:55,624 WARN ]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-06-22 02:09:56,109 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:56,110 INFO ]: Finished difference Result 122 states and 295 transitions. [2018-06-22 02:09:56,111 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 02:09:56,111 INFO ]: Start accepts. Automaton has 20 states. Word has length 16 [2018-06-22 02:09:56,111 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:56,112 INFO ]: With dead ends: 122 [2018-06-22 02:09:56,112 INFO ]: Without dead ends: 120 [2018-06-22 02:09:56,112 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=392, Invalid=1498, Unknown=2, NotChecked=0, Total=1892 [2018-06-22 02:09:56,112 INFO ]: Start minimizeSevpa. Operand 120 states. [2018-06-22 02:09:56,128 INFO ]: Finished minimizeSevpa. Reduced states from 120 to 38. [2018-06-22 02:09:56,128 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 02:09:56,129 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 85 transitions. [2018-06-22 02:09:56,129 INFO ]: Start accepts. Automaton has 38 states and 85 transitions. Word has length 16 [2018-06-22 02:09:56,129 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:56,129 INFO ]: Abstraction has 38 states and 85 transitions. [2018-06-22 02:09:56,129 INFO ]: Interpolant automaton has 20 states. [2018-06-22 02:09:56,129 INFO ]: Start isEmpty. Operand 38 states and 85 transitions. [2018-06-22 02:09:56,129 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 02:09:56,130 INFO ]: Found error trace [2018-06-22 02:09:56,130 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:56,130 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:56,130 INFO ]: Analyzing trace with hash -285054094, now seen corresponding path program 2 times [2018-06-22 02:09:56,130 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:56,130 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:56,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:56,131 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:56,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:56,149 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:56,241 INFO ]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:09:56,241 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:56,241 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:09:56,247 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:09:56,285 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:09:56,285 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:56,287 INFO ]: Computing forward predicates... [2018-06-22 02:09:56,344 INFO ]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:09:56,364 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:09:56,364 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-22 02:09:56,364 INFO ]: Interpolant automaton has 6 states [2018-06-22 02:09:56,364 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 02:09:56,364 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:09:56,364 INFO ]: Start difference. First operand 38 states and 85 transitions. Second operand 6 states. [2018-06-22 02:09:56,385 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:56,385 INFO ]: Finished difference Result 38 states and 81 transitions. [2018-06-22 02:09:56,385 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:09:56,385 INFO ]: Start accepts. Automaton has 6 states. Word has length 16 [2018-06-22 02:09:56,386 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:56,386 INFO ]: With dead ends: 38 [2018-06-22 02:09:56,386 INFO ]: Without dead ends: 38 [2018-06-22 02:09:56,386 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:09:56,386 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 02:09:56,390 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-22 02:09:56,390 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 02:09:56,391 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 81 transitions. [2018-06-22 02:09:56,391 INFO ]: Start accepts. Automaton has 38 states and 81 transitions. Word has length 16 [2018-06-22 02:09:56,391 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:56,391 INFO ]: Abstraction has 38 states and 81 transitions. [2018-06-22 02:09:56,391 INFO ]: Interpolant automaton has 6 states. [2018-06-22 02:09:56,391 INFO ]: Start isEmpty. Operand 38 states and 81 transitions. [2018-06-22 02:09:56,391 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 02:09:56,391 INFO ]: Found error trace [2018-06-22 02:09:56,391 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:56,391 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:56,392 INFO ]: Analyzing trace with hash -1030006666, now seen corresponding path program 1 times [2018-06-22 02:09:56,392 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:56,392 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:56,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:56,392 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:56,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:56,410 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:56,585 INFO ]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:09:56,585 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:56,585 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 02:09:56,591 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:56,623 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:56,625 INFO ]: Computing forward predicates... [2018-06-22 02:09:56,705 INFO ]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:09:56,738 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:56,738 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-22 02:09:56,739 INFO ]: Interpolant automaton has 12 states [2018-06-22 02:09:56,739 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 02:09:56,739 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:09:56,739 INFO ]: Start difference. First operand 38 states and 81 transitions. Second operand 12 states. [2018-06-22 02:09:57,392 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:57,392 INFO ]: Finished difference Result 78 states and 173 transitions. [2018-06-22 02:09:57,392 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 02:09:57,392 INFO ]: Start accepts. Automaton has 12 states. Word has length 16 [2018-06-22 02:09:57,392 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:57,393 INFO ]: With dead ends: 78 [2018-06-22 02:09:57,393 INFO ]: Without dead ends: 73 [2018-06-22 02:09:57,393 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2018-06-22 02:09:57,393 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 02:09:57,396 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 52. [2018-06-22 02:09:57,397 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 02:09:57,397 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 108 transitions. [2018-06-22 02:09:57,397 INFO ]: Start accepts. Automaton has 52 states and 108 transitions. Word has length 16 [2018-06-22 02:09:57,398 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:57,398 INFO ]: Abstraction has 52 states and 108 transitions. [2018-06-22 02:09:57,398 INFO ]: Interpolant automaton has 12 states. [2018-06-22 02:09:57,398 INFO ]: Start isEmpty. Operand 52 states and 108 transitions. [2018-06-22 02:09:57,398 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 02:09:57,398 INFO ]: Found error trace [2018-06-22 02:09:57,398 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:57,398 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:57,398 INFO ]: Analyzing trace with hash 1175492600, now seen corresponding path program 1 times [2018-06-22 02:09:57,399 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:57,399 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:57,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:57,409 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:57,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:57,419 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:57,753 INFO ]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:09:57,753 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:57,753 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 02:09:57,767 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:09:57,806 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:57,808 INFO ]: Computing forward predicates... [2018-06-22 02:09:57,955 INFO ]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:09:57,986 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:57,986 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 02:09:57,986 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:09:57,986 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:09:57,986 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:09:57,987 INFO ]: Start difference. First operand 52 states and 108 transitions. Second operand 7 states. [2018-06-22 02:09:58,037 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:58,038 INFO ]: Finished difference Result 63 states and 132 transitions. [2018-06-22 02:09:58,038 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:09:58,038 INFO ]: Start accepts. Automaton has 7 states. Word has length 16 [2018-06-22 02:09:58,038 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:58,038 INFO ]: With dead ends: 63 [2018-06-22 02:09:58,038 INFO ]: Without dead ends: 63 [2018-06-22 02:09:58,038 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:09:58,038 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 02:09:58,040 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-06-22 02:09:58,040 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 02:09:58,041 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 110 transitions. [2018-06-22 02:09:58,041 INFO ]: Start accepts. Automaton has 53 states and 110 transitions. Word has length 16 [2018-06-22 02:09:58,041 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:58,041 INFO ]: Abstraction has 53 states and 110 transitions. [2018-06-22 02:09:58,041 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:09:58,041 INFO ]: Start isEmpty. Operand 53 states and 110 transitions. [2018-06-22 02:09:58,042 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 02:09:58,042 INFO ]: Found error trace [2018-06-22 02:09:58,042 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:58,042 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:58,042 INFO ]: Analyzing trace with hash 1073276376, now seen corresponding path program 1 times [2018-06-22 02:09:58,042 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:58,042 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:58,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:58,043 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:58,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:58,052 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:58,126 INFO ]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:09:58,126 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:58,126 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 02:09:58,132 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:58,154 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:58,156 INFO ]: Computing forward predicates... [2018-06-22 02:09:58,171 INFO ]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:09:58,191 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:58,191 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 02:09:58,191 INFO ]: Interpolant automaton has 8 states [2018-06-22 02:09:58,191 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 02:09:58,191 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:09:58,191 INFO ]: Start difference. First operand 53 states and 110 transitions. Second operand 8 states. [2018-06-22 02:09:58,261 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:58,261 INFO ]: Finished difference Result 65 states and 136 transitions. [2018-06-22 02:09:58,262 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 02:09:58,262 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 02:09:58,262 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:58,262 INFO ]: With dead ends: 65 [2018-06-22 02:09:58,262 INFO ]: Without dead ends: 60 [2018-06-22 02:09:58,263 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:09:58,263 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 02:09:58,268 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-06-22 02:09:58,268 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 02:09:58,268 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 99 transitions. [2018-06-22 02:09:58,268 INFO ]: Start accepts. Automaton has 52 states and 99 transitions. Word has length 17 [2018-06-22 02:09:58,268 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:58,268 INFO ]: Abstraction has 52 states and 99 transitions. [2018-06-22 02:09:58,268 INFO ]: Interpolant automaton has 8 states. [2018-06-22 02:09:58,268 INFO ]: Start isEmpty. Operand 52 states and 99 transitions. [2018-06-22 02:09:58,269 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 02:09:58,269 INFO ]: Found error trace [2018-06-22 02:09:58,269 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:58,269 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:58,269 INFO ]: Analyzing trace with hash 794676066, now seen corresponding path program 3 times [2018-06-22 02:09:58,269 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:58,269 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:58,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:58,270 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:58,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:58,279 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:58,368 INFO ]: Checked inductivity of 11 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:09:58,368 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:58,368 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 02:09:58,375 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:09:58,401 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 02:09:58,401 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:58,403 INFO ]: Computing forward predicates... [2018-06-22 02:09:58,491 INFO ]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:09:58,521 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:58,521 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2018-06-22 02:09:58,521 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:09:58,521 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:09:58,521 INFO ]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:09:58,521 INFO ]: Start difference. First operand 52 states and 99 transitions. Second operand 13 states. [2018-06-22 02:09:58,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:58,886 INFO ]: Finished difference Result 117 states and 228 transitions. [2018-06-22 02:09:58,888 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 02:09:58,888 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 02:09:58,888 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:58,889 INFO ]: With dead ends: 117 [2018-06-22 02:09:58,889 INFO ]: Without dead ends: 100 [2018-06-22 02:09:58,890 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2018-06-22 02:09:58,890 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-22 02:09:58,893 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 65. [2018-06-22 02:09:58,893 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 02:09:58,894 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 124 transitions. [2018-06-22 02:09:58,894 INFO ]: Start accepts. Automaton has 65 states and 124 transitions. Word has length 17 [2018-06-22 02:09:58,894 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:58,894 INFO ]: Abstraction has 65 states and 124 transitions. [2018-06-22 02:09:58,894 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:09:58,894 INFO ]: Start isEmpty. Operand 65 states and 124 transitions. [2018-06-22 02:09:58,895 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 02:09:58,895 INFO ]: Found error trace [2018-06-22 02:09:58,895 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:58,895 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:58,895 INFO ]: Analyzing trace with hash 283631970, now seen corresponding path program 1 times [2018-06-22 02:09:58,895 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:58,900 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:58,901 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:58,901 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:09:58,901 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:58,913 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:59,183 INFO ]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:09:59,183 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:59,183 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 02:09:59,190 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:59,214 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:59,215 INFO ]: Computing forward predicates... [2018-06-22 02:09:59,307 INFO ]: Checked inductivity of 10 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:09:59,326 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:59,326 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-06-22 02:09:59,326 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:09:59,326 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:09:59,326 INFO ]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:09:59,327 INFO ]: Start difference. First operand 65 states and 124 transitions. Second operand 13 states. [2018-06-22 02:09:59,713 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:09:59,713 INFO ]: Finished difference Result 100 states and 177 transitions. [2018-06-22 02:09:59,715 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 02:09:59,715 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 02:09:59,716 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:09:59,716 INFO ]: With dead ends: 100 [2018-06-22 02:09:59,716 INFO ]: Without dead ends: 90 [2018-06-22 02:09:59,716 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2018-06-22 02:09:59,716 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-22 02:09:59,718 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 59. [2018-06-22 02:09:59,718 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 02:09:59,719 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 100 transitions. [2018-06-22 02:09:59,719 INFO ]: Start accepts. Automaton has 59 states and 100 transitions. Word has length 17 [2018-06-22 02:09:59,720 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:09:59,720 INFO ]: Abstraction has 59 states and 100 transitions. [2018-06-22 02:09:59,720 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:09:59,720 INFO ]: Start isEmpty. Operand 59 states and 100 transitions. [2018-06-22 02:09:59,720 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 02:09:59,720 INFO ]: Found error trace [2018-06-22 02:09:59,720 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:09:59,720 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:09:59,720 INFO ]: Analyzing trace with hash 2084393626, now seen corresponding path program 1 times [2018-06-22 02:09:59,720 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:09:59,721 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:09:59,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:59,721 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:59,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:09:59,732 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:59,831 INFO ]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:09:59,831 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:09:59,831 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 02:09:59,838 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:09:59,861 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:09:59,863 INFO ]: Computing forward predicates... [2018-06-22 02:09:59,897 INFO ]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:09:59,919 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:09:59,919 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 02:09:59,919 INFO ]: Interpolant automaton has 10 states [2018-06-22 02:09:59,919 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 02:09:59,919 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:09:59,919 INFO ]: Start difference. First operand 59 states and 100 transitions. Second operand 10 states. [2018-06-22 02:10:00,098 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:00,098 INFO ]: Finished difference Result 72 states and 119 transitions. [2018-06-22 02:10:00,098 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 02:10:00,098 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 02:10:00,098 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:00,099 INFO ]: With dead ends: 72 [2018-06-22 02:10:00,099 INFO ]: Without dead ends: 70 [2018-06-22 02:10:00,099 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2018-06-22 02:10:00,100 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 02:10:00,101 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 56. [2018-06-22 02:10:00,102 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 02:10:00,102 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 93 transitions. [2018-06-22 02:10:00,102 INFO ]: Start accepts. Automaton has 56 states and 93 transitions. Word has length 17 [2018-06-22 02:10:00,102 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:00,102 INFO ]: Abstraction has 56 states and 93 transitions. [2018-06-22 02:10:00,102 INFO ]: Interpolant automaton has 10 states. [2018-06-22 02:10:00,102 INFO ]: Start isEmpty. Operand 56 states and 93 transitions. [2018-06-22 02:10:00,103 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 02:10:00,103 INFO ]: Found error trace [2018-06-22 02:10:00,103 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:00,103 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:00,103 INFO ]: Analyzing trace with hash 454270778, now seen corresponding path program 4 times [2018-06-22 02:10:00,103 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:00,103 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:00,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:00,103 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:00,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:00,114 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:00,502 INFO ]: Checked inductivity of 15 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:10:00,503 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:00,503 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 02:10:00,509 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:10:00,537 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:10:00,537 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:00,539 INFO ]: Computing forward predicates... [2018-06-22 02:10:00,559 INFO ]: Checked inductivity of 15 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:10:00,582 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:00,582 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2018-06-22 02:10:00,582 INFO ]: Interpolant automaton has 12 states [2018-06-22 02:10:00,582 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 02:10:00,582 INFO ]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:10:00,583 INFO ]: Start difference. First operand 56 states and 93 transitions. Second operand 12 states. [2018-06-22 02:10:00,751 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:00,751 INFO ]: Finished difference Result 95 states and 172 transitions. [2018-06-22 02:10:00,753 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 02:10:00,753 INFO ]: Start accepts. Automaton has 12 states. Word has length 18 [2018-06-22 02:10:00,754 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:00,754 INFO ]: With dead ends: 95 [2018-06-22 02:10:00,754 INFO ]: Without dead ends: 94 [2018-06-22 02:10:00,754 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-06-22 02:10:00,754 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 02:10:00,756 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 71. [2018-06-22 02:10:00,756 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 02:10:00,757 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 122 transitions. [2018-06-22 02:10:00,757 INFO ]: Start accepts. Automaton has 71 states and 122 transitions. Word has length 18 [2018-06-22 02:10:00,757 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:00,757 INFO ]: Abstraction has 71 states and 122 transitions. [2018-06-22 02:10:00,757 INFO ]: Interpolant automaton has 12 states. [2018-06-22 02:10:00,757 INFO ]: Start isEmpty. Operand 71 states and 122 transitions. [2018-06-22 02:10:00,758 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 02:10:00,758 INFO ]: Found error trace [2018-06-22 02:10:00,758 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:00,758 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:00,758 INFO ]: Analyzing trace with hash -272668086, now seen corresponding path program 5 times [2018-06-22 02:10:00,758 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:00,758 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:00,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:00,758 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:00,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:00,769 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:00,870 INFO ]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 02:10:00,870 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:00,870 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 02:10:00,877 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:10:00,906 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 02:10:00,906 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:00,908 INFO ]: Computing forward predicates... [2018-06-22 02:10:00,955 INFO ]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:10:00,978 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:00,978 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-22 02:10:00,979 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:10:00,979 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:10:00,979 INFO ]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:10:00,979 INFO ]: Start difference. First operand 71 states and 122 transitions. Second operand 13 states. [2018-06-22 02:10:01,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:01,306 INFO ]: Finished difference Result 93 states and 169 transitions. [2018-06-22 02:10:01,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 02:10:01,306 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-22 02:10:01,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:01,307 INFO ]: With dead ends: 93 [2018-06-22 02:10:01,307 INFO ]: Without dead ends: 87 [2018-06-22 02:10:01,307 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2018-06-22 02:10:01,307 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-22 02:10:01,310 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 70. [2018-06-22 02:10:01,310 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 02:10:01,310 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 120 transitions. [2018-06-22 02:10:01,310 INFO ]: Start accepts. Automaton has 70 states and 120 transitions. Word has length 18 [2018-06-22 02:10:01,310 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:01,310 INFO ]: Abstraction has 70 states and 120 transitions. [2018-06-22 02:10:01,310 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:10:01,310 INFO ]: Start isEmpty. Operand 70 states and 120 transitions. [2018-06-22 02:10:01,311 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 02:10:01,311 INFO ]: Found error trace [2018-06-22 02:10:01,311 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:01,311 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:01,311 INFO ]: Analyzing trace with hash 1805563863, now seen corresponding path program 1 times [2018-06-22 02:10:01,311 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:01,311 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:01,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:01,314 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:01,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:01,323 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:01,425 INFO ]: Checked inductivity of 12 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 02:10:01,425 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:01,425 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 02:10:01,431 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:01,460 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:01,462 INFO ]: Computing forward predicates... [2018-06-22 02:10:01,526 INFO ]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 02:10:01,548 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:01,548 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 10 [2018-06-22 02:10:01,548 INFO ]: Interpolant automaton has 10 states [2018-06-22 02:10:01,548 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 02:10:01,548 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:10:01,549 INFO ]: Start difference. First operand 70 states and 120 transitions. Second operand 10 states. [2018-06-22 02:10:01,724 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:01,724 INFO ]: Finished difference Result 76 states and 130 transitions. [2018-06-22 02:10:01,724 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 02:10:01,724 INFO ]: Start accepts. Automaton has 10 states. Word has length 18 [2018-06-22 02:10:01,724 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:01,724 INFO ]: With dead ends: 76 [2018-06-22 02:10:01,724 INFO ]: Without dead ends: 63 [2018-06-22 02:10:01,725 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:10:01,725 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 02:10:01,726 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 47. [2018-06-22 02:10:01,726 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 02:10:01,727 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 75 transitions. [2018-06-22 02:10:01,727 INFO ]: Start accepts. Automaton has 47 states and 75 transitions. Word has length 18 [2018-06-22 02:10:01,727 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:01,727 INFO ]: Abstraction has 47 states and 75 transitions. [2018-06-22 02:10:01,727 INFO ]: Interpolant automaton has 10 states. [2018-06-22 02:10:01,727 INFO ]: Start isEmpty. Operand 47 states and 75 transitions. [2018-06-22 02:10:01,727 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 02:10:01,727 INFO ]: Found error trace [2018-06-22 02:10:01,727 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:01,727 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:01,727 INFO ]: Analyzing trace with hash 1394169676, now seen corresponding path program 2 times [2018-06-22 02:10:01,727 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:01,728 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:01,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:01,728 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:01,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:01,736 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:02,200 INFO ]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 02:10:02,200 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:02,200 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 02:10:02,206 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:10:02,237 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:10:02,237 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:02,239 INFO ]: Computing forward predicates... [2018-06-22 02:10:02,287 INFO ]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 02:10:02,320 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:02,320 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2018-06-22 02:10:02,320 INFO ]: Interpolant automaton has 12 states [2018-06-22 02:10:02,320 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 02:10:02,320 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:10:02,321 INFO ]: Start difference. First operand 47 states and 75 transitions. Second operand 12 states. [2018-06-22 02:10:02,465 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:02,465 INFO ]: Finished difference Result 53 states and 87 transitions. [2018-06-22 02:10:02,465 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 02:10:02,465 INFO ]: Start accepts. Automaton has 12 states. Word has length 19 [2018-06-22 02:10:02,465 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:02,465 INFO ]: With dead ends: 53 [2018-06-22 02:10:02,465 INFO ]: Without dead ends: 53 [2018-06-22 02:10:02,466 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2018-06-22 02:10:02,466 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 02:10:02,467 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 38. [2018-06-22 02:10:02,467 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 02:10:02,467 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 62 transitions. [2018-06-22 02:10:02,468 INFO ]: Start accepts. Automaton has 38 states and 62 transitions. Word has length 19 [2018-06-22 02:10:02,468 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:02,468 INFO ]: Abstraction has 38 states and 62 transitions. [2018-06-22 02:10:02,468 INFO ]: Interpolant automaton has 12 states. [2018-06-22 02:10:02,468 INFO ]: Start isEmpty. Operand 38 states and 62 transitions. [2018-06-22 02:10:02,468 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:10:02,468 INFO ]: Found error trace [2018-06-22 02:10:02,468 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:02,468 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:02,468 INFO ]: Analyzing trace with hash 265678794, now seen corresponding path program 3 times [2018-06-22 02:10:02,468 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:02,468 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:02,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:02,469 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:02,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:02,479 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:02,896 INFO ]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 02:10:02,897 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:02,897 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) [2018-06-22 02:10:02,909 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:02,981 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 02:10:02,981 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:02,984 INFO ]: Computing forward predicates... [2018-06-22 02:10:03,354 INFO ]: Checked inductivity of 18 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 02:10:03,377 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:03,377 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-06-22 02:10:03,377 INFO ]: Interpolant automaton has 12 states [2018-06-22 02:10:03,377 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 02:10:03,377 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:10:03,377 INFO ]: Start difference. First operand 38 states and 62 transitions. Second operand 12 states. [2018-06-22 02:10:03,550 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:03,550 INFO ]: Finished difference Result 47 states and 77 transitions. [2018-06-22 02:10:03,551 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 02:10:03,551 INFO ]: Start accepts. Automaton has 12 states. Word has length 20 [2018-06-22 02:10:03,551 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:03,551 INFO ]: With dead ends: 47 [2018-06-22 02:10:03,551 INFO ]: Without dead ends: 34 [2018-06-22 02:10:03,551 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2018-06-22 02:10:03,551 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 02:10:03,552 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 27. [2018-06-22 02:10:03,552 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 02:10:03,553 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 45 transitions. [2018-06-22 02:10:03,553 INFO ]: Start accepts. Automaton has 27 states and 45 transitions. Word has length 20 [2018-06-22 02:10:03,553 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:03,553 INFO ]: Abstraction has 27 states and 45 transitions. [2018-06-22 02:10:03,553 INFO ]: Interpolant automaton has 12 states. [2018-06-22 02:10:03,553 INFO ]: Start isEmpty. Operand 27 states and 45 transitions. [2018-06-22 02:10:03,553 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:10:03,553 INFO ]: Found error trace [2018-06-22 02:10:03,553 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:03,553 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:03,553 INFO ]: Analyzing trace with hash 112314634, now seen corresponding path program 6 times [2018-06-22 02:10:03,553 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:03,553 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:03,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:03,554 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:03,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:03,570 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:03,795 INFO ]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:10:03,796 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:03,796 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 02:10:03,801 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:10:03,868 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-22 02:10:03,868 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:03,874 INFO ]: Computing forward predicates... [2018-06-22 02:10:04,328 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:10:04,351 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:04,351 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2018-06-22 02:10:04,351 INFO ]: Interpolant automaton has 22 states [2018-06-22 02:10:04,351 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 02:10:04,352 INFO ]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-06-22 02:10:04,352 INFO ]: Start difference. First operand 27 states and 45 transitions. Second operand 22 states. [2018-06-22 02:10:04,902 WARN ]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-22 02:10:05,745 WARN ]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-06-22 02:10:06,041 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:06,041 INFO ]: Finished difference Result 143 states and 257 transitions. [2018-06-22 02:10:06,041 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 02:10:06,041 INFO ]: Start accepts. Automaton has 22 states. Word has length 20 [2018-06-22 02:10:06,041 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:06,042 INFO ]: With dead ends: 143 [2018-06-22 02:10:06,042 INFO ]: Without dead ends: 134 [2018-06-22 02:10:06,042 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=396, Invalid=1584, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 02:10:06,043 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-22 02:10:06,045 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 44. [2018-06-22 02:10:06,046 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 02:10:06,046 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 78 transitions. [2018-06-22 02:10:06,046 INFO ]: Start accepts. Automaton has 44 states and 78 transitions. Word has length 20 [2018-06-22 02:10:06,046 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:06,046 INFO ]: Abstraction has 44 states and 78 transitions. [2018-06-22 02:10:06,046 INFO ]: Interpolant automaton has 22 states. [2018-06-22 02:10:06,046 INFO ]: Start isEmpty. Operand 44 states and 78 transitions. [2018-06-22 02:10:06,046 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:10:06,046 INFO ]: Found error trace [2018-06-22 02:10:06,046 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:06,046 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:06,047 INFO ]: Analyzing trace with hash -673739386, now seen corresponding path program 2 times [2018-06-22 02:10:06,047 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:06,047 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:06,047 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:06,047 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:06,047 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:06,058 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:06,151 INFO ]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 02:10:06,151 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:06,151 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 02:10:06,159 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:10:06,192 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:10:06,192 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:06,194 INFO ]: Computing forward predicates... [2018-06-22 02:10:06,285 INFO ]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:10:06,309 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:06,309 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 02:10:06,309 INFO ]: Interpolant automaton has 16 states [2018-06-22 02:10:06,309 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 02:10:06,309 INFO ]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-06-22 02:10:06,309 INFO ]: Start difference. First operand 44 states and 78 transitions. Second operand 16 states. [2018-06-22 02:10:07,065 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:07,066 INFO ]: Finished difference Result 87 states and 148 transitions. [2018-06-22 02:10:07,066 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 02:10:07,066 INFO ]: Start accepts. Automaton has 16 states. Word has length 20 [2018-06-22 02:10:07,066 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:07,067 INFO ]: With dead ends: 87 [2018-06-22 02:10:07,067 INFO ]: Without dead ends: 76 [2018-06-22 02:10:07,067 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2018-06-22 02:10:07,067 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-22 02:10:07,069 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 55. [2018-06-22 02:10:07,070 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 02:10:07,070 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 95 transitions. [2018-06-22 02:10:07,070 INFO ]: Start accepts. Automaton has 55 states and 95 transitions. Word has length 20 [2018-06-22 02:10:07,070 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:07,070 INFO ]: Abstraction has 55 states and 95 transitions. [2018-06-22 02:10:07,070 INFO ]: Interpolant automaton has 16 states. [2018-06-22 02:10:07,070 INFO ]: Start isEmpty. Operand 55 states and 95 transitions. [2018-06-22 02:10:07,070 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:10:07,070 INFO ]: Found error trace [2018-06-22 02:10:07,071 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:07,071 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:07,071 INFO ]: Analyzing trace with hash 1700662536, now seen corresponding path program 2 times [2018-06-22 02:10:07,071 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:07,071 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:07,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:07,071 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:07,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:07,082 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:07,162 INFO ]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 02:10:07,162 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:07,162 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 02:10:07,169 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:10:07,202 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:10:07,202 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:07,204 INFO ]: Computing forward predicates... [2018-06-22 02:10:07,216 INFO ]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 02:10:07,237 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:07,237 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 02:10:07,237 INFO ]: Interpolant automaton has 9 states [2018-06-22 02:10:07,237 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 02:10:07,237 INFO ]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:10:07,237 INFO ]: Start difference. First operand 55 states and 95 transitions. Second operand 9 states. [2018-06-22 02:10:07,319 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:07,319 INFO ]: Finished difference Result 73 states and 122 transitions. [2018-06-22 02:10:07,322 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 02:10:07,322 INFO ]: Start accepts. Automaton has 9 states. Word has length 20 [2018-06-22 02:10:07,322 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:07,323 INFO ]: With dead ends: 73 [2018-06-22 02:10:07,323 INFO ]: Without dead ends: 73 [2018-06-22 02:10:07,323 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:10:07,323 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 02:10:07,325 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 57. [2018-06-22 02:10:07,325 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 02:10:07,325 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 97 transitions. [2018-06-22 02:10:07,325 INFO ]: Start accepts. Automaton has 57 states and 97 transitions. Word has length 20 [2018-06-22 02:10:07,325 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:07,326 INFO ]: Abstraction has 57 states and 97 transitions. [2018-06-22 02:10:07,326 INFO ]: Interpolant automaton has 9 states. [2018-06-22 02:10:07,326 INFO ]: Start isEmpty. Operand 57 states and 97 transitions. [2018-06-22 02:10:07,326 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 02:10:07,326 INFO ]: Found error trace [2018-06-22 02:10:07,326 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:07,326 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:07,326 INFO ]: Analyzing trace with hash 431323100, now seen corresponding path program 7 times [2018-06-22 02:10:07,326 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:07,326 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:07,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:07,327 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:07,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:07,338 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:07,534 INFO ]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 02:10:07,535 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:07,535 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 02:10:07,541 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:07,577 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:07,579 INFO ]: Computing forward predicates... [2018-06-22 02:10:07,584 INFO ]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 02:10:07,607 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:07,608 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 02:10:07,608 INFO ]: Interpolant automaton has 9 states [2018-06-22 02:10:07,608 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 02:10:07,608 INFO ]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:10:07,608 INFO ]: Start difference. First operand 57 states and 97 transitions. Second operand 9 states. [2018-06-22 02:10:07,684 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:07,684 INFO ]: Finished difference Result 106 states and 175 transitions. [2018-06-22 02:10:07,684 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 02:10:07,684 INFO ]: Start accepts. Automaton has 9 states. Word has length 21 [2018-06-22 02:10:07,684 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:07,685 INFO ]: With dead ends: 106 [2018-06-22 02:10:07,685 INFO ]: Without dead ends: 106 [2018-06-22 02:10:07,685 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:10:07,685 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-22 02:10:07,686 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 62. [2018-06-22 02:10:07,686 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 02:10:07,686 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 107 transitions. [2018-06-22 02:10:07,686 INFO ]: Start accepts. Automaton has 62 states and 107 transitions. Word has length 21 [2018-06-22 02:10:07,686 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:07,686 INFO ]: Abstraction has 62 states and 107 transitions. [2018-06-22 02:10:07,686 INFO ]: Interpolant automaton has 9 states. [2018-06-22 02:10:07,687 INFO ]: Start isEmpty. Operand 62 states and 107 transitions. [2018-06-22 02:10:07,687 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 02:10:07,687 INFO ]: Found error trace [2018-06-22 02:10:07,687 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:07,687 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:07,687 INFO ]: Analyzing trace with hash -476187892, now seen corresponding path program 2 times [2018-06-22 02:10:07,687 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:07,687 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:07,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:07,687 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:07,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:07,695 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:08,169 INFO ]: Checked inductivity of 21 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 02:10:08,170 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:08,170 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 02:10:08,176 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:10:08,210 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:10:08,210 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:08,212 INFO ]: Computing forward predicates... [2018-06-22 02:10:08,275 INFO ]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 02:10:08,298 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:08,298 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-22 02:10:08,298 INFO ]: Interpolant automaton has 16 states [2018-06-22 02:10:08,298 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 02:10:08,298 INFO ]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-06-22 02:10:08,298 INFO ]: Start difference. First operand 62 states and 107 transitions. Second operand 16 states. [2018-06-22 02:10:08,576 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:08,576 INFO ]: Finished difference Result 94 states and 154 transitions. [2018-06-22 02:10:08,576 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 02:10:08,576 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 02:10:08,576 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:08,576 INFO ]: With dead ends: 94 [2018-06-22 02:10:08,576 INFO ]: Without dead ends: 81 [2018-06-22 02:10:08,577 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2018-06-22 02:10:08,577 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 02:10:08,578 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 49. [2018-06-22 02:10:08,578 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 02:10:08,578 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 78 transitions. [2018-06-22 02:10:08,578 INFO ]: Start accepts. Automaton has 49 states and 78 transitions. Word has length 21 [2018-06-22 02:10:08,578 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:08,578 INFO ]: Abstraction has 49 states and 78 transitions. [2018-06-22 02:10:08,578 INFO ]: Interpolant automaton has 16 states. [2018-06-22 02:10:08,578 INFO ]: Start isEmpty. Operand 49 states and 78 transitions. [2018-06-22 02:10:08,579 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 02:10:08,579 INFO ]: Found error trace [2018-06-22 02:10:08,579 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:08,579 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:08,579 INFO ]: Analyzing trace with hash 1523231374, now seen corresponding path program 8 times [2018-06-22 02:10:08,579 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:08,579 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:08,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:08,580 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:08,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:08,591 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:08,670 INFO ]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 02:10:08,670 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:08,670 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 02:10:08,676 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:10:08,721 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:10:08,721 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:08,723 INFO ]: Computing forward predicates... [2018-06-22 02:10:08,815 INFO ]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:10:08,849 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:08,849 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2018-06-22 02:10:08,849 INFO ]: Interpolant automaton has 19 states [2018-06-22 02:10:08,849 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 02:10:08,850 INFO ]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-06-22 02:10:08,850 INFO ]: Start difference. First operand 49 states and 78 transitions. Second operand 19 states. [2018-06-22 02:10:09,845 WARN ]: Spent 281.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-06-22 02:10:10,188 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:10,188 INFO ]: Finished difference Result 131 states and 212 transitions. [2018-06-22 02:10:10,190 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 02:10:10,190 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-22 02:10:10,190 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:10,190 INFO ]: With dead ends: 131 [2018-06-22 02:10:10,190 INFO ]: Without dead ends: 111 [2018-06-22 02:10:10,191 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 02:10:10,191 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-22 02:10:10,192 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 65. [2018-06-22 02:10:10,192 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 02:10:10,193 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 101 transitions. [2018-06-22 02:10:10,193 INFO ]: Start accepts. Automaton has 65 states and 101 transitions. Word has length 21 [2018-06-22 02:10:10,193 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:10,193 INFO ]: Abstraction has 65 states and 101 transitions. [2018-06-22 02:10:10,193 INFO ]: Interpolant automaton has 19 states. [2018-06-22 02:10:10,193 INFO ]: Start isEmpty. Operand 65 states and 101 transitions. [2018-06-22 02:10:10,193 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 02:10:10,193 INFO ]: Found error trace [2018-06-22 02:10:10,193 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:10,193 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:10,193 INFO ]: Analyzing trace with hash -1236806846, now seen corresponding path program 4 times [2018-06-22 02:10:10,193 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:10,193 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:10,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:10,194 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:10,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:10,216 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:10,378 INFO ]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 02:10:10,378 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:10,378 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 02:10:10,384 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:10:10,415 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:10:10,415 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:10,417 INFO ]: Computing forward predicates... [2018-06-22 02:10:10,477 INFO ]: Checked inductivity of 21 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 02:10:10,498 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:10,498 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-06-22 02:10:10,498 INFO ]: Interpolant automaton has 17 states [2018-06-22 02:10:10,498 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 02:10:10,498 INFO ]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:10:10,498 INFO ]: Start difference. First operand 65 states and 101 transitions. Second operand 17 states. [2018-06-22 02:10:10,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:10,772 INFO ]: Finished difference Result 102 states and 156 transitions. [2018-06-22 02:10:10,772 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 02:10:10,772 INFO ]: Start accepts. Automaton has 17 states. Word has length 21 [2018-06-22 02:10:10,772 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:10,772 INFO ]: With dead ends: 102 [2018-06-22 02:10:10,772 INFO ]: Without dead ends: 84 [2018-06-22 02:10:10,773 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2018-06-22 02:10:10,773 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-22 02:10:10,774 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 56. [2018-06-22 02:10:10,774 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 02:10:10,774 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 85 transitions. [2018-06-22 02:10:10,774 INFO ]: Start accepts. Automaton has 56 states and 85 transitions. Word has length 21 [2018-06-22 02:10:10,774 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:10,774 INFO ]: Abstraction has 56 states and 85 transitions. [2018-06-22 02:10:10,774 INFO ]: Interpolant automaton has 17 states. [2018-06-22 02:10:10,774 INFO ]: Start isEmpty. Operand 56 states and 85 transitions. [2018-06-22 02:10:10,775 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 02:10:10,775 INFO ]: Found error trace [2018-06-22 02:10:10,775 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:10,775 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:10,775 INFO ]: Analyzing trace with hash 1210241932, now seen corresponding path program 1 times [2018-06-22 02:10:10,775 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:10,775 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:10,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:10,775 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:10,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:10,786 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:11,024 INFO ]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 02:10:11,024 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:11,024 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 02:10:11,030 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:11,085 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:11,088 INFO ]: Computing forward predicates... [2018-06-22 02:10:11,179 INFO ]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 02:10:11,204 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:11,204 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 16 [2018-06-22 02:10:11,204 INFO ]: Interpolant automaton has 16 states [2018-06-22 02:10:11,204 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 02:10:11,204 INFO ]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-06-22 02:10:11,204 INFO ]: Start difference. First operand 56 states and 85 transitions. Second operand 16 states. [2018-06-22 02:10:11,399 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:11,399 INFO ]: Finished difference Result 78 states and 124 transitions. [2018-06-22 02:10:11,400 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 02:10:11,400 INFO ]: Start accepts. Automaton has 16 states. Word has length 22 [2018-06-22 02:10:11,400 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:11,400 INFO ]: With dead ends: 78 [2018-06-22 02:10:11,400 INFO ]: Without dead ends: 60 [2018-06-22 02:10:11,400 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2018-06-22 02:10:11,400 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 02:10:11,402 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 46. [2018-06-22 02:10:11,402 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 02:10:11,402 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 72 transitions. [2018-06-22 02:10:11,403 INFO ]: Start accepts. Automaton has 46 states and 72 transitions. Word has length 22 [2018-06-22 02:10:11,403 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:11,403 INFO ]: Abstraction has 46 states and 72 transitions. [2018-06-22 02:10:11,403 INFO ]: Interpolant automaton has 16 states. [2018-06-22 02:10:11,403 INFO ]: Start isEmpty. Operand 46 states and 72 transitions. [2018-06-22 02:10:11,403 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 02:10:11,403 INFO ]: Found error trace [2018-06-22 02:10:11,403 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:11,403 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:11,403 INFO ]: Analyzing trace with hash -635410194, now seen corresponding path program 5 times [2018-06-22 02:10:11,403 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:11,403 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:11,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:11,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:11,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:11,418 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:11,525 INFO ]: Checked inductivity of 32 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 02:10:11,525 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:11,525 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 02:10:11,531 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:10:11,570 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 02:10:11,570 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:11,572 INFO ]: Computing forward predicates... [2018-06-22 02:10:11,641 INFO ]: Checked inductivity of 32 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 02:10:11,667 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:11,667 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-06-22 02:10:11,667 INFO ]: Interpolant automaton has 14 states [2018-06-22 02:10:11,667 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 02:10:11,667 INFO ]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:10:11,667 INFO ]: Start difference. First operand 46 states and 72 transitions. Second operand 14 states. [2018-06-22 02:10:12,005 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:12,005 INFO ]: Finished difference Result 65 states and 103 transitions. [2018-06-22 02:10:12,005 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 02:10:12,005 INFO ]: Start accepts. Automaton has 14 states. Word has length 24 [2018-06-22 02:10:12,006 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:12,006 INFO ]: With dead ends: 65 [2018-06-22 02:10:12,006 INFO ]: Without dead ends: 41 [2018-06-22 02:10:12,006 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2018-06-22 02:10:12,006 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 02:10:12,007 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-06-22 02:10:12,007 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 02:10:12,007 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 48 transitions. [2018-06-22 02:10:12,007 INFO ]: Start accepts. Automaton has 30 states and 48 transitions. Word has length 24 [2018-06-22 02:10:12,007 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:12,007 INFO ]: Abstraction has 30 states and 48 transitions. [2018-06-22 02:10:12,007 INFO ]: Interpolant automaton has 14 states. [2018-06-22 02:10:12,007 INFO ]: Start isEmpty. Operand 30 states and 48 transitions. [2018-06-22 02:10:12,008 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 02:10:12,008 INFO ]: Found error trace [2018-06-22 02:10:12,008 INFO ]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:12,008 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:12,008 INFO ]: Analyzing trace with hash 352605178, now seen corresponding path program 9 times [2018-06-22 02:10:12,008 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:12,008 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:12,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:12,008 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:12,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:12,025 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:12,778 INFO ]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:10:12,778 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:12,778 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:12,785 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:10:12,830 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 02:10:12,830 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:12,834 INFO ]: Computing forward predicates... [2018-06-22 02:10:15,282 WARN ]: unable to prove that (exists ((gotoProc_hhv_INV_MAIN_3_4_Int Int) (v_gotoProc_hbv_INV_MAIN_2_1_Int_28 Int) (gotoProc_hhv_INV_MAIN_3_1_Int Int) (v_gotoProc_hhv_INV_MAIN_2_2_Int_17 Int)) (let ((.cse2 (+ v_gotoProc_hhv_INV_MAIN_2_2_Int_17 2)) (.cse1 (+ c_gotoProc_hhv_INV_MAIN_2_2_Int gotoProc_hhv_INV_MAIN_3_1_Int)) (.cse0 (+ v_gotoProc_hbv_INV_MAIN_2_1_Int_28 1))) (and (< 2 gotoProc_hhv_INV_MAIN_3_4_Int) (<= 3 gotoProc_hhv_INV_MAIN_3_1_Int) (<= .cse0 gotoProc_hhv_INV_MAIN_3_4_Int) (<= .cse1 .cse2) (<= gotoProc_hhv_INV_MAIN_3_1_Int 3) (<= .cse2 .cse1) (<= gotoProc_hhv_INV_MAIN_3_4_Int .cse0) (not (= (+ (* 4 gotoProc_hhv_INV_MAIN_3_1_Int) (* 3 v_gotoProc_hhv_INV_MAIN_2_2_Int_17)) (+ (* 3 gotoProc_hhv_INV_MAIN_3_4_Int) (* 2 c_gotoProc_hhv_INV_MAIN_2_2_Int) (* 2 v_gotoProc_hbv_INV_MAIN_2_1_Int_28) c_gotoProc_hhv_INV_MAIN_2_5_Int 1))) (<= gotoProc_hhv_INV_MAIN_3_4_Int 3)))) is different from true [2018-06-22 02:10:21,507 INFO ]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 4 not checked. [2018-06-22 02:10:21,540 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:21,540 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2018-06-22 02:10:21,541 INFO ]: Interpolant automaton has 29 states [2018-06-22 02:10:21,541 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 02:10:21,541 INFO ]: CoverageRelationStatistics Valid=83, Invalid=672, Unknown=5, NotChecked=52, Total=812 [2018-06-22 02:10:21,541 INFO ]: Start difference. First operand 30 states and 48 transitions. Second operand 29 states. Received shutdown request... [2018-06-22 02:10:40,785 WARN ]: Spent 1.95 s on a formula simplification that was a NOOP. DAG size: 99 [2018-06-22 02:10:40,787 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 02:10:40,787 WARN ]: Verification canceled [2018-06-22 02:10:40,792 WARN ]: Timeout [2018-06-22 02:10:40,792 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:10:40 BoogieIcfgContainer [2018-06-22 02:10:40,792 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 02:10:40,793 INFO ]: Toolchain (without parser) took 66601.83 ms. Allocated memory was 311.4 MB in the beginning and 471.3 MB in the end (delta: 159.9 MB). Free memory was 264.8 MB in the beginning and 196.7 MB in the end (delta: 68.2 MB). Peak memory consumption was 228.1 MB. Max. memory is 3.6 GB. [2018-06-22 02:10:40,794 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 311.4 MB. Free memory is still 276.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 02:10:40,794 INFO ]: ChcToBoogie took 64.68 ms. Allocated memory is still 311.4 MB. Free memory was 264.8 MB in the beginning and 262.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:10:40,795 INFO ]: Boogie Preprocessor took 39.53 ms. Allocated memory is still 311.4 MB. Free memory was 262.8 MB in the beginning and 260.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:10:40,795 INFO ]: RCFGBuilder took 477.89 ms. Allocated memory is still 311.4 MB. Free memory was 260.8 MB in the beginning and 247.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:10:40,795 INFO ]: TraceAbstraction took 66008.89 ms. Allocated memory was 311.4 MB in the beginning and 471.3 MB in the end (delta: 159.9 MB). Free memory was 246.9 MB in the beginning and 196.7 MB in the end (delta: 50.2 MB). Peak memory consumption was 210.1 MB. Max. memory is 3.6 GB. [2018-06-22 02:10:40,798 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.10 ms. Allocated memory is still 311.4 MB. Free memory is still 276.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.68 ms. Allocated memory is still 311.4 MB. Free memory was 264.8 MB in the beginning and 262.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.53 ms. Allocated memory is still 311.4 MB. Free memory was 262.8 MB in the beginning and 260.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 477.89 ms. Allocated memory is still 311.4 MB. Free memory was 260.8 MB in the beginning and 247.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 66008.89 ms. Allocated memory was 311.4 MB in the beginning and 471.3 MB in the end (delta: 159.9 MB). Free memory was 246.9 MB in the beginning and 196.7 MB in the end (delta: 50.2 MB). Peak memory consumption was 210.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (30states) and interpolant automaton (currently 34 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (83 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 1 error locations. TIMEOUT Result, 65.9s OverallTime, 40 OverallIterations, 3 TraceHistogramMax, 39.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 665 SDtfs, 1522 SDslu, 3712 SDs, 0 SdLazy, 5332 SolverSat, 1644 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 15.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1205 GetRequests, 523 SyntacticMatches, 9 SemanticMatches, 673 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2888 ImplicationChecksByTransitivity, 44.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 714 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 22.7s InterpolantComputationTime, 1217 NumberOfCodeBlocks, 1217 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 1144 ConstructedInterpolants, 17 QuantifiedInterpolants, 78250 SizeOfPredicates, 135 NumberOfNonLiveVariables, 7708 ConjunctsInSsa, 897 ConjunctsInUnsatCore, 73 InterpolantComputations, 10 PerfectInterpolantSequences, 557/828 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/loop__barthe2-big3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_02-10-40-904.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_02-10-40-904.csv Completed graceful shutdown