java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/012b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:14:02,593 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:14:02,596 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:14:02,610 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:14:02,610 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:14:02,611 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:14:02,613 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:14:02,617 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:14:02,619 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:14:02,620 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:14:02,622 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:14:02,622 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:14:02,623 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:14:02,624 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:14:02,628 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:14:02,629 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:14:02,631 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:14:02,645 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:14:02,646 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:14:02,647 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:14:02,648 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:14:02,652 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:14:02,652 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:14:02,652 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:14:02,653 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:14:02,654 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:14:02,654 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:14:02,655 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:14:02,656 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:14:02,656 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:14:02,660 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:14:02,661 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:14:02,661 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:14:02,662 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:14:02,663 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:14:02,663 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:14:02,686 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:14:02,687 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:14:02,687 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:14:02,687 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:14:02,688 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:14:02,688 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:14:02,689 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:14:02,689 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:14:02,689 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:14:02,689 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:14:02,689 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:14:02,690 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:14:02,690 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:14:02,690 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:14:02,691 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:14:02,691 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:14:02,691 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:14:02,691 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:14:02,691 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:14:02,693 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:14:02,693 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:14:02,741 INFO ]: Repository-Root is: /tmp [2018-06-22 11:14:02,757 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:14:02,760 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:14:02,761 INFO ]: Initializing SmtParser... [2018-06-22 11:14:02,762 INFO ]: SmtParser initialized [2018-06-22 11:14:02,762 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/012b-horn.smt2 [2018-06-22 11:14:02,764 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:14:02,845 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/012b-horn.smt2 unknown [2018-06-22 11:14:03,077 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/012b-horn.smt2 [2018-06-22 11:14:03,083 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:14:03,088 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:14:03,089 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:14:03,089 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:14:03,089 INFO ]: ChcToBoogie initialized [2018-06-22 11:14:03,092 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:14:03" (1/1) ... [2018-06-22 11:14:03,138 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:14:03 Unit [2018-06-22 11:14:03,139 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:14:03,140 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:14:03,140 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:14:03,140 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:14:03,163 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:14:03" (1/1) ... [2018-06-22 11:14:03,163 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:14:03" (1/1) ... [2018-06-22 11:14:03,170 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:14:03" (1/1) ... [2018-06-22 11:14:03,171 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:14:03" (1/1) ... [2018-06-22 11:14:03,174 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:14:03" (1/1) ... [2018-06-22 11:14:03,176 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:14:03" (1/1) ... [2018-06-22 11:14:03,178 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:14:03" (1/1) ... [2018-06-22 11:14:03,180 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:14:03,181 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:14:03,181 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:14:03,189 INFO ]: RCFGBuilder initialized [2018-06-22 11:14:03,190 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:14:03" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:14:03,206 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:14:03,206 INFO ]: Found specification of procedure False [2018-06-22 11:14:03,206 INFO ]: Found implementation of procedure False [2018-06-22 11:14:03,206 INFO ]: Specification and implementation of procedure REC_f_f given in one single declaration [2018-06-22 11:14:03,206 INFO ]: Found specification of procedure REC_f_f [2018-06-22 11:14:03,206 INFO ]: Found implementation of procedure REC_f_f [2018-06-22 11:14:03,207 INFO ]: Specification and implementation of procedure REC_f_ given in one single declaration [2018-06-22 11:14:03,207 INFO ]: Found specification of procedure REC_f_ [2018-06-22 11:14:03,207 INFO ]: Found implementation of procedure REC_f_ [2018-06-22 11:14:03,207 INFO ]: Specification and implementation of procedure REC__f given in one single declaration [2018-06-22 11:14:03,207 INFO ]: Found specification of procedure REC__f [2018-06-22 11:14:03,207 INFO ]: Found implementation of procedure REC__f [2018-06-22 11:14:03,207 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:14:03,207 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:14:03,207 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:14:03,634 INFO ]: Using library mode [2018-06-22 11:14:03,635 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:14:03 BoogieIcfgContainer [2018-06-22 11:14:03,635 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:14:03,637 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:14:03,637 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:14:03,641 INFO ]: TraceAbstraction initialized [2018-06-22 11:14:03,642 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:14:03" (1/3) ... [2018-06-22 11:14:03,644 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1363226d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:14:03, skipping insertion in model container [2018-06-22 11:14:03,644 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:14:03" (2/3) ... [2018-06-22 11:14:03,644 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1363226d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:14:03, skipping insertion in model container [2018-06-22 11:14:03,644 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:14:03" (3/3) ... [2018-06-22 11:14:03,646 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:14:03,657 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:14:03,667 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:14:03,718 INFO ]: Using default assertion order modulation [2018-06-22 11:14:03,719 INFO ]: Interprodecural is true [2018-06-22 11:14:03,719 INFO ]: Hoare is false [2018-06-22 11:14:03,719 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:14:03,719 INFO ]: Backedges is TWOTRACK [2018-06-22 11:14:03,719 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:14:03,719 INFO ]: Difference is false [2018-06-22 11:14:03,719 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:14:03,719 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:14:03,739 INFO ]: Start isEmpty. Operand 25 states. [2018-06-22 11:14:03,760 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:14:03,760 INFO ]: Found error trace [2018-06-22 11:14:03,761 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:14:03,761 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:03,767 INFO ]: Analyzing trace with hash 88883971, now seen corresponding path program 1 times [2018-06-22 11:14:03,769 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:03,769 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:03,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:03,812 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:14:03,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:03,826 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:03,848 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:14:03,849 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:14:03,849 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:14:03,850 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:14:03,861 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:14:03,861 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:14:03,863 INFO ]: Start difference. First operand 25 states. Second operand 2 states. [2018-06-22 11:14:03,890 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:03,890 INFO ]: Finished difference Result 21 states and 28 transitions. [2018-06-22 11:14:03,890 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:14:03,891 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:14:03,891 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:03,911 INFO ]: With dead ends: 21 [2018-06-22 11:14:03,913 INFO ]: Without dead ends: 21 [2018-06-22 11:14:03,915 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:14:03,930 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:14:03,950 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 11:14:03,951 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:14:03,952 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-06-22 11:14:03,953 INFO ]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 5 [2018-06-22 11:14:03,953 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:03,953 INFO ]: Abstraction has 21 states and 28 transitions. [2018-06-22 11:14:03,953 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:14:03,953 INFO ]: Start isEmpty. Operand 21 states and 28 transitions. [2018-06-22 11:14:03,955 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:14:03,955 INFO ]: Found error trace [2018-06-22 11:14:03,955 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:03,955 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:03,955 INFO ]: Analyzing trace with hash -1073856975, now seen corresponding path program 1 times [2018-06-22 11:14:03,955 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:03,955 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:03,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:03,956 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:14:03,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:03,984 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:04,137 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:14:04,138 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:14:04,138 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:14:04,139 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:14:04,139 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:14:04,139 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:14:04,140 INFO ]: Start difference. First operand 21 states and 28 transitions. Second operand 4 states. [2018-06-22 11:14:04,188 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:04,188 INFO ]: Finished difference Result 23 states and 30 transitions. [2018-06-22 11:14:04,188 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:14:04,188 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:14:04,188 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:04,189 INFO ]: With dead ends: 23 [2018-06-22 11:14:04,189 INFO ]: Without dead ends: 23 [2018-06-22 11:14:04,190 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:14:04,190 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:14:04,196 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 11:14:04,196 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:14:04,197 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-06-22 11:14:04,198 INFO ]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 9 [2018-06-22 11:14:04,198 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:04,198 INFO ]: Abstraction has 23 states and 30 transitions. [2018-06-22 11:14:04,198 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:14:04,199 INFO ]: Start isEmpty. Operand 23 states and 30 transitions. [2018-06-22 11:14:04,199 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:14:04,199 INFO ]: Found error trace [2018-06-22 11:14:04,199 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:04,199 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:04,199 INFO ]: Analyzing trace with hash 1760339025, now seen corresponding path program 1 times [2018-06-22 11:14:04,199 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:04,199 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:04,200 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:04,200 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:14:04,200 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:04,213 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:04,425 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:14:04,425 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:14:04,425 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:14:04,425 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:14:04,426 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:14:04,426 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:14:04,426 INFO ]: Start difference. First operand 23 states and 30 transitions. Second operand 6 states. [2018-06-22 11:14:04,662 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-22 11:14:04,794 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:04,794 INFO ]: Finished difference Result 29 states and 38 transitions. [2018-06-22 11:14:04,794 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:14:04,794 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:14:04,795 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:04,795 INFO ]: With dead ends: 29 [2018-06-22 11:14:04,796 INFO ]: Without dead ends: 29 [2018-06-22 11:14:04,796 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:14:04,796 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:14:04,803 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-22 11:14:04,803 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:14:04,804 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-06-22 11:14:04,804 INFO ]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 13 [2018-06-22 11:14:04,804 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:04,804 INFO ]: Abstraction has 25 states and 33 transitions. [2018-06-22 11:14:04,804 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:14:04,804 INFO ]: Start isEmpty. Operand 25 states and 33 transitions. [2018-06-22 11:14:04,805 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:14:04,805 INFO ]: Found error trace [2018-06-22 11:14:04,805 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:04,805 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:04,805 INFO ]: Analyzing trace with hash -685830930, now seen corresponding path program 1 times [2018-06-22 11:14:04,805 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:04,805 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:04,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:04,806 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:14:04,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:04,815 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:04,843 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:14:04,843 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:14:04,843 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:14:04,843 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:14:04,844 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:14:04,844 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:14:04,844 INFO ]: Start difference. First operand 25 states and 33 transitions. Second operand 4 states. [2018-06-22 11:14:04,880 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:04,880 INFO ]: Finished difference Result 27 states and 35 transitions. [2018-06-22 11:14:04,881 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:14:04,881 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:14:04,881 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:04,882 INFO ]: With dead ends: 27 [2018-06-22 11:14:04,882 INFO ]: Without dead ends: 27 [2018-06-22 11:14:04,882 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:14:04,882 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:14:04,886 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:14:04,887 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:14:04,888 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-06-22 11:14:04,888 INFO ]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 13 [2018-06-22 11:14:04,888 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:04,888 INFO ]: Abstraction has 25 states and 33 transitions. [2018-06-22 11:14:04,888 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:14:04,888 INFO ]: Start isEmpty. Operand 25 states and 33 transitions. [2018-06-22 11:14:04,889 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:14:04,889 INFO ]: Found error trace [2018-06-22 11:14:04,889 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:04,889 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:04,889 INFO ]: Analyzing trace with hash -1526428449, now seen corresponding path program 1 times [2018-06-22 11:14:04,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:04,889 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:04,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:04,890 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:14:04,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:04,897 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:05,053 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:14:05,053 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:05,053 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 11:14:05,059 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:14:05,090 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:05,098 INFO ]: Computing forward predicates... [2018-06-22 11:14:05,213 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:14:05,234 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:05,234 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:14:05,234 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:14:05,234 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:14:05,234 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:14:05,234 INFO ]: Start difference. First operand 25 states and 33 transitions. Second operand 8 states. [2018-06-22 11:14:05,346 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:05,346 INFO ]: Finished difference Result 33 states and 42 transitions. [2018-06-22 11:14:05,346 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:14:05,346 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:14:05,346 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:05,347 INFO ]: With dead ends: 33 [2018-06-22 11:14:05,347 INFO ]: Without dead ends: 33 [2018-06-22 11:14:05,348 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:14:05,348 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:14:05,354 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-06-22 11:14:05,354 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:14:05,355 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-06-22 11:14:05,355 INFO ]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 13 [2018-06-22 11:14:05,355 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:05,355 INFO ]: Abstraction has 27 states and 35 transitions. [2018-06-22 11:14:05,355 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:14:05,355 INFO ]: Start isEmpty. Operand 27 states and 35 transitions. [2018-06-22 11:14:05,356 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:14:05,356 INFO ]: Found error trace [2018-06-22 11:14:05,356 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:05,356 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:05,356 INFO ]: Analyzing trace with hash -407121153, now seen corresponding path program 1 times [2018-06-22 11:14:05,356 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:05,356 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:05,357 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:05,357 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:14:05,357 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:05,371 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:05,911 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:14:05,911 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:05,911 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) [2018-06-22 11:14:05,923 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:05,950 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:05,953 INFO ]: Computing forward predicates... [2018-06-22 11:14:06,331 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:14:06,362 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:06,362 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:14:06,362 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:14:06,362 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:14:06,362 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:14:06,363 INFO ]: Start difference. First operand 27 states and 35 transitions. Second operand 14 states. [2018-06-22 11:14:06,760 WARN ]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-22 11:14:06,767 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:06,767 INFO ]: Finished difference Result 33 states and 42 transitions. [2018-06-22 11:14:06,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:14:06,767 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-22 11:14:06,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:06,768 INFO ]: With dead ends: 33 [2018-06-22 11:14:06,768 INFO ]: Without dead ends: 33 [2018-06-22 11:14:06,769 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:14:06,769 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:14:06,774 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-06-22 11:14:06,774 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:14:06,775 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-06-22 11:14:06,775 INFO ]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 17 [2018-06-22 11:14:06,775 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:06,775 INFO ]: Abstraction has 27 states and 35 transitions. [2018-06-22 11:14:06,775 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:14:06,775 INFO ]: Start isEmpty. Operand 27 states and 35 transitions. [2018-06-22 11:14:06,776 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:14:06,776 INFO ]: Found error trace [2018-06-22 11:14:06,776 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:06,776 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:06,776 INFO ]: Analyzing trace with hash 2105266189, now seen corresponding path program 2 times [2018-06-22 11:14:06,776 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:06,776 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:06,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:06,777 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:14:06,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:06,787 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:06,917 INFO ]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:14:06,918 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:06,918 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:06,929 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:14:06,944 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:14:06,944 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:06,946 INFO ]: Computing forward predicates... [2018-06-22 11:14:07,048 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:14:07,079 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:07,079 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 11:14:07,079 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:14:07,079 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:14:07,080 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:14:07,080 INFO ]: Start difference. First operand 27 states and 35 transitions. Second operand 12 states. [2018-06-22 11:14:07,261 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:07,261 INFO ]: Finished difference Result 41 states and 50 transitions. [2018-06-22 11:14:07,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:14:07,261 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:14:07,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:07,262 INFO ]: With dead ends: 41 [2018-06-22 11:14:07,262 INFO ]: Without dead ends: 24 [2018-06-22 11:14:07,262 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:14:07,262 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:14:07,267 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-06-22 11:14:07,267 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:14:07,267 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-06-22 11:14:07,267 INFO ]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 17 [2018-06-22 11:14:07,267 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:07,267 INFO ]: Abstraction has 22 states and 26 transitions. [2018-06-22 11:14:07,267 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:14:07,267 INFO ]: Start isEmpty. Operand 22 states and 26 transitions. [2018-06-22 11:14:07,268 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:14:07,268 INFO ]: Found error trace [2018-06-22 11:14:07,268 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:07,268 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:07,268 INFO ]: Analyzing trace with hash -1706602957, now seen corresponding path program 1 times [2018-06-22 11:14:07,268 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:07,268 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:07,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:07,269 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:07,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:07,276 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:07,343 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:14:07,343 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:14:07,343 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:14:07,343 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:14:07,343 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:14:07,343 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:14:07,344 INFO ]: Start difference. First operand 22 states and 26 transitions. Second operand 6 states. [2018-06-22 11:14:07,423 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:07,423 INFO ]: Finished difference Result 24 states and 28 transitions. [2018-06-22 11:14:07,424 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:14:07,424 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:14:07,424 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:07,425 INFO ]: With dead ends: 24 [2018-06-22 11:14:07,425 INFO ]: Without dead ends: 24 [2018-06-22 11:14:07,425 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:14:07,425 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:14:07,428 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-06-22 11:14:07,428 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:14:07,429 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-06-22 11:14:07,429 INFO ]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 17 [2018-06-22 11:14:07,429 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:07,429 INFO ]: Abstraction has 22 states and 26 transitions. [2018-06-22 11:14:07,429 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:14:07,429 INFO ]: Start isEmpty. Operand 22 states and 26 transitions. [2018-06-22 11:14:07,430 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:14:07,430 INFO ]: Found error trace [2018-06-22 11:14:07,430 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:07,430 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:07,430 INFO ]: Analyzing trace with hash -1005586899, now seen corresponding path program 2 times [2018-06-22 11:14:07,430 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:07,430 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:07,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:07,431 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:14:07,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:07,441 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:07,513 INFO ]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:14:07,514 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:07,514 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:07,521 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:14:07,534 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:14:07,534 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:07,536 INFO ]: Computing forward predicates... [2018-06-22 11:14:07,654 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:14:07,674 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:07,717 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-22 11:14:07,717 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:14:07,717 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:14:07,717 INFO ]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:14:07,718 INFO ]: Start difference. First operand 22 states and 26 transitions. Second operand 14 states. [2018-06-22 11:14:08,007 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:08,007 INFO ]: Finished difference Result 28 states and 32 transitions. [2018-06-22 11:14:08,008 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:14:08,008 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:14:08,008 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:08,008 INFO ]: With dead ends: 28 [2018-06-22 11:14:08,008 INFO ]: Without dead ends: 20 [2018-06-22 11:14:08,009 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:14:08,009 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:14:08,011 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 11:14:08,011 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:14:08,011 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-06-22 11:14:08,012 INFO ]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 21 [2018-06-22 11:14:08,012 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:08,012 INFO ]: Abstraction has 20 states and 23 transitions. [2018-06-22 11:14:08,012 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:14:08,012 INFO ]: Start isEmpty. Operand 20 states and 23 transitions. [2018-06-22 11:14:08,013 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:14:08,013 INFO ]: Found error trace [2018-06-22 11:14:08,013 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:08,013 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:08,013 INFO ]: Analyzing trace with hash 27882593, now seen corresponding path program 1 times [2018-06-22 11:14:08,013 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:08,013 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:08,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:08,014 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:08,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:08,022 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:08,129 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:14:08,129 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:08,129 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:08,134 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:14:08,145 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:08,148 INFO ]: Computing forward predicates... [2018-06-22 11:14:08,519 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:14:08,538 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:08,538 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-22 11:14:08,538 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:14:08,538 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:14:08,538 INFO ]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:14:08,539 INFO ]: Start difference. First operand 20 states and 23 transitions. Second operand 16 states. [2018-06-22 11:14:08,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:08,663 INFO ]: Finished difference Result 26 states and 30 transitions. [2018-06-22 11:14:08,666 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:14:08,666 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 11:14:08,666 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:08,667 INFO ]: With dead ends: 26 [2018-06-22 11:14:08,667 INFO ]: Without dead ends: 26 [2018-06-22 11:14:08,667 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:14:08,667 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:14:08,670 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-06-22 11:14:08,670 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:14:08,671 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-06-22 11:14:08,671 INFO ]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 21 [2018-06-22 11:14:08,671 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:08,671 INFO ]: Abstraction has 24 states and 28 transitions. [2018-06-22 11:14:08,671 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:14:08,671 INFO ]: Start isEmpty. Operand 24 states and 28 transitions. [2018-06-22 11:14:08,672 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:14:08,672 INFO ]: Found error trace [2018-06-22 11:14:08,672 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:08,672 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:08,672 INFO ]: Analyzing trace with hash 1618784015, now seen corresponding path program 2 times [2018-06-22 11:14:08,672 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:08,672 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:08,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:08,673 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:14:08,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:08,686 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:09,213 INFO ]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:14:09,213 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:09,213 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:09,219 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:14:09,243 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:14:09,243 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:09,246 INFO ]: Computing forward predicates... [2018-06-22 11:14:09,771 INFO ]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:14:09,802 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:09,802 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-22 11:14:09,803 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:14:09,803 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:14:09,803 INFO ]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:14:09,803 INFO ]: Start difference. First operand 24 states and 28 transitions. Second operand 22 states. [2018-06-22 11:14:10,568 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:10,568 INFO ]: Finished difference Result 28 states and 32 transitions. [2018-06-22 11:14:10,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:14:10,569 INFO ]: Start accepts. Automaton has 22 states. Word has length 25 [2018-06-22 11:14:10,569 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:10,569 INFO ]: With dead ends: 28 [2018-06-22 11:14:10,569 INFO ]: Without dead ends: 28 [2018-06-22 11:14:10,570 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:14:10,570 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:14:10,581 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-06-22 11:14:10,581 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:14:10,581 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-06-22 11:14:10,581 INFO ]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 25 [2018-06-22 11:14:10,581 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:10,582 INFO ]: Abstraction has 26 states and 30 transitions. [2018-06-22 11:14:10,582 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:14:10,582 INFO ]: Start isEmpty. Operand 26 states and 30 transitions. [2018-06-22 11:14:10,582 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:14:10,582 INFO ]: Found error trace [2018-06-22 11:14:10,582 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:10,582 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:10,583 INFO ]: Analyzing trace with hash -350549181, now seen corresponding path program 3 times [2018-06-22 11:14:10,583 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:10,583 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:10,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:10,583 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:10,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:10,596 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:10,684 INFO ]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:14:10,684 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:10,684 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:10,691 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:14:10,704 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:14:10,704 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:10,706 INFO ]: Computing forward predicates... [2018-06-22 11:14:10,773 INFO ]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:14:10,804 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:10,804 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-22 11:14:10,804 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:14:10,805 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:14:10,805 INFO ]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:14:10,805 INFO ]: Start difference. First operand 26 states and 30 transitions. Second operand 14 states. [2018-06-22 11:14:10,967 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:10,967 INFO ]: Finished difference Result 30 states and 34 transitions. [2018-06-22 11:14:10,968 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:14:10,968 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 11:14:10,968 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:10,969 INFO ]: With dead ends: 30 [2018-06-22 11:14:10,969 INFO ]: Without dead ends: 30 [2018-06-22 11:14:10,969 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:14:10,969 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:14:10,972 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-06-22 11:14:10,972 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:14:10,973 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-06-22 11:14:10,973 INFO ]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 25 [2018-06-22 11:14:10,973 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:10,973 INFO ]: Abstraction has 26 states and 30 transitions. [2018-06-22 11:14:10,973 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:14:10,973 INFO ]: Start isEmpty. Operand 26 states and 30 transitions. [2018-06-22 11:14:10,974 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:14:10,974 INFO ]: Found error trace [2018-06-22 11:14:10,975 INFO ]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:10,975 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:10,975 INFO ]: Analyzing trace with hash -879108547, now seen corresponding path program 4 times [2018-06-22 11:14:10,975 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:10,975 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:10,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:10,975 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:10,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:10,984 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:11,089 INFO ]: Checked inductivity of 24 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:14:11,089 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:11,089 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:11,097 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:14:11,116 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:14:11,116 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:11,119 INFO ]: Computing forward predicates... [2018-06-22 11:14:11,597 INFO ]: Checked inductivity of 24 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:14:11,629 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:11,629 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-06-22 11:14:11,629 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:14:11,629 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:14:11,629 INFO ]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:14:11,629 INFO ]: Start difference. First operand 26 states and 30 transitions. Second operand 18 states. [2018-06-22 11:14:11,792 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:11,792 INFO ]: Finished difference Result 34 states and 38 transitions. [2018-06-22 11:14:11,793 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:14:11,793 INFO ]: Start accepts. Automaton has 18 states. Word has length 29 [2018-06-22 11:14:11,794 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:11,794 INFO ]: With dead ends: 34 [2018-06-22 11:14:11,794 INFO ]: Without dead ends: 24 [2018-06-22 11:14:11,794 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:14:11,794 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:14:11,796 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-22 11:14:11,796 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:14:11,797 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-06-22 11:14:11,797 INFO ]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 29 [2018-06-22 11:14:11,797 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:11,797 INFO ]: Abstraction has 24 states and 27 transitions. [2018-06-22 11:14:11,797 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:14:11,797 INFO ]: Start isEmpty. Operand 24 states and 27 transitions. [2018-06-22 11:14:11,798 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:14:11,798 INFO ]: Found error trace [2018-06-22 11:14:11,798 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:11,798 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:11,798 INFO ]: Analyzing trace with hash 672267633, now seen corresponding path program 5 times [2018-06-22 11:14:11,798 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:11,798 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:11,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:11,800 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:11,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:11,808 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:12,162 INFO ]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:14:12,162 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:12,162 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:12,168 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:14:12,182 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 11:14:12,182 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:12,186 INFO ]: Computing forward predicates... [2018-06-22 11:14:12,402 INFO ]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:14:12,421 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:12,421 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2018-06-22 11:14:12,421 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:14:12,422 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:14:12,422 INFO ]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:14:12,422 INFO ]: Start difference. First operand 24 states and 27 transitions. Second operand 21 states. [2018-06-22 11:14:12,621 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:12,621 INFO ]: Finished difference Result 32 states and 36 transitions. [2018-06-22 11:14:12,621 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:14:12,621 INFO ]: Start accepts. Automaton has 21 states. Word has length 29 [2018-06-22 11:14:12,621 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:12,622 INFO ]: With dead ends: 32 [2018-06-22 11:14:12,622 INFO ]: Without dead ends: 32 [2018-06-22 11:14:12,622 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:14:12,622 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:14:12,625 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-06-22 11:14:12,625 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:14:12,626 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-06-22 11:14:12,626 INFO ]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 29 [2018-06-22 11:14:12,626 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:12,626 INFO ]: Abstraction has 28 states and 32 transitions. [2018-06-22 11:14:12,626 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:14:12,626 INFO ]: Start isEmpty. Operand 28 states and 32 transitions. [2018-06-22 11:14:12,626 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:14:12,627 INFO ]: Found error trace [2018-06-22 11:14:12,627 INFO ]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:12,627 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:12,627 INFO ]: Analyzing trace with hash -605191853, now seen corresponding path program 6 times [2018-06-22 11:14:12,627 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:12,627 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:12,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:12,627 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:12,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:12,635 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:12,752 INFO ]: Checked inductivity of 31 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:14:12,752 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:12,752 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:12,758 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:14:12,773 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 11:14:12,773 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:12,775 INFO ]: Computing forward predicates... [2018-06-22 11:14:12,891 INFO ]: Checked inductivity of 31 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:14:12,911 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:12,911 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-06-22 11:14:12,911 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:14:12,911 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:14:12,911 INFO ]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:14:12,911 INFO ]: Start difference. First operand 28 states and 32 transitions. Second operand 17 states. [2018-06-22 11:14:13,061 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:13,061 INFO ]: Finished difference Result 34 states and 38 transitions. [2018-06-22 11:14:13,062 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:14:13,062 INFO ]: Start accepts. Automaton has 17 states. Word has length 33 [2018-06-22 11:14:13,062 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:13,062 INFO ]: With dead ends: 34 [2018-06-22 11:14:13,062 INFO ]: Without dead ends: 34 [2018-06-22 11:14:13,063 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:14:13,063 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:14:13,067 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 26. [2018-06-22 11:14:13,067 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:14:13,067 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-06-22 11:14:13,067 INFO ]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 33 [2018-06-22 11:14:13,068 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:13,068 INFO ]: Abstraction has 26 states and 29 transitions. [2018-06-22 11:14:13,068 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:14:13,068 INFO ]: Start isEmpty. Operand 26 states and 29 transitions. [2018-06-22 11:14:13,068 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:14:13,068 INFO ]: Found error trace [2018-06-22 11:14:13,069 INFO ]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:13,069 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:13,069 INFO ]: Analyzing trace with hash 1578042399, now seen corresponding path program 7 times [2018-06-22 11:14:13,070 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:13,070 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:13,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:13,070 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:13,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:13,081 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:13,530 INFO ]: Checked inductivity of 31 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:14:13,530 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:13,530 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) [2018-06-22 11:14:13,544 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:13,560 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:13,564 INFO ]: Computing forward predicates... [2018-06-22 11:14:13,980 INFO ]: Checked inductivity of 31 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:14:14,004 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:14,004 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-06-22 11:14:14,004 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:14:14,005 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:14:14,005 INFO ]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:14:14,005 INFO ]: Start difference. First operand 26 states and 29 transitions. Second operand 28 states. [2018-06-22 11:14:14,358 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:14,358 INFO ]: Finished difference Result 36 states and 40 transitions. [2018-06-22 11:14:14,359 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:14:14,359 INFO ]: Start accepts. Automaton has 28 states. Word has length 33 [2018-06-22 11:14:14,359 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:14,359 INFO ]: With dead ends: 36 [2018-06-22 11:14:14,359 INFO ]: Without dead ends: 36 [2018-06-22 11:14:14,360 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:14:14,360 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:14:14,364 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-06-22 11:14:14,364 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:14:14,365 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-06-22 11:14:14,365 INFO ]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 33 [2018-06-22 11:14:14,365 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:14,365 INFO ]: Abstraction has 30 states and 34 transitions. [2018-06-22 11:14:14,365 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:14:14,365 INFO ]: Start isEmpty. Operand 30 states and 34 transitions. [2018-06-22 11:14:14,366 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:14:14,366 INFO ]: Found error trace [2018-06-22 11:14:14,366 INFO ]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:14,366 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:14,366 INFO ]: Analyzing trace with hash 78315341, now seen corresponding path program 8 times [2018-06-22 11:14:14,366 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:14,366 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:14,367 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:14,367 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:14:14,367 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:14,377 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:15,246 INFO ]: Checked inductivity of 46 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:14:15,246 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:15,246 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 11:14:15,254 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:14:15,270 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:14:15,270 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:15,273 INFO ]: Computing forward predicates... [2018-06-22 11:14:15,551 INFO ]: Checked inductivity of 46 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:14:15,571 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:15,571 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2018-06-22 11:14:15,571 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:14:15,571 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:14:15,571 INFO ]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:14:15,571 INFO ]: Start difference. First operand 30 states and 34 transitions. Second operand 21 states. [2018-06-22 11:14:15,776 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:15,776 INFO ]: Finished difference Result 40 states and 44 transitions. [2018-06-22 11:14:15,776 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:14:15,776 INFO ]: Start accepts. Automaton has 21 states. Word has length 37 [2018-06-22 11:14:15,776 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:15,777 INFO ]: With dead ends: 40 [2018-06-22 11:14:15,777 INFO ]: Without dead ends: 28 [2018-06-22 11:14:15,777 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:14:15,777 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:14:15,780 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-22 11:14:15,780 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:14:15,780 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-06-22 11:14:15,780 INFO ]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 37 [2018-06-22 11:14:15,780 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:15,780 INFO ]: Abstraction has 28 states and 31 transitions. [2018-06-22 11:14:15,780 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:14:15,780 INFO ]: Start isEmpty. Operand 28 states and 31 transitions. [2018-06-22 11:14:15,782 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:14:15,782 INFO ]: Found error trace [2018-06-22 11:14:15,782 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:15,782 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:15,782 INFO ]: Analyzing trace with hash -2065760383, now seen corresponding path program 9 times [2018-06-22 11:14:15,782 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:15,782 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:15,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:15,783 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:15,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:15,792 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:16,151 INFO ]: Checked inductivity of 42 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:14:16,152 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:16,152 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:16,158 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:14:16,176 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:14:16,176 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:16,179 INFO ]: Computing forward predicates... [2018-06-22 11:14:16,505 INFO ]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:14:16,525 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:16,525 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 26 [2018-06-22 11:14:16,525 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:14:16,525 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:14:16,525 INFO ]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:14:16,526 INFO ]: Start difference. First operand 28 states and 31 transitions. Second operand 26 states. [2018-06-22 11:14:16,855 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:16,855 INFO ]: Finished difference Result 38 states and 42 transitions. [2018-06-22 11:14:16,856 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:14:16,856 INFO ]: Start accepts. Automaton has 26 states. Word has length 37 [2018-06-22 11:14:16,856 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:16,857 INFO ]: With dead ends: 38 [2018-06-22 11:14:16,857 INFO ]: Without dead ends: 38 [2018-06-22 11:14:16,858 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:14:16,858 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:14:16,863 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 32. [2018-06-22 11:14:16,863 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:14:16,863 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-06-22 11:14:16,863 INFO ]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 37 [2018-06-22 11:14:16,863 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:16,863 INFO ]: Abstraction has 32 states and 36 transitions. [2018-06-22 11:14:16,863 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:14:16,864 INFO ]: Start isEmpty. Operand 32 states and 36 transitions. [2018-06-22 11:14:16,864 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:14:16,864 INFO ]: Found error trace [2018-06-22 11:14:16,864 INFO ]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:16,864 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:16,864 INFO ]: Analyzing trace with hash 234590767, now seen corresponding path program 10 times [2018-06-22 11:14:16,864 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:16,864 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:16,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:16,865 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:16,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:16,887 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:17,310 INFO ]: Checked inductivity of 57 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:14:17,310 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:17,310 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:17,316 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:14:17,335 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:14:17,335 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:17,340 INFO ]: Computing forward predicates... [2018-06-22 11:14:17,857 INFO ]: Checked inductivity of 57 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:14:17,877 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:17,877 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2018-06-22 11:14:17,877 INFO ]: Interpolant automaton has 34 states [2018-06-22 11:14:17,877 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 11:14:17,877 INFO ]: CoverageRelationStatistics Valid=87, Invalid=1035, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:14:17,878 INFO ]: Start difference. First operand 32 states and 36 transitions. Second operand 34 states. [2018-06-22 11:14:18,683 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:18,683 INFO ]: Finished difference Result 40 states and 44 transitions. [2018-06-22 11:14:18,683 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:14:18,683 INFO ]: Start accepts. Automaton has 34 states. Word has length 41 [2018-06-22 11:14:18,684 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:18,684 INFO ]: With dead ends: 40 [2018-06-22 11:14:18,684 INFO ]: Without dead ends: 40 [2018-06-22 11:14:18,685 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=157, Invalid=1565, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 11:14:18,685 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:14:18,688 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 34. [2018-06-22 11:14:18,688 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:14:18,688 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-06-22 11:14:18,688 INFO ]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 41 [2018-06-22 11:14:18,689 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:18,689 INFO ]: Abstraction has 34 states and 38 transitions. [2018-06-22 11:14:18,689 INFO ]: Interpolant automaton has 34 states. [2018-06-22 11:14:18,689 INFO ]: Start isEmpty. Operand 34 states and 38 transitions. [2018-06-22 11:14:18,689 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:14:18,689 INFO ]: Found error trace [2018-06-22 11:14:18,689 INFO ]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:18,689 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:18,689 INFO ]: Analyzing trace with hash 349663331, now seen corresponding path program 11 times [2018-06-22 11:14:18,689 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:18,689 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:18,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:18,690 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:18,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:18,697 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:19,437 INFO ]: Checked inductivity of 57 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:14:19,437 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:19,437 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:19,444 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:14:19,462 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 11:14:19,462 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:19,465 INFO ]: Computing forward predicates... [2018-06-22 11:14:19,586 INFO ]: Checked inductivity of 57 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:14:19,606 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:19,606 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-06-22 11:14:19,606 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:14:19,606 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:14:19,606 INFO ]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:14:19,606 INFO ]: Start difference. First operand 34 states and 38 transitions. Second operand 20 states. [2018-06-22 11:14:19,800 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:19,800 INFO ]: Finished difference Result 42 states and 46 transitions. [2018-06-22 11:14:19,800 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:14:19,801 INFO ]: Start accepts. Automaton has 20 states. Word has length 41 [2018-06-22 11:14:19,801 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:19,801 INFO ]: With dead ends: 42 [2018-06-22 11:14:19,801 INFO ]: Without dead ends: 42 [2018-06-22 11:14:19,801 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:14:19,802 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:14:19,805 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 34. [2018-06-22 11:14:19,805 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:14:19,805 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-06-22 11:14:19,805 INFO ]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 41 [2018-06-22 11:14:19,806 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:19,806 INFO ]: Abstraction has 34 states and 38 transitions. [2018-06-22 11:14:19,806 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:14:19,806 INFO ]: Start isEmpty. Operand 34 states and 38 transitions. [2018-06-22 11:14:19,806 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:14:19,806 INFO ]: Found error trace [2018-06-22 11:14:19,806 INFO ]: trace histogram [6, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:19,806 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:19,806 INFO ]: Analyzing trace with hash 765204829, now seen corresponding path program 12 times [2018-06-22 11:14:19,806 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:19,807 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:19,807 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:19,807 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:19,807 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:19,816 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:19,996 INFO ]: Checked inductivity of 76 backedges. 20 proven. 26 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 11:14:19,996 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:19,996 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:20,008 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:14:20,053 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 11:14:20,053 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:20,056 INFO ]: Computing forward predicates... [2018-06-22 11:14:20,211 INFO ]: Checked inductivity of 76 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 11:14:20,231 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:20,231 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-06-22 11:14:20,231 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:14:20,232 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:14:20,232 INFO ]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:14:20,232 INFO ]: Start difference. First operand 34 states and 38 transitions. Second operand 24 states. [2018-06-22 11:14:20,477 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:20,477 INFO ]: Finished difference Result 46 states and 50 transitions. [2018-06-22 11:14:20,477 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:14:20,477 INFO ]: Start accepts. Automaton has 24 states. Word has length 45 [2018-06-22 11:14:20,477 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:20,477 INFO ]: With dead ends: 46 [2018-06-22 11:14:20,477 INFO ]: Without dead ends: 32 [2018-06-22 11:14:20,478 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=1007, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:14:20,478 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:14:20,480 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-22 11:14:20,480 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:14:20,481 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-06-22 11:14:20,481 INFO ]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 45 [2018-06-22 11:14:20,481 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:20,481 INFO ]: Abstraction has 32 states and 35 transitions. [2018-06-22 11:14:20,481 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:14:20,481 INFO ]: Start isEmpty. Operand 32 states and 35 transitions. [2018-06-22 11:14:20,481 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:14:20,481 INFO ]: Found error trace [2018-06-22 11:14:20,481 INFO ]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:20,481 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:20,482 INFO ]: Analyzing trace with hash -319210863, now seen corresponding path program 13 times [2018-06-22 11:14:20,482 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:20,482 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:20,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:20,482 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:20,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:20,490 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:20,892 INFO ]: Checked inductivity of 72 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 11:14:20,892 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:20,892 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:20,898 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:14:20,916 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:20,920 INFO ]: Computing forward predicates... [2018-06-22 11:14:21,294 INFO ]: Checked inductivity of 72 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:14:21,313 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:21,313 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16] total 31 [2018-06-22 11:14:21,313 INFO ]: Interpolant automaton has 31 states [2018-06-22 11:14:21,314 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 11:14:21,314 INFO ]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:14:21,314 INFO ]: Start difference. First operand 32 states and 35 transitions. Second operand 31 states. [2018-06-22 11:14:21,781 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:21,781 INFO ]: Finished difference Result 44 states and 48 transitions. [2018-06-22 11:14:21,783 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:14:21,783 INFO ]: Start accepts. Automaton has 31 states. Word has length 45 [2018-06-22 11:14:21,783 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:21,784 INFO ]: With dead ends: 44 [2018-06-22 11:14:21,784 INFO ]: Without dead ends: 44 [2018-06-22 11:14:21,784 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=1412, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:14:21,784 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:14:21,788 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-06-22 11:14:21,788 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:14:21,788 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-06-22 11:14:21,789 INFO ]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 45 [2018-06-22 11:14:21,789 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:21,789 INFO ]: Abstraction has 36 states and 40 transitions. [2018-06-22 11:14:21,789 INFO ]: Interpolant automaton has 31 states. [2018-06-22 11:14:21,789 INFO ]: Start isEmpty. Operand 36 states and 40 transitions. [2018-06-22 11:14:21,789 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:14:21,789 INFO ]: Found error trace [2018-06-22 11:14:21,789 INFO ]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:21,789 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:21,790 INFO ]: Analyzing trace with hash -1843292045, now seen corresponding path program 14 times [2018-06-22 11:14:21,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:21,790 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:21,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:21,790 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:14:21,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:21,798 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:21,953 INFO ]: Checked inductivity of 91 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:14:21,953 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:21,953 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:21,961 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:14:21,981 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:14:21,981 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:21,983 INFO ]: Computing forward predicates... [2018-06-22 11:14:22,112 INFO ]: Checked inductivity of 91 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:14:22,131 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:22,131 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2018-06-22 11:14:22,131 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:14:22,132 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:14:22,132 INFO ]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:14:22,132 INFO ]: Start difference. First operand 36 states and 40 transitions. Second operand 23 states. [2018-06-22 11:14:22,372 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:22,372 INFO ]: Finished difference Result 46 states and 50 transitions. [2018-06-22 11:14:22,372 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:14:22,372 INFO ]: Start accepts. Automaton has 23 states. Word has length 49 [2018-06-22 11:14:22,372 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:22,373 INFO ]: With dead ends: 46 [2018-06-22 11:14:22,373 INFO ]: Without dead ends: 46 [2018-06-22 11:14:22,373 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:14:22,374 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:14:22,376 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 34. [2018-06-22 11:14:22,376 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:14:22,376 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-06-22 11:14:22,376 INFO ]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 49 [2018-06-22 11:14:22,377 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:22,377 INFO ]: Abstraction has 34 states and 37 transitions. [2018-06-22 11:14:22,377 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:14:22,377 INFO ]: Start isEmpty. Operand 34 states and 37 transitions. [2018-06-22 11:14:22,377 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:14:22,377 INFO ]: Found error trace [2018-06-22 11:14:22,377 INFO ]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:22,378 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:22,378 INFO ]: Analyzing trace with hash 2113607999, now seen corresponding path program 15 times [2018-06-22 11:14:22,378 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:22,378 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:22,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:22,378 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:22,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:22,397 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:22,853 INFO ]: Checked inductivity of 91 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:14:22,853 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:22,853 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:22,859 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:14:22,884 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 11:14:22,884 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:22,889 INFO ]: Computing forward predicates... [2018-06-22 11:14:35,402 INFO ]: Checked inductivity of 91 backedges. 4 proven. 52 refuted. 2 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-22 11:14:35,434 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:35,434 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 41 [2018-06-22 11:14:35,434 INFO ]: Interpolant automaton has 41 states [2018-06-22 11:14:35,434 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-22 11:14:35,435 INFO ]: CoverageRelationStatistics Valid=102, Invalid=1522, Unknown=16, NotChecked=0, Total=1640 [2018-06-22 11:14:35,435 INFO ]: Start difference. First operand 34 states and 37 transitions. Second operand 41 states. [2018-06-22 11:14:36,098 WARN ]: Spent 134.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2018-06-22 11:14:36,900 WARN ]: Spent 724.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 40 [2018-06-22 11:14:37,814 WARN ]: Spent 830.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2018-06-22 11:14:38,009 WARN ]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2018-06-22 11:14:40,957 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:40,957 INFO ]: Finished difference Result 48 states and 52 transitions. [2018-06-22 11:14:40,957 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:14:40,957 INFO ]: Start accepts. Automaton has 41 states. Word has length 49 [2018-06-22 11:14:40,957 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:40,958 INFO ]: With dead ends: 48 [2018-06-22 11:14:40,958 INFO ]: Without dead ends: 48 [2018-06-22 11:14:40,959 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=221, Invalid=2414, Unknown=17, NotChecked=0, Total=2652 [2018-06-22 11:14:40,959 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:14:40,961 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 38. [2018-06-22 11:14:40,961 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:14:40,964 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-06-22 11:14:40,964 INFO ]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 49 [2018-06-22 11:14:40,964 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:40,964 INFO ]: Abstraction has 38 states and 42 transitions. [2018-06-22 11:14:40,964 INFO ]: Interpolant automaton has 41 states. [2018-06-22 11:14:40,964 INFO ]: Start isEmpty. Operand 38 states and 42 transitions. [2018-06-22 11:14:40,965 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:14:40,965 INFO ]: Found error trace [2018-06-22 11:14:40,965 INFO ]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:40,965 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:40,965 INFO ]: Analyzing trace with hash -1728713619, now seen corresponding path program 16 times [2018-06-22 11:14:40,965 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:40,965 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:40,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:40,965 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:40,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:40,975 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:41,131 INFO ]: Checked inductivity of 114 backedges. 30 proven. 37 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-06-22 11:14:41,131 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:41,131 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:41,137 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:14:41,158 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:14:41,158 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:41,160 INFO ]: Computing forward predicates... [2018-06-22 11:14:41,300 INFO ]: Checked inductivity of 114 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-06-22 11:14:41,319 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:41,319 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2018-06-22 11:14:41,319 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:14:41,320 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:14:41,320 INFO ]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:14:41,321 INFO ]: Start difference. First operand 38 states and 42 transitions. Second operand 27 states. [2018-06-22 11:14:41,648 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:41,648 INFO ]: Finished difference Result 52 states and 56 transitions. [2018-06-22 11:14:41,648 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:14:41,648 INFO ]: Start accepts. Automaton has 27 states. Word has length 53 [2018-06-22 11:14:41,648 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:41,649 INFO ]: With dead ends: 52 [2018-06-22 11:14:41,649 INFO ]: Without dead ends: 36 [2018-06-22 11:14:41,649 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=1330, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:14:41,649 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:14:41,651 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 11:14:41,651 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:14:41,652 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-06-22 11:14:41,652 INFO ]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 53 [2018-06-22 11:14:41,652 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:41,652 INFO ]: Abstraction has 36 states and 39 transitions. [2018-06-22 11:14:41,652 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:14:41,652 INFO ]: Start isEmpty. Operand 36 states and 39 transitions. [2018-06-22 11:14:41,652 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:14:41,652 INFO ]: Found error trace [2018-06-22 11:14:41,652 INFO ]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:41,653 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:41,653 INFO ]: Analyzing trace with hash 1031368353, now seen corresponding path program 17 times [2018-06-22 11:14:41,653 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:41,653 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:41,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:41,653 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:41,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:41,664 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:42,413 INFO ]: Checked inductivity of 110 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 11:14:42,413 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:42,413 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:42,418 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:14:42,441 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:14:42,441 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:42,445 INFO ]: Computing forward predicates... [2018-06-22 11:14:42,828 INFO ]: Checked inductivity of 110 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-22 11:14:42,847 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:42,847 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18] total 36 [2018-06-22 11:14:42,847 INFO ]: Interpolant automaton has 36 states [2018-06-22 11:14:42,847 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 11:14:42,848 INFO ]: CoverageRelationStatistics Valid=87, Invalid=1173, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:14:42,848 INFO ]: Start difference. First operand 36 states and 39 transitions. Second operand 36 states. [2018-06-22 11:14:43,418 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:43,419 INFO ]: Finished difference Result 50 states and 54 transitions. [2018-06-22 11:14:43,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:14:43,448 INFO ]: Start accepts. Automaton has 36 states. Word has length 53 [2018-06-22 11:14:43,449 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:43,449 INFO ]: With dead ends: 50 [2018-06-22 11:14:43,449 INFO ]: Without dead ends: 50 [2018-06-22 11:14:43,450 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=188, Invalid=1974, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 11:14:43,450 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:14:43,453 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 40. [2018-06-22 11:14:43,453 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:14:43,456 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-06-22 11:14:43,456 INFO ]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 53 [2018-06-22 11:14:43,456 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:43,456 INFO ]: Abstraction has 40 states and 44 transitions. [2018-06-22 11:14:43,456 INFO ]: Interpolant automaton has 36 states. [2018-06-22 11:14:43,456 INFO ]: Start isEmpty. Operand 40 states and 44 transitions. [2018-06-22 11:14:43,457 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:14:43,457 INFO ]: Found error trace [2018-06-22 11:14:43,457 INFO ]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:43,457 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:43,457 INFO ]: Analyzing trace with hash -2142979709, now seen corresponding path program 18 times [2018-06-22 11:14:43,457 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:43,457 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:43,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:43,457 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:43,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:43,468 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:44,075 INFO ]: Checked inductivity of 133 backedges. 42 proven. 35 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:14:44,076 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:44,076 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:44,083 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:14:44,107 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 11:14:44,107 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:44,110 INFO ]: Computing forward predicates... [2018-06-22 11:14:44,297 INFO ]: Checked inductivity of 133 backedges. 42 proven. 35 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:14:44,315 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:44,315 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2018-06-22 11:14:44,315 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:14:44,316 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:14:44,316 INFO ]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:14:44,316 INFO ]: Start difference. First operand 40 states and 44 transitions. Second operand 26 states. [2018-06-22 11:14:45,126 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:45,126 INFO ]: Finished difference Result 52 states and 56 transitions. [2018-06-22 11:14:45,126 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:14:45,126 INFO ]: Start accepts. Automaton has 26 states. Word has length 57 [2018-06-22 11:14:45,126 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:45,127 INFO ]: With dead ends: 52 [2018-06-22 11:14:45,127 INFO ]: Without dead ends: 52 [2018-06-22 11:14:45,127 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=263, Invalid=1543, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:14:45,127 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:14:45,131 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 38. [2018-06-22 11:14:45,131 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:14:45,131 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-06-22 11:14:45,131 INFO ]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 57 [2018-06-22 11:14:45,131 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:45,131 INFO ]: Abstraction has 38 states and 41 transitions. [2018-06-22 11:14:45,131 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:14:45,132 INFO ]: Start isEmpty. Operand 38 states and 41 transitions. [2018-06-22 11:14:45,132 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:14:45,132 INFO ]: Found error trace [2018-06-22 11:14:45,132 INFO ]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:45,132 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:45,132 INFO ]: Analyzing trace with hash 2012633423, now seen corresponding path program 19 times [2018-06-22 11:14:45,132 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:45,132 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:45,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:45,133 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:45,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:45,152 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:45,935 INFO ]: Checked inductivity of 133 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 11:14:45,935 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:45,935 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:45,942 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:14:45,969 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:45,976 INFO ]: Computing forward predicates... [2018-06-22 11:14:46,755 INFO ]: Checked inductivity of 133 backedges. 5 proven. 72 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:14:46,775 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:46,775 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20] total 46 [2018-06-22 11:14:46,775 INFO ]: Interpolant automaton has 46 states [2018-06-22 11:14:46,775 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-22 11:14:46,776 INFO ]: CoverageRelationStatistics Valid=121, Invalid=1949, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:14:46,776 INFO ]: Start difference. First operand 38 states and 41 transitions. Second operand 46 states. [2018-06-22 11:14:47,657 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:47,658 INFO ]: Finished difference Result 54 states and 58 transitions. [2018-06-22 11:14:47,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:14:47,658 INFO ]: Start accepts. Automaton has 46 states. Word has length 57 [2018-06-22 11:14:47,658 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:47,658 INFO ]: With dead ends: 54 [2018-06-22 11:14:47,658 INFO ]: Without dead ends: 54 [2018-06-22 11:14:47,659 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=249, Invalid=3057, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 11:14:47,659 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:14:47,662 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 42. [2018-06-22 11:14:47,662 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:14:47,662 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-06-22 11:14:47,662 INFO ]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 57 [2018-06-22 11:14:47,663 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:47,663 INFO ]: Abstraction has 42 states and 46 transitions. [2018-06-22 11:14:47,663 INFO ]: Interpolant automaton has 46 states. [2018-06-22 11:14:47,663 INFO ]: Start isEmpty. Operand 42 states and 46 transitions. [2018-06-22 11:14:47,663 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:14:47,663 INFO ]: Found error trace [2018-06-22 11:14:47,663 INFO ]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:47,663 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:47,663 INFO ]: Analyzing trace with hash 933780401, now seen corresponding path program 20 times [2018-06-22 11:14:47,663 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:47,663 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:47,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:47,664 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:14:47,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:47,677 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:48,278 INFO ]: Checked inductivity of 156 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-22 11:14:48,279 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:48,279 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:48,284 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:14:48,309 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:14:48,309 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:48,315 INFO ]: Computing forward predicates... [2018-06-22 11:14:48,785 INFO ]: Checked inductivity of 156 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-06-22 11:14:48,804 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:48,804 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 20] total 41 [2018-06-22 11:14:48,804 INFO ]: Interpolant automaton has 41 states [2018-06-22 11:14:48,804 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-22 11:14:48,804 INFO ]: CoverageRelationStatistics Valid=100, Invalid=1540, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:14:48,805 INFO ]: Start difference. First operand 42 states and 46 transitions. Second operand 41 states. [2018-06-22 11:14:49,824 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:49,824 INFO ]: Finished difference Result 60 states and 65 transitions. [2018-06-22 11:14:49,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:14:49,828 INFO ]: Start accepts. Automaton has 41 states. Word has length 61 [2018-06-22 11:14:49,828 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:49,829 INFO ]: With dead ends: 60 [2018-06-22 11:14:49,829 INFO ]: Without dead ends: 60 [2018-06-22 11:14:49,830 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=232, Invalid=2630, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 11:14:49,830 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:14:49,837 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 44. [2018-06-22 11:14:49,837 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:14:49,837 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-06-22 11:14:49,837 INFO ]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 61 [2018-06-22 11:14:49,838 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:49,838 INFO ]: Abstraction has 44 states and 49 transitions. [2018-06-22 11:14:49,838 INFO ]: Interpolant automaton has 41 states. [2018-06-22 11:14:49,838 INFO ]: Start isEmpty. Operand 44 states and 49 transitions. [2018-06-22 11:14:49,838 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:14:49,838 INFO ]: Found error trace [2018-06-22 11:14:49,838 INFO ]: trace histogram [8, 7, 7, 7, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:49,839 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:49,839 INFO ]: Analyzing trace with hash 158414973, now seen corresponding path program 21 times [2018-06-22 11:14:49,839 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:49,839 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:49,839 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:49,839 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:49,839 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:49,851 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:50,046 INFO ]: Checked inductivity of 160 backedges. 42 proven. 50 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-22 11:14:50,046 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:50,046 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:50,052 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:14:50,082 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-22 11:14:50,082 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:50,086 INFO ]: Computing forward predicates... [2018-06-22 11:14:50,371 INFO ]: Checked inductivity of 160 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-22 11:14:50,392 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:50,392 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2018-06-22 11:14:50,392 INFO ]: Interpolant automaton has 30 states [2018-06-22 11:14:50,392 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 11:14:50,392 INFO ]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:14:50,392 INFO ]: Start difference. First operand 44 states and 49 transitions. Second operand 30 states. [2018-06-22 11:14:50,761 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:50,761 INFO ]: Finished difference Result 64 states and 69 transitions. [2018-06-22 11:14:50,762 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:14:50,762 INFO ]: Start accepts. Automaton has 30 states. Word has length 61 [2018-06-22 11:14:50,762 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:50,763 INFO ]: With dead ends: 64 [2018-06-22 11:14:50,763 INFO ]: Without dead ends: 46 [2018-06-22 11:14:50,763 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=283, Invalid=1697, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 11:14:50,763 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:14:50,765 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-06-22 11:14:50,765 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:14:50,766 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-06-22 11:14:50,766 INFO ]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 61 [2018-06-22 11:14:50,766 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:50,766 INFO ]: Abstraction has 44 states and 48 transitions. [2018-06-22 11:14:50,766 INFO ]: Interpolant automaton has 30 states. [2018-06-22 11:14:50,766 INFO ]: Start isEmpty. Operand 44 states and 48 transitions. [2018-06-22 11:14:50,766 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:14:50,766 INFO ]: Found error trace [2018-06-22 11:14:50,766 INFO ]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:50,766 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:50,766 INFO ]: Analyzing trace with hash 1577456223, now seen corresponding path program 22 times [2018-06-22 11:14:50,766 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:50,766 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:50,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:50,771 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:50,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:50,794 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:51,707 INFO ]: Checked inductivity of 183 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 11:14:51,708 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:51,708 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:51,716 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:14:51,746 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:14:51,746 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:51,751 INFO ]: Computing forward predicates... [2018-06-22 11:14:52,682 INFO ]: Checked inductivity of 183 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-22 11:14:52,700 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:52,700 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 22] total 52 [2018-06-22 11:14:52,701 INFO ]: Interpolant automaton has 52 states [2018-06-22 11:14:52,701 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-22 11:14:52,701 INFO ]: CoverageRelationStatistics Valid=138, Invalid=2514, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 11:14:52,701 INFO ]: Start difference. First operand 44 states and 48 transitions. Second operand 52 states. [2018-06-22 11:14:53,647 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:53,647 INFO ]: Finished difference Result 58 states and 62 transitions. [2018-06-22 11:14:53,676 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:14:53,676 INFO ]: Start accepts. Automaton has 52 states. Word has length 65 [2018-06-22 11:14:53,676 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:53,677 INFO ]: With dead ends: 58 [2018-06-22 11:14:53,677 INFO ]: Without dead ends: 58 [2018-06-22 11:14:53,678 INFO ]: 0 DeclaredPredicates, 110 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=301, Invalid=3989, Unknown=0, NotChecked=0, Total=4290 [2018-06-22 11:14:53,678 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 11:14:53,681 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 46. [2018-06-22 11:14:53,681 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:14:53,682 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-06-22 11:14:53,682 INFO ]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 65 [2018-06-22 11:14:53,682 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:53,682 INFO ]: Abstraction has 46 states and 50 transitions. [2018-06-22 11:14:53,682 INFO ]: Interpolant automaton has 52 states. [2018-06-22 11:14:53,682 INFO ]: Start isEmpty. Operand 46 states and 50 transitions. [2018-06-22 11:14:53,683 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:14:53,683 INFO ]: Found error trace [2018-06-22 11:14:53,683 INFO ]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:53,683 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:53,683 INFO ]: Analyzing trace with hash 401183635, now seen corresponding path program 23 times [2018-06-22 11:14:53,683 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:53,683 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:53,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:53,683 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:53,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:53,700 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:53,896 INFO ]: Checked inductivity of 183 backedges. 56 proven. 48 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-22 11:14:53,896 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:53,896 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:53,902 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:14:53,932 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 11:14:53,932 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:53,935 INFO ]: Computing forward predicates... [2018-06-22 11:14:54,173 INFO ]: Checked inductivity of 183 backedges. 56 proven. 48 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-22 11:14:54,191 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:54,191 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 29 [2018-06-22 11:14:54,192 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:14:54,192 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:14:54,192 INFO ]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:14:54,192 INFO ]: Start difference. First operand 46 states and 50 transitions. Second operand 29 states. [2018-06-22 11:14:54,604 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:54,605 INFO ]: Finished difference Result 60 states and 64 transitions. [2018-06-22 11:14:54,605 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:14:54,605 INFO ]: Start accepts. Automaton has 29 states. Word has length 65 [2018-06-22 11:14:54,605 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:54,605 INFO ]: With dead ends: 60 [2018-06-22 11:14:54,605 INFO ]: Without dead ends: 60 [2018-06-22 11:14:54,606 INFO ]: 0 DeclaredPredicates, 121 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=336, Invalid=2016, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 11:14:54,606 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:14:54,608 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 46. [2018-06-22 11:14:54,608 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:14:54,609 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-06-22 11:14:54,609 INFO ]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 65 [2018-06-22 11:14:54,609 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:54,609 INFO ]: Abstraction has 46 states and 50 transitions. [2018-06-22 11:14:54,609 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:14:54,609 INFO ]: Start isEmpty. Operand 46 states and 50 transitions. [2018-06-22 11:14:54,610 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:14:54,610 INFO ]: Found error trace [2018-06-22 11:14:54,610 INFO ]: trace histogram [9, 8, 8, 8, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:54,610 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:54,610 INFO ]: Analyzing trace with hash -1913209459, now seen corresponding path program 24 times [2018-06-22 11:14:54,610 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:54,610 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:54,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:54,611 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:54,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:54,626 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:54,852 INFO ]: Checked inductivity of 214 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-06-22 11:14:54,852 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:54,852 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:54,858 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:14:54,889 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-22 11:14:54,889 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:54,893 INFO ]: Computing forward predicates... [2018-06-22 11:14:55,136 INFO ]: Checked inductivity of 214 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-06-22 11:14:55,154 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:55,155 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 33 [2018-06-22 11:14:55,155 INFO ]: Interpolant automaton has 33 states [2018-06-22 11:14:55,155 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 11:14:55,155 INFO ]: CoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:14:55,155 INFO ]: Start difference. First operand 46 states and 50 transitions. Second operand 33 states. [2018-06-22 11:14:55,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:55,521 INFO ]: Finished difference Result 64 states and 68 transitions. [2018-06-22 11:14:55,521 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:14:55,521 INFO ]: Start accepts. Automaton has 33 states. Word has length 69 [2018-06-22 11:14:55,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:55,522 INFO ]: With dead ends: 64 [2018-06-22 11:14:55,522 INFO ]: Without dead ends: 44 [2018-06-22 11:14:55,523 INFO ]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=342, Invalid=2108, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:14:55,523 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:14:55,525 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-22 11:14:55,525 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:14:55,525 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-06-22 11:14:55,525 INFO ]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 69 [2018-06-22 11:14:55,526 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:55,526 INFO ]: Abstraction has 44 states and 47 transitions. [2018-06-22 11:14:55,526 INFO ]: Interpolant automaton has 33 states. [2018-06-22 11:14:55,526 INFO ]: Start isEmpty. Operand 44 states and 47 transitions. [2018-06-22 11:14:55,527 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:14:55,527 INFO ]: Found error trace [2018-06-22 11:14:55,527 INFO ]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:55,527 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:55,527 INFO ]: Analyzing trace with hash 1560199617, now seen corresponding path program 25 times [2018-06-22 11:14:55,527 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:55,527 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:55,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:55,528 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:55,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:55,543 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:56,306 INFO ]: Checked inductivity of 210 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:14:56,306 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:56,306 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:56,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:14:56,338 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:56,342 INFO ]: Computing forward predicates... [2018-06-22 11:14:56,908 INFO ]: Checked inductivity of 210 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-06-22 11:14:56,927 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:56,927 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 22] total 46 [2018-06-22 11:14:56,927 INFO ]: Interpolant automaton has 46 states [2018-06-22 11:14:56,927 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-22 11:14:56,928 INFO ]: CoverageRelationStatistics Valid=113, Invalid=1957, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:14:56,928 INFO ]: Start difference. First operand 44 states and 47 transitions. Second operand 46 states. [2018-06-22 11:14:57,768 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:57,768 INFO ]: Finished difference Result 62 states and 66 transitions. [2018-06-22 11:14:57,769 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:14:57,769 INFO ]: Start accepts. Automaton has 46 states. Word has length 69 [2018-06-22 11:14:57,769 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:57,769 INFO ]: With dead ends: 62 [2018-06-22 11:14:57,769 INFO ]: Without dead ends: 62 [2018-06-22 11:14:57,770 INFO ]: 0 DeclaredPredicates, 117 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=280, Invalid=3380, Unknown=0, NotChecked=0, Total=3660 [2018-06-22 11:14:57,770 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:14:57,772 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 48. [2018-06-22 11:14:57,772 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:14:57,773 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-06-22 11:14:57,773 INFO ]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 69 [2018-06-22 11:14:57,773 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:57,773 INFO ]: Abstraction has 48 states and 52 transitions. [2018-06-22 11:14:57,773 INFO ]: Interpolant automaton has 46 states. [2018-06-22 11:14:57,773 INFO ]: Start isEmpty. Operand 48 states and 52 transitions. [2018-06-22 11:14:57,773 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 11:14:57,773 INFO ]: Found error trace [2018-06-22 11:14:57,773 INFO ]: trace histogram [9, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:57,773 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:57,774 INFO ]: Analyzing trace with hash 108201071, now seen corresponding path program 26 times [2018-06-22 11:14:57,774 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:57,774 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:57,774 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:57,774 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:14:57,774 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:57,804 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:58,734 INFO ]: Checked inductivity of 241 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-22 11:14:58,781 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:58,781 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:58,790 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:14:58,831 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:14:58,831 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:58,838 INFO ]: Computing forward predicates... [2018-06-22 11:15:09,154 WARN ]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 37 Received shutdown request... [2018-06-22 11:15:09,747 INFO ]: Timeout while computing interpolants [2018-06-22 11:15:09,947 WARN ]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:15:09,947 WARN ]: Verification canceled [2018-06-22 11:15:09,951 WARN ]: Timeout [2018-06-22 11:15:09,951 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:15:09 BoogieIcfgContainer [2018-06-22 11:15:09,951 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:15:09,952 INFO ]: Toolchain (without parser) took 66868.62 ms. Allocated memory was 309.3 MB in the beginning and 745.0 MB in the end (delta: 435.7 MB). Free memory was 264.7 MB in the beginning and 714.3 MB in the end (delta: -449.5 MB). Peak memory consumption was 169.3 MB. Max. memory is 3.6 GB. [2018-06-22 11:15:09,952 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:15:09,952 INFO ]: ChcToBoogie took 51.16 ms. Allocated memory is still 309.3 MB. Free memory was 264.7 MB in the beginning and 262.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:15:09,953 INFO ]: Boogie Preprocessor took 39.70 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 261.7 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:15:09,953 INFO ]: RCFGBuilder took 454.54 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 252.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:15:09,953 INFO ]: TraceAbstraction took 66313.66 ms. Allocated memory was 309.3 MB in the beginning and 745.0 MB in the end (delta: 435.7 MB). Free memory was 251.7 MB in the beginning and 714.3 MB in the end (delta: -462.6 MB). Peak memory consumption was 156.3 MB. Max. memory is 3.6 GB. [2018-06-22 11:15:09,955 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 51.16 ms. Allocated memory is still 309.3 MB. Free memory was 264.7 MB in the beginning and 262.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.70 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 261.7 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 454.54 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 252.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 66313.66 ms. Allocated memory was 309.3 MB in the beginning and 745.0 MB in the end (delta: 435.7 MB). Free memory was 251.7 MB in the beginning and 714.3 MB in the end (delta: -462.6 MB). Peak memory consumption was 156.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 74 with TraceHistMax 9, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. TIMEOUT Result, 66.2s OverallTime, 35 OverallIterations, 9 TraceHistogramMax, 18.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 822 SDtfs, 519 SDslu, 9279 SDs, 0 SdLazy, 8112 SolverSat, 464 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2104 GetRequests, 1082 SyntacticMatches, 13 SemanticMatches, 1009 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5847 ImplicationChecksByTransitivity, 41.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=34, 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, 34 MinimizatonAttempts, 192 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 33.4s InterpolantComputationTime, 2491 NumberOfCodeBlocks, 2491 NumberOfCodeBlocksAsserted, 126 NumberOfCheckSat, 2428 ConstructedInterpolants, 24 QuantifiedInterpolants, 1073044 SizeOfPredicates, 658 NumberOfNonLiveVariables, 5157 ConjunctsInSsa, 2093 ConjunctsInUnsatCore, 63 InterpolantComputations, 5 PerfectInterpolantSequences, 2277/4587 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/012b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-15-09-964.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/012b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-15-09-964.csv Completed graceful shutdown