java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/013-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:15:24,826 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:15:24,829 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:15:24,842 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:15:24,842 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:15:24,843 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:15:24,844 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:15:24,849 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:15:24,852 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:15:24,853 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:15:24,853 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:15:24,854 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:15:24,855 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:15:24,857 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:15:24,858 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:15:24,859 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:15:24,873 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:15:24,875 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:15:24,876 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:15:24,877 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:15:24,878 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:15:24,881 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:15:24,884 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:15:24,885 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:15:24,886 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:15:24,886 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:15:24,887 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:15:24,888 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:15:24,889 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:15:24,889 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:15:24,890 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:15:24,890 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:15:24,891 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:15:24,891 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:15:24,897 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:15:24,898 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:15:24,916 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:15:24,916 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:15:24,917 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:15:24,917 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:15:24,919 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:15:24,920 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:15:24,920 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:15:24,920 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:15:24,920 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:15:24,921 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:15:24,921 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:15:24,921 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:15:24,921 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:15:24,921 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:15:24,921 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:15:24,922 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:15:24,922 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:15:24,922 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:15:24,922 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:15:24,927 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:15:24,928 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:15:24,962 INFO ]: Repository-Root is: /tmp [2018-06-22 11:15:24,975 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:15:24,978 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:15:24,980 INFO ]: Initializing SmtParser... [2018-06-22 11:15:24,980 INFO ]: SmtParser initialized [2018-06-22 11:15:24,980 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/013-horn.smt2 [2018-06-22 11:15:24,982 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:15:25,069 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/013-horn.smt2 unknown [2018-06-22 11:15:25,298 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/013-horn.smt2 [2018-06-22 11:15:25,304 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:15:25,309 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:15:25,310 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:15:25,310 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:15:25,310 INFO ]: ChcToBoogie initialized [2018-06-22 11:15:25,313 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:15:25" (1/1) ... [2018-06-22 11:15:25,356 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:15:25 Unit [2018-06-22 11:15:25,356 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:15:25,357 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:15:25,357 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:15:25,357 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:15:25,377 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:15:25" (1/1) ... [2018-06-22 11:15:25,377 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:15:25" (1/1) ... [2018-06-22 11:15:25,382 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:15:25" (1/1) ... [2018-06-22 11:15:25,382 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:15:25" (1/1) ... [2018-06-22 11:15:25,385 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:15:25" (1/1) ... [2018-06-22 11:15:25,387 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:15:25" (1/1) ... [2018-06-22 11:15:25,388 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:15:25" (1/1) ... [2018-06-22 11:15:25,390 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:15:25,390 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:15:25,390 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:15:25,391 INFO ]: RCFGBuilder initialized [2018-06-22 11:15:25,391 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:15:25" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:15:25,401 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:15:25,401 INFO ]: Found specification of procedure False [2018-06-22 11:15:25,401 INFO ]: Found implementation of procedure False [2018-06-22 11:15:25,401 INFO ]: Specification and implementation of procedure REC_f_f given in one single declaration [2018-06-22 11:15:25,401 INFO ]: Found specification of procedure REC_f_f [2018-06-22 11:15:25,401 INFO ]: Found implementation of procedure REC_f_f [2018-06-22 11:15:25,401 INFO ]: Specification and implementation of procedure REC_f_ given in one single declaration [2018-06-22 11:15:25,401 INFO ]: Found specification of procedure REC_f_ [2018-06-22 11:15:25,401 INFO ]: Found implementation of procedure REC_f_ [2018-06-22 11:15:25,401 INFO ]: Specification and implementation of procedure REC__f given in one single declaration [2018-06-22 11:15:25,401 INFO ]: Found specification of procedure REC__f [2018-06-22 11:15:25,401 INFO ]: Found implementation of procedure REC__f [2018-06-22 11:15:25,401 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:15:25,401 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:15:25,401 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 11:15:25,826 INFO ]: Using library mode [2018-06-22 11:15:25,826 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:15:25 BoogieIcfgContainer [2018-06-22 11:15:25,826 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:15:25,827 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:15:25,827 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:15:25,830 INFO ]: TraceAbstraction initialized [2018-06-22 11:15:25,830 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:15:25" (1/3) ... [2018-06-22 11:15:25,831 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5ca92f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:15:25, skipping insertion in model container [2018-06-22 11:15:25,831 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:15:25" (2/3) ... [2018-06-22 11:15:25,832 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5ca92f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:15:25, skipping insertion in model container [2018-06-22 11:15:25,832 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:15:25" (3/3) ... [2018-06-22 11:15:25,833 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:15:25,842 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:15:25,850 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:15:25,883 INFO ]: Using default assertion order modulation [2018-06-22 11:15:25,883 INFO ]: Interprodecural is true [2018-06-22 11:15:25,883 INFO ]: Hoare is false [2018-06-22 11:15:25,883 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:15:25,883 INFO ]: Backedges is TWOTRACK [2018-06-22 11:15:25,883 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:15:25,883 INFO ]: Difference is false [2018-06-22 11:15:25,883 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:15:25,883 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:15:25,898 INFO ]: Start isEmpty. Operand 27 states. [2018-06-22 11:15:25,911 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:15:25,911 INFO ]: Found error trace [2018-06-22 11:15:25,912 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:15:25,912 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:25,917 INFO ]: Analyzing trace with hash 111576821, now seen corresponding path program 1 times [2018-06-22 11:15:25,919 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:25,920 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:25,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:25,956 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:25,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:25,972 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:25,993 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:15:25,995 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:25,995 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:15:25,996 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:15:26,007 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:15:26,008 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:15:26,010 INFO ]: Start difference. First operand 27 states. Second operand 2 states. [2018-06-22 11:15:26,038 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:26,038 INFO ]: Finished difference Result 23 states and 36 transitions. [2018-06-22 11:15:26,038 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:15:26,049 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:15:26,050 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:26,063 INFO ]: With dead ends: 23 [2018-06-22 11:15:26,063 INFO ]: Without dead ends: 23 [2018-06-22 11:15:26,064 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:15:26,082 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:15:26,112 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 11:15:26,116 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:15:26,117 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2018-06-22 11:15:26,118 INFO ]: Start accepts. Automaton has 23 states and 36 transitions. Word has length 5 [2018-06-22 11:15:26,119 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:26,119 INFO ]: Abstraction has 23 states and 36 transitions. [2018-06-22 11:15:26,119 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:15:26,119 INFO ]: Start isEmpty. Operand 23 states and 36 transitions. [2018-06-22 11:15:26,120 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:15:26,121 INFO ]: Found error trace [2018-06-22 11:15:26,121 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:26,121 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:26,121 INFO ]: Analyzing trace with hash 159025101, now seen corresponding path program 1 times [2018-06-22 11:15:26,121 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:26,121 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:26,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:26,122 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:26,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:26,144 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:26,247 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:15:26,247 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:26,247 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:15:26,249 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:15:26,249 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:15:26,249 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:15:26,249 INFO ]: Start difference. First operand 23 states and 36 transitions. Second operand 4 states. [2018-06-22 11:15:26,296 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:26,296 INFO ]: Finished difference Result 27 states and 42 transitions. [2018-06-22 11:15:26,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:15:26,296 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:15:26,296 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:26,297 INFO ]: With dead ends: 27 [2018-06-22 11:15:26,297 INFO ]: Without dead ends: 27 [2018-06-22 11:15:26,298 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:15:26,298 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:15:26,306 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:15:26,306 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:15:26,307 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2018-06-22 11:15:26,307 INFO ]: Start accepts. Automaton has 25 states and 40 transitions. Word has length 9 [2018-06-22 11:15:26,307 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:26,307 INFO ]: Abstraction has 25 states and 40 transitions. [2018-06-22 11:15:26,307 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:15:26,307 INFO ]: Start isEmpty. Operand 25 states and 40 transitions. [2018-06-22 11:15:26,308 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:15:26,308 INFO ]: Found error trace [2018-06-22 11:15:26,309 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:26,309 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:26,310 INFO ]: Analyzing trace with hash -1220389038, now seen corresponding path program 1 times [2018-06-22 11:15:26,310 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:26,310 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:26,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:26,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:26,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:26,323 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:26,432 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:15:26,432 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:26,432 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:15:26,432 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:15:26,433 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:15:26,433 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:15:26,433 INFO ]: Start difference. First operand 25 states and 40 transitions. Second operand 4 states. [2018-06-22 11:15:26,533 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:26,533 INFO ]: Finished difference Result 29 states and 44 transitions. [2018-06-22 11:15:26,534 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:15:26,534 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:15:26,534 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:26,535 INFO ]: With dead ends: 29 [2018-06-22 11:15:26,535 INFO ]: Without dead ends: 29 [2018-06-22 11:15:26,535 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:15:26,535 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:15:26,545 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-22 11:15:26,545 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:15:26,546 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2018-06-22 11:15:26,546 INFO ]: Start accepts. Automaton has 27 states and 42 transitions. Word has length 9 [2018-06-22 11:15:26,547 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:26,547 INFO ]: Abstraction has 27 states and 42 transitions. [2018-06-22 11:15:26,547 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:15:26,547 INFO ]: Start isEmpty. Operand 27 states and 42 transitions. [2018-06-22 11:15:26,548 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:15:26,549 INFO ]: Found error trace [2018-06-22 11:15:26,549 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:26,549 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:26,549 INFO ]: Analyzing trace with hash -1420793095, now seen corresponding path program 1 times [2018-06-22 11:15:26,549 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:26,549 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:26,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:26,550 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:26,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:26,558 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:26,716 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:15:26,716 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:26,716 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:15:26,716 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:15:26,716 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:15:26,716 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:15:26,717 INFO ]: Start difference. First operand 27 states and 42 transitions. Second operand 4 states. [2018-06-22 11:15:26,782 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:26,782 INFO ]: Finished difference Result 31 states and 46 transitions. [2018-06-22 11:15:26,782 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:15:26,782 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:15:26,782 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:26,783 INFO ]: With dead ends: 31 [2018-06-22 11:15:26,783 INFO ]: Without dead ends: 31 [2018-06-22 11:15:26,784 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:15:26,784 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:15:26,789 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 11:15:26,789 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:15:26,789 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2018-06-22 11:15:26,790 INFO ]: Start accepts. Automaton has 27 states and 42 transitions. Word has length 9 [2018-06-22 11:15:26,790 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:26,790 INFO ]: Abstraction has 27 states and 42 transitions. [2018-06-22 11:15:26,790 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:15:26,790 INFO ]: Start isEmpty. Operand 27 states and 42 transitions. [2018-06-22 11:15:26,790 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:15:26,790 INFO ]: Found error trace [2018-06-22 11:15:26,790 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:26,790 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:26,790 INFO ]: Analyzing trace with hash -573353809, now seen corresponding path program 1 times [2018-06-22 11:15:26,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:26,791 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:26,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:26,791 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:26,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:26,801 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:26,833 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:15:26,833 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:26,833 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:15:26,833 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:15:26,833 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:15:26,833 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:15:26,834 INFO ]: Start difference. First operand 27 states and 42 transitions. Second operand 4 states. [2018-06-22 11:15:26,877 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:26,877 INFO ]: Finished difference Result 27 states and 41 transitions. [2018-06-22 11:15:26,878 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:15:26,878 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:15:26,878 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:26,879 INFO ]: With dead ends: 27 [2018-06-22 11:15:26,879 INFO ]: Without dead ends: 26 [2018-06-22 11:15:26,879 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:15:26,879 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:15:26,883 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-06-22 11:15:26,883 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:15:26,884 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2018-06-22 11:15:26,884 INFO ]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2018-06-22 11:15:26,884 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:26,884 INFO ]: Abstraction has 24 states and 35 transitions. [2018-06-22 11:15:26,884 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:15:26,884 INFO ]: Start isEmpty. Operand 24 states and 35 transitions. [2018-06-22 11:15:26,885 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:15:26,885 INFO ]: Found error trace [2018-06-22 11:15:26,885 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:26,885 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:26,885 INFO ]: Analyzing trace with hash 2019304662, now seen corresponding path program 1 times [2018-06-22 11:15:26,885 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:26,885 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:26,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:26,886 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:26,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:26,896 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:27,044 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:15:27,044 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:27,044 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:15:27,052 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:27,087 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:27,095 INFO ]: Computing forward predicates... [2018-06-22 11:15:27,349 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:15:27,375 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:27,375 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:15:27,375 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:15:27,375 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:15:27,375 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:15:27,375 INFO ]: Start difference. First operand 24 states and 35 transitions. Second operand 10 states. [2018-06-22 11:15:27,702 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:27,702 INFO ]: Finished difference Result 30 states and 42 transitions. [2018-06-22 11:15:27,702 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:15:27,703 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:15:27,703 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:27,703 INFO ]: With dead ends: 30 [2018-06-22 11:15:27,703 INFO ]: Without dead ends: 30 [2018-06-22 11:15:27,704 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:15:27,704 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:15:27,708 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-06-22 11:15:27,708 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:15:27,709 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-06-22 11:15:27,709 INFO ]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 13 [2018-06-22 11:15:27,709 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:27,709 INFO ]: Abstraction has 26 states and 37 transitions. [2018-06-22 11:15:27,709 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:15:27,709 INFO ]: Start isEmpty. Operand 26 states and 37 transitions. [2018-06-22 11:15:27,710 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:15:27,710 INFO ]: Found error trace [2018-06-22 11:15:27,710 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:27,710 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:27,710 INFO ]: Analyzing trace with hash -1590433091, now seen corresponding path program 1 times [2018-06-22 11:15:27,710 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:27,710 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:27,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:27,711 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:27,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:27,724 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:27,781 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:15:27,781 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:27,781 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:15:27,781 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:15:27,781 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:15:27,782 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:15:27,782 INFO ]: Start difference. First operand 26 states and 37 transitions. Second operand 5 states. [2018-06-22 11:15:28,156 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:28,156 INFO ]: Finished difference Result 32 states and 44 transitions. [2018-06-22 11:15:28,157 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:15:28,157 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:15:28,157 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:28,158 INFO ]: With dead ends: 32 [2018-06-22 11:15:28,158 INFO ]: Without dead ends: 23 [2018-06-22 11:15:28,158 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:15:28,158 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:15:28,161 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-22 11:15:28,161 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:15:28,161 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-06-22 11:15:28,162 INFO ]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 13 [2018-06-22 11:15:28,162 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:28,169 INFO ]: Abstraction has 21 states and 27 transitions. [2018-06-22 11:15:28,169 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:15:28,169 INFO ]: Start isEmpty. Operand 21 states and 27 transitions. [2018-06-22 11:15:28,169 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:15:28,169 INFO ]: Found error trace [2018-06-22 11:15:28,169 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:28,169 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:28,170 INFO ]: Analyzing trace with hash 1865428199, now seen corresponding path program 1 times [2018-06-22 11:15:28,170 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:28,170 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:28,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:28,170 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:28,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:28,179 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:28,239 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:15:28,239 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:28,239 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:15:28,239 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:15:28,239 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:15:28,239 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:15:28,239 INFO ]: Start difference. First operand 21 states and 27 transitions. Second operand 6 states. [2018-06-22 11:15:28,405 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:28,405 INFO ]: Finished difference Result 27 states and 36 transitions. [2018-06-22 11:15:28,405 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:15:28,405 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:15:28,405 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:28,406 INFO ]: With dead ends: 27 [2018-06-22 11:15:28,406 INFO ]: Without dead ends: 27 [2018-06-22 11:15:28,406 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:15:28,406 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:15:28,410 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-06-22 11:15:28,410 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:15:28,411 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-06-22 11:15:28,411 INFO ]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 13 [2018-06-22 11:15:28,411 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:28,411 INFO ]: Abstraction has 23 states and 31 transitions. [2018-06-22 11:15:28,411 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:15:28,411 INFO ]: Start isEmpty. Operand 23 states and 31 transitions. [2018-06-22 11:15:28,412 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:15:28,412 INFO ]: Found error trace [2018-06-22 11:15:28,412 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:28,412 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:28,412 INFO ]: Analyzing trace with hash 1620177346, now seen corresponding path program 1 times [2018-06-22 11:15:28,412 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:28,412 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:28,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:28,413 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:28,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:28,418 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:28,435 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:15:28,435 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:28,435 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:15:28,435 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:15:28,435 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:15:28,435 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:15:28,435 INFO ]: Start difference. First operand 23 states and 31 transitions. Second operand 4 states. [2018-06-22 11:15:28,455 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:28,455 INFO ]: Finished difference Result 25 states and 33 transitions. [2018-06-22 11:15:28,455 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:15:28,455 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:15:28,455 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:28,456 INFO ]: With dead ends: 25 [2018-06-22 11:15:28,456 INFO ]: Without dead ends: 25 [2018-06-22 11:15:28,456 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:15:28,456 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:15:28,460 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 11:15:28,460 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:15:28,460 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-06-22 11:15:28,460 INFO ]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 13 [2018-06-22 11:15:28,461 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:28,461 INFO ]: Abstraction has 23 states and 31 transitions. [2018-06-22 11:15:28,461 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:15:28,461 INFO ]: Start isEmpty. Operand 23 states and 31 transitions. [2018-06-22 11:15:28,461 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:15:28,461 INFO ]: Found error trace [2018-06-22 11:15:28,461 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:28,461 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:28,462 INFO ]: Analyzing trace with hash 1075449562, now seen corresponding path program 2 times [2018-06-22 11:15:28,462 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:28,462 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:28,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:28,462 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:28,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:28,472 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:28,742 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:15:28,742 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:28,742 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:15:28,758 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:15:28,805 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:15:28,805 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:28,808 INFO ]: Computing forward predicates... [2018-06-22 11:15:28,942 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:15:28,967 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:28,967 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-22 11:15:28,968 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:15:28,968 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:15:28,968 INFO ]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:15:28,968 INFO ]: Start difference. First operand 23 states and 31 transitions. Second operand 13 states. [2018-06-22 11:15:29,136 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:29,136 INFO ]: Finished difference Result 29 states and 38 transitions. [2018-06-22 11:15:29,137 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:15:29,137 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:15:29,137 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:29,137 INFO ]: With dead ends: 29 [2018-06-22 11:15:29,137 INFO ]: Without dead ends: 29 [2018-06-22 11:15:29,138 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:15:29,138 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:15:29,140 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-22 11:15:29,140 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:15:29,141 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-06-22 11:15:29,141 INFO ]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 17 [2018-06-22 11:15:29,141 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:29,141 INFO ]: Abstraction has 25 states and 33 transitions. [2018-06-22 11:15:29,141 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:15:29,141 INFO ]: Start isEmpty. Operand 25 states and 33 transitions. [2018-06-22 11:15:29,141 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:15:29,141 INFO ]: Found error trace [2018-06-22 11:15:29,141 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:29,142 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:29,142 INFO ]: Analyzing trace with hash -770943317, now seen corresponding path program 1 times [2018-06-22 11:15:29,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:29,142 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:29,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:29,143 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:15:29,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:29,153 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:29,243 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:15:29,243 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:29,243 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:15:29,249 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:29,259 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:29,262 INFO ]: Computing forward predicates... [2018-06-22 11:15:29,452 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:15:29,485 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:29,485 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:15:29,485 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:15:29,485 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:15:29,486 INFO ]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:15:29,486 INFO ]: Start difference. First operand 25 states and 33 transitions. Second operand 13 states. [2018-06-22 11:15:29,887 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:29,887 INFO ]: Finished difference Result 33 states and 42 transitions. [2018-06-22 11:15:29,922 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:15:29,922 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:15:29,922 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:29,923 INFO ]: With dead ends: 33 [2018-06-22 11:15:29,923 INFO ]: Without dead ends: 33 [2018-06-22 11:15:29,923 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:15:29,923 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:15:29,928 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-06-22 11:15:29,928 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:15:29,928 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-06-22 11:15:29,928 INFO ]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 17 [2018-06-22 11:15:29,929 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:29,929 INFO ]: Abstraction has 25 states and 33 transitions. [2018-06-22 11:15:29,929 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:15:29,929 INFO ]: Start isEmpty. Operand 25 states and 33 transitions. [2018-06-22 11:15:29,929 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:15:29,929 INFO ]: Found error trace [2018-06-22 11:15:29,929 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:29,929 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:29,930 INFO ]: Analyzing trace with hash -233811770, now seen corresponding path program 1 times [2018-06-22 11:15:29,930 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:29,930 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:29,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:29,931 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:29,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:29,937 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:30,012 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:15:30,012 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:30,012 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:15:30,012 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:15:30,012 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:15:30,012 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:15:30,013 INFO ]: Start difference. First operand 25 states and 33 transitions. Second operand 5 states. [2018-06-22 11:15:30,062 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:30,062 INFO ]: Finished difference Result 33 states and 42 transitions. [2018-06-22 11:15:30,062 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:15:30,062 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:15:30,062 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:30,063 INFO ]: With dead ends: 33 [2018-06-22 11:15:30,063 INFO ]: Without dead ends: 28 [2018-06-22 11:15:30,063 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:15:30,063 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:15:30,066 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-06-22 11:15:30,066 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:15:30,067 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-06-22 11:15:30,067 INFO ]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 17 [2018-06-22 11:15:30,067 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:30,067 INFO ]: Abstraction has 24 states and 29 transitions. [2018-06-22 11:15:30,067 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:15:30,067 INFO ]: Start isEmpty. Operand 24 states and 29 transitions. [2018-06-22 11:15:30,068 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:15:30,068 INFO ]: Found error trace [2018-06-22 11:15:30,068 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:30,068 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:30,068 INFO ]: Analyzing trace with hash 967269321, now seen corresponding path program 1 times [2018-06-22 11:15:30,068 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:30,068 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:30,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:30,069 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:30,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:30,074 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:30,106 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:15:30,106 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:30,106 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:15:30,106 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:15:30,106 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:15:30,106 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:15:30,106 INFO ]: Start difference. First operand 24 states and 29 transitions. Second operand 6 states. [2018-06-22 11:15:30,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:30,140 INFO ]: Finished difference Result 28 states and 33 transitions. [2018-06-22 11:15:30,141 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:15:30,141 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:15:30,141 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:30,141 INFO ]: With dead ends: 28 [2018-06-22 11:15:30,141 INFO ]: Without dead ends: 28 [2018-06-22 11:15:30,141 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:15:30,141 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:15:30,144 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-06-22 11:15:30,144 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:15:30,145 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-06-22 11:15:30,145 INFO ]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 17 [2018-06-22 11:15:30,145 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:30,145 INFO ]: Abstraction has 24 states and 29 transitions. [2018-06-22 11:15:30,145 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:15:30,145 INFO ]: Start isEmpty. Operand 24 states and 29 transitions. [2018-06-22 11:15:30,145 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:15:30,145 INFO ]: Found error trace [2018-06-22 11:15:30,146 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:30,146 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:30,146 INFO ]: Analyzing trace with hash 611595614, now seen corresponding path program 3 times [2018-06-22 11:15:30,146 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:30,146 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:30,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:30,146 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:30,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:30,156 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:30,382 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:15:30,382 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:30,382 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:15:30,393 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:15:30,409 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:15:30,409 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:30,412 INFO ]: Computing forward predicates... [2018-06-22 11:15:30,528 INFO ]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:15:30,548 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:30,548 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-06-22 11:15:30,549 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:15:30,549 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:15:30,549 INFO ]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:15:30,549 INFO ]: Start difference. First operand 24 states and 29 transitions. Second operand 16 states. [2018-06-22 11:15:30,786 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:30,786 INFO ]: Finished difference Result 32 states and 37 transitions. [2018-06-22 11:15:30,788 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:15:30,788 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 11:15:30,788 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:30,789 INFO ]: With dead ends: 32 [2018-06-22 11:15:30,789 INFO ]: Without dead ends: 32 [2018-06-22 11:15:30,789 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:15:30,789 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:15:30,792 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-06-22 11:15:30,793 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:15:30,793 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-06-22 11:15:30,793 INFO ]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 21 [2018-06-22 11:15:30,793 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:30,793 INFO ]: Abstraction has 26 states and 31 transitions. [2018-06-22 11:15:30,793 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:15:30,793 INFO ]: Start isEmpty. Operand 26 states and 31 transitions. [2018-06-22 11:15:30,794 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:15:30,794 INFO ]: Found error trace [2018-06-22 11:15:30,794 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:30,794 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:30,794 INFO ]: Analyzing trace with hash 49532143, now seen corresponding path program 2 times [2018-06-22 11:15:30,794 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:30,794 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:30,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:30,795 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:15:30,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:30,804 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:30,987 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:15:30,987 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:30,987 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:15:30,995 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:15:31,006 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:15:31,006 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:31,009 INFO ]: Computing forward predicates... [2018-06-22 11:15:31,348 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:15:31,368 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:31,368 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-06-22 11:15:31,368 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:15:31,368 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:15:31,368 INFO ]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:15:31,369 INFO ]: Start difference. First operand 26 states and 31 transitions. Second operand 17 states. [2018-06-22 11:15:31,594 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:31,594 INFO ]: Finished difference Result 34 states and 39 transitions. [2018-06-22 11:15:31,595 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:15:31,595 INFO ]: Start accepts. Automaton has 17 states. Word has length 21 [2018-06-22 11:15:31,595 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:31,595 INFO ]: With dead ends: 34 [2018-06-22 11:15:31,595 INFO ]: Without dead ends: 34 [2018-06-22 11:15:31,596 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:15:31,596 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:15:31,601 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 26. [2018-06-22 11:15:31,601 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:15:31,601 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-06-22 11:15:31,601 INFO ]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 21 [2018-06-22 11:15:31,601 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:31,601 INFO ]: Abstraction has 26 states and 31 transitions. [2018-06-22 11:15:31,601 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:15:31,601 INFO ]: Start isEmpty. Operand 26 states and 31 transitions. [2018-06-22 11:15:31,602 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:15:31,602 INFO ]: Found error trace [2018-06-22 11:15:31,602 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:31,602 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:31,602 INFO ]: Analyzing trace with hash -270400883, now seen corresponding path program 1 times [2018-06-22 11:15:31,602 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:31,602 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:31,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:31,603 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:15:31,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:31,609 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:31,715 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:15:31,715 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:15:31,715 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:15:31,715 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:15:31,715 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:15:31,715 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:15:31,715 INFO ]: Start difference. First operand 26 states and 31 transitions. Second operand 7 states. [2018-06-22 11:15:31,793 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:31,793 INFO ]: Finished difference Result 32 states and 37 transitions. [2018-06-22 11:15:31,794 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:15:31,794 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:15:31,794 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:31,794 INFO ]: With dead ends: 32 [2018-06-22 11:15:31,794 INFO ]: Without dead ends: 25 [2018-06-22 11:15:31,794 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:15:31,795 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:15:31,797 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 11:15:31,797 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:15:31,797 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-06-22 11:15:31,797 INFO ]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 21 [2018-06-22 11:15:31,797 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:31,797 INFO ]: Abstraction has 23 states and 25 transitions. [2018-06-22 11:15:31,797 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:15:31,797 INFO ]: Start isEmpty. Operand 23 states and 25 transitions. [2018-06-22 11:15:31,799 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:15:31,799 INFO ]: Found error trace [2018-06-22 11:15:31,799 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:31,799 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:31,800 INFO ]: Analyzing trace with hash 356169826, now seen corresponding path program 4 times [2018-06-22 11:15:31,800 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:31,800 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:31,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:31,800 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:15:31,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:31,813 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:32,332 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:15:32,332 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:32,332 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:15:32,337 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:15:32,366 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:15:32,366 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:32,370 INFO ]: Computing forward predicates... [2018-06-22 11:15:32,801 INFO ]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:15:32,831 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:32,831 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2018-06-22 11:15:32,832 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:15:32,832 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:15:32,832 INFO ]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:15:32,832 INFO ]: Start difference. First operand 23 states and 25 transitions. Second operand 19 states. [2018-06-22 11:15:33,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:33,119 INFO ]: Finished difference Result 31 states and 33 transitions. [2018-06-22 11:15:33,119 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:15:33,119 INFO ]: Start accepts. Automaton has 19 states. Word has length 25 [2018-06-22 11:15:33,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:33,119 INFO ]: With dead ends: 31 [2018-06-22 11:15:33,119 INFO ]: Without dead ends: 31 [2018-06-22 11:15:33,120 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:15:33,120 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:15:33,122 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-06-22 11:15:33,122 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:15:33,122 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-06-22 11:15:33,122 INFO ]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 25 [2018-06-22 11:15:33,122 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:33,122 INFO ]: Abstraction has 25 states and 27 transitions. [2018-06-22 11:15:33,122 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:15:33,122 INFO ]: Start isEmpty. Operand 25 states and 27 transitions. [2018-06-22 11:15:33,123 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:15:33,123 INFO ]: Found error trace [2018-06-22 11:15:33,123 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:33,123 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:33,123 INFO ]: Analyzing trace with hash 1379053491, now seen corresponding path program 3 times [2018-06-22 11:15:33,123 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:33,123 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:33,124 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:33,124 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:15:33,124 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:33,132 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:33,510 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:15:33,510 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:33,510 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:15:33,516 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:15:33,536 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:15:33,536 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:33,539 INFO ]: Computing forward predicates... [2018-06-22 11:15:33,926 INFO ]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:15:33,958 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:33,958 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-06-22 11:15:33,959 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:15:33,959 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:15:33,959 INFO ]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:15:33,959 INFO ]: Start difference. First operand 25 states and 27 transitions. Second operand 20 states. [2018-06-22 11:15:34,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:34,473 INFO ]: Finished difference Result 33 states and 35 transitions. [2018-06-22 11:15:34,473 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:15:34,473 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-22 11:15:34,473 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:34,473 INFO ]: With dead ends: 33 [2018-06-22 11:15:34,473 INFO ]: Without dead ends: 33 [2018-06-22 11:15:34,474 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:15:34,474 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:15:34,476 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-06-22 11:15:34,476 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:15:34,476 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-06-22 11:15:34,476 INFO ]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 25 [2018-06-22 11:15:34,476 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:34,476 INFO ]: Abstraction has 25 states and 27 transitions. [2018-06-22 11:15:34,476 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:15:34,476 INFO ]: Start isEmpty. Operand 25 states and 27 transitions. [2018-06-22 11:15:34,477 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:15:34,477 INFO ]: Found error trace [2018-06-22 11:15:34,477 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:34,477 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:34,477 INFO ]: Analyzing trace with hash 370522086, now seen corresponding path program 5 times [2018-06-22 11:15:34,477 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:34,477 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:34,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:34,478 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:15:34,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:34,486 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:34,679 INFO ]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:15:34,679 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:34,679 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:15:34,696 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:15:34,718 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:15:34,718 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:34,722 INFO ]: Computing forward predicates... [2018-06-22 11:15:34,922 INFO ]: Checked inductivity of 55 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:15:34,942 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:34,942 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2018-06-22 11:15:34,942 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:15:34,942 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:15:34,942 INFO ]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:15:34,942 INFO ]: Start difference. First operand 25 states and 27 transitions. Second operand 22 states. [2018-06-22 11:15:35,154 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:35,154 INFO ]: Finished difference Result 35 states and 37 transitions. [2018-06-22 11:15:35,155 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:15:35,155 INFO ]: Start accepts. Automaton has 22 states. Word has length 29 [2018-06-22 11:15:35,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:35,156 INFO ]: With dead ends: 35 [2018-06-22 11:15:35,156 INFO ]: Without dead ends: 35 [2018-06-22 11:15:35,156 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:15:35,156 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:15:35,158 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-06-22 11:15:35,159 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:15:35,159 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-06-22 11:15:35,159 INFO ]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 29 [2018-06-22 11:15:35,159 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:35,159 INFO ]: Abstraction has 27 states and 29 transitions. [2018-06-22 11:15:35,159 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:15:35,159 INFO ]: Start isEmpty. Operand 27 states and 29 transitions. [2018-06-22 11:15:35,160 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:15:35,160 INFO ]: Found error trace [2018-06-22 11:15:35,160 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:35,160 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:35,160 INFO ]: Analyzing trace with hash -185786633, now seen corresponding path program 4 times [2018-06-22 11:15:35,160 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:35,160 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:35,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:35,161 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:15:35,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:35,171 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:35,498 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:15:35,498 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:35,498 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:15:35,504 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:15:35,518 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:15:35,518 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:35,522 INFO ]: Computing forward predicates... [2018-06-22 11:15:36,018 INFO ]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:15:36,038 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:36,038 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2018-06-22 11:15:36,038 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:15:36,038 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:15:36,038 INFO ]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:15:36,038 INFO ]: Start difference. First operand 27 states and 29 transitions. Second operand 23 states. [2018-06-22 11:15:36,361 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:36,361 INFO ]: Finished difference Result 37 states and 39 transitions. [2018-06-22 11:15:36,361 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:15:36,361 INFO ]: Start accepts. Automaton has 23 states. Word has length 29 [2018-06-22 11:15:36,361 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:36,362 INFO ]: With dead ends: 37 [2018-06-22 11:15:36,362 INFO ]: Without dead ends: 37 [2018-06-22 11:15:36,362 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:15:36,362 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:15:36,364 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 27. [2018-06-22 11:15:36,365 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:15:36,365 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-06-22 11:15:36,365 INFO ]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 29 [2018-06-22 11:15:36,365 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:36,365 INFO ]: Abstraction has 27 states and 29 transitions. [2018-06-22 11:15:36,365 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:15:36,365 INFO ]: Start isEmpty. Operand 27 states and 29 transitions. [2018-06-22 11:15:36,366 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:15:36,366 INFO ]: Found error trace [2018-06-22 11:15:36,366 INFO ]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:36,366 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:36,366 INFO ]: Analyzing trace with hash -125479958, now seen corresponding path program 6 times [2018-06-22 11:15:36,366 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:36,366 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:36,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:36,366 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:15:36,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:36,375 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:37,436 INFO ]: Checked inductivity of 78 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:15:37,436 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:37,436 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:15:37,441 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:15:37,460 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 11:15:37,460 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:37,464 INFO ]: Computing forward predicates... [2018-06-22 11:15:37,779 INFO ]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 11:15:37,799 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:37,800 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2018-06-22 11:15:37,800 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:15:37,800 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:15:37,800 INFO ]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:15:37,800 INFO ]: Start difference. First operand 27 states and 29 transitions. Second operand 25 states. [2018-06-22 11:15:38,043 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:15:38,043 INFO ]: Finished difference Result 39 states and 41 transitions. [2018-06-22 11:15:38,043 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:15:38,043 INFO ]: Start accepts. Automaton has 25 states. Word has length 33 [2018-06-22 11:15:38,043 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:15:38,044 INFO ]: With dead ends: 39 [2018-06-22 11:15:38,044 INFO ]: Without dead ends: 39 [2018-06-22 11:15:38,044 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:15:38,045 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:15:38,047 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 29. [2018-06-22 11:15:38,047 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:15:38,048 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-22 11:15:38,048 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 33 [2018-06-22 11:15:38,048 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:15:38,048 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-22 11:15:38,048 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:15:38,048 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-22 11:15:38,048 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:15:38,048 INFO ]: Found error trace [2018-06-22 11:15:38,048 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:15:38,049 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:15:38,052 INFO ]: Analyzing trace with hash 2132753083, now seen corresponding path program 5 times [2018-06-22 11:15:38,052 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:15:38,052 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:15:38,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:38,053 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:15:38,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:15:38,063 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:38,418 INFO ]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:15:38,419 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:15:38,419 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:15:38,425 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:15:38,444 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:15:38,444 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:15:38,448 INFO ]: Computing forward predicates... [2018-06-22 11:15:43,083 INFO ]: Checked inductivity of 55 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:15:43,103 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:15:43,103 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2018-06-22 11:15:43,103 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:15:43,104 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:15:43,104 INFO ]: CoverageRelationStatistics Valid=75, Invalid=524, Unknown=1, NotChecked=0, Total=600 [2018-06-22 11:15:43,104 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 25 states. [2018-06-22 11:16:08,167 WARN ]: Spent 637.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-06-22 11:16:20,216 WARN ]: Spent 2.54 s on a formula simplification that was a NOOP. DAG size: 80 [2018-06-22 11:16:24,600 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:24,600 INFO ]: Finished difference Result 41 states and 43 transitions. [2018-06-22 11:16:24,601 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:16:24,602 INFO ]: Start accepts. Automaton has 25 states. Word has length 33 [2018-06-22 11:16:24,602 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:24,602 INFO ]: With dead ends: 41 [2018-06-22 11:16:24,602 INFO ]: Without dead ends: 41 [2018-06-22 11:16:24,603 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=146, Invalid=778, Unknown=6, NotChecked=0, Total=930 [2018-06-22 11:16:24,603 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:16:24,605 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 29. [2018-06-22 11:16:24,605 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:16:24,605 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-22 11:16:24,605 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 33 [2018-06-22 11:16:24,606 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:24,606 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-22 11:16:24,606 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:16:24,606 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-22 11:16:24,606 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:16:24,606 INFO ]: Found error trace [2018-06-22 11:16:24,606 INFO ]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:24,606 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:24,606 INFO ]: Analyzing trace with hash -1780372370, now seen corresponding path program 7 times [2018-06-22 11:16:24,606 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:24,606 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:24,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:24,607 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:24,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:24,618 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:25,171 INFO ]: Checked inductivity of 105 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 11:16:25,171 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:25,171 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:16:25,185 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:25,208 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:25,213 INFO ]: Computing forward predicates... [2018-06-22 11:16:25,504 INFO ]: Checked inductivity of 105 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 11:16:25,523 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:25,523 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 28 [2018-06-22 11:16:25,523 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:16:25,523 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:16:25,523 INFO ]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:16:25,524 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 28 states. [2018-06-22 11:16:26,198 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:26,198 INFO ]: Finished difference Result 43 states and 45 transitions. [2018-06-22 11:16:26,198 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:16:26,198 INFO ]: Start accepts. Automaton has 28 states. Word has length 37 [2018-06-22 11:16:26,198 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:26,199 INFO ]: With dead ends: 43 [2018-06-22 11:16:26,199 INFO ]: Without dead ends: 43 [2018-06-22 11:16:26,199 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:16:26,199 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:16:26,202 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 31. [2018-06-22 11:16:26,202 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:16:26,202 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-06-22 11:16:26,202 INFO ]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 37 [2018-06-22 11:16:26,203 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:26,203 INFO ]: Abstraction has 31 states and 33 transitions. [2018-06-22 11:16:26,203 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:16:26,203 INFO ]: Start isEmpty. Operand 31 states and 33 transitions. [2018-06-22 11:16:26,203 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:16:26,203 INFO ]: Found error trace [2018-06-22 11:16:26,203 INFO ]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:26,203 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:26,203 INFO ]: Analyzing trace with hash -576904449, now seen corresponding path program 6 times [2018-06-22 11:16:26,203 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:26,203 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:26,204 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:26,204 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:26,204 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:26,216 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:26,871 INFO ]: Checked inductivity of 78 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:16:26,871 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:26,871 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:26,877 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:16:26,901 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 11:16:26,901 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:26,905 INFO ]: Computing forward predicates... [2018-06-22 11:16:27,924 INFO ]: Checked inductivity of 78 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 11:16:27,958 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:27,958 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2018-06-22 11:16:27,958 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:16:27,958 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:16:27,958 INFO ]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:16:27,958 INFO ]: Start difference. First operand 31 states and 33 transitions. Second operand 29 states. [2018-06-22 11:16:29,026 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:29,026 INFO ]: Finished difference Result 45 states and 47 transitions. [2018-06-22 11:16:29,027 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:16:29,027 INFO ]: Start accepts. Automaton has 29 states. Word has length 37 [2018-06-22 11:16:29,027 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:29,027 INFO ]: With dead ends: 45 [2018-06-22 11:16:29,027 INFO ]: Without dead ends: 45 [2018-06-22 11:16:29,028 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=197, Invalid=1063, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:16:29,028 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 11:16:29,030 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 31. [2018-06-22 11:16:29,030 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:16:29,031 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-06-22 11:16:29,031 INFO ]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 37 [2018-06-22 11:16:29,031 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:29,031 INFO ]: Abstraction has 31 states and 33 transitions. [2018-06-22 11:16:29,031 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:16:29,031 INFO ]: Start isEmpty. Operand 31 states and 33 transitions. [2018-06-22 11:16:29,032 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:16:29,032 INFO ]: Found error trace [2018-06-22 11:16:29,032 INFO ]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:29,032 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:29,032 INFO ]: Analyzing trace with hash -1990532750, now seen corresponding path program 8 times [2018-06-22 11:16:29,032 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:29,032 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:29,032 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:29,032 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:29,032 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:29,043 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:29,393 INFO ]: Checked inductivity of 136 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 11:16:29,393 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:29,393 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:29,413 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:16:29,466 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:16:29,466 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:29,477 INFO ]: Computing forward predicates... [2018-06-22 11:16:29,824 INFO ]: Checked inductivity of 136 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-22 11:16:29,844 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:29,844 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 31 [2018-06-22 11:16:29,845 INFO ]: Interpolant automaton has 31 states [2018-06-22 11:16:29,845 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 11:16:29,845 INFO ]: CoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:16:29,845 INFO ]: Start difference. First operand 31 states and 33 transitions. Second operand 31 states. [2018-06-22 11:16:30,245 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:30,245 INFO ]: Finished difference Result 47 states and 49 transitions. [2018-06-22 11:16:30,245 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:16:30,245 INFO ]: Start accepts. Automaton has 31 states. Word has length 41 [2018-06-22 11:16:30,245 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:30,246 INFO ]: With dead ends: 47 [2018-06-22 11:16:30,246 INFO ]: Without dead ends: 47 [2018-06-22 11:16:30,246 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:16:30,246 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:16:30,249 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 33. [2018-06-22 11:16:30,249 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:16:30,251 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-06-22 11:16:30,251 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 41 [2018-06-22 11:16:30,251 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:30,251 INFO ]: Abstraction has 33 states and 35 transitions. [2018-06-22 11:16:30,251 INFO ]: Interpolant automaton has 31 states. [2018-06-22 11:16:30,251 INFO ]: Start isEmpty. Operand 33 states and 35 transitions. [2018-06-22 11:16:30,252 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:16:30,252 INFO ]: Found error trace [2018-06-22 11:16:30,252 INFO ]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:30,252 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:30,252 INFO ]: Analyzing trace with hash -804063293, now seen corresponding path program 7 times [2018-06-22 11:16:30,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:30,252 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:30,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:30,252 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:30,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:30,264 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:30,651 INFO ]: Checked inductivity of 105 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 11:16:30,651 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:30,651 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:30,657 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:30,678 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:30,684 INFO ]: Computing forward predicates... [2018-06-22 11:16:31,397 INFO ]: Checked inductivity of 105 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:16:31,416 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:31,416 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 32 [2018-06-22 11:16:31,417 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:16:31,417 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:16:31,417 INFO ]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:16:31,417 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 32 states. [2018-06-22 11:16:31,920 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:31,921 INFO ]: Finished difference Result 49 states and 51 transitions. [2018-06-22 11:16:31,921 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:16:31,921 INFO ]: Start accepts. Automaton has 32 states. Word has length 41 [2018-06-22 11:16:31,921 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:31,921 INFO ]: With dead ends: 49 [2018-06-22 11:16:31,921 INFO ]: Without dead ends: 49 [2018-06-22 11:16:31,922 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:16:31,922 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:16:31,924 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 33. [2018-06-22 11:16:31,924 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:16:31,924 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-06-22 11:16:31,924 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 41 [2018-06-22 11:16:31,924 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:31,924 INFO ]: Abstraction has 33 states and 35 transitions. [2018-06-22 11:16:31,924 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:16:31,924 INFO ]: Start isEmpty. Operand 33 states and 35 transitions. [2018-06-22 11:16:31,924 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:16:31,924 INFO ]: Found error trace [2018-06-22 11:16:31,924 INFO ]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:31,925 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:31,925 INFO ]: Analyzing trace with hash 1777930998, now seen corresponding path program 9 times [2018-06-22 11:16:31,925 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:31,925 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:31,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:31,925 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:31,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:31,938 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:32,370 INFO ]: Checked inductivity of 171 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 11:16:32,371 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:32,371 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:32,380 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:16:32,426 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-22 11:16:32,426 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:32,430 INFO ]: Computing forward predicates... [2018-06-22 11:16:33,145 INFO ]: Checked inductivity of 171 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-06-22 11:16:33,164 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:33,164 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 34 [2018-06-22 11:16:33,164 INFO ]: Interpolant automaton has 34 states [2018-06-22 11:16:33,164 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 11:16:33,165 INFO ]: CoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:16:33,165 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 34 states. [2018-06-22 11:16:33,601 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:33,601 INFO ]: Finished difference Result 51 states and 53 transitions. [2018-06-22 11:16:33,602 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:16:33,602 INFO ]: Start accepts. Automaton has 34 states. Word has length 45 [2018-06-22 11:16:33,602 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:33,602 INFO ]: With dead ends: 51 [2018-06-22 11:16:33,602 INFO ]: Without dead ends: 51 [2018-06-22 11:16:33,603 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=211, Invalid=1595, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:16:33,603 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:16:33,605 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 35. [2018-06-22 11:16:33,605 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:16:33,605 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-06-22 11:16:33,605 INFO ]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 45 [2018-06-22 11:16:33,605 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:33,605 INFO ]: Abstraction has 35 states and 37 transitions. [2018-06-22 11:16:33,605 INFO ]: Interpolant automaton has 34 states. [2018-06-22 11:16:33,605 INFO ]: Start isEmpty. Operand 35 states and 37 transitions. [2018-06-22 11:16:33,606 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:16:33,606 INFO ]: Found error trace [2018-06-22 11:16:33,606 INFO ]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:33,606 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:33,606 INFO ]: Analyzing trace with hash -486221561, now seen corresponding path program 8 times [2018-06-22 11:16:33,606 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:33,606 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:33,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:33,607 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:33,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:33,624 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:34,014 INFO ]: Checked inductivity of 136 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 11:16:34,015 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:34,015 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:34,020 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:16:34,044 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:16:34,044 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:34,064 INFO ]: Computing forward predicates... [2018-06-22 11:16:34,808 INFO ]: Checked inductivity of 136 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 11:16:34,827 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:34,827 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16] total 35 [2018-06-22 11:16:34,827 INFO ]: Interpolant automaton has 35 states [2018-06-22 11:16:34,827 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 11:16:34,827 INFO ]: CoverageRelationStatistics Valid=131, Invalid=1059, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:16:34,827 INFO ]: Start difference. First operand 35 states and 37 transitions. Second operand 35 states. [2018-06-22 11:16:35,770 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:35,770 INFO ]: Finished difference Result 53 states and 55 transitions. [2018-06-22 11:16:35,770 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:16:35,770 INFO ]: Start accepts. Automaton has 35 states. Word has length 45 [2018-06-22 11:16:35,771 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:35,771 INFO ]: With dead ends: 53 [2018-06-22 11:16:35,771 INFO ]: Without dead ends: 53 [2018-06-22 11:16:35,771 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=285, Invalid=1607, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 11:16:35,771 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 11:16:35,773 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 35. [2018-06-22 11:16:35,773 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:16:35,774 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-06-22 11:16:35,774 INFO ]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 45 [2018-06-22 11:16:35,774 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:35,774 INFO ]: Abstraction has 35 states and 37 transitions. [2018-06-22 11:16:35,774 INFO ]: Interpolant automaton has 35 states. [2018-06-22 11:16:35,774 INFO ]: Start isEmpty. Operand 35 states and 37 transitions. [2018-06-22 11:16:35,774 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:16:35,774 INFO ]: Found error trace [2018-06-22 11:16:35,774 INFO ]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:35,774 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:35,775 INFO ]: Analyzing trace with hash -2070126342, now seen corresponding path program 10 times [2018-06-22 11:16:35,775 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:35,775 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:35,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:35,775 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:35,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:35,786 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 11:16:36,513 WARN ]: Verification canceled [2018-06-22 11:16:36,518 WARN ]: Timeout [2018-06-22 11:16:36,518 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:16:36 BoogieIcfgContainer [2018-06-22 11:16:36,518 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:16:36,519 INFO ]: Toolchain (without parser) took 71213.89 ms. Allocated memory was 308.8 MB in the beginning and 490.2 MB in the end (delta: 181.4 MB). Free memory was 263.4 MB in the beginning and 441.3 MB in the end (delta: -177.9 MB). Peak memory consumption was 3.5 MB. Max. memory is 3.6 GB. [2018-06-22 11:16:36,519 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:16:36,523 INFO ]: ChcToBoogie took 47.09 ms. Allocated memory is still 308.8 MB. Free memory was 263.4 MB in the beginning and 261.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:16:36,523 INFO ]: Boogie Preprocessor took 32.95 ms. Allocated memory is still 308.8 MB. Free memory was 261.4 MB in the beginning and 259.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:16:36,524 INFO ]: RCFGBuilder took 435.74 ms. Allocated memory is still 308.8 MB. Free memory was 259.4 MB in the beginning and 249.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:16:36,524 INFO ]: TraceAbstraction took 70690.56 ms. Allocated memory was 308.8 MB in the beginning and 490.2 MB in the end (delta: 181.4 MB). Free memory was 249.4 MB in the beginning and 441.3 MB in the end (delta: -191.9 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:16:36,527 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 47.09 ms. Allocated memory is still 308.8 MB. Free memory was 263.4 MB in the beginning and 261.4 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.95 ms. Allocated memory is still 308.8 MB. Free memory was 261.4 MB in the beginning and 259.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 435.74 ms. Allocated memory is still 308.8 MB. Free memory was 259.4 MB in the beginning and 249.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 70690.56 ms. Allocated memory was 308.8 MB in the beginning and 490.2 MB in the end (delta: 181.4 MB). Free memory was 249.4 MB in the beginning and 441.3 MB in the end (delta: -191.9 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 11, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 27 locations, 1 error locations. TIMEOUT Result, 70.6s OverallTime, 29 OverallIterations, 11 TraceHistogramMax, 49.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 716 SDtfs, 363 SDslu, 4694 SDs, 0 SdLazy, 3204 SolverSat, 349 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 29.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 887 GetRequests, 397 SyntacticMatches, 8 SemanticMatches, 482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 36.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=27, 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, 28 MinimizatonAttempts, 202 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 18.6s InterpolantComputationTime, 1157 NumberOfCodeBlocks, 1157 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 1112 ConstructedInterpolants, 72 QuantifiedInterpolants, 592752 SizeOfPredicates, 442 NumberOfNonLiveVariables, 2587 ConjunctsInSsa, 1639 ConjunctsInUnsatCore, 45 InterpolantComputations, 11 PerfectInterpolantSequences, 765/2136 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/013-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-16-36-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/013-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-16-36-536.csv Completed graceful shutdown