java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/025b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:34:12,800 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:34:12,802 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:34:12,817 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:34:12,817 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:34:12,819 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:34:12,820 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:34:12,822 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:34:12,823 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:34:12,824 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:34:12,825 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:34:12,825 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:34:12,827 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:34:12,828 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:34:12,829 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:34:12,830 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:34:12,834 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:34:12,836 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:34:12,850 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:34:12,851 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:34:12,852 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:34:12,854 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:34:12,854 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:34:12,854 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:34:12,855 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:34:12,856 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:34:12,856 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:34:12,857 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:34:12,863 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:34:12,863 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:34:12,864 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:34:12,865 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:34:12,865 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:34:12,865 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:34:12,866 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:34:12,866 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:34:12,881 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:34:12,882 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:34:12,882 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:34:12,882 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:34:12,883 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:34:12,883 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:34:12,884 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:34:12,884 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:34:12,884 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:34:12,884 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:34:12,884 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:34:12,885 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:34:12,885 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:34:12,885 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:34:12,885 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:34:12,885 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:34:12,885 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:34:12,887 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:34:12,887 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:34:12,928 INFO ]: Repository-Root is: /tmp [2018-06-22 01:34:12,946 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:34:12,951 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:34:12,953 INFO ]: Initializing SmtParser... [2018-06-22 01:34:12,953 INFO ]: SmtParser initialized [2018-06-22 01:34:12,953 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/025b-horn.smt2 [2018-06-22 01:34:12,955 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 01:34:13,043 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025b-horn.smt2 unknown [2018-06-22 01:34:13,304 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025b-horn.smt2 [2018-06-22 01:34:13,311 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:34:13,317 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:34:13,317 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:34:13,317 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:34:13,318 INFO ]: ChcToBoogie initialized [2018-06-22 01:34:13,321 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:34:13" (1/1) ... [2018-06-22 01:34:13,385 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:13 Unit [2018-06-22 01:34:13,385 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:34:13,385 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:34:13,385 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:34:13,386 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:34:13,401 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:13" (1/1) ... [2018-06-22 01:34:13,402 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:13" (1/1) ... [2018-06-22 01:34:13,407 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:13" (1/1) ... [2018-06-22 01:34:13,407 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:13" (1/1) ... [2018-06-22 01:34:13,413 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:13" (1/1) ... [2018-06-22 01:34:13,415 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:13" (1/1) ... [2018-06-22 01:34:13,417 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:13" (1/1) ... [2018-06-22 01:34:13,418 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:34:13,419 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:34:13,419 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:34:13,419 INFO ]: RCFGBuilder initialized [2018-06-22 01:34:13,420 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:13" (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 01:34:13,435 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:34:13,435 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:34:13,435 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:34:13,435 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:34:13,435 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:34:13,435 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 01:34:13,983 INFO ]: Using library mode [2018-06-22 01:34:13,983 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:34:13 BoogieIcfgContainer [2018-06-22 01:34:13,983 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:34:13,985 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:34:13,985 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:34:13,988 INFO ]: TraceAbstraction initialized [2018-06-22 01:34:13,988 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:34:13" (1/3) ... [2018-06-22 01:34:13,989 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14904f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:34:13, skipping insertion in model container [2018-06-22 01:34:13,989 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:13" (2/3) ... [2018-06-22 01:34:13,989 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14904f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:34:13, skipping insertion in model container [2018-06-22 01:34:13,989 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:34:13" (3/3) ... [2018-06-22 01:34:13,991 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:34:13,999 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:34:14,008 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:34:14,051 INFO ]: Using default assertion order modulation [2018-06-22 01:34:14,051 INFO ]: Interprodecural is true [2018-06-22 01:34:14,051 INFO ]: Hoare is false [2018-06-22 01:34:14,051 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:34:14,051 INFO ]: Backedges is TWOTRACK [2018-06-22 01:34:14,051 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:34:14,052 INFO ]: Difference is false [2018-06-22 01:34:14,052 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:34:14,052 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:34:14,068 INFO ]: Start isEmpty. Operand 12 states. [2018-06-22 01:34:14,080 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:34:14,080 INFO ]: Found error trace [2018-06-22 01:34:14,084 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:14,084 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:14,089 INFO ]: Analyzing trace with hash 1046053294, now seen corresponding path program 1 times [2018-06-22 01:34:14,091 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:14,091 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:14,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:14,131 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:14,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:14,171 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:14,471 WARN ]: Spent 232.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-06-22 01:34:14,475 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:14,478 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:34:14,478 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:34:14,479 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:34:14,494 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:34:14,494 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:34:14,497 INFO ]: Start difference. First operand 12 states. Second operand 3 states. [2018-06-22 01:34:14,696 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:14,697 INFO ]: Finished difference Result 15 states and 52 transitions. [2018-06-22 01:34:14,697 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:34:14,698 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:34:14,698 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:14,707 INFO ]: With dead ends: 15 [2018-06-22 01:34:14,707 INFO ]: Without dead ends: 15 [2018-06-22 01:34:14,709 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:34:14,724 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:34:14,742 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 11. [2018-06-22 01:34:14,743 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:34:14,743 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2018-06-22 01:34:14,747 INFO ]: Start accepts. Automaton has 11 states and 42 transitions. Word has length 7 [2018-06-22 01:34:14,748 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:14,748 INFO ]: Abstraction has 11 states and 42 transitions. [2018-06-22 01:34:14,748 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:34:14,748 INFO ]: Start isEmpty. Operand 11 states and 42 transitions. [2018-06-22 01:34:14,748 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:34:14,748 INFO ]: Found error trace [2018-06-22 01:34:14,748 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:14,749 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:14,749 INFO ]: Analyzing trace with hash -1928040227, now seen corresponding path program 1 times [2018-06-22 01:34:14,749 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:14,749 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:14,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:14,750 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:14,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:14,765 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:14,805 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:14,805 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:34:14,805 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:34:14,806 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:34:14,807 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:34:14,807 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:34:14,807 INFO ]: Start difference. First operand 11 states and 42 transitions. Second operand 3 states. [2018-06-22 01:34:14,891 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:14,891 INFO ]: Finished difference Result 15 states and 52 transitions. [2018-06-22 01:34:14,891 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:34:14,891 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:34:14,891 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:14,892 INFO ]: With dead ends: 15 [2018-06-22 01:34:14,892 INFO ]: Without dead ends: 15 [2018-06-22 01:34:14,893 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:34:14,893 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:34:14,895 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-06-22 01:34:14,895 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:34:14,895 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2018-06-22 01:34:14,895 INFO ]: Start accepts. Automaton has 12 states and 46 transitions. Word has length 8 [2018-06-22 01:34:14,896 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:14,896 INFO ]: Abstraction has 12 states and 46 transitions. [2018-06-22 01:34:14,896 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:34:14,896 INFO ]: Start isEmpty. Operand 12 states and 46 transitions. [2018-06-22 01:34:14,896 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:34:14,896 INFO ]: Found error trace [2018-06-22 01:34:14,896 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:14,896 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:14,896 INFO ]: Analyzing trace with hash -1898487555, now seen corresponding path program 1 times [2018-06-22 01:34:14,896 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:14,896 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:14,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:14,897 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:14,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:14,914 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:15,075 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:15,075 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:15,075 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 01:34:15,082 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:15,122 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:15,130 INFO ]: Computing forward predicates... [2018-06-22 01:34:15,237 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:15,257 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:15,257 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 01:34:15,258 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:34:15,258 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:34:15,258 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:34:15,258 INFO ]: Start difference. First operand 12 states and 46 transitions. Second operand 5 states. [2018-06-22 01:34:15,472 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:15,472 INFO ]: Finished difference Result 18 states and 80 transitions. [2018-06-22 01:34:15,472 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:34:15,472 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 01:34:15,472 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:15,473 INFO ]: With dead ends: 18 [2018-06-22 01:34:15,473 INFO ]: Without dead ends: 18 [2018-06-22 01:34:15,473 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:34:15,473 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:34:15,475 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-06-22 01:34:15,475 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:34:15,476 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 55 transitions. [2018-06-22 01:34:15,476 INFO ]: Start accepts. Automaton has 13 states and 55 transitions. Word has length 8 [2018-06-22 01:34:15,476 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:15,476 INFO ]: Abstraction has 13 states and 55 transitions. [2018-06-22 01:34:15,476 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:34:15,476 INFO ]: Start isEmpty. Operand 13 states and 55 transitions. [2018-06-22 01:34:15,476 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:34:15,476 INFO ]: Found error trace [2018-06-22 01:34:15,476 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:15,477 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:15,477 INFO ]: Analyzing trace with hash 370031215, now seen corresponding path program 1 times [2018-06-22 01:34:15,477 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:15,477 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:15,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:15,478 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:15,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:15,487 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:15,533 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:34:15,534 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:34:15,534 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:34:15,534 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:34:15,534 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:34:15,534 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:34:15,534 INFO ]: Start difference. First operand 13 states and 55 transitions. Second operand 3 states. [2018-06-22 01:34:15,555 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:15,555 INFO ]: Finished difference Result 14 states and 56 transitions. [2018-06-22 01:34:15,555 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:34:15,555 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:34:15,555 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:15,556 INFO ]: With dead ends: 14 [2018-06-22 01:34:15,556 INFO ]: Without dead ends: 12 [2018-06-22 01:34:15,556 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:34:15,556 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:34:15,558 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:34:15,558 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:34:15,558 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2018-06-22 01:34:15,558 INFO ]: Start accepts. Automaton has 12 states and 40 transitions. Word has length 9 [2018-06-22 01:34:15,558 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:15,558 INFO ]: Abstraction has 12 states and 40 transitions. [2018-06-22 01:34:15,558 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:34:15,558 INFO ]: Start isEmpty. Operand 12 states and 40 transitions. [2018-06-22 01:34:15,559 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:34:15,559 INFO ]: Found error trace [2018-06-22 01:34:15,559 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:15,559 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:15,559 INFO ]: Analyzing trace with hash 1295250302, now seen corresponding path program 1 times [2018-06-22 01:34:15,559 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:15,559 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:15,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:15,560 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:15,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:15,572 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:15,605 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:15,605 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:15,605 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:34:15,612 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:15,637 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:15,639 INFO ]: Computing forward predicates... [2018-06-22 01:34:15,644 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:15,674 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:15,674 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:34:15,675 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:34:15,675 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:34:15,675 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:34:15,675 INFO ]: Start difference. First operand 12 states and 40 transitions. Second operand 4 states. [2018-06-22 01:34:15,798 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:15,798 INFO ]: Finished difference Result 18 states and 66 transitions. [2018-06-22 01:34:15,801 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:34:15,801 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:34:15,801 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:15,802 INFO ]: With dead ends: 18 [2018-06-22 01:34:15,802 INFO ]: Without dead ends: 18 [2018-06-22 01:34:15,802 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:34:15,802 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:34:15,804 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-06-22 01:34:15,804 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:34:15,805 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 57 transitions. [2018-06-22 01:34:15,805 INFO ]: Start accepts. Automaton has 14 states and 57 transitions. Word has length 9 [2018-06-22 01:34:15,805 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:15,805 INFO ]: Abstraction has 14 states and 57 transitions. [2018-06-22 01:34:15,805 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:34:15,805 INFO ]: Start isEmpty. Operand 14 states and 57 transitions. [2018-06-22 01:34:15,805 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:34:15,805 INFO ]: Found error trace [2018-06-22 01:34:15,805 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:15,805 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:15,806 INFO ]: Analyzing trace with hash 1310026638, now seen corresponding path program 2 times [2018-06-22 01:34:15,806 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:15,806 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:15,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:15,806 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:15,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:15,820 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:15,992 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 01:34:16,160 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:16,160 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:16,160 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 01:34:16,166 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:34:16,181 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:34:16,181 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:16,183 INFO ]: Computing forward predicates... [2018-06-22 01:34:16,315 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:16,346 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:16,346 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-22 01:34:16,347 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:34:16,347 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:34:16,347 INFO ]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:34:16,347 INFO ]: Start difference. First operand 14 states and 57 transitions. Second operand 7 states. [2018-06-22 01:34:16,935 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:16,935 INFO ]: Finished difference Result 32 states and 137 transitions. [2018-06-22 01:34:16,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:34:16,938 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-22 01:34:16,938 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:16,939 INFO ]: With dead ends: 32 [2018-06-22 01:34:16,939 INFO ]: Without dead ends: 32 [2018-06-22 01:34:16,939 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:34:16,939 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:34:16,942 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 17. [2018-06-22 01:34:16,942 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:34:16,943 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 80 transitions. [2018-06-22 01:34:16,943 INFO ]: Start accepts. Automaton has 17 states and 80 transitions. Word has length 9 [2018-06-22 01:34:16,943 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:16,943 INFO ]: Abstraction has 17 states and 80 transitions. [2018-06-22 01:34:16,943 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:34:16,943 INFO ]: Start isEmpty. Operand 17 states and 80 transitions. [2018-06-22 01:34:16,944 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:34:16,944 INFO ]: Found error trace [2018-06-22 01:34:16,944 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:16,944 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:16,944 INFO ]: Analyzing trace with hash 1322955932, now seen corresponding path program 1 times [2018-06-22 01:34:16,944 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:16,944 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:16,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:16,945 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:16,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:16,955 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:17,112 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:17,112 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:17,113 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 01:34:17,119 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:17,146 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:17,148 INFO ]: Computing forward predicates... [2018-06-22 01:34:17,214 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:17,249 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:17,249 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-22 01:34:17,249 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:34:17,249 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:34:17,249 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:34:17,250 INFO ]: Start difference. First operand 17 states and 80 transitions. Second operand 5 states. [2018-06-22 01:34:17,393 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:17,394 INFO ]: Finished difference Result 38 states and 155 transitions. [2018-06-22 01:34:17,394 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:34:17,394 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-22 01:34:17,394 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:17,395 INFO ]: With dead ends: 38 [2018-06-22 01:34:17,395 INFO ]: Without dead ends: 38 [2018-06-22 01:34:17,395 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:34:17,395 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:34:17,401 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 21. [2018-06-22 01:34:17,402 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:34:17,402 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 113 transitions. [2018-06-22 01:34:17,402 INFO ]: Start accepts. Automaton has 21 states and 113 transitions. Word has length 9 [2018-06-22 01:34:17,403 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:17,403 INFO ]: Abstraction has 21 states and 113 transitions. [2018-06-22 01:34:17,403 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:34:17,403 INFO ]: Start isEmpty. Operand 21 states and 113 transitions. [2018-06-22 01:34:17,403 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:34:17,403 INFO ]: Found error trace [2018-06-22 01:34:17,403 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:17,403 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:17,403 INFO ]: Analyzing trace with hash 1066217094, now seen corresponding path program 1 times [2018-06-22 01:34:17,403 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:17,403 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:17,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:17,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:17,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:17,412 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:17,436 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:17,436 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:34:17,436 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:34:17,436 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:34:17,436 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:34:17,436 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:34:17,436 INFO ]: Start difference. First operand 21 states and 113 transitions. Second operand 3 states. [2018-06-22 01:34:17,490 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:17,490 INFO ]: Finished difference Result 21 states and 95 transitions. [2018-06-22 01:34:17,490 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:34:17,490 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:34:17,490 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:17,491 INFO ]: With dead ends: 21 [2018-06-22 01:34:17,491 INFO ]: Without dead ends: 21 [2018-06-22 01:34:17,491 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:34:17,491 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:34:17,493 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-22 01:34:17,493 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:34:17,494 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 78 transitions. [2018-06-22 01:34:17,494 INFO ]: Start accepts. Automaton has 19 states and 78 transitions. Word has length 9 [2018-06-22 01:34:17,494 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:17,494 INFO ]: Abstraction has 19 states and 78 transitions. [2018-06-22 01:34:17,494 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:34:17,494 INFO ]: Start isEmpty. Operand 19 states and 78 transitions. [2018-06-22 01:34:17,495 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:34:17,495 INFO ]: Found error trace [2018-06-22 01:34:17,495 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:17,495 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:17,495 INFO ]: Analyzing trace with hash 1072115712, now seen corresponding path program 1 times [2018-06-22 01:34:17,495 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:17,495 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:17,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:17,496 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:17,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:17,503 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:17,566 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:17,566 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:17,566 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 01:34:17,573 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:17,586 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:17,587 INFO ]: Computing forward predicates... [2018-06-22 01:34:17,593 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:17,613 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:34:17,613 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-22 01:34:17,613 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:34:17,613 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:34:17,613 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:34:17,613 INFO ]: Start difference. First operand 19 states and 78 transitions. Second operand 6 states. [2018-06-22 01:34:17,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:17,886 INFO ]: Finished difference Result 33 states and 111 transitions. [2018-06-22 01:34:17,887 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:34:17,887 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-22 01:34:17,887 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:17,887 INFO ]: With dead ends: 33 [2018-06-22 01:34:17,887 INFO ]: Without dead ends: 33 [2018-06-22 01:34:17,888 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:34:17,888 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:34:17,891 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 22. [2018-06-22 01:34:17,891 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 01:34:17,891 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 85 transitions. [2018-06-22 01:34:17,891 INFO ]: Start accepts. Automaton has 22 states and 85 transitions. Word has length 9 [2018-06-22 01:34:17,892 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:17,892 INFO ]: Abstraction has 22 states and 85 transitions. [2018-06-22 01:34:17,892 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:34:17,892 INFO ]: Start isEmpty. Operand 22 states and 85 transitions. [2018-06-22 01:34:17,892 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:34:17,892 INFO ]: Found error trace [2018-06-22 01:34:17,892 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:17,892 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:17,892 INFO ]: Analyzing trace with hash 1539059846, now seen corresponding path program 1 times [2018-06-22 01:34:17,892 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:17,892 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:17,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:17,893 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:17,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:17,901 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:17,941 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:17,941 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:17,941 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 01:34:17,948 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:17,967 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:17,968 INFO ]: Computing forward predicates... [2018-06-22 01:34:18,063 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:18,082 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:18,082 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-06-22 01:34:18,082 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:34:18,082 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:34:18,082 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:34:18,082 INFO ]: Start difference. First operand 22 states and 85 transitions. Second operand 7 states. [2018-06-22 01:34:18,186 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:18,186 INFO ]: Finished difference Result 24 states and 84 transitions. [2018-06-22 01:34:18,186 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:34:18,186 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-22 01:34:18,186 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:18,187 INFO ]: With dead ends: 24 [2018-06-22 01:34:18,187 INFO ]: Without dead ends: 24 [2018-06-22 01:34:18,187 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:34:18,187 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:34:18,188 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-06-22 01:34:18,188 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:34:18,189 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2018-06-22 01:34:18,189 INFO ]: Start accepts. Automaton has 17 states and 54 transitions. Word has length 9 [2018-06-22 01:34:18,189 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:18,189 INFO ]: Abstraction has 17 states and 54 transitions. [2018-06-22 01:34:18,189 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:34:18,189 INFO ]: Start isEmpty. Operand 17 states and 54 transitions. [2018-06-22 01:34:18,190 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:34:18,190 INFO ]: Found error trace [2018-06-22 01:34:18,190 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:18,190 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:18,190 INFO ]: Analyzing trace with hash 1710834752, now seen corresponding path program 2 times [2018-06-22 01:34:18,190 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:18,190 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:18,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:18,191 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:18,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:18,200 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:18,239 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:18,239 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:18,239 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 01:34:18,248 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:34:18,259 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:34:18,259 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:18,260 INFO ]: Computing forward predicates... [2018-06-22 01:34:18,264 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:18,283 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:18,283 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-22 01:34:18,283 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:34:18,284 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:34:18,284 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:34:18,284 INFO ]: Start difference. First operand 17 states and 54 transitions. Second operand 5 states. [2018-06-22 01:34:18,345 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:18,345 INFO ]: Finished difference Result 32 states and 99 transitions. [2018-06-22 01:34:18,346 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:34:18,346 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-22 01:34:18,346 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:18,347 INFO ]: With dead ends: 32 [2018-06-22 01:34:18,347 INFO ]: Without dead ends: 32 [2018-06-22 01:34:18,347 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:34:18,347 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:34:18,349 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 17. [2018-06-22 01:34:18,349 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:34:18,349 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2018-06-22 01:34:18,349 INFO ]: Start accepts. Automaton has 17 states and 54 transitions. Word has length 9 [2018-06-22 01:34:18,350 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:18,350 INFO ]: Abstraction has 17 states and 54 transitions. [2018-06-22 01:34:18,350 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:34:18,350 INFO ]: Start isEmpty. Operand 17 states and 54 transitions. [2018-06-22 01:34:18,350 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:34:18,350 INFO ]: Found error trace [2018-06-22 01:34:18,350 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:18,350 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:18,350 INFO ]: Analyzing trace with hash 1980841095, now seen corresponding path program 1 times [2018-06-22 01:34:18,350 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:18,350 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:18,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:18,351 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:18,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:18,358 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:18,423 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:34:18,423 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:18,423 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 01:34:18,431 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:18,461 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:18,462 INFO ]: Computing forward predicates... [2018-06-22 01:34:18,467 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:34:18,494 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:34:18,494 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-06-22 01:34:18,494 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:34:18,494 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:34:18,494 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:34:18,494 INFO ]: Start difference. First operand 17 states and 54 transitions. Second operand 4 states. [2018-06-22 01:34:18,505 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:18,505 INFO ]: Finished difference Result 15 states and 39 transitions. [2018-06-22 01:34:18,506 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:34:18,506 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 01:34:18,506 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:18,506 INFO ]: With dead ends: 15 [2018-06-22 01:34:18,506 INFO ]: Without dead ends: 15 [2018-06-22 01:34:18,506 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:34:18,506 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:34:18,507 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-06-22 01:34:18,507 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:34:18,507 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2018-06-22 01:34:18,507 INFO ]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 10 [2018-06-22 01:34:18,507 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:18,507 INFO ]: Abstraction has 13 states and 31 transitions. [2018-06-22 01:34:18,507 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:34:18,507 INFO ]: Start isEmpty. Operand 13 states and 31 transitions. [2018-06-22 01:34:18,508 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:34:18,508 INFO ]: Found error trace [2018-06-22 01:34:18,508 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:18,508 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:18,508 INFO ]: Analyzing trace with hash 2002648107, now seen corresponding path program 3 times [2018-06-22 01:34:18,508 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:18,508 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:18,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:18,509 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:18,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:18,517 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:18,593 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:18,593 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:18,593 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 01:34:18,598 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:34:18,611 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:34:18,611 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:18,612 INFO ]: Computing forward predicates... [2018-06-22 01:34:18,656 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:18,674 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:18,674 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 01:34:18,675 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:34:18,675 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:34:18,675 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:34:18,675 INFO ]: Start difference. First operand 13 states and 31 transitions. Second operand 6 states. [2018-06-22 01:34:18,871 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:18,871 INFO ]: Finished difference Result 22 states and 67 transitions. [2018-06-22 01:34:18,871 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:34:18,871 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-22 01:34:18,871 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:18,871 INFO ]: With dead ends: 22 [2018-06-22 01:34:18,871 INFO ]: Without dead ends: 22 [2018-06-22 01:34:18,872 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:34:18,872 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 01:34:18,873 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-06-22 01:34:18,873 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:34:18,873 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2018-06-22 01:34:18,873 INFO ]: Start accepts. Automaton has 14 states and 35 transitions. Word has length 10 [2018-06-22 01:34:18,873 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:18,874 INFO ]: Abstraction has 14 states and 35 transitions. [2018-06-22 01:34:18,874 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:34:18,874 INFO ]: Start isEmpty. Operand 14 states and 35 transitions. [2018-06-22 01:34:18,874 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:34:18,874 INFO ]: Found error trace [2018-06-22 01:34:18,874 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:18,874 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:18,874 INFO ]: Analyzing trace with hash -1904440369, now seen corresponding path program 4 times [2018-06-22 01:34:18,874 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:18,874 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:18,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:18,875 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:18,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:18,883 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:18,937 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:18,937 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:18,937 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 01:34:18,943 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:34:18,956 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:34:18,956 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:18,957 INFO ]: Computing forward predicates... [2018-06-22 01:34:19,013 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:19,033 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:19,033 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 01:34:19,034 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:34:19,034 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:34:19,034 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:34:19,034 INFO ]: Start difference. First operand 14 states and 35 transitions. Second operand 10 states. [2018-06-22 01:34:19,149 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:19,149 INFO ]: Finished difference Result 21 states and 63 transitions. [2018-06-22 01:34:19,149 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:34:19,149 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-22 01:34:19,149 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:19,149 INFO ]: With dead ends: 21 [2018-06-22 01:34:19,149 INFO ]: Without dead ends: 21 [2018-06-22 01:34:19,150 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:34:19,150 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:34:19,151 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 14. [2018-06-22 01:34:19,151 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:34:19,151 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2018-06-22 01:34:19,151 INFO ]: Start accepts. Automaton has 14 states and 35 transitions. Word has length 10 [2018-06-22 01:34:19,151 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:19,151 INFO ]: Abstraction has 14 states and 35 transitions. [2018-06-22 01:34:19,151 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:34:19,151 INFO ]: Start isEmpty. Operand 14 states and 35 transitions. [2018-06-22 01:34:19,152 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:34:19,152 INFO ]: Found error trace [2018-06-22 01:34:19,152 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:19,152 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:19,152 INFO ]: Analyzing trace with hash -815343339, now seen corresponding path program 1 times [2018-06-22 01:34:19,152 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:19,152 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:19,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:19,153 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:19,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:19,161 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:19,200 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:19,200 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:19,200 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:34:19,207 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:19,220 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:19,232 INFO ]: Computing forward predicates... [2018-06-22 01:34:19,261 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:19,281 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:19,281 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 01:34:19,281 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:34:19,281 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:34:19,281 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:34:19,281 INFO ]: Start difference. First operand 14 states and 35 transitions. Second operand 10 states. [2018-06-22 01:34:19,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:19,407 INFO ]: Finished difference Result 26 states and 83 transitions. [2018-06-22 01:34:19,408 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:34:19,408 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-22 01:34:19,408 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:19,408 INFO ]: With dead ends: 26 [2018-06-22 01:34:19,408 INFO ]: Without dead ends: 26 [2018-06-22 01:34:19,408 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:34:19,408 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 01:34:19,410 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 15. [2018-06-22 01:34:19,410 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:34:19,410 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 39 transitions. [2018-06-22 01:34:19,410 INFO ]: Start accepts. Automaton has 15 states and 39 transitions. Word has length 10 [2018-06-22 01:34:19,410 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:19,410 INFO ]: Abstraction has 15 states and 39 transitions. [2018-06-22 01:34:19,410 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:34:19,410 INFO ]: Start isEmpty. Operand 15 states and 39 transitions. [2018-06-22 01:34:19,411 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:34:19,411 INFO ]: Found error trace [2018-06-22 01:34:19,411 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:19,411 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:19,411 INFO ]: Analyzing trace with hash 499813669, now seen corresponding path program 2 times [2018-06-22 01:34:19,411 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:19,411 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:19,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:19,411 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:19,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:19,419 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:19,473 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:19,473 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:19,473 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 01:34:19,480 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:34:19,496 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:34:19,496 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:19,497 INFO ]: Computing forward predicates... [2018-06-22 01:34:19,641 INFO ]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:19,660 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:19,660 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-22 01:34:19,661 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:34:19,661 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:34:19,661 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:34:19,661 INFO ]: Start difference. First operand 15 states and 39 transitions. Second operand 9 states. [2018-06-22 01:34:19,892 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:19,893 INFO ]: Finished difference Result 23 states and 71 transitions. [2018-06-22 01:34:19,893 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:34:19,893 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-22 01:34:19,893 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:19,893 INFO ]: With dead ends: 23 [2018-06-22 01:34:19,893 INFO ]: Without dead ends: 23 [2018-06-22 01:34:19,893 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:34:19,893 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:34:19,895 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 13. [2018-06-22 01:34:19,895 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:34:19,895 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2018-06-22 01:34:19,895 INFO ]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 10 [2018-06-22 01:34:19,895 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:19,895 INFO ]: Abstraction has 13 states and 31 transitions. [2018-06-22 01:34:19,895 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:34:19,895 INFO ]: Start isEmpty. Operand 13 states and 31 transitions. [2018-06-22 01:34:19,895 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:34:19,895 INFO ]: Found error trace [2018-06-22 01:34:19,895 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:19,896 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:19,896 INFO ]: Analyzing trace with hash 1585339758, now seen corresponding path program 3 times [2018-06-22 01:34:19,896 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:19,896 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:19,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:19,896 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:19,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:19,919 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:20,027 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:20,027 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:20,027 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) [2018-06-22 01:34:20,042 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:34:20,066 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:34:20,066 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:20,068 INFO ]: Computing forward predicates... [2018-06-22 01:34:22,266 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:22,291 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:22,291 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-22 01:34:22,292 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:34:22,292 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:34:22,292 INFO ]: CoverageRelationStatistics Valid=32, Invalid=77, Unknown=1, NotChecked=0, Total=110 [2018-06-22 01:34:22,292 INFO ]: Start difference. First operand 13 states and 31 transitions. Second operand 11 states. [2018-06-22 01:34:33,119 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-06-22 01:34:34,503 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:34,503 INFO ]: Finished difference Result 34 states and 115 transitions. [2018-06-22 01:34:34,504 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:34:34,504 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-22 01:34:34,504 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:34,504 INFO ]: With dead ends: 34 [2018-06-22 01:34:34,504 INFO ]: Without dead ends: 34 [2018-06-22 01:34:34,505 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=107, Invalid=234, Unknown=1, NotChecked=0, Total=342 [2018-06-22 01:34:34,505 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 01:34:34,507 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-06-22 01:34:34,507 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:34:34,507 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2018-06-22 01:34:34,507 INFO ]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 11 [2018-06-22 01:34:34,507 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:34,507 INFO ]: Abstraction has 20 states and 59 transitions. [2018-06-22 01:34:34,507 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:34:34,507 INFO ]: Start isEmpty. Operand 20 states and 59 transitions. [2018-06-22 01:34:34,508 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:34:34,508 INFO ]: Found error trace [2018-06-22 01:34:34,508 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:34,508 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:34,508 INFO ]: Analyzing trace with hash 1598269052, now seen corresponding path program 5 times [2018-06-22 01:34:34,508 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:34,508 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:34,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:34,509 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:34,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:34,516 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:34,737 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:34,737 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:34,795 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 01:34:34,801 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:34:34,828 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 01:34:34,828 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:34,830 INFO ]: Computing forward predicates... [2018-06-22 01:34:34,886 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:34,906 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:34,907 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 01:34:34,907 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:34:34,907 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:34:34,907 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:34:34,907 INFO ]: Start difference. First operand 20 states and 59 transitions. Second operand 7 states. [2018-06-22 01:34:35,045 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:35,045 INFO ]: Finished difference Result 43 states and 151 transitions. [2018-06-22 01:34:35,045 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:34:35,045 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-22 01:34:35,045 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:35,045 INFO ]: With dead ends: 43 [2018-06-22 01:34:35,045 INFO ]: Without dead ends: 43 [2018-06-22 01:34:35,045 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:34:35,045 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 01:34:35,047 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 23. [2018-06-22 01:34:35,047 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:34:35,047 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 71 transitions. [2018-06-22 01:34:35,047 INFO ]: Start accepts. Automaton has 23 states and 71 transitions. Word has length 11 [2018-06-22 01:34:35,047 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:35,047 INFO ]: Abstraction has 23 states and 71 transitions. [2018-06-22 01:34:35,047 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:34:35,047 INFO ]: Start isEmpty. Operand 23 states and 71 transitions. [2018-06-22 01:34:35,048 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:34:35,048 INFO ]: Found error trace [2018-06-22 01:34:35,048 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:35,048 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:35,048 INFO ]: Analyzing trace with hash 1986147872, now seen corresponding path program 6 times [2018-06-22 01:34:35,048 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:35,048 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:35,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:35,049 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:35,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:35,056 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:35,405 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:35,405 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:35,405 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 01:34:35,411 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:34:35,426 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-22 01:34:35,426 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:35,427 INFO ]: Computing forward predicates... [2018-06-22 01:34:35,508 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:35,527 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:35,527 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 01:34:35,527 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:34:35,527 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:34:35,528 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:34:35,528 INFO ]: Start difference. First operand 23 states and 71 transitions. Second operand 7 states. [2018-06-22 01:34:35,611 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:35,611 INFO ]: Finished difference Result 41 states and 143 transitions. [2018-06-22 01:34:35,611 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:34:35,611 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-22 01:34:35,611 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:35,611 INFO ]: With dead ends: 41 [2018-06-22 01:34:35,611 INFO ]: Without dead ends: 41 [2018-06-22 01:34:35,612 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:34:35,612 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:34:35,613 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 23. [2018-06-22 01:34:35,613 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:34:35,613 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 71 transitions. [2018-06-22 01:34:35,613 INFO ]: Start accepts. Automaton has 23 states and 71 transitions. Word has length 11 [2018-06-22 01:34:35,613 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:35,613 INFO ]: Abstraction has 23 states and 71 transitions. [2018-06-22 01:34:35,613 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:34:35,614 INFO ]: Start isEmpty. Operand 23 states and 71 transitions. [2018-06-22 01:34:35,614 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:34:35,614 INFO ]: Found error trace [2018-06-22 01:34:35,614 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:35,614 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:35,614 INFO ]: Analyzing trace with hash 1125489404, now seen corresponding path program 7 times [2018-06-22 01:34:35,614 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:35,614 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:35,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:35,614 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:35,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:35,624 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:35,715 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:35,715 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:35,715 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 01:34:35,721 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:35,734 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:35,735 INFO ]: Computing forward predicates... [2018-06-22 01:34:35,829 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:35,848 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:35,848 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 01:34:35,848 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:34:35,848 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:34:35,848 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:34:35,848 INFO ]: Start difference. First operand 23 states and 71 transitions. Second operand 12 states. [2018-06-22 01:34:36,365 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:36,365 INFO ]: Finished difference Result 51 states and 183 transitions. [2018-06-22 01:34:36,365 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:34:36,365 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-22 01:34:36,365 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:36,366 INFO ]: With dead ends: 51 [2018-06-22 01:34:36,366 INFO ]: Without dead ends: 51 [2018-06-22 01:34:36,366 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:34:36,366 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 01:34:36,368 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 23. [2018-06-22 01:34:36,368 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:34:36,368 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 71 transitions. [2018-06-22 01:34:36,368 INFO ]: Start accepts. Automaton has 23 states and 71 transitions. Word has length 11 [2018-06-22 01:34:36,368 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:36,368 INFO ]: Abstraction has 23 states and 71 transitions. [2018-06-22 01:34:36,368 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:34:36,368 INFO ]: Start isEmpty. Operand 23 states and 71 transitions. [2018-06-22 01:34:36,369 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:34:36,369 INFO ]: Found error trace [2018-06-22 01:34:36,369 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:36,369 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:36,369 INFO ]: Analyzing trace with hash -1652046746, now seen corresponding path program 3 times [2018-06-22 01:34:36,369 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:36,369 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:36,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:36,369 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:36,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:36,377 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:36,406 INFO ]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:36,407 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:36,407 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 01:34:36,412 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:34:36,426 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:34:36,426 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:36,428 INFO ]: Computing forward predicates... [2018-06-22 01:34:36,524 INFO ]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:36,546 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:36,546 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-06-22 01:34:36,546 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:34:36,546 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:34:36,546 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:34:36,546 INFO ]: Start difference. First operand 23 states and 71 transitions. Second operand 11 states. [2018-06-22 01:34:36,725 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:36,725 INFO ]: Finished difference Result 34 states and 115 transitions. [2018-06-22 01:34:36,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:34:36,729 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-22 01:34:36,729 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:36,730 INFO ]: With dead ends: 34 [2018-06-22 01:34:36,730 INFO ]: Without dead ends: 34 [2018-06-22 01:34:36,730 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:34:36,730 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 01:34:36,732 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 19. [2018-06-22 01:34:36,732 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:34:36,732 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 55 transitions. [2018-06-22 01:34:36,732 INFO ]: Start accepts. Automaton has 19 states and 55 transitions. Word has length 11 [2018-06-22 01:34:36,732 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:36,732 INFO ]: Abstraction has 19 states and 55 transitions. [2018-06-22 01:34:36,732 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:34:36,732 INFO ]: Start isEmpty. Operand 19 states and 55 transitions. [2018-06-22 01:34:36,732 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:34:36,732 INFO ]: Found error trace [2018-06-22 01:34:36,732 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:36,733 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:36,734 INFO ]: Analyzing trace with hash 1947420235, now seen corresponding path program 8 times [2018-06-22 01:34:36,734 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:36,734 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:36,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:36,734 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:36,735 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:36,746 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:36,877 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:36,878 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:36,878 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 01:34:36,884 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:34:36,902 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:34:36,902 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:36,903 INFO ]: Computing forward predicates... [2018-06-22 01:34:36,944 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:36,962 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:36,962 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:34:36,963 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:34:36,963 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:34:36,963 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:34:36,963 INFO ]: Start difference. First operand 19 states and 55 transitions. Second operand 8 states. [2018-06-22 01:34:37,203 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:37,203 INFO ]: Finished difference Result 51 states and 183 transitions. [2018-06-22 01:34:37,205 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:34:37,205 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-22 01:34:37,205 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:37,206 INFO ]: With dead ends: 51 [2018-06-22 01:34:37,206 INFO ]: Without dead ends: 51 [2018-06-22 01:34:37,206 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:34:37,206 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 01:34:37,212 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 23. [2018-06-22 01:34:37,213 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:34:37,213 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 71 transitions. [2018-06-22 01:34:37,213 INFO ]: Start accepts. Automaton has 23 states and 71 transitions. Word has length 12 [2018-06-22 01:34:37,213 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:37,213 INFO ]: Abstraction has 23 states and 71 transitions. [2018-06-22 01:34:37,213 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:34:37,213 INFO ]: Start isEmpty. Operand 23 states and 71 transitions. [2018-06-22 01:34:37,213 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:34:37,213 INFO ]: Found error trace [2018-06-22 01:34:37,214 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:37,214 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:37,214 INFO ]: Analyzing trace with hash -1959668241, now seen corresponding path program 9 times [2018-06-22 01:34:37,214 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:37,214 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:37,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:37,214 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:37,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:37,225 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:37,731 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:37,731 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:37,731 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 01:34:37,736 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:34:37,754 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:34:37,754 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:37,755 INFO ]: Computing forward predicates... [2018-06-22 01:34:37,813 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:37,832 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:37,832 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 01:34:37,832 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:34:37,832 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:34:37,832 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:34:37,832 INFO ]: Start difference. First operand 23 states and 71 transitions. Second operand 9 states. [2018-06-22 01:34:38,033 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:38,033 INFO ]: Finished difference Result 72 states and 262 transitions. [2018-06-22 01:34:38,034 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:34:38,034 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-22 01:34:38,034 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:38,035 INFO ]: With dead ends: 72 [2018-06-22 01:34:38,035 INFO ]: Without dead ends: 72 [2018-06-22 01:34:38,035 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:34:38,035 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 01:34:38,038 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 46. [2018-06-22 01:34:38,038 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 01:34:38,039 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 164 transitions. [2018-06-22 01:34:38,039 INFO ]: Start accepts. Automaton has 46 states and 164 transitions. Word has length 12 [2018-06-22 01:34:38,039 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:38,039 INFO ]: Abstraction has 46 states and 164 transitions. [2018-06-22 01:34:38,039 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:34:38,039 INFO ]: Start isEmpty. Operand 46 states and 164 transitions. [2018-06-22 01:34:38,039 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:34:38,039 INFO ]: Found error trace [2018-06-22 01:34:38,039 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:38,040 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:38,040 INFO ]: Analyzing trace with hash 1474640587, now seen corresponding path program 10 times [2018-06-22 01:34:38,040 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:38,040 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:38,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:38,040 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:38,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:38,048 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:38,719 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:38,719 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:38,719 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 01:34:38,736 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:34:38,788 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:34:38,788 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:38,790 INFO ]: Computing forward predicates... [2018-06-22 01:34:39,028 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:39,061 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:39,061 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:34:39,061 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:34:39,061 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:34:39,061 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:34:39,061 INFO ]: Start difference. First operand 46 states and 164 transitions. Second operand 8 states. [2018-06-22 01:34:39,391 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:39,391 INFO ]: Finished difference Result 81 states and 304 transitions. [2018-06-22 01:34:39,391 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:34:39,391 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-22 01:34:39,391 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:39,392 INFO ]: With dead ends: 81 [2018-06-22 01:34:39,392 INFO ]: Without dead ends: 81 [2018-06-22 01:34:39,392 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:34:39,392 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 01:34:39,395 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 46. [2018-06-22 01:34:39,395 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 01:34:39,396 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 164 transitions. [2018-06-22 01:34:39,396 INFO ]: Start accepts. Automaton has 46 states and 164 transitions. Word has length 12 [2018-06-22 01:34:39,396 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:39,396 INFO ]: Abstraction has 46 states and 164 transitions. [2018-06-22 01:34:39,396 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:34:39,396 INFO ]: Start isEmpty. Operand 46 states and 164 transitions. [2018-06-22 01:34:39,397 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:34:39,397 INFO ]: Found error trace [2018-06-22 01:34:39,397 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:39,397 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:39,397 INFO ]: Analyzing trace with hash 359757125, now seen corresponding path program 4 times [2018-06-22 01:34:39,397 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:39,397 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:39,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:39,397 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:39,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:39,410 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:39,465 INFO ]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:39,465 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:39,465 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 01:34:39,470 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:34:39,486 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:34:39,486 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:39,488 INFO ]: Computing forward predicates... [2018-06-22 01:34:39,632 INFO ]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:39,651 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:39,651 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-06-22 01:34:39,651 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:34:39,651 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:34:39,651 INFO ]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:34:39,651 INFO ]: Start difference. First operand 46 states and 164 transitions. Second operand 13 states. [2018-06-22 01:34:39,864 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:39,864 INFO ]: Finished difference Result 83 states and 312 transitions. [2018-06-22 01:34:39,864 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:34:39,864 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-22 01:34:39,864 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:39,865 INFO ]: With dead ends: 83 [2018-06-22 01:34:39,865 INFO ]: Without dead ends: 83 [2018-06-22 01:34:39,865 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:34:39,865 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-22 01:34:39,868 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 48. [2018-06-22 01:34:39,868 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 01:34:39,869 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 172 transitions. [2018-06-22 01:34:39,869 INFO ]: Start accepts. Automaton has 48 states and 172 transitions. Word has length 12 [2018-06-22 01:34:39,869 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:39,869 INFO ]: Abstraction has 48 states and 172 transitions. [2018-06-22 01:34:39,869 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:34:39,869 INFO ]: Start isEmpty. Operand 48 states and 172 transitions. [2018-06-22 01:34:39,870 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:34:39,870 INFO ]: Found error trace [2018-06-22 01:34:39,870 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:39,870 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:39,870 INFO ]: Analyzing trace with hash -113794980, now seen corresponding path program 11 times [2018-06-22 01:34:39,870 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:39,870 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:39,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:39,871 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:39,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:39,882 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:39,928 INFO ]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:39,928 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:39,928 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 01:34:39,934 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:34:39,954 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:34:39,954 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:39,955 INFO ]: Computing forward predicates... [2018-06-22 01:34:40,159 INFO ]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:40,178 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:40,178 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:34:40,178 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:34:40,178 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:34:40,178 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:34:40,178 INFO ]: Start difference. First operand 48 states and 172 transitions. Second operand 8 states. [2018-06-22 01:34:40,316 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:40,316 INFO ]: Finished difference Result 87 states and 328 transitions. [2018-06-22 01:34:40,316 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:34:40,316 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 01:34:40,316 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:40,317 INFO ]: With dead ends: 87 [2018-06-22 01:34:40,317 INFO ]: Without dead ends: 87 [2018-06-22 01:34:40,317 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:34:40,317 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-22 01:34:40,320 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 43. [2018-06-22 01:34:40,320 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 01:34:40,320 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 152 transitions. [2018-06-22 01:34:40,320 INFO ]: Start accepts. Automaton has 43 states and 152 transitions. Word has length 13 [2018-06-22 01:34:40,320 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:40,321 INFO ]: Abstraction has 43 states and 152 transitions. [2018-06-22 01:34:40,321 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:34:40,321 INFO ]: Start isEmpty. Operand 43 states and 152 transitions. [2018-06-22 01:34:40,321 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:34:40,321 INFO ]: Found error trace [2018-06-22 01:34:40,321 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:40,321 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:40,321 INFO ]: Analyzing trace with hash -1698832314, now seen corresponding path program 5 times [2018-06-22 01:34:40,321 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:40,321 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:40,322 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:40,322 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:40,322 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:40,333 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:40,451 INFO ]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:40,451 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:40,451 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 01:34:40,456 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:34:40,475 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:34:40,475 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:40,476 INFO ]: Computing forward predicates... [2018-06-22 01:34:40,570 INFO ]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:40,588 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:40,588 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:34:40,588 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:34:40,589 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:34:40,589 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:34:40,589 INFO ]: Start difference. First operand 43 states and 152 transitions. Second operand 8 states. [2018-06-22 01:34:40,715 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:40,715 INFO ]: Finished difference Result 68 states and 204 transitions. [2018-06-22 01:34:40,715 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:34:40,715 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 01:34:40,715 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:40,715 INFO ]: With dead ends: 68 [2018-06-22 01:34:40,716 INFO ]: Without dead ends: 51 [2018-06-22 01:34:40,716 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:34:40,716 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 01:34:40,718 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-06-22 01:34:40,718 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 01:34:40,719 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 176 transitions. [2018-06-22 01:34:40,719 INFO ]: Start accepts. Automaton has 51 states and 176 transitions. Word has length 13 [2018-06-22 01:34:40,719 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:40,719 INFO ]: Abstraction has 51 states and 176 transitions. [2018-06-22 01:34:40,719 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:34:40,719 INFO ]: Start isEmpty. Operand 51 states and 176 transitions. [2018-06-22 01:34:40,720 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:34:40,720 INFO ]: Found error trace [2018-06-22 01:34:40,720 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:40,720 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:40,720 INFO ]: Analyzing trace with hash 2136284628, now seen corresponding path program 1 times [2018-06-22 01:34:40,720 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:40,720 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:40,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:40,720 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:40,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:40,730 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:40,834 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:40,834 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:40,834 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 01:34:40,840 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:40,857 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:40,860 INFO ]: Computing forward predicates... [2018-06-22 01:34:41,314 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:41,332 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:41,332 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-06-22 01:34:41,333 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:34:41,333 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:34:41,333 INFO ]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:34:41,333 INFO ]: Start difference. First operand 51 states and 176 transitions. Second operand 15 states. [2018-06-22 01:34:45,524 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:45,524 INFO ]: Finished difference Result 78 states and 282 transitions. [2018-06-22 01:34:45,524 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:34:45,524 INFO ]: Start accepts. Automaton has 15 states. Word has length 13 [2018-06-22 01:34:45,525 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:45,525 INFO ]: With dead ends: 78 [2018-06-22 01:34:45,525 INFO ]: Without dead ends: 78 [2018-06-22 01:34:45,526 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:34:45,526 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-22 01:34:45,530 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 53. [2018-06-22 01:34:45,530 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 01:34:45,531 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 182 transitions. [2018-06-22 01:34:45,531 INFO ]: Start accepts. Automaton has 53 states and 182 transitions. Word has length 13 [2018-06-22 01:34:45,531 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:45,531 INFO ]: Abstraction has 53 states and 182 transitions. [2018-06-22 01:34:45,531 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:34:45,531 INFO ]: Start isEmpty. Operand 53 states and 182 transitions. [2018-06-22 01:34:45,531 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:34:45,531 INFO ]: Found error trace [2018-06-22 01:34:45,531 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:45,532 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:45,532 INFO ]: Analyzing trace with hash 1225675896, now seen corresponding path program 2 times [2018-06-22 01:34:45,532 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:45,532 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:45,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:45,532 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:45,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:45,540 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:45,605 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:45,605 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:45,605 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 01:34:45,611 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:34:45,629 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:34:45,629 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:45,631 INFO ]: Computing forward predicates... [2018-06-22 01:34:45,785 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:45,804 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:45,804 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-22 01:34:45,804 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:34:45,804 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:34:45,805 INFO ]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:34:45,805 INFO ]: Start difference. First operand 53 states and 182 transitions. Second operand 16 states. [2018-06-22 01:34:46,125 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:46,125 INFO ]: Finished difference Result 121 states and 454 transitions. [2018-06-22 01:34:46,127 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:34:46,127 INFO ]: Start accepts. Automaton has 16 states. Word has length 13 [2018-06-22 01:34:46,127 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:46,129 INFO ]: With dead ends: 121 [2018-06-22 01:34:46,129 INFO ]: Without dead ends: 121 [2018-06-22 01:34:46,129 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:34:46,129 INFO ]: Start minimizeSevpa. Operand 121 states. [2018-06-22 01:34:46,132 INFO ]: Finished minimizeSevpa. Reduced states from 121 to 53. [2018-06-22 01:34:46,132 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 01:34:46,133 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 182 transitions. [2018-06-22 01:34:46,133 INFO ]: Start accepts. Automaton has 53 states and 182 transitions. Word has length 13 [2018-06-22 01:34:46,133 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:46,133 INFO ]: Abstraction has 53 states and 182 transitions. [2018-06-22 01:34:46,133 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:34:46,133 INFO ]: Start isEmpty. Operand 53 states and 182 transitions. [2018-06-22 01:34:46,133 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:34:46,133 INFO ]: Found error trace [2018-06-22 01:34:46,133 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:46,134 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:46,134 INFO ]: Analyzing trace with hash -1233391020, now seen corresponding path program 3 times [2018-06-22 01:34:46,134 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:46,134 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:46,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:46,134 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:46,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:46,142 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:46,530 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:46,530 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:46,530 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 01:34:46,551 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:34:46,570 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:34:46,570 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:46,571 INFO ]: Computing forward predicates... [2018-06-22 01:34:46,656 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:46,674 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:46,674 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-22 01:34:46,674 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:34:46,674 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:34:46,675 INFO ]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:34:46,675 INFO ]: Start difference. First operand 53 states and 182 transitions. Second operand 16 states. [2018-06-22 01:34:47,390 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:47,390 INFO ]: Finished difference Result 157 states and 598 transitions. [2018-06-22 01:34:47,393 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:34:47,393 INFO ]: Start accepts. Automaton has 16 states. Word has length 13 [2018-06-22 01:34:47,393 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:47,394 INFO ]: With dead ends: 157 [2018-06-22 01:34:47,394 INFO ]: Without dead ends: 157 [2018-06-22 01:34:47,395 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=214, Invalid=778, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:34:47,395 INFO ]: Start minimizeSevpa. Operand 157 states. [2018-06-22 01:34:47,399 INFO ]: Finished minimizeSevpa. Reduced states from 157 to 51. [2018-06-22 01:34:47,399 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 01:34:47,399 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 174 transitions. [2018-06-22 01:34:47,399 INFO ]: Start accepts. Automaton has 51 states and 174 transitions. Word has length 13 [2018-06-22 01:34:47,399 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:47,399 INFO ]: Abstraction has 51 states and 174 transitions. [2018-06-22 01:34:47,399 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:34:47,399 INFO ]: Start isEmpty. Operand 51 states and 174 transitions. [2018-06-22 01:34:47,400 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:34:47,400 INFO ]: Found error trace [2018-06-22 01:34:47,400 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:47,400 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:47,400 INFO ]: Analyzing trace with hash 1752513671, now seen corresponding path program 4 times [2018-06-22 01:34:47,400 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:47,400 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:47,400 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:47,400 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:47,400 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:47,409 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:47,484 INFO ]: Checked inductivity of 28 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:47,484 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:47,484 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) [2018-06-22 01:34:47,498 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:34:47,526 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:34:47,526 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:47,527 INFO ]: Computing forward predicates... [2018-06-22 01:34:47,532 INFO ]: Checked inductivity of 28 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:47,563 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:47,563 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 01:34:47,563 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:34:47,563 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:34:47,563 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:34:47,563 INFO ]: Start difference. First operand 51 states and 174 transitions. Second operand 9 states. [2018-06-22 01:34:47,735 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:47,735 INFO ]: Finished difference Result 82 states and 230 transitions. [2018-06-22 01:34:47,735 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:34:47,735 INFO ]: Start accepts. Automaton has 9 states. Word has length 14 [2018-06-22 01:34:47,735 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:47,736 INFO ]: With dead ends: 82 [2018-06-22 01:34:47,736 INFO ]: Without dead ends: 45 [2018-06-22 01:34:47,736 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:34:47,736 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 01:34:47,738 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-06-22 01:34:47,738 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 01:34:47,738 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 148 transitions. [2018-06-22 01:34:47,738 INFO ]: Start accepts. Automaton has 43 states and 148 transitions. Word has length 14 [2018-06-22 01:34:47,738 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:47,738 INFO ]: Abstraction has 43 states and 148 transitions. [2018-06-22 01:34:47,738 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:34:47,738 INFO ]: Start isEmpty. Operand 43 states and 148 transitions. [2018-06-22 01:34:47,739 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:34:47,739 INFO ]: Found error trace [2018-06-22 01:34:47,739 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:47,739 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:47,739 INFO ]: Analyzing trace with hash -706553245, now seen corresponding path program 5 times [2018-06-22 01:34:47,739 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:47,739 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:47,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:47,739 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:47,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:47,754 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:47,919 WARN ]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 01:34:48,078 WARN ]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 01:34:48,520 WARN ]: Spent 384.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-06-22 01:34:48,699 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:48,699 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:48,699 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 01:34:48,704 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:34:48,727 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 01:34:48,727 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:48,730 INFO ]: Computing forward predicates... [2018-06-22 01:34:48,882 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:48,900 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:48,900 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 01:34:48,900 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:34:48,900 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:34:48,900 INFO ]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:34:48,901 INFO ]: Start difference. First operand 43 states and 148 transitions. Second operand 18 states. [2018-06-22 01:34:51,909 WARN ]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 85 [2018-06-22 01:34:52,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:52,608 INFO ]: Finished difference Result 120 states and 446 transitions. [2018-06-22 01:34:52,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:34:52,609 INFO ]: Start accepts. Automaton has 18 states. Word has length 14 [2018-06-22 01:34:52,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:52,610 INFO ]: With dead ends: 120 [2018-06-22 01:34:52,610 INFO ]: Without dead ends: 120 [2018-06-22 01:34:52,610 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=200, Invalid=990, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:34:52,610 INFO ]: Start minimizeSevpa. Operand 120 states. [2018-06-22 01:34:52,614 INFO ]: Finished minimizeSevpa. Reduced states from 120 to 94. [2018-06-22 01:34:52,614 INFO ]: Start removeUnreachable. Operand 94 states. [2018-06-22 01:34:52,615 INFO ]: Finished removeUnreachable. Reduced from 94 states to 94 states and 351 transitions. [2018-06-22 01:34:52,615 INFO ]: Start accepts. Automaton has 94 states and 351 transitions. Word has length 14 [2018-06-22 01:34:52,615 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:52,615 INFO ]: Abstraction has 94 states and 351 transitions. [2018-06-22 01:34:52,615 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:34:52,615 INFO ]: Start isEmpty. Operand 94 states and 351 transitions. [2018-06-22 01:34:52,616 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:34:52,616 INFO ]: Found error trace [2018-06-22 01:34:52,616 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:52,616 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:52,616 INFO ]: Analyzing trace with hash -693623951, now seen corresponding path program 6 times [2018-06-22 01:34:52,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:52,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:52,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:52,617 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:52,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:52,626 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:52,723 INFO ]: Checked inductivity of 28 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:34:52,723 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:52,723 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 01:34:52,728 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:34:52,752 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 01:34:52,752 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:52,754 INFO ]: Computing forward predicates... [2018-06-22 01:34:55,630 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:55,649 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:55,649 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 01:34:55,649 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:34:55,649 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:34:55,649 INFO ]: CoverageRelationStatistics Valid=35, Invalid=201, Unknown=4, NotChecked=0, Total=240 [2018-06-22 01:34:55,649 INFO ]: Start difference. First operand 94 states and 351 transitions. Second operand 16 states. [2018-06-22 01:34:59,762 WARN ]: Spent 1.19 s on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-06-22 01:35:01,222 WARN ]: Spent 341.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2018-06-22 01:35:05,626 WARN ]: Spent 3.11 s on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2018-06-22 01:35:05,832 WARN ]: Spent 188.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 16 [2018-06-22 01:35:08,034 WARN ]: Spent 350.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2018-06-22 01:35:16,626 WARN ]: Spent 449.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 20 [2018-06-22 01:35:19,519 WARN ]: Spent 707.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 24 Received shutdown request... [2018-06-22 01:35:25,810 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:35:25,810 WARN ]: Verification canceled [2018-06-22 01:35:25,814 WARN ]: Timeout [2018-06-22 01:35:25,814 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:35:25 BoogieIcfgContainer [2018-06-22 01:35:25,814 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:35:25,815 INFO ]: Toolchain (without parser) took 72503.60 ms. Allocated memory was 309.9 MB in the beginning and 433.6 MB in the end (delta: 123.7 MB). Free memory was 262.2 MB in the beginning and 251.2 MB in the end (delta: 11.1 MB). Peak memory consumption was 134.8 MB. Max. memory is 3.6 GB. [2018-06-22 01:35:25,815 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 309.9 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:35:25,816 INFO ]: ChcToBoogie took 67.77 ms. Allocated memory is still 309.9 MB. Free memory was 260.3 MB in the beginning and 258.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:35:25,816 INFO ]: Boogie Preprocessor took 32.98 ms. Allocated memory is still 309.9 MB. Free memory is still 258.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:35:25,816 INFO ]: RCFGBuilder took 564.38 ms. Allocated memory is still 309.9 MB. Free memory was 258.3 MB in the beginning and 240.3 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:35:25,816 INFO ]: TraceAbstraction took 71829.08 ms. Allocated memory was 309.9 MB in the beginning and 433.6 MB in the end (delta: 123.7 MB). Free memory was 240.3 MB in the beginning and 251.2 MB in the end (delta: -10.8 MB). Peak memory consumption was 112.9 MB. Max. memory is 3.6 GB. [2018-06-22 01:35:25,818 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 309.9 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 67.77 ms. Allocated memory is still 309.9 MB. Free memory was 260.3 MB in the beginning and 258.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 32.98 ms. Allocated memory is still 309.9 MB. Free memory is still 258.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 564.38 ms. Allocated memory is still 309.9 MB. Free memory was 258.3 MB in the beginning and 240.3 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 71829.08 ms. Allocated memory was 309.9 MB in the beginning and 433.6 MB in the end (delta: 123.7 MB). Free memory was 240.3 MB in the beginning and 251.2 MB in the end (delta: -10.8 MB). Peak memory consumption was 112.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (94states) and interpolant automaton (currently 23 states, 16 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. TIMEOUT Result, 71.7s OverallTime, 33 OverallIterations, 5 TraceHistogramMax, 56.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 370 SDtfs, 261 SDslu, 1206 SDs, 0 SdLazy, 3529 SolverSat, 957 SolverUnsat, 31 SolverUnknown, 0 SolverNotchecked, 40.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 675 GetRequests, 264 SyntacticMatches, 28 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 26.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=32, 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, 32 MinimizatonAttempts, 611 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 677 NumberOfCodeBlocks, 677 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 615 ConstructedInterpolants, 40 QuantifiedInterpolants, 34182 SizeOfPredicates, 47 NumberOfNonLiveVariables, 4018 ConjunctsInSsa, 808 ConjunctsInUnsatCore, 62 InterpolantComputations, 6 PerfectInterpolantSequences, 102/691 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/025b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-35-25-827.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-35-25-827.csv Completed graceful shutdown