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/llreve-bench/smt2/arrays/heap__findmax.array.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:42:30,890 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:42:30,892 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:42:30,903 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:42:30,903 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:42:30,904 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:42:30,905 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:42:30,909 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:42:30,912 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:42:30,913 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:42:30,914 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:42:30,914 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:42:30,915 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:42:30,916 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:42:30,916 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:42:30,919 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:42:30,921 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:42:30,933 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:42:30,935 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:42:30,936 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:42:30,937 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:42:30,939 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:42:30,939 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:42:30,939 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:42:30,940 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:42:30,946 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:42:30,947 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:42:30,948 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:42:30,949 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:42:30,949 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:42:30,949 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:42:30,950 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:42:30,950 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:42:30,956 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:42:30,956 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:42:30,957 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:42:30,982 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:42:30,982 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:42:30,982 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:42:30,983 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:42:30,983 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:42:30,985 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:42:30,985 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:42:30,986 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:42:30,986 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:42:30,986 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:42:30,986 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:42:30,986 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:42:30,987 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:42:30,987 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:42:30,987 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:42:30,987 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:42:30,987 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:42:30,987 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:42:30,988 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:42:30,990 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:42:30,990 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:42:31,042 INFO ]: Repository-Root is: /tmp [2018-06-22 11:42:31,059 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:42:31,062 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:42:31,063 INFO ]: Initializing SmtParser... [2018-06-22 11:42:31,064 INFO ]: SmtParser initialized [2018-06-22 11:42:31,064 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/arrays/heap__findmax.array.smt2 [2018-06-22 11:42:31,066 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:42:31,143 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/arrays/heap__findmax.array.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@6d0cc5fa [2018-06-22 11:42:31,419 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/arrays/heap__findmax.array.smt2 [2018-06-22 11:42:31,423 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:42:31,429 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:42:31,429 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:42:31,429 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:42:31,430 INFO ]: ChcToBoogie initialized [2018-06-22 11:42:31,433 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:42:31" (1/1) ... [2018-06-22 11:42:31,488 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:31 Unit [2018-06-22 11:42:31,488 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:42:31,489 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:42:31,489 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:42:31,489 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:42:31,511 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:31" (1/1) ... [2018-06-22 11:42:31,511 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:31" (1/1) ... [2018-06-22 11:42:31,524 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:31" (1/1) ... [2018-06-22 11:42:31,525 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:31" (1/1) ... [2018-06-22 11:42:31,528 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:31" (1/1) ... [2018-06-22 11:42:31,557 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:31" (1/1) ... [2018-06-22 11:42:31,558 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:31" (1/1) ... [2018-06-22 11:42:31,559 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:42:31,560 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:42:31,560 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:42:31,560 INFO ]: RCFGBuilder initialized [2018-06-22 11:42:31,561 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:31" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:42:31,572 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:42:31,572 INFO ]: Found specification of procedure False [2018-06-22 11:42:31,572 INFO ]: Found implementation of procedure False [2018-06-22 11:42:31,572 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-22 11:42:31,572 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-22 11:42:31,572 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-22 11:42:31,572 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:42:31,572 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:42:31,572 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:42:31,937 INFO ]: Using library mode [2018-06-22 11:42:31,939 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:42:31 BoogieIcfgContainer [2018-06-22 11:42:31,939 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:42:31,940 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:42:31,940 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:42:31,945 INFO ]: TraceAbstraction initialized [2018-06-22 11:42:31,946 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:42:31" (1/3) ... [2018-06-22 11:42:31,947 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5cfc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:42:31, skipping insertion in model container [2018-06-22 11:42:31,947 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:31" (2/3) ... [2018-06-22 11:42:31,947 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5cfc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:42:31, skipping insertion in model container [2018-06-22 11:42:31,947 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:42:31" (3/3) ... [2018-06-22 11:42:31,949 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:42:31,958 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:42:31,964 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:42:32,006 INFO ]: Using default assertion order modulation [2018-06-22 11:42:32,018 INFO ]: Interprodecural is true [2018-06-22 11:42:32,018 INFO ]: Hoare is false [2018-06-22 11:42:32,018 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:42:32,018 INFO ]: Backedges is TWOTRACK [2018-06-22 11:42:32,018 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:42:32,019 INFO ]: Difference is false [2018-06-22 11:42:32,019 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:42:32,019 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:42:32,033 INFO ]: Start isEmpty. Operand 17 states. [2018-06-22 11:42:32,044 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:42:32,044 INFO ]: Found error trace [2018-06-22 11:42:32,045 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:32,045 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:32,049 INFO ]: Analyzing trace with hash -1454067414, now seen corresponding path program 1 times [2018-06-22 11:42:32,050 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:32,051 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:32,087 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:32,129 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:32,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:32,178 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:32,346 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:42:32,348 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:32,349 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:42:32,350 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:42:32,360 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:42:32,361 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:32,363 INFO ]: Start difference. First operand 17 states. Second operand 4 states. [2018-06-22 11:42:32,592 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:32,592 INFO ]: Finished difference Result 17 states and 30 transitions. [2018-06-22 11:42:32,593 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:42:32,594 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:42:32,594 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:32,603 INFO ]: With dead ends: 17 [2018-06-22 11:42:32,603 INFO ]: Without dead ends: 17 [2018-06-22 11:42:32,605 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:42:32,619 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 11:42:32,646 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 11:42:32,647 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:42:32,649 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2018-06-22 11:42:32,650 INFO ]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 9 [2018-06-22 11:42:32,651 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:32,651 INFO ]: Abstraction has 17 states and 30 transitions. [2018-06-22 11:42:32,651 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:42:32,651 INFO ]: Start isEmpty. Operand 17 states and 30 transitions. [2018-06-22 11:42:32,655 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:42:32,655 INFO ]: Found error trace [2018-06-22 11:42:32,655 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:32,655 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:32,655 INFO ]: Analyzing trace with hash 994308632, now seen corresponding path program 1 times [2018-06-22 11:42:32,655 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:32,655 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:32,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:32,656 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:32,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:32,679 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:32,897 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:42:32,897 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:32,897 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:42:32,904 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:32,947 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:32,959 INFO ]: Computing forward predicates... [2018-06-22 11:42:33,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:42:33,278 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:33,278 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:42:33,279 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:42:33,279 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:42:33,279 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:42:33,279 INFO ]: Start difference. First operand 17 states and 30 transitions. Second operand 8 states. [2018-06-22 11:42:33,701 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:33,701 INFO ]: Finished difference Result 27 states and 62 transitions. [2018-06-22 11:42:33,702 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:42:33,702 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:42:33,702 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:33,703 INFO ]: With dead ends: 27 [2018-06-22 11:42:33,703 INFO ]: Without dead ends: 27 [2018-06-22 11:42:33,704 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:42:33,704 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:42:33,715 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-06-22 11:42:33,716 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:42:33,717 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 43 transitions. [2018-06-22 11:42:33,717 INFO ]: Start accepts. Automaton has 21 states and 43 transitions. Word has length 13 [2018-06-22 11:42:33,717 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:33,717 INFO ]: Abstraction has 21 states and 43 transitions. [2018-06-22 11:42:33,717 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:42:33,718 INFO ]: Start isEmpty. Operand 21 states and 43 transitions. [2018-06-22 11:42:33,719 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:42:33,719 INFO ]: Found error trace [2018-06-22 11:42:33,719 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:33,719 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:33,719 INFO ]: Analyzing trace with hash 1484810338, now seen corresponding path program 1 times [2018-06-22 11:42:33,719 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:33,719 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:33,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:33,721 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:33,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:33,732 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:33,771 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:42:33,771 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:33,771 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:42:33,771 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:42:33,772 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:42:33,772 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:33,772 INFO ]: Start difference. First operand 21 states and 43 transitions. Second operand 4 states. [2018-06-22 11:42:33,949 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:33,949 INFO ]: Finished difference Result 23 states and 44 transitions. [2018-06-22 11:42:33,949 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:42:33,949 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:42:33,950 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:33,951 INFO ]: With dead ends: 23 [2018-06-22 11:42:33,951 INFO ]: Without dead ends: 23 [2018-06-22 11:42:33,951 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:42:33,951 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:42:33,957 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-22 11:42:33,957 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:42:33,958 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 40 transitions. [2018-06-22 11:42:33,958 INFO ]: Start accepts. Automaton has 21 states and 40 transitions. Word has length 13 [2018-06-22 11:42:33,958 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:33,958 INFO ]: Abstraction has 21 states and 40 transitions. [2018-06-22 11:42:33,958 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:42:33,958 INFO ]: Start isEmpty. Operand 21 states and 40 transitions. [2018-06-22 11:42:33,960 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:42:33,960 INFO ]: Found error trace [2018-06-22 11:42:33,960 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:33,960 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:33,960 INFO ]: Analyzing trace with hash -36996241, now seen corresponding path program 1 times [2018-06-22 11:42:33,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:33,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:33,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:33,961 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:33,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:33,987 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:34,402 WARN ]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-22 11:42:34,560 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:42:34,560 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:34,560 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:42:34,569 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:34,581 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:34,613 INFO ]: Computing forward predicates... [2018-06-22 11:42:34,744 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:42:34,767 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:34,767 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:42:34,768 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:42:34,768 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:42:34,768 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:42:34,768 INFO ]: Start difference. First operand 21 states and 40 transitions. Second operand 9 states. [2018-06-22 11:42:35,138 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:35,138 INFO ]: Finished difference Result 33 states and 74 transitions. [2018-06-22 11:42:35,139 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:42:35,139 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:42:35,140 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:35,141 INFO ]: With dead ends: 33 [2018-06-22 11:42:35,141 INFO ]: Without dead ends: 33 [2018-06-22 11:42:35,141 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:42:35,142 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:42:35,159 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-06-22 11:42:35,160 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:42:35,161 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2018-06-22 11:42:35,161 INFO ]: Start accepts. Automaton has 27 states and 56 transitions. Word has length 13 [2018-06-22 11:42:35,161 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:35,161 INFO ]: Abstraction has 27 states and 56 transitions. [2018-06-22 11:42:35,161 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:42:35,161 INFO ]: Start isEmpty. Operand 27 states and 56 transitions. [2018-06-22 11:42:35,162 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:42:35,162 INFO ]: Found error trace [2018-06-22 11:42:35,162 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:35,163 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:35,165 INFO ]: Analyzing trace with hash 1239559485, now seen corresponding path program 1 times [2018-06-22 11:42:35,165 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:35,165 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:35,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:35,166 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:35,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:35,213 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:35,403 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:42:35,403 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:35,403 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:42:35,420 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:35,443 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:35,446 INFO ]: Computing forward predicates... [2018-06-22 11:42:35,675 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:42:35,697 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:35,697 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:42:35,697 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:42:35,697 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:42:35,697 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:42:35,697 INFO ]: Start difference. First operand 27 states and 56 transitions. Second operand 9 states. [2018-06-22 11:42:35,882 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:35,882 INFO ]: Finished difference Result 33 states and 75 transitions. [2018-06-22 11:42:35,883 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:42:35,883 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:42:35,883 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:35,884 INFO ]: With dead ends: 33 [2018-06-22 11:42:35,884 INFO ]: Without dead ends: 33 [2018-06-22 11:42:35,885 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:42:35,885 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:42:35,895 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-06-22 11:42:35,895 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:42:35,896 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2018-06-22 11:42:35,896 INFO ]: Start accepts. Automaton has 27 states and 56 transitions. Word has length 13 [2018-06-22 11:42:35,896 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:35,896 INFO ]: Abstraction has 27 states and 56 transitions. [2018-06-22 11:42:35,896 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:42:35,896 INFO ]: Start isEmpty. Operand 27 states and 56 transitions. [2018-06-22 11:42:35,898 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:42:35,898 INFO ]: Found error trace [2018-06-22 11:42:35,898 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:35,898 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:35,898 INFO ]: Analyzing trace with hash 1314711645, now seen corresponding path program 1 times [2018-06-22 11:42:35,898 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:35,898 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:35,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:35,899 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:35,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:35,910 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:35,995 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:42:35,995 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:35,995 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:42:36,004 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:36,018 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:36,020 INFO ]: Computing forward predicates... [2018-06-22 11:42:36,084 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:42:36,103 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:36,103 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 11:42:36,103 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:42:36,103 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:42:36,103 INFO ]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:42:36,103 INFO ]: Start difference. First operand 27 states and 56 transitions. Second operand 12 states. [2018-06-22 11:42:36,517 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:36,517 INFO ]: Finished difference Result 41 states and 93 transitions. [2018-06-22 11:42:36,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:42:36,517 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:42:36,518 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:36,519 INFO ]: With dead ends: 41 [2018-06-22 11:42:36,519 INFO ]: Without dead ends: 41 [2018-06-22 11:42:36,519 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:42:36,519 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:42:36,538 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 31. [2018-06-22 11:42:36,539 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:42:36,540 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 66 transitions. [2018-06-22 11:42:36,540 INFO ]: Start accepts. Automaton has 31 states and 66 transitions. Word has length 17 [2018-06-22 11:42:36,540 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:36,540 INFO ]: Abstraction has 31 states and 66 transitions. [2018-06-22 11:42:36,540 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:42:36,540 INFO ]: Start isEmpty. Operand 31 states and 66 transitions. [2018-06-22 11:42:36,542 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:42:36,542 INFO ]: Found error trace [2018-06-22 11:42:36,542 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:36,542 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:36,542 INFO ]: Analyzing trace with hash 861693227, now seen corresponding path program 1 times [2018-06-22 11:42:36,542 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:36,542 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:36,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:36,543 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:36,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:36,567 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:36,689 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:42:36,689 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:36,689 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:42:36,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:36,713 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:36,715 INFO ]: Computing forward predicates... [2018-06-22 11:42:36,805 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:42:36,834 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:36,834 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 11:42:36,835 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:42:36,835 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:42:36,890 INFO ]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:42:36,891 INFO ]: Start difference. First operand 31 states and 66 transitions. Second operand 12 states. [2018-06-22 11:42:37,401 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:37,401 INFO ]: Finished difference Result 49 states and 115 transitions. [2018-06-22 11:42:37,402 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:42:37,402 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:42:37,402 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:37,403 INFO ]: With dead ends: 49 [2018-06-22 11:42:37,403 INFO ]: Without dead ends: 49 [2018-06-22 11:42:37,404 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:42:37,404 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:42:37,414 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 41. [2018-06-22 11:42:37,414 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:42:37,415 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 94 transitions. [2018-06-22 11:42:37,415 INFO ]: Start accepts. Automaton has 41 states and 94 transitions. Word has length 17 [2018-06-22 11:42:37,415 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:37,415 INFO ]: Abstraction has 41 states and 94 transitions. [2018-06-22 11:42:37,415 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:42:37,415 INFO ]: Start isEmpty. Operand 41 states and 94 transitions. [2018-06-22 11:42:37,417 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:42:37,417 INFO ]: Found error trace [2018-06-22 11:42:37,417 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:37,417 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:37,418 INFO ]: Analyzing trace with hash -1142185187, now seen corresponding path program 2 times [2018-06-22 11:42:37,418 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:37,418 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:37,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:37,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:37,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:37,427 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:37,473 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:42:37,473 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:37,473 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:42:37,479 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:42:37,497 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:42:37,497 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:37,500 INFO ]: Computing forward predicates... [2018-06-22 11:42:37,593 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:42:37,613 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:37,613 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:42:37,614 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:42:37,614 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:42:37,614 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:42:37,614 INFO ]: Start difference. First operand 41 states and 94 transitions. Second operand 11 states. [2018-06-22 11:42:37,884 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:37,884 INFO ]: Finished difference Result 49 states and 116 transitions. [2018-06-22 11:42:37,885 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:42:37,885 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:42:37,885 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:37,886 INFO ]: With dead ends: 49 [2018-06-22 11:42:37,886 INFO ]: Without dead ends: 49 [2018-06-22 11:42:37,887 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:42:37,887 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:42:37,898 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-06-22 11:42:37,898 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:42:37,899 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 101 transitions. [2018-06-22 11:42:37,899 INFO ]: Start accepts. Automaton has 43 states and 101 transitions. Word has length 17 [2018-06-22 11:42:37,899 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:37,899 INFO ]: Abstraction has 43 states and 101 transitions. [2018-06-22 11:42:37,899 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:42:37,899 INFO ]: Start isEmpty. Operand 43 states and 101 transitions. [2018-06-22 11:42:37,901 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:42:37,901 INFO ]: Found error trace [2018-06-22 11:42:37,901 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:37,901 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:37,902 INFO ]: Analyzing trace with hash -1926793228, now seen corresponding path program 2 times [2018-06-22 11:42:37,902 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:37,902 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:37,902 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:37,902 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:42:37,902 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:37,929 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:38,177 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:42:38,177 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:38,177 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:42:38,183 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:42:38,207 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:42:38,246 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:38,249 INFO ]: Computing forward predicates... [2018-06-22 11:42:38,532 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:42:38,621 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:38,621 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:42:38,622 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:42:38,622 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:42:38,622 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:42:38,622 INFO ]: Start difference. First operand 43 states and 101 transitions. Second operand 13 states. [2018-06-22 11:42:39,355 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:39,355 INFO ]: Finished difference Result 61 states and 153 transitions. [2018-06-22 11:42:39,355 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:42:39,355 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:42:39,355 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:39,357 INFO ]: With dead ends: 61 [2018-06-22 11:42:39,357 INFO ]: Without dead ends: 61 [2018-06-22 11:42:39,357 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:42:39,357 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:42:39,368 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 43. [2018-06-22 11:42:39,368 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:42:39,369 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 101 transitions. [2018-06-22 11:42:39,369 INFO ]: Start accepts. Automaton has 43 states and 101 transitions. Word has length 17 [2018-06-22 11:42:39,369 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:39,369 INFO ]: Abstraction has 43 states and 101 transitions. [2018-06-22 11:42:39,369 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:42:39,369 INFO ]: Start isEmpty. Operand 43 states and 101 transitions. [2018-06-22 11:42:39,371 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:42:39,371 INFO ]: Found error trace [2018-06-22 11:42:39,371 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:39,371 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:39,371 INFO ]: Analyzing trace with hash 1915155650, now seen corresponding path program 1 times [2018-06-22 11:42:39,371 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:39,371 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:39,372 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:39,372 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:42:39,372 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:39,390 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:39,686 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:42:39,686 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:39,686 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:42:39,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:39,710 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:39,712 INFO ]: Computing forward predicates... [2018-06-22 11:42:40,177 WARN ]: Spent 117.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2018-06-22 11:42:40,328 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:42:40,361 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:40,361 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:42:40,361 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:42:40,361 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:42:40,361 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:42:40,361 INFO ]: Start difference. First operand 43 states and 101 transitions. Second operand 13 states. [2018-06-22 11:42:41,083 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:41,083 INFO ]: Finished difference Result 59 states and 152 transitions. [2018-06-22 11:42:41,087 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:42:41,087 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:42:41,087 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:41,088 INFO ]: With dead ends: 59 [2018-06-22 11:42:41,088 INFO ]: Without dead ends: 59 [2018-06-22 11:42:41,089 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:42:41,089 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 11:42:41,103 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 45. [2018-06-22 11:42:41,103 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:42:41,104 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 107 transitions. [2018-06-22 11:42:41,104 INFO ]: Start accepts. Automaton has 45 states and 107 transitions. Word has length 17 [2018-06-22 11:42:41,106 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:41,106 INFO ]: Abstraction has 45 states and 107 transitions. [2018-06-22 11:42:41,106 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:42:41,106 INFO ]: Start isEmpty. Operand 45 states and 107 transitions. [2018-06-22 11:42:41,107 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:42:41,107 INFO ]: Found error trace [2018-06-22 11:42:41,107 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:41,107 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:41,107 INFO ]: Analyzing trace with hash 677529191, now seen corresponding path program 1 times [2018-06-22 11:42:41,107 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:41,107 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:41,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:41,108 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:41,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:41,117 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:41,220 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:42:41,221 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:41,221 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:42:41,221 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:42:41,221 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:42:41,221 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:42:41,221 INFO ]: Start difference. First operand 45 states and 107 transitions. Second operand 5 states. [2018-06-22 11:42:41,341 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:41,341 INFO ]: Finished difference Result 49 states and 115 transitions. [2018-06-22 11:42:41,342 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:42:41,342 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:42:41,342 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:41,343 INFO ]: With dead ends: 49 [2018-06-22 11:42:41,343 INFO ]: Without dead ends: 49 [2018-06-22 11:42:41,343 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:42:41,343 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:42:41,354 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-06-22 11:42:41,354 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:42:41,355 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 99 transitions. [2018-06-22 11:42:41,355 INFO ]: Start accepts. Automaton has 43 states and 99 transitions. Word has length 17 [2018-06-22 11:42:41,355 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:41,355 INFO ]: Abstraction has 43 states and 99 transitions. [2018-06-22 11:42:41,355 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:42:41,356 INFO ]: Start isEmpty. Operand 43 states and 99 transitions. [2018-06-22 11:42:41,357 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:42:41,357 INFO ]: Found error trace [2018-06-22 11:42:41,357 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:41,357 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:41,357 INFO ]: Analyzing trace with hash 1562188139, now seen corresponding path program 2 times [2018-06-22 11:42:41,357 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:41,357 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:41,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:41,358 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:41,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:41,365 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:41,443 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:42:41,443 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:41,443 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:42:41,450 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:42:41,467 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:42:41,467 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:41,469 INFO ]: Computing forward predicates... [2018-06-22 11:42:41,530 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:42:41,551 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:41,551 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:42:41,551 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:42:41,551 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:42:41,551 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:42:41,551 INFO ]: Start difference. First operand 43 states and 99 transitions. Second operand 11 states. [2018-06-22 11:42:41,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:41,798 INFO ]: Finished difference Result 51 states and 118 transitions. [2018-06-22 11:42:41,798 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:42:41,798 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:42:41,798 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:41,799 INFO ]: With dead ends: 51 [2018-06-22 11:42:41,799 INFO ]: Without dead ends: 51 [2018-06-22 11:42:41,799 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:42:41,799 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:42:41,807 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 41. [2018-06-22 11:42:41,807 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:42:41,808 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 94 transitions. [2018-06-22 11:42:41,808 INFO ]: Start accepts. Automaton has 41 states and 94 transitions. Word has length 17 [2018-06-22 11:42:41,808 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:41,808 INFO ]: Abstraction has 41 states and 94 transitions. [2018-06-22 11:42:41,808 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:42:41,808 INFO ]: Start isEmpty. Operand 41 states and 94 transitions. [2018-06-22 11:42:41,809 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:42:41,809 INFO ]: Found error trace [2018-06-22 11:42:41,809 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:41,809 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:41,809 INFO ]: Analyzing trace with hash -913064779, now seen corresponding path program 1 times [2018-06-22 11:42:41,809 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:41,809 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:41,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:41,810 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:42:41,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:41,816 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:41,858 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:42:41,858 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:41,858 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:42:41,858 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:42:41,858 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:42:41,858 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:42:41,858 INFO ]: Start difference. First operand 41 states and 94 transitions. Second operand 5 states. [2018-06-22 11:42:41,961 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:41,961 INFO ]: Finished difference Result 51 states and 116 transitions. [2018-06-22 11:42:41,961 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:42:41,962 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:42:41,962 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:41,962 INFO ]: With dead ends: 51 [2018-06-22 11:42:41,962 INFO ]: Without dead ends: 51 [2018-06-22 11:42:41,963 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:42:41,963 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:42:41,970 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-06-22 11:42:41,970 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:42:41,971 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 109 transitions. [2018-06-22 11:42:41,971 INFO ]: Start accepts. Automaton has 49 states and 109 transitions. Word has length 17 [2018-06-22 11:42:41,971 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:41,971 INFO ]: Abstraction has 49 states and 109 transitions. [2018-06-22 11:42:41,971 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:42:41,971 INFO ]: Start isEmpty. Operand 49 states and 109 transitions. [2018-06-22 11:42:41,972 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:42:41,972 INFO ]: Found error trace [2018-06-22 11:42:41,973 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:41,973 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:41,973 INFO ]: Analyzing trace with hash 777580098, now seen corresponding path program 2 times [2018-06-22 11:42:41,973 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:41,973 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:41,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:41,973 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:41,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:42,017 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:42,739 WARN ]: Spent 515.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2018-06-22 11:42:42,847 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:42:42,847 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:42,847 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:42:42,853 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:42:42,889 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:42:42,889 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:42,892 INFO ]: Computing forward predicates... [2018-06-22 11:42:43,226 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:42:43,245 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:43,278 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:42:43,279 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:42:43,279 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:42:43,279 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:42:43,279 INFO ]: Start difference. First operand 49 states and 109 transitions. Second operand 13 states. [2018-06-22 11:42:43,944 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:43,944 INFO ]: Finished difference Result 69 states and 165 transitions. [2018-06-22 11:42:43,945 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:42:43,945 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:42:43,945 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:43,945 INFO ]: With dead ends: 69 [2018-06-22 11:42:43,945 INFO ]: Without dead ends: 69 [2018-06-22 11:42:43,946 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:42:43,946 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 11:42:43,954 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 47. [2018-06-22 11:42:43,954 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:42:43,956 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 104 transitions. [2018-06-22 11:42:43,956 INFO ]: Start accepts. Automaton has 47 states and 104 transitions. Word has length 17 [2018-06-22 11:42:43,956 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:43,956 INFO ]: Abstraction has 47 states and 104 transitions. [2018-06-22 11:42:43,956 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:42:43,956 INFO ]: Start isEmpty. Operand 47 states and 104 transitions. [2018-06-22 11:42:43,957 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:42:43,957 INFO ]: Found error trace [2018-06-22 11:42:43,957 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:43,958 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:43,958 INFO ]: Analyzing trace with hash -1097051934, now seen corresponding path program 3 times [2018-06-22 11:42:43,958 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:43,958 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:43,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:43,958 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:42:43,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:43,967 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:44,107 INFO ]: Checked inductivity of 19 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:42:44,107 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:44,107 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:42:44,122 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:42:44,142 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 11:42:44,142 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:44,144 INFO ]: Computing forward predicates... [2018-06-22 11:42:44,190 INFO ]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:42:44,210 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:42:44,210 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-06-22 11:42:44,211 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:42:44,211 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:42:44,211 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:42:44,211 INFO ]: Start difference. First operand 47 states and 104 transitions. Second operand 11 states. [2018-06-22 11:42:44,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:44,407 INFO ]: Finished difference Result 45 states and 100 transitions. [2018-06-22 11:42:44,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:42:44,407 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-22 11:42:44,407 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:44,408 INFO ]: With dead ends: 45 [2018-06-22 11:42:44,408 INFO ]: Without dead ends: 45 [2018-06-22 11:42:44,408 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:42:44,408 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 11:42:44,415 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-06-22 11:42:44,415 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:42:44,416 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 87 transitions. [2018-06-22 11:42:44,416 INFO ]: Start accepts. Automaton has 41 states and 87 transitions. Word has length 21 [2018-06-22 11:42:44,416 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:44,416 INFO ]: Abstraction has 41 states and 87 transitions. [2018-06-22 11:42:44,416 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:42:44,416 INFO ]: Start isEmpty. Operand 41 states and 87 transitions. [2018-06-22 11:42:44,417 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:42:44,417 INFO ]: Found error trace [2018-06-22 11:42:44,417 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:44,417 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:44,418 INFO ]: Analyzing trace with hash -1828141062, now seen corresponding path program 1 times [2018-06-22 11:42:44,418 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:44,418 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:44,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:44,418 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:42:44,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:44,425 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:45,135 INFO ]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:42:45,135 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:45,135 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:42:45,151 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:42:45,179 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:45,181 INFO ]: Computing forward predicates... [2018-06-22 11:42:45,601 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-22 11:42:45,682 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:42:45,701 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:45,701 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 14 [2018-06-22 11:42:45,701 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:42:45,701 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:42:45,701 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:42:45,701 INFO ]: Start difference. First operand 41 states and 87 transitions. Second operand 14 states. [2018-06-22 11:42:47,100 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:47,100 INFO ]: Finished difference Result 67 states and 155 transitions. [2018-06-22 11:42:47,100 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:42:47,100 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:42:47,100 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:47,101 INFO ]: With dead ends: 67 [2018-06-22 11:42:47,101 INFO ]: Without dead ends: 67 [2018-06-22 11:42:47,102 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:42:47,102 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 11:42:47,114 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 43. [2018-06-22 11:42:47,114 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:42:47,115 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 94 transitions. [2018-06-22 11:42:47,115 INFO ]: Start accepts. Automaton has 43 states and 94 transitions. Word has length 21 [2018-06-22 11:42:47,115 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:47,115 INFO ]: Abstraction has 43 states and 94 transitions. [2018-06-22 11:42:47,115 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:42:47,115 INFO ]: Start isEmpty. Operand 43 states and 94 transitions. [2018-06-22 11:42:47,116 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:42:47,116 INFO ]: Found error trace [2018-06-22 11:42:47,116 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:47,116 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:47,116 INFO ]: Analyzing trace with hash -1976141904, now seen corresponding path program 1 times [2018-06-22 11:42:47,116 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:47,116 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:47,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:47,117 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:47,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:47,132 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:47,803 INFO ]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:42:47,803 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:47,803 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:42:47,809 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:47,823 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:47,825 INFO ]: Computing forward predicates... [2018-06-22 11:42:48,174 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:42:48,193 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:48,193 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 14 [2018-06-22 11:42:48,193 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:42:48,193 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:42:48,193 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:42:48,194 INFO ]: Start difference. First operand 43 states and 94 transitions. Second operand 14 states. [2018-06-22 11:42:48,723 WARN ]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-22 11:42:49,109 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:49,175 INFO ]: Finished difference Result 73 states and 170 transitions. [2018-06-22 11:42:49,175 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:42:49,175 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:42:49,176 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:49,177 INFO ]: With dead ends: 73 [2018-06-22 11:42:49,177 INFO ]: Without dead ends: 73 [2018-06-22 11:42:49,177 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:42:49,177 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 11:42:49,188 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 47. [2018-06-22 11:42:49,188 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:42:49,189 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 105 transitions. [2018-06-22 11:42:49,189 INFO ]: Start accepts. Automaton has 47 states and 105 transitions. Word has length 21 [2018-06-22 11:42:49,189 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:49,189 INFO ]: Abstraction has 47 states and 105 transitions. [2018-06-22 11:42:49,189 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:42:49,189 INFO ]: Start isEmpty. Operand 47 states and 105 transitions. [2018-06-22 11:42:49,190 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:42:49,190 INFO ]: Found error trace [2018-06-22 11:42:49,190 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:49,190 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:49,190 INFO ]: Analyzing trace with hash 404019207, now seen corresponding path program 3 times [2018-06-22 11:42:49,190 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:49,190 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:49,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:49,192 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:49,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:49,235 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:49,580 INFO ]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:42:49,580 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:49,580 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:42:49,585 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:42:49,602 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:42:49,602 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:49,605 INFO ]: Computing forward predicates... [2018-06-22 11:42:49,961 INFO ]: Checked inductivity of 19 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:42:49,982 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:49,982 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-06-22 11:42:49,982 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:42:49,982 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:42:49,983 INFO ]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:42:49,983 INFO ]: Start difference. First operand 47 states and 105 transitions. Second operand 16 states. [2018-06-22 11:42:50,791 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:50,791 INFO ]: Finished difference Result 67 states and 161 transitions. [2018-06-22 11:42:50,791 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:42:50,791 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 11:42:50,791 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:50,792 INFO ]: With dead ends: 67 [2018-06-22 11:42:50,792 INFO ]: Without dead ends: 67 [2018-06-22 11:42:50,793 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:42:50,793 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 11:42:50,800 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 45. [2018-06-22 11:42:50,844 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:42:50,845 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 98 transitions. [2018-06-22 11:42:50,845 INFO ]: Start accepts. Automaton has 45 states and 98 transitions. Word has length 21 [2018-06-22 11:42:50,845 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:50,845 INFO ]: Abstraction has 45 states and 98 transitions. [2018-06-22 11:42:50,845 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:42:50,845 INFO ]: Start isEmpty. Operand 45 states and 98 transitions. [2018-06-22 11:42:50,846 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:42:50,846 INFO ]: Found error trace [2018-06-22 11:42:50,846 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:50,846 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:50,847 INFO ]: Analyzing trace with hash 504657520, now seen corresponding path program 2 times [2018-06-22 11:42:50,847 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:50,847 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:50,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:50,847 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:42:50,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:50,855 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:51,465 INFO ]: Checked inductivity of 18 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:42:51,465 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:51,465 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:42:51,471 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:42:51,485 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:42:51,485 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:51,487 INFO ]: Computing forward predicates... [2018-06-22 11:42:51,606 INFO ]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:42:51,636 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:51,636 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2018-06-22 11:42:51,636 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:42:51,636 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:42:51,637 INFO ]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:42:51,637 INFO ]: Start difference. First operand 45 states and 98 transitions. Second operand 15 states. [2018-06-22 11:42:52,162 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:52,181 INFO ]: Finished difference Result 65 states and 148 transitions. [2018-06-22 11:42:52,181 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:42:52,181 INFO ]: Start accepts. Automaton has 15 states. Word has length 21 [2018-06-22 11:42:52,181 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:52,182 INFO ]: With dead ends: 65 [2018-06-22 11:42:52,182 INFO ]: Without dead ends: 65 [2018-06-22 11:42:52,182 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:42:52,183 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 11:42:52,189 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 49. [2018-06-22 11:42:52,189 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:42:52,189 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 108 transitions. [2018-06-22 11:42:52,189 INFO ]: Start accepts. Automaton has 49 states and 108 transitions. Word has length 21 [2018-06-22 11:42:52,190 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:52,190 INFO ]: Abstraction has 49 states and 108 transitions. [2018-06-22 11:42:52,190 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:42:52,190 INFO ]: Start isEmpty. Operand 49 states and 108 transitions. [2018-06-22 11:42:52,191 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:42:52,191 INFO ]: Found error trace [2018-06-22 11:42:52,191 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:52,191 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:52,191 INFO ]: Analyzing trace with hash -2083092747, now seen corresponding path program 3 times [2018-06-22 11:42:52,191 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:52,191 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:52,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:52,192 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:42:52,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:52,200 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:52,463 INFO ]: Checked inductivity of 31 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:42:52,463 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:52,463 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:42:52,469 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:42:52,490 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:42:52,490 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:52,492 INFO ]: Computing forward predicates... [2018-06-22 11:42:52,618 INFO ]: Checked inductivity of 31 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:42:52,637 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:52,637 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2018-06-22 11:42:52,637 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:42:52,638 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:42:52,638 INFO ]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:42:52,638 INFO ]: Start difference. First operand 49 states and 108 transitions. Second operand 18 states. [2018-06-22 11:42:53,438 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:53,439 INFO ]: Finished difference Result 109 states and 244 transitions. [2018-06-22 11:42:53,439 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 11:42:53,439 INFO ]: Start accepts. Automaton has 18 states. Word has length 25 [2018-06-22 11:42:53,439 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:53,440 INFO ]: With dead ends: 109 [2018-06-22 11:42:53,471 INFO ]: Without dead ends: 109 [2018-06-22 11:42:53,472 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=320, Invalid=1402, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 11:42:53,472 INFO ]: Start minimizeSevpa. Operand 109 states. [2018-06-22 11:42:53,480 INFO ]: Finished minimizeSevpa. Reduced states from 109 to 59. [2018-06-22 11:42:53,480 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 11:42:53,481 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 127 transitions. [2018-06-22 11:42:53,481 INFO ]: Start accepts. Automaton has 59 states and 127 transitions. Word has length 25 [2018-06-22 11:42:53,481 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:53,481 INFO ]: Abstraction has 59 states and 127 transitions. [2018-06-22 11:42:53,481 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:42:53,482 INFO ]: Start isEmpty. Operand 59 states and 127 transitions. [2018-06-22 11:42:53,483 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:42:53,483 INFO ]: Found error trace [2018-06-22 11:42:53,483 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:53,483 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:53,483 INFO ]: Analyzing trace with hash 899337705, now seen corresponding path program 1 times [2018-06-22 11:42:53,483 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:53,483 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:53,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:53,484 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:42:53,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:53,491 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:53,610 INFO ]: Checked inductivity of 31 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:42:53,689 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:53,689 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:42:53,698 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:53,734 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:53,736 INFO ]: Computing forward predicates... [2018-06-22 11:42:53,798 INFO ]: Checked inductivity of 31 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:42:53,922 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:53,922 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 11:42:53,922 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:42:53,922 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:42:53,922 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:53,922 INFO ]: Start difference. First operand 59 states and 127 transitions. Second operand 4 states. [2018-06-22 11:42:54,036 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:54,037 INFO ]: Finished difference Result 113 states and 239 transitions. [2018-06-22 11:42:54,037 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:42:54,037 INFO ]: Start accepts. Automaton has 4 states. Word has length 25 [2018-06-22 11:42:54,037 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:54,039 INFO ]: With dead ends: 113 [2018-06-22 11:42:54,039 INFO ]: Without dead ends: 82 [2018-06-22 11:42:54,039 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:42:54,039 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-22 11:42:54,049 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 64. [2018-06-22 11:42:54,049 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 11:42:54,050 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 141 transitions. [2018-06-22 11:42:54,050 INFO ]: Start accepts. Automaton has 64 states and 141 transitions. Word has length 25 [2018-06-22 11:42:54,050 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:54,050 INFO ]: Abstraction has 64 states and 141 transitions. [2018-06-22 11:42:54,050 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:42:54,050 INFO ]: Start isEmpty. Operand 64 states and 141 transitions. [2018-06-22 11:42:54,051 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:42:54,051 INFO ]: Found error trace [2018-06-22 11:42:54,051 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:54,051 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:54,051 INFO ]: Analyzing trace with hash -280028733, now seen corresponding path program 4 times [2018-06-22 11:42:54,052 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:54,052 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:54,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:54,052 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:54,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:54,059 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:54,128 INFO ]: Checked inductivity of 31 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:42:54,128 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:54,128 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:42:54,138 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:42:54,156 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:42:54,156 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:54,158 INFO ]: Computing forward predicates... [2018-06-22 11:42:54,270 INFO ]: Checked inductivity of 31 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:42:54,362 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:54,362 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2018-06-22 11:42:54,362 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:42:54,362 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:42:54,363 INFO ]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:42:54,363 INFO ]: Start difference. First operand 64 states and 141 transitions. Second operand 18 states. [2018-06-22 11:42:55,351 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:55,351 INFO ]: Finished difference Result 138 states and 303 transitions. [2018-06-22 11:42:55,353 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 11:42:55,353 INFO ]: Start accepts. Automaton has 18 states. Word has length 25 [2018-06-22 11:42:55,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:55,355 INFO ]: With dead ends: 138 [2018-06-22 11:42:55,355 INFO ]: Without dead ends: 138 [2018-06-22 11:42:55,356 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=312, Invalid=1410, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 11:42:55,356 INFO ]: Start minimizeSevpa. Operand 138 states. [2018-06-22 11:42:55,366 INFO ]: Finished minimizeSevpa. Reduced states from 138 to 38. [2018-06-22 11:42:55,366 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:42:55,366 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 74 transitions. [2018-06-22 11:42:55,366 INFO ]: Start accepts. Automaton has 38 states and 74 transitions. Word has length 25 [2018-06-22 11:42:55,367 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:55,367 INFO ]: Abstraction has 38 states and 74 transitions. [2018-06-22 11:42:55,367 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:42:55,367 INFO ]: Start isEmpty. Operand 38 states and 74 transitions. [2018-06-22 11:42:55,367 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:42:55,367 INFO ]: Found error trace [2018-06-22 11:42:55,367 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:55,367 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:55,368 INFO ]: Analyzing trace with hash -1592565577, now seen corresponding path program 2 times [2018-06-22 11:42:55,368 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:55,368 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:55,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:55,368 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:42:55,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:55,375 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:55,443 INFO ]: Checked inductivity of 31 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:42:55,443 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:55,443 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:42:55,449 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:42:55,467 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:42:55,467 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:55,468 INFO ]: Computing forward predicates... [2018-06-22 11:42:55,486 INFO ]: Checked inductivity of 31 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:42:55,506 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:55,506 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 11:42:55,506 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:42:55,507 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:42:55,507 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:55,507 INFO ]: Start difference. First operand 38 states and 74 transitions. Second operand 4 states. [2018-06-22 11:42:55,553 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:55,553 INFO ]: Finished difference Result 32 states and 62 transitions. [2018-06-22 11:42:55,553 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:42:55,553 INFO ]: Start accepts. Automaton has 4 states. Word has length 25 [2018-06-22 11:42:55,553 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:55,554 INFO ]: With dead ends: 32 [2018-06-22 11:42:55,554 INFO ]: Without dead ends: 0 [2018-06-22 11:42:55,554 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:42:55,554 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:42:55,554 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:42:55,554 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:42:55,554 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:42:55,554 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-06-22 11:42:55,554 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:55,554 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:42:55,554 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:42:55,554 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:42:55,554 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:42:55,649 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:42:55 BoogieIcfgContainer [2018-06-22 11:42:55,649 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:42:55,650 INFO ]: Toolchain (without parser) took 24226.41 ms. Allocated memory was 299.4 MB in the beginning and 613.9 MB in the end (delta: 314.6 MB). Free memory was 254.7 MB in the beginning and 592.5 MB in the end (delta: -337.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 3.6 GB. [2018-06-22 11:42:55,651 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 299.4 MB. Free memory is still 264.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:42:55,651 INFO ]: ChcToBoogie took 58.90 ms. Allocated memory is still 299.4 MB. Free memory was 254.7 MB in the beginning and 252.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:42:55,651 INFO ]: Boogie Preprocessor took 70.68 ms. Allocated memory is still 299.4 MB. Free memory was 252.7 MB in the beginning and 250.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:42:55,652 INFO ]: RCFGBuilder took 379.02 ms. Allocated memory is still 299.4 MB. Free memory was 250.8 MB in the beginning and 241.7 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:42:55,652 INFO ]: TraceAbstraction took 23709.15 ms. Allocated memory was 299.4 MB in the beginning and 613.9 MB in the end (delta: 314.6 MB). Free memory was 241.7 MB in the beginning and 592.5 MB in the end (delta: -350.9 MB). Peak memory consumption was 40.7 MB. Max. memory is 3.6 GB. [2018-06-22 11:42:55,655 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 299.4 MB. Free memory is still 264.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 58.90 ms. Allocated memory is still 299.4 MB. Free memory was 254.7 MB in the beginning and 252.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 70.68 ms. Allocated memory is still 299.4 MB. Free memory was 252.7 MB in the beginning and 250.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 379.02 ms. Allocated memory is still 299.4 MB. Free memory was 250.8 MB in the beginning and 241.7 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 23709.15 ms. Allocated memory was 299.4 MB in the beginning and 613.9 MB in the end (delta: 314.6 MB). Free memory was 241.7 MB in the beginning and 592.5 MB in the end (delta: -350.9 MB). Peak memory consumption was 40.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 17 locations, 1 error locations. SAFE Result, 23.6s OverallTime, 23 OverallIterations, 5 TraceHistogramMax, 11.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 525 SDtfs, 179 SDslu, 1698 SDs, 0 SdLazy, 5516 SolverSat, 451 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 656 GetRequests, 310 SyntacticMatches, 14 SemanticMatches, 332 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=21, 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.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 376 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 782 NumberOfCodeBlocks, 774 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 740 ConstructedInterpolants, 0 QuantifiedInterpolants, 101764 SizeOfPredicates, 159 NumberOfNonLiveVariables, 2335 ConjunctsInSsa, 561 ConjunctsInUnsatCore, 42 InterpolantComputations, 5 PerfectInterpolantSequences, 371/599 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/heap__findmax.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-42-55-665.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/heap__findmax.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-42-55-665.csv Received shutdown request...