java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/loop__break_single.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 02:11:35,450 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 02:11:35,452 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 02:11:35,468 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 02:11:35,468 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 02:11:35,469 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 02:11:35,472 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 02:11:35,474 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 02:11:35,477 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 02:11:35,478 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 02:11:35,479 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 02:11:35,479 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 02:11:35,480 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 02:11:35,481 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 02:11:35,482 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 02:11:35,483 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 02:11:35,485 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 02:11:35,496 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 02:11:35,498 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 02:11:35,499 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 02:11:35,500 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 02:11:35,502 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 02:11:35,503 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 02:11:35,503 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 02:11:35,504 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 02:11:35,513 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 02:11:35,514 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 02:11:35,514 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 02:11:35,515 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 02:11:35,515 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 02:11:35,516 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 02:11:35,517 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 02:11:35,517 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 02:11:35,518 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 02:11:35,518 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 02:11:35,519 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 02:11:35,543 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 02:11:35,544 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 02:11:35,544 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 02:11:35,544 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 02:11:35,545 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 02:11:35,545 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 02:11:35,546 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 02:11:35,546 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 02:11:35,546 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:11:35,546 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 02:11:35,546 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 02:11:35,547 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 02:11:35,551 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 02:11:35,551 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 02:11:35,551 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 02:11:35,551 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 02:11:35,551 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 02:11:35,553 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 02:11:35,553 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 02:11:35,606 INFO ]: Repository-Root is: /tmp [2018-06-22 02:11:35,622 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 02:11:35,627 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 02:11:35,628 INFO ]: Initializing SmtParser... [2018-06-22 02:11:35,629 INFO ]: SmtParser initialized [2018-06-22 02:11:35,629 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__break_single.smt2 [2018-06-22 02:11:35,631 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 02:11:35,723 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__break_single.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@64976ccf [2018-06-22 02:11:35,922 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__break_single.smt2 [2018-06-22 02:11:35,926 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 02:11:35,938 INFO ]: Walking toolchain with 4 elements. [2018-06-22 02:11:35,939 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 02:11:35,939 INFO ]: Initializing ChcToBoogie... [2018-06-22 02:11:35,939 INFO ]: ChcToBoogie initialized [2018-06-22 02:11:35,942 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:11:35" (1/1) ... [2018-06-22 02:11:35,997 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:11:35 Unit [2018-06-22 02:11:35,997 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 02:11:35,998 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 02:11:35,998 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 02:11:35,998 INFO ]: Boogie Preprocessor initialized [2018-06-22 02:11:36,019 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:11:35" (1/1) ... [2018-06-22 02:11:36,020 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:11:35" (1/1) ... [2018-06-22 02:11:36,025 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:11:35" (1/1) ... [2018-06-22 02:11:36,025 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:11:35" (1/1) ... [2018-06-22 02:11:36,029 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:11:35" (1/1) ... [2018-06-22 02:11:36,030 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:11:35" (1/1) ... [2018-06-22 02:11:36,031 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:11:35" (1/1) ... [2018-06-22 02:11:36,032 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 02:11:36,033 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 02:11:36,033 INFO ]: Initializing RCFGBuilder... [2018-06-22 02:11:36,033 INFO ]: RCFGBuilder initialized [2018-06-22 02:11:36,034 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:11:35" (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 02:11:36,052 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 02:11:36,052 INFO ]: Found specification of procedure gotoProc [2018-06-22 02:11:36,052 INFO ]: Found implementation of procedure gotoProc [2018-06-22 02:11:36,052 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 02:11:36,053 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 02:11:36,053 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 02:11:36,214 INFO ]: Using library mode [2018-06-22 02:11:36,214 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:11:36 BoogieIcfgContainer [2018-06-22 02:11:36,214 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 02:11:36,217 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 02:11:36,217 INFO ]: Initializing TraceAbstraction... [2018-06-22 02:11:36,220 INFO ]: TraceAbstraction initialized [2018-06-22 02:11:36,220 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:11:35" (1/3) ... [2018-06-22 02:11:36,221 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a4cfd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 02:11:36, skipping insertion in model container [2018-06-22 02:11:36,221 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:11:35" (2/3) ... [2018-06-22 02:11:36,221 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a4cfd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:11:36, skipping insertion in model container [2018-06-22 02:11:36,221 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:11:36" (3/3) ... [2018-06-22 02:11:36,223 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 02:11:36,234 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 02:11:36,241 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 02:11:36,283 INFO ]: Using default assertion order modulation [2018-06-22 02:11:36,283 INFO ]: Interprodecural is true [2018-06-22 02:11:36,283 INFO ]: Hoare is false [2018-06-22 02:11:36,283 INFO ]: Compute interpolants for FPandBP [2018-06-22 02:11:36,283 INFO ]: Backedges is TWOTRACK [2018-06-22 02:11:36,283 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 02:11:36,284 INFO ]: Difference is false [2018-06-22 02:11:36,284 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 02:11:36,284 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 02:11:36,301 INFO ]: Start isEmpty. Operand 10 states. [2018-06-22 02:11:36,324 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 02:11:36,324 INFO ]: Found error trace [2018-06-22 02:11:36,325 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:36,325 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:36,329 INFO ]: Analyzing trace with hash -204604396, now seen corresponding path program 1 times [2018-06-22 02:11:36,330 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:36,330 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:36,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:36,363 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:36,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:36,403 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:36,451 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:36,452 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:11:36,453 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:11:36,454 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:11:36,557 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:11:36,557 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:11:36,590 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-22 02:11:37,083 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:37,083 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-22 02:11:37,084 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:11:37,096 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 02:11:37,096 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:37,223 INFO ]: With dead ends: 9 [2018-06-22 02:11:37,223 INFO ]: Without dead ends: 9 [2018-06-22 02:11:37,234 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:11:37,613 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 02:11:37,642 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 02:11:37,644 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 02:11:37,644 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-22 02:11:37,649 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-22 02:11:37,649 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:37,649 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-22 02:11:37,649 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:11:37,649 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-22 02:11:37,650 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:11:37,650 INFO ]: Found error trace [2018-06-22 02:11:37,650 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:37,650 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:37,650 INFO ]: Analyzing trace with hash -2057039604, now seen corresponding path program 1 times [2018-06-22 02:11:37,650 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:37,650 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:37,651 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:37,651 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:37,651 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:37,672 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:37,928 WARN ]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 02:11:37,929 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:37,929 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:11:37,929 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:11:37,932 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:11:37,932 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:11:37,932 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:11:37,932 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 3 states. [2018-06-22 02:11:38,050 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:38,051 INFO ]: Finished difference Result 10 states and 16 transitions. [2018-06-22 02:11:38,051 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:11:38,051 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 02:11:38,051 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:38,052 INFO ]: With dead ends: 10 [2018-06-22 02:11:38,052 INFO ]: Without dead ends: 10 [2018-06-22 02:11:38,053 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:11:38,053 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 02:11:38,054 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 02:11:38,054 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 02:11:38,054 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2018-06-22 02:11:38,054 INFO ]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 8 [2018-06-22 02:11:38,054 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:38,055 INFO ]: Abstraction has 10 states and 16 transitions. [2018-06-22 02:11:38,055 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:11:38,055 INFO ]: Start isEmpty. Operand 10 states and 16 transitions. [2018-06-22 02:11:38,055 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:11:38,055 INFO ]: Found error trace [2018-06-22 02:11:38,055 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:38,056 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:38,056 INFO ]: Analyzing trace with hash -2049651436, now seen corresponding path program 1 times [2018-06-22 02:11:38,056 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:38,056 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:38,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:38,057 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:38,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:38,072 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:38,238 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:38,238 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:38,238 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:38,254 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:38,285 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:38,293 INFO ]: Computing forward predicates... [2018-06-22 02:11:38,417 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:38,438 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:11:38,438 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-22 02:11:38,439 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:11:38,439 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:11:38,439 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:11:38,439 INFO ]: Start difference. First operand 10 states and 16 transitions. Second operand 5 states. [2018-06-22 02:11:38,691 WARN ]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-22 02:11:38,830 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:38,830 INFO ]: Finished difference Result 13 states and 23 transitions. [2018-06-22 02:11:38,830 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:11:38,830 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 02:11:38,830 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:38,831 INFO ]: With dead ends: 13 [2018-06-22 02:11:38,831 INFO ]: Without dead ends: 13 [2018-06-22 02:11:38,831 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:11:38,832 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 02:11:38,833 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-22 02:11:38,833 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 02:11:38,834 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2018-06-22 02:11:38,834 INFO ]: Start accepts. Automaton has 11 states and 18 transitions. Word has length 8 [2018-06-22 02:11:38,834 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:38,834 INFO ]: Abstraction has 11 states and 18 transitions. [2018-06-22 02:11:38,834 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:11:38,834 INFO ]: Start isEmpty. Operand 11 states and 18 transitions. [2018-06-22 02:11:38,834 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:11:38,834 INFO ]: Found error trace [2018-06-22 02:11:38,835 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:38,835 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:38,835 INFO ]: Analyzing trace with hash 650705176, now seen corresponding path program 1 times [2018-06-22 02:11:38,835 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:38,835 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:38,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:38,836 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:38,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:38,849 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:38,957 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:38,958 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:38,958 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:38,967 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:38,993 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:38,995 INFO ]: Computing forward predicates... [2018-06-22 02:11:39,323 WARN ]: Spent 105.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-06-22 02:11:39,900 WARN ]: Spent 485.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2018-06-22 02:11:39,914 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:39,936 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:39,936 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 02:11:39,936 INFO ]: Interpolant automaton has 8 states [2018-06-22 02:11:39,936 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 02:11:39,936 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:11:39,936 INFO ]: Start difference. First operand 11 states and 18 transitions. Second operand 8 states. [2018-06-22 02:11:40,189 WARN ]: Spent 241.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2018-06-22 02:11:40,243 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:40,243 INFO ]: Finished difference Result 18 states and 38 transitions. [2018-06-22 02:11:40,244 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 02:11:40,244 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-22 02:11:40,244 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:40,245 INFO ]: With dead ends: 18 [2018-06-22 02:11:40,245 INFO ]: Without dead ends: 18 [2018-06-22 02:11:40,245 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:11:40,245 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 02:11:40,248 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-06-22 02:11:40,248 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 02:11:40,248 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2018-06-22 02:11:40,248 INFO ]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 9 [2018-06-22 02:11:40,248 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:40,248 INFO ]: Abstraction has 13 states and 24 transitions. [2018-06-22 02:11:40,248 INFO ]: Interpolant automaton has 8 states. [2018-06-22 02:11:40,249 INFO ]: Start isEmpty. Operand 13 states and 24 transitions. [2018-06-22 02:11:40,249 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:11:40,249 INFO ]: Found error trace [2018-06-22 02:11:40,249 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:40,249 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:40,249 INFO ]: Analyzing trace with hash 879738384, now seen corresponding path program 1 times [2018-06-22 02:11:40,249 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:40,249 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:40,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:40,250 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:40,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:40,264 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:40,334 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:40,334 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:40,334 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:40,342 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:40,361 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:40,363 INFO ]: Computing forward predicates... [2018-06-22 02:11:40,615 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:40,635 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:40,635 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 02:11:40,636 INFO ]: Interpolant automaton has 8 states [2018-06-22 02:11:40,636 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 02:11:40,636 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:11:40,636 INFO ]: Start difference. First operand 13 states and 24 transitions. Second operand 8 states. [2018-06-22 02:11:40,776 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:40,776 INFO ]: Finished difference Result 18 states and 37 transitions. [2018-06-22 02:11:40,777 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 02:11:40,777 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-22 02:11:40,777 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:40,777 INFO ]: With dead ends: 18 [2018-06-22 02:11:40,777 INFO ]: Without dead ends: 18 [2018-06-22 02:11:40,778 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:11:40,778 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 02:11:40,780 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-06-22 02:11:40,780 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 02:11:40,780 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2018-06-22 02:11:40,780 INFO ]: Start accepts. Automaton has 14 states and 26 transitions. Word has length 9 [2018-06-22 02:11:40,780 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:40,780 INFO ]: Abstraction has 14 states and 26 transitions. [2018-06-22 02:11:40,780 INFO ]: Interpolant automaton has 8 states. [2018-06-22 02:11:40,780 INFO ]: Start isEmpty. Operand 14 states and 26 transitions. [2018-06-22 02:11:40,781 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:11:40,781 INFO ]: Found error trace [2018-06-22 02:11:40,781 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:40,781 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:40,781 INFO ]: Analyzing trace with hash -1423069168, now seen corresponding path program 2 times [2018-06-22 02:11:40,781 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:40,781 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:40,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:40,782 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:40,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:40,792 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:40,915 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:40,915 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:40,915 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:40,922 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:11:40,944 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:11:40,944 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:40,946 INFO ]: Computing forward predicates... [2018-06-22 02:11:41,085 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:41,106 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:41,106 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 02:11:41,106 INFO ]: Interpolant automaton has 10 states [2018-06-22 02:11:41,106 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 02:11:41,106 INFO ]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:11:41,107 INFO ]: Start difference. First operand 14 states and 26 transitions. Second operand 10 states. [2018-06-22 02:11:41,186 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:41,186 INFO ]: Finished difference Result 20 states and 43 transitions. [2018-06-22 02:11:41,187 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:11:41,187 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-22 02:11:41,187 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:41,187 INFO ]: With dead ends: 20 [2018-06-22 02:11:41,187 INFO ]: Without dead ends: 20 [2018-06-22 02:11:41,188 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:11:41,188 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 02:11:41,190 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-06-22 02:11:41,190 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 02:11:41,190 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2018-06-22 02:11:41,190 INFO ]: Start accepts. Automaton has 15 states and 29 transitions. Word has length 10 [2018-06-22 02:11:41,190 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:41,191 INFO ]: Abstraction has 15 states and 29 transitions. [2018-06-22 02:11:41,191 INFO ]: Interpolant automaton has 10 states. [2018-06-22 02:11:41,191 INFO ]: Start isEmpty. Operand 15 states and 29 transitions. [2018-06-22 02:11:41,191 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:11:41,191 INFO ]: Found error trace [2018-06-22 02:11:41,191 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:41,191 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:41,191 INFO ]: Analyzing trace with hash -1308552564, now seen corresponding path program 3 times [2018-06-22 02:11:41,191 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:41,191 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:41,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:41,192 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:41,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:41,208 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:41,297 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:41,297 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:41,297 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:41,307 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:11:41,319 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 02:11:41,320 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:41,321 INFO ]: Computing forward predicates... [2018-06-22 02:11:41,478 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:41,499 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:41,499 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-06-22 02:11:41,499 INFO ]: Interpolant automaton has 9 states [2018-06-22 02:11:41,499 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 02:11:41,499 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:11:41,499 INFO ]: Start difference. First operand 15 states and 29 transitions. Second operand 9 states. [2018-06-22 02:11:41,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:41,955 INFO ]: Finished difference Result 32 states and 77 transitions. [2018-06-22 02:11:41,955 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 02:11:41,955 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-22 02:11:41,956 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:41,956 INFO ]: With dead ends: 32 [2018-06-22 02:11:41,956 INFO ]: Without dead ends: 32 [2018-06-22 02:11:41,956 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:11:41,956 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 02:11:41,959 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 16. [2018-06-22 02:11:41,959 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 02:11:41,959 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 31 transitions. [2018-06-22 02:11:41,960 INFO ]: Start accepts. Automaton has 16 states and 31 transitions. Word has length 10 [2018-06-22 02:11:41,960 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:41,960 INFO ]: Abstraction has 16 states and 31 transitions. [2018-06-22 02:11:41,960 INFO ]: Interpolant automaton has 9 states. [2018-06-22 02:11:41,960 INFO ]: Start isEmpty. Operand 16 states and 31 transitions. [2018-06-22 02:11:41,960 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:11:41,960 INFO ]: Found error trace [2018-06-22 02:11:41,960 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:41,960 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:41,960 INFO ]: Analyzing trace with hash -1938988532, now seen corresponding path program 2 times [2018-06-22 02:11:41,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:41,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:41,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:41,961 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:41,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:41,969 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:42,018 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:42,018 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:42,018 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 02:11:42,024 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:11:42,036 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:11:42,036 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:42,037 INFO ]: Computing forward predicates... [2018-06-22 02:11:42,046 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:11:42,067 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:11:42,067 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-22 02:11:42,067 INFO ]: Interpolant automaton has 6 states [2018-06-22 02:11:42,067 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 02:11:42,067 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:11:42,067 INFO ]: Start difference. First operand 16 states and 31 transitions. Second operand 6 states. [2018-06-22 02:11:42,085 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:42,085 INFO ]: Finished difference Result 15 states and 24 transitions. [2018-06-22 02:11:42,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:11:42,085 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-22 02:11:42,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:42,085 INFO ]: With dead ends: 15 [2018-06-22 02:11:42,085 INFO ]: Without dead ends: 15 [2018-06-22 02:11:42,086 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:11:42,086 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 02:11:42,087 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 02:11:42,087 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 02:11:42,088 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2018-06-22 02:11:42,088 INFO ]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 10 [2018-06-22 02:11:42,088 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:42,088 INFO ]: Abstraction has 15 states and 24 transitions. [2018-06-22 02:11:42,088 INFO ]: Interpolant automaton has 6 states. [2018-06-22 02:11:42,088 INFO ]: Start isEmpty. Operand 15 states and 24 transitions. [2018-06-22 02:11:42,088 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:11:42,088 INFO ]: Found error trace [2018-06-22 02:11:42,088 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:42,088 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:42,088 INFO ]: Analyzing trace with hash 1496509588, now seen corresponding path program 3 times [2018-06-22 02:11:42,088 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:42,088 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:42,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:42,089 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:42,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:42,099 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:42,169 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:42,169 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:42,169 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) [2018-06-22 02:11:42,183 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:42,205 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 02:11:42,205 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:42,207 INFO ]: Computing forward predicates... [2018-06-22 02:11:42,382 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:42,401 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:42,401 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 02:11:42,401 INFO ]: Interpolant automaton has 10 states [2018-06-22 02:11:42,401 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 02:11:42,401 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:11:42,401 INFO ]: Start difference. First operand 15 states and 24 transitions. Second operand 10 states. [2018-06-22 02:11:42,619 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:42,619 INFO ]: Finished difference Result 25 states and 44 transitions. [2018-06-22 02:11:42,619 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 02:11:42,619 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-22 02:11:42,619 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:42,620 INFO ]: With dead ends: 25 [2018-06-22 02:11:42,620 INFO ]: Without dead ends: 25 [2018-06-22 02:11:42,620 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:11:42,620 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 02:11:42,622 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-06-22 02:11:42,622 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 02:11:42,623 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2018-06-22 02:11:42,623 INFO ]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 10 [2018-06-22 02:11:42,623 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:42,623 INFO ]: Abstraction has 16 states and 26 transitions. [2018-06-22 02:11:42,623 INFO ]: Interpolant automaton has 10 states. [2018-06-22 02:11:42,623 INFO ]: Start isEmpty. Operand 16 states and 26 transitions. [2018-06-22 02:11:42,623 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:11:42,623 INFO ]: Found error trace [2018-06-22 02:11:42,623 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:42,623 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:42,623 INFO ]: Analyzing trace with hash -1916000360, now seen corresponding path program 4 times [2018-06-22 02:11:42,623 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:42,623 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:42,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:42,624 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:42,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:42,638 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:42,715 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:42,716 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:42,716 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:42,737 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:11:42,757 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:11:42,757 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:42,759 INFO ]: Computing forward predicates... [2018-06-22 02:11:42,958 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:42,979 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:42,979 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 02:11:42,980 INFO ]: Interpolant automaton has 12 states [2018-06-22 02:11:42,980 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 02:11:42,980 INFO ]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:11:42,980 INFO ]: Start difference. First operand 16 states and 26 transitions. Second operand 12 states. [2018-06-22 02:11:43,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:43,247 INFO ]: Finished difference Result 31 states and 56 transitions. [2018-06-22 02:11:43,247 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 02:11:43,247 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-22 02:11:43,247 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:43,248 INFO ]: With dead ends: 31 [2018-06-22 02:11:43,248 INFO ]: Without dead ends: 31 [2018-06-22 02:11:43,249 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:11:43,249 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 02:11:43,251 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 17. [2018-06-22 02:11:43,251 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 02:11:43,251 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2018-06-22 02:11:43,251 INFO ]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 11 [2018-06-22 02:11:43,251 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:43,251 INFO ]: Abstraction has 17 states and 28 transitions. [2018-06-22 02:11:43,251 INFO ]: Interpolant automaton has 12 states. [2018-06-22 02:11:43,251 INFO ]: Start isEmpty. Operand 17 states and 28 transitions. [2018-06-22 02:11:43,252 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:11:43,252 INFO ]: Found error trace [2018-06-22 02:11:43,252 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:43,252 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:43,252 INFO ]: Analyzing trace with hash -858419568, now seen corresponding path program 4 times [2018-06-22 02:11:43,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:43,253 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:43,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:43,253 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:43,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:43,266 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:43,335 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:43,335 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:43,335 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:43,341 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:11:43,362 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:11:43,362 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:43,364 INFO ]: Computing forward predicates... [2018-06-22 02:11:43,509 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:43,529 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:43,529 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 02:11:43,530 INFO ]: Interpolant automaton has 12 states [2018-06-22 02:11:43,530 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 02:11:43,530 INFO ]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:11:43,530 INFO ]: Start difference. First operand 17 states and 28 transitions. Second operand 12 states. [2018-06-22 02:11:43,583 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:43,583 INFO ]: Finished difference Result 29 states and 52 transitions. [2018-06-22 02:11:43,583 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 02:11:43,583 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-22 02:11:43,583 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:43,584 INFO ]: With dead ends: 29 [2018-06-22 02:11:43,584 INFO ]: Without dead ends: 29 [2018-06-22 02:11:43,584 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:11:43,584 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 02:11:43,586 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-06-22 02:11:43,586 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 02:11:43,587 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2018-06-22 02:11:43,588 INFO ]: Start accepts. Automaton has 18 states and 30 transitions. Word has length 11 [2018-06-22 02:11:43,588 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:43,588 INFO ]: Abstraction has 18 states and 30 transitions. [2018-06-22 02:11:43,588 INFO ]: Interpolant automaton has 12 states. [2018-06-22 02:11:43,588 INFO ]: Start isEmpty. Operand 18 states and 30 transitions. [2018-06-22 02:11:43,588 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:11:43,588 INFO ]: Found error trace [2018-06-22 02:11:43,588 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:43,588 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:43,589 INFO ]: Analyzing trace with hash -1948319600, now seen corresponding path program 5 times [2018-06-22 02:11:43,589 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:43,589 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:43,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:43,589 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:43,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:43,598 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:43,774 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:43,774 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:43,774 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 02:11:43,780 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:11:43,802 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 02:11:43,802 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:43,804 INFO ]: Computing forward predicates... [2018-06-22 02:11:43,982 WARN ]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-06-22 02:11:44,427 WARN ]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-22 02:11:44,617 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:44,637 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:44,637 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 02:11:44,638 INFO ]: Interpolant automaton has 14 states [2018-06-22 02:11:44,638 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 02:11:44,638 INFO ]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:11:44,638 INFO ]: Start difference. First operand 18 states and 30 transitions. Second operand 14 states. [2018-06-22 02:11:44,845 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:44,845 INFO ]: Finished difference Result 32 states and 58 transitions. [2018-06-22 02:11:44,846 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 02:11:44,846 INFO ]: Start accepts. Automaton has 14 states. Word has length 12 [2018-06-22 02:11:44,846 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:44,846 INFO ]: With dead ends: 32 [2018-06-22 02:11:44,846 INFO ]: Without dead ends: 32 [2018-06-22 02:11:44,847 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:11:44,847 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 02:11:44,849 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-06-22 02:11:44,849 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 02:11:44,849 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. [2018-06-22 02:11:44,849 INFO ]: Start accepts. Automaton has 19 states and 32 transitions. Word has length 12 [2018-06-22 02:11:44,849 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:44,849 INFO ]: Abstraction has 19 states and 32 transitions. [2018-06-22 02:11:44,849 INFO ]: Interpolant automaton has 14 states. [2018-06-22 02:11:44,849 INFO ]: Start isEmpty. Operand 19 states and 32 transitions. [2018-06-22 02:11:44,850 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:11:44,850 INFO ]: Found error trace [2018-06-22 02:11:44,850 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:44,850 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:44,850 INFO ]: Analyzing trace with hash 727954444, now seen corresponding path program 6 times [2018-06-22 02:11:44,850 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:44,850 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:44,851 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:44,851 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:44,851 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:44,858 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:44,944 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:44,944 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:44,944 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:44,950 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:11:45,007 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 02:11:45,007 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:45,009 INFO ]: Computing forward predicates... [2018-06-22 02:11:45,255 INFO ]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:45,276 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:45,276 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-22 02:11:45,276 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:11:45,276 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:11:45,276 INFO ]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:11:45,276 INFO ]: Start difference. First operand 19 states and 32 transitions. Second operand 13 states. [2018-06-22 02:11:46,214 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:46,214 INFO ]: Finished difference Result 56 states and 106 transitions. [2018-06-22 02:11:46,214 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 02:11:46,215 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-22 02:11:46,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:46,215 INFO ]: With dead ends: 56 [2018-06-22 02:11:46,215 INFO ]: Without dead ends: 56 [2018-06-22 02:11:46,216 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=283, Invalid=1277, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 02:11:46,216 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 02:11:46,218 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 19. [2018-06-22 02:11:46,218 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 02:11:46,219 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. [2018-06-22 02:11:46,219 INFO ]: Start accepts. Automaton has 19 states and 32 transitions. Word has length 12 [2018-06-22 02:11:46,219 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:46,219 INFO ]: Abstraction has 19 states and 32 transitions. [2018-06-22 02:11:46,219 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:11:46,219 INFO ]: Start isEmpty. Operand 19 states and 32 transitions. [2018-06-22 02:11:46,219 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:11:46,219 INFO ]: Found error trace [2018-06-22 02:11:46,219 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:46,219 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:46,220 INFO ]: Analyzing trace with hash -846779372, now seen corresponding path program 5 times [2018-06-22 02:11:46,220 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:46,220 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:46,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:46,220 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:46,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:46,228 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:46,319 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:46,319 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:46,319 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:46,327 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:11:46,341 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 02:11:46,341 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:46,343 INFO ]: Computing forward predicates... [2018-06-22 02:11:46,607 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:46,626 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:46,626 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 02:11:46,626 INFO ]: Interpolant automaton has 14 states [2018-06-22 02:11:46,626 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 02:11:46,626 INFO ]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:11:46,626 INFO ]: Start difference. First operand 19 states and 32 transitions. Second operand 14 states. [2018-06-22 02:11:46,744 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:46,744 INFO ]: Finished difference Result 40 states and 74 transitions. [2018-06-22 02:11:46,744 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 02:11:46,744 INFO ]: Start accepts. Automaton has 14 states. Word has length 12 [2018-06-22 02:11:46,744 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:46,744 INFO ]: With dead ends: 40 [2018-06-22 02:11:46,744 INFO ]: Without dead ends: 40 [2018-06-22 02:11:46,745 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:11:46,745 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 02:11:46,747 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 20. [2018-06-22 02:11:46,747 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 02:11:46,747 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2018-06-22 02:11:46,747 INFO ]: Start accepts. Automaton has 20 states and 34 transitions. Word has length 12 [2018-06-22 02:11:46,747 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:46,747 INFO ]: Abstraction has 20 states and 34 transitions. [2018-06-22 02:11:46,747 INFO ]: Interpolant automaton has 14 states. [2018-06-22 02:11:46,747 INFO ]: Start isEmpty. Operand 20 states and 34 transitions. [2018-06-22 02:11:46,749 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 02:11:46,749 INFO ]: Found error trace [2018-06-22 02:11:46,749 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:46,749 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:46,749 INFO ]: Analyzing trace with hash 1086174744, now seen corresponding path program 7 times [2018-06-22 02:11:46,749 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:46,749 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:46,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:46,750 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:46,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:46,759 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:46,888 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:46,888 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:46,888 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 02:11:46,903 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:46,919 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:46,921 INFO ]: Computing forward predicates... [2018-06-22 02:11:47,241 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:47,261 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:47,261 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-22 02:11:47,261 INFO ]: Interpolant automaton has 16 states [2018-06-22 02:11:47,261 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 02:11:47,261 INFO ]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-06-22 02:11:47,262 INFO ]: Start difference. First operand 20 states and 34 transitions. Second operand 16 states. [2018-06-22 02:11:47,375 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:47,375 INFO ]: Finished difference Result 48 states and 90 transitions. [2018-06-22 02:11:47,376 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 02:11:47,376 INFO ]: Start accepts. Automaton has 16 states. Word has length 13 [2018-06-22 02:11:47,376 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:47,377 INFO ]: With dead ends: 48 [2018-06-22 02:11:47,377 INFO ]: Without dead ends: 48 [2018-06-22 02:11:47,377 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:11:47,377 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 02:11:47,379 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 21. [2018-06-22 02:11:47,379 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 02:11:47,379 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2018-06-22 02:11:47,379 INFO ]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 13 [2018-06-22 02:11:47,379 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:47,379 INFO ]: Abstraction has 21 states and 36 transitions. [2018-06-22 02:11:47,379 INFO ]: Interpolant automaton has 16 states. [2018-06-22 02:11:47,379 INFO ]: Start isEmpty. Operand 21 states and 36 transitions. [2018-06-22 02:11:47,382 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 02:11:47,382 INFO ]: Found error trace [2018-06-22 02:11:47,382 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:47,382 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:47,382 INFO ]: Analyzing trace with hash -485933296, now seen corresponding path program 6 times [2018-06-22 02:11:47,382 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:47,382 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:47,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:47,383 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:47,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:47,404 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:47,679 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:47,679 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:47,679 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 02:11:47,685 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:11:47,714 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 02:11:47,714 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:47,716 INFO ]: Computing forward predicates... [2018-06-22 02:11:47,818 INFO ]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:47,838 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:47,838 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-22 02:11:47,838 INFO ]: Interpolant automaton has 15 states [2018-06-22 02:11:47,838 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 02:11:47,838 INFO ]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:11:47,838 INFO ]: Start difference. First operand 21 states and 36 transitions. Second operand 15 states. [2018-06-22 02:11:48,364 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:48,364 INFO ]: Finished difference Result 58 states and 110 transitions. [2018-06-22 02:11:48,364 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 02:11:48,364 INFO ]: Start accepts. Automaton has 15 states. Word has length 13 [2018-06-22 02:11:48,364 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:48,365 INFO ]: With dead ends: 58 [2018-06-22 02:11:48,365 INFO ]: Without dead ends: 58 [2018-06-22 02:11:48,365 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=1127, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 02:11:48,365 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 02:11:48,367 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 17. [2018-06-22 02:11:48,367 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 02:11:48,367 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2018-06-22 02:11:48,367 INFO ]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 13 [2018-06-22 02:11:48,367 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:48,368 INFO ]: Abstraction has 17 states and 28 transitions. [2018-06-22 02:11:48,368 INFO ]: Interpolant automaton has 15 states. [2018-06-22 02:11:48,368 INFO ]: Start isEmpty. Operand 17 states and 28 transitions. [2018-06-22 02:11:48,368 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 02:11:48,368 INFO ]: Found error trace [2018-06-22 02:11:48,368 INFO ]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:48,368 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:48,368 INFO ]: Analyzing trace with hash 92156176, now seen corresponding path program 8 times [2018-06-22 02:11:48,368 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:48,368 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:48,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:48,369 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:48,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:48,379 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:48,500 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:48,500 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:48,500 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:48,506 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:11:48,523 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:11:48,523 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:48,525 INFO ]: Computing forward predicates... [2018-06-22 02:11:48,754 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:48,773 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:48,773 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 02:11:48,773 INFO ]: Interpolant automaton has 18 states [2018-06-22 02:11:48,773 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 02:11:48,773 INFO ]: CoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2018-06-22 02:11:48,773 INFO ]: Start difference. First operand 17 states and 28 transitions. Second operand 18 states. [2018-06-22 02:11:48,876 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:48,876 INFO ]: Finished difference Result 49 states and 92 transitions. [2018-06-22 02:11:48,877 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 02:11:48,877 INFO ]: Start accepts. Automaton has 18 states. Word has length 14 [2018-06-22 02:11:48,877 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:48,877 INFO ]: With dead ends: 49 [2018-06-22 02:11:48,877 INFO ]: Without dead ends: 49 [2018-06-22 02:11:48,877 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2018-06-22 02:11:48,877 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 02:11:48,879 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 18. [2018-06-22 02:11:48,879 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 02:11:48,879 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2018-06-22 02:11:48,879 INFO ]: Start accepts. Automaton has 18 states and 30 transitions. Word has length 14 [2018-06-22 02:11:48,879 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:48,879 INFO ]: Abstraction has 18 states and 30 transitions. [2018-06-22 02:11:48,879 INFO ]: Interpolant automaton has 18 states. [2018-06-22 02:11:48,879 INFO ]: Start isEmpty. Operand 18 states and 30 transitions. [2018-06-22 02:11:48,879 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 02:11:48,879 INFO ]: Found error trace [2018-06-22 02:11:48,879 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:48,879 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:48,880 INFO ]: Analyzing trace with hash -693897844, now seen corresponding path program 9 times [2018-06-22 02:11:48,880 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:48,880 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:48,880 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:48,880 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:48,880 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:48,900 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:49,207 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:49,208 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:49,208 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:49,214 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:11:49,294 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 02:11:49,294 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:49,297 INFO ]: Computing forward predicates... [2018-06-22 02:11:49,533 INFO ]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:49,553 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:49,553 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-06-22 02:11:49,553 INFO ]: Interpolant automaton has 17 states [2018-06-22 02:11:49,553 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 02:11:49,553 INFO ]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:11:49,554 INFO ]: Start difference. First operand 18 states and 30 transitions. Second operand 17 states. [2018-06-22 02:11:50,366 WARN ]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-22 02:11:52,527 WARN ]: Spent 165.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2018-06-22 02:11:53,037 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:53,037 INFO ]: Finished difference Result 128 states and 250 transitions. [2018-06-22 02:11:53,037 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-06-22 02:11:53,038 INFO ]: Start accepts. Automaton has 17 states. Word has length 14 [2018-06-22 02:11:53,038 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:53,038 INFO ]: With dead ends: 128 [2018-06-22 02:11:53,038 INFO ]: Without dead ends: 128 [2018-06-22 02:11:53,040 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2914 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1180, Invalid=7376, Unknown=0, NotChecked=0, Total=8556 [2018-06-22 02:11:53,040 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-22 02:11:53,044 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 18. [2018-06-22 02:11:53,044 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 02:11:53,044 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2018-06-22 02:11:53,044 INFO ]: Start accepts. Automaton has 18 states and 30 transitions. Word has length 14 [2018-06-22 02:11:53,044 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:53,044 INFO ]: Abstraction has 18 states and 30 transitions. [2018-06-22 02:11:53,044 INFO ]: Interpolant automaton has 17 states. [2018-06-22 02:11:53,044 INFO ]: Start isEmpty. Operand 18 states and 30 transitions. [2018-06-22 02:11:53,045 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 02:11:53,045 INFO ]: Found error trace [2018-06-22 02:11:53,045 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:53,045 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:53,045 INFO ]: Analyzing trace with hash 2110360468, now seen corresponding path program 7 times [2018-06-22 02:11:53,045 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:53,045 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:53,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:53,045 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:53,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:53,054 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:53,351 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:53,351 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:53,351 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:53,357 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:53,381 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:53,384 INFO ]: Computing forward predicates... [2018-06-22 02:11:53,762 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:53,782 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:53,782 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 02:11:53,782 INFO ]: Interpolant automaton has 18 states [2018-06-22 02:11:53,783 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 02:11:53,783 INFO ]: CoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2018-06-22 02:11:53,783 INFO ]: Start difference. First operand 18 states and 30 transitions. Second operand 18 states. [2018-06-22 02:11:53,853 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:53,853 INFO ]: Finished difference Result 64 states and 122 transitions. [2018-06-22 02:11:53,853 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 02:11:53,853 INFO ]: Start accepts. Automaton has 18 states. Word has length 14 [2018-06-22 02:11:53,853 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:53,853 INFO ]: With dead ends: 64 [2018-06-22 02:11:53,853 INFO ]: Without dead ends: 64 [2018-06-22 02:11:53,854 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2018-06-22 02:11:53,854 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 02:11:53,856 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 19. [2018-06-22 02:11:53,856 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 02:11:53,856 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. [2018-06-22 02:11:53,856 INFO ]: Start accepts. Automaton has 19 states and 32 transitions. Word has length 14 [2018-06-22 02:11:53,856 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:53,856 INFO ]: Abstraction has 19 states and 32 transitions. [2018-06-22 02:11:53,857 INFO ]: Interpolant automaton has 18 states. [2018-06-22 02:11:53,857 INFO ]: Start isEmpty. Operand 19 states and 32 transitions. [2018-06-22 02:11:53,857 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 02:11:53,857 INFO ]: Found error trace [2018-06-22 02:11:53,857 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:53,857 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:53,857 INFO ]: Analyzing trace with hash -41573224, now seen corresponding path program 10 times [2018-06-22 02:11:53,857 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:53,857 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:53,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:53,858 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:53,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:53,871 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:54,015 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:54,016 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:54,016 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:54,022 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:11:54,039 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:11:54,039 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:54,041 INFO ]: Computing forward predicates... [2018-06-22 02:11:54,693 WARN ]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-22 02:11:54,863 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:54,889 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:54,889 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-22 02:11:54,889 INFO ]: Interpolant automaton has 20 states [2018-06-22 02:11:54,889 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 02:11:54,889 INFO ]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2018-06-22 02:11:54,889 INFO ]: Start difference. First operand 19 states and 32 transitions. Second operand 20 states. [2018-06-22 02:11:55,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:55,068 INFO ]: Finished difference Result 69 states and 132 transitions. [2018-06-22 02:11:55,068 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 02:11:55,068 INFO ]: Start accepts. Automaton has 20 states. Word has length 15 [2018-06-22 02:11:55,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:55,069 INFO ]: With dead ends: 69 [2018-06-22 02:11:55,069 INFO ]: Without dead ends: 69 [2018-06-22 02:11:55,069 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2018-06-22 02:11:55,069 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 02:11:55,071 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 20. [2018-06-22 02:11:55,071 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 02:11:55,071 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2018-06-22 02:11:55,071 INFO ]: Start accepts. Automaton has 20 states and 34 transitions. Word has length 15 [2018-06-22 02:11:55,071 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:55,072 INFO ]: Abstraction has 20 states and 34 transitions. [2018-06-22 02:11:55,072 INFO ]: Interpolant automaton has 20 states. [2018-06-22 02:11:55,072 INFO ]: Start isEmpty. Operand 20 states and 34 transitions. [2018-06-22 02:11:55,074 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 02:11:55,074 INFO ]: Found error trace [2018-06-22 02:11:55,074 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:55,074 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:55,075 INFO ]: Analyzing trace with hash 991088528, now seen corresponding path program 8 times [2018-06-22 02:11:55,075 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:55,075 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:55,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:55,075 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:55,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:55,084 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:55,221 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:55,221 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:55,221 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:55,227 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:11:55,273 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:11:55,273 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:55,276 INFO ]: Computing forward predicates... [2018-06-22 02:11:56,080 WARN ]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-06-22 02:11:56,319 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:56,339 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:56,339 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-22 02:11:56,339 INFO ]: Interpolant automaton has 20 states [2018-06-22 02:11:56,339 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 02:11:56,339 INFO ]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-06-22 02:11:56,339 INFO ]: Start difference. First operand 20 states and 34 transitions. Second operand 20 states. [2018-06-22 02:11:56,552 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:56,552 INFO ]: Finished difference Result 92 states and 178 transitions. [2018-06-22 02:11:56,553 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 02:11:56,553 INFO ]: Start accepts. Automaton has 20 states. Word has length 15 [2018-06-22 02:11:56,553 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:56,553 INFO ]: With dead ends: 92 [2018-06-22 02:11:56,553 INFO ]: Without dead ends: 92 [2018-06-22 02:11:56,554 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-06-22 02:11:56,554 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-22 02:11:56,556 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 21. [2018-06-22 02:11:56,556 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 02:11:56,557 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2018-06-22 02:11:56,557 INFO ]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 15 [2018-06-22 02:11:56,557 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:56,557 INFO ]: Abstraction has 21 states and 36 transitions. [2018-06-22 02:11:56,557 INFO ]: Interpolant automaton has 20 states. [2018-06-22 02:11:56,557 INFO ]: Start isEmpty. Operand 21 states and 36 transitions. [2018-06-22 02:11:56,557 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 02:11:56,557 INFO ]: Found error trace [2018-06-22 02:11:56,557 INFO ]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:56,558 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:56,558 INFO ]: Analyzing trace with hash -1810677360, now seen corresponding path program 11 times [2018-06-22 02:11:56,558 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:56,558 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:56,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:56,558 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:56,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:56,566 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:57,603 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:57,603 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:57,603 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:57,611 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:11:57,632 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 02:11:57,632 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:57,634 INFO ]: Computing forward predicates... [2018-06-22 02:11:57,862 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:57,882 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:57,882 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-22 02:11:57,883 INFO ]: Interpolant automaton has 22 states [2018-06-22 02:11:57,883 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 02:11:57,883 INFO ]: CoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2018-06-22 02:11:57,883 INFO ]: Start difference. First operand 21 states and 36 transitions. Second operand 22 states. [2018-06-22 02:11:57,961 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:57,961 INFO ]: Finished difference Result 70 states and 134 transitions. [2018-06-22 02:11:57,963 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 02:11:57,963 INFO ]: Start accepts. Automaton has 22 states. Word has length 16 [2018-06-22 02:11:57,963 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:57,963 INFO ]: With dead ends: 70 [2018-06-22 02:11:57,963 INFO ]: Without dead ends: 70 [2018-06-22 02:11:57,963 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-06-22 02:11:57,963 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 02:11:57,965 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 22. [2018-06-22 02:11:57,965 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 02:11:57,965 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 38 transitions. [2018-06-22 02:11:57,966 INFO ]: Start accepts. Automaton has 22 states and 38 transitions. Word has length 16 [2018-06-22 02:11:57,966 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:57,966 INFO ]: Abstraction has 22 states and 38 transitions. [2018-06-22 02:11:57,966 INFO ]: Interpolant automaton has 22 states. [2018-06-22 02:11:57,966 INFO ]: Start isEmpty. Operand 22 states and 38 transitions. [2018-06-22 02:11:57,966 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 02:11:57,966 INFO ]: Found error trace [2018-06-22 02:11:57,966 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:57,966 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:57,966 INFO ]: Analyzing trace with hash -1294346484, now seen corresponding path program 12 times [2018-06-22 02:11:57,966 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:57,966 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:57,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:57,967 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:57,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:57,974 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:58,546 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:58,574 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:58,574 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:58,580 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:11:58,601 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 02:11:58,601 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:58,604 INFO ]: Computing forward predicates... [2018-06-22 02:11:58,842 INFO ]: Checked inductivity of 45 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:58,872 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:58,872 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-06-22 02:11:58,873 INFO ]: Interpolant automaton has 21 states [2018-06-22 02:11:58,873 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 02:11:58,873 INFO ]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-06-22 02:11:58,873 INFO ]: Start difference. First operand 22 states and 38 transitions. Second operand 21 states. [2018-06-22 02:12:00,222 WARN ]: Spent 149.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-06-22 02:12:01,342 WARN ]: Spent 448.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2018-06-22 02:12:02,754 WARN ]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-22 02:12:08,925 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:08,925 INFO ]: Finished difference Result 257 states and 508 transitions. [2018-06-22 02:12:08,926 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-06-22 02:12:08,926 INFO ]: Start accepts. Automaton has 21 states. Word has length 16 [2018-06-22 02:12:08,927 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:08,929 INFO ]: With dead ends: 257 [2018-06-22 02:12:08,929 INFO ]: Without dead ends: 257 [2018-06-22 02:12:08,940 INFO ]: 0 DeclaredPredicates, 224 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19646 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=4771, Invalid=42535, Unknown=0, NotChecked=0, Total=47306 [2018-06-22 02:12:08,941 INFO ]: Start minimizeSevpa. Operand 257 states. [2018-06-22 02:12:08,944 INFO ]: Finished minimizeSevpa. Reduced states from 257 to 22. [2018-06-22 02:12:08,945 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 02:12:08,945 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 38 transitions. [2018-06-22 02:12:08,945 INFO ]: Start accepts. Automaton has 22 states and 38 transitions. Word has length 16 [2018-06-22 02:12:08,945 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:08,945 INFO ]: Abstraction has 22 states and 38 transitions. [2018-06-22 02:12:08,945 INFO ]: Interpolant automaton has 21 states. [2018-06-22 02:12:08,945 INFO ]: Start isEmpty. Operand 22 states and 38 transitions. [2018-06-22 02:12:08,946 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 02:12:08,946 INFO ]: Found error trace [2018-06-22 02:12:08,946 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:08,946 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:08,946 INFO ]: Analyzing trace with hash 653396756, now seen corresponding path program 9 times [2018-06-22 02:12:08,946 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:08,946 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:08,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:08,947 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:12:08,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:08,956 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:09,095 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:09,095 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:12:09,095 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:12:09,101 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:12:09,123 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 02:12:09,123 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:09,125 INFO ]: Computing forward predicates... [2018-06-22 02:12:09,304 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:09,323 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:12:09,323 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-22 02:12:09,323 INFO ]: Interpolant automaton has 22 states [2018-06-22 02:12:09,324 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 02:12:09,324 INFO ]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-06-22 02:12:09,324 INFO ]: Start difference. First operand 22 states and 38 transitions. Second operand 22 states. [2018-06-22 02:12:10,839 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:10,839 INFO ]: Finished difference Result 124 states and 242 transitions. [2018-06-22 02:12:10,839 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 02:12:10,839 INFO ]: Start accepts. Automaton has 22 states. Word has length 16 [2018-06-22 02:12:10,839 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:10,840 INFO ]: With dead ends: 124 [2018-06-22 02:12:10,840 INFO ]: Without dead ends: 124 [2018-06-22 02:12:10,840 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=549, Invalid=2207, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 02:12:10,840 INFO ]: Start minimizeSevpa. Operand 124 states. [2018-06-22 02:12:10,842 INFO ]: Finished minimizeSevpa. Reduced states from 124 to 23. [2018-06-22 02:12:10,842 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 02:12:10,843 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 40 transitions. [2018-06-22 02:12:10,843 INFO ]: Start accepts. Automaton has 23 states and 40 transitions. Word has length 16 [2018-06-22 02:12:10,843 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:10,843 INFO ]: Abstraction has 23 states and 40 transitions. [2018-06-22 02:12:10,843 INFO ]: Interpolant automaton has 22 states. [2018-06-22 02:12:10,843 INFO ]: Start isEmpty. Operand 23 states and 40 transitions. [2018-06-22 02:12:10,843 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 02:12:10,843 INFO ]: Found error trace [2018-06-22 02:12:10,843 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:10,844 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:10,844 INFO ]: Analyzing trace with hash -1475611880, now seen corresponding path program 13 times [2018-06-22 02:12:10,844 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:10,844 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:10,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:10,844 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:12:10,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:10,852 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:11,010 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:11,010 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:12:11,010 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:12:11,016 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:12:11,035 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:11,038 INFO ]: Computing forward predicates... [2018-06-22 02:12:11,438 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:11,457 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:12:11,458 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-22 02:12:11,458 INFO ]: Interpolant automaton has 24 states [2018-06-22 02:12:11,458 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 02:12:11,458 INFO ]: CoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2018-06-22 02:12:11,458 INFO ]: Start difference. First operand 23 states and 40 transitions. Second operand 24 states. [2018-06-22 02:12:11,596 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:11,596 INFO ]: Finished difference Result 93 states and 180 transitions. [2018-06-22 02:12:11,596 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 02:12:11,596 INFO ]: Start accepts. Automaton has 24 states. Word has length 17 [2018-06-22 02:12:11,596 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:11,597 INFO ]: With dead ends: 93 [2018-06-22 02:12:11,597 INFO ]: Without dead ends: 93 [2018-06-22 02:12:11,597 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2018-06-22 02:12:11,597 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 02:12:11,599 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 24. [2018-06-22 02:12:11,599 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 02:12:11,600 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 42 transitions. [2018-06-22 02:12:11,600 INFO ]: Start accepts. Automaton has 24 states and 42 transitions. Word has length 17 [2018-06-22 02:12:11,600 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:11,600 INFO ]: Abstraction has 24 states and 42 transitions. [2018-06-22 02:12:11,600 INFO ]: Interpolant automaton has 24 states. [2018-06-22 02:12:11,600 INFO ]: Start isEmpty. Operand 24 states and 42 transitions. [2018-06-22 02:12:11,600 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 02:12:11,600 INFO ]: Found error trace [2018-06-22 02:12:11,600 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:11,600 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:11,600 INFO ]: Analyzing trace with hash -1225113584, now seen corresponding path program 10 times [2018-06-22 02:12:11,600 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:11,600 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:11,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:11,603 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:12:11,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:11,611 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:11,914 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 02:12:12,193 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:12,193 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:12:12,193 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:12:12,199 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:12:12,220 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:12:12,220 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:12,223 INFO ]: Computing forward predicates... [2018-06-22 02:12:12,467 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:12,487 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:12:12,487 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-22 02:12:12,487 INFO ]: Interpolant automaton has 24 states [2018-06-22 02:12:12,487 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 02:12:12,487 INFO ]: CoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2018-06-22 02:12:12,487 INFO ]: Start difference. First operand 24 states and 42 transitions. Second operand 24 states. [2018-06-22 02:12:12,603 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:12,604 INFO ]: Finished difference Result 91 states and 176 transitions. [2018-06-22 02:12:12,604 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 02:12:12,604 INFO ]: Start accepts. Automaton has 24 states. Word has length 17 [2018-06-22 02:12:12,604 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:12,604 INFO ]: With dead ends: 91 [2018-06-22 02:12:12,604 INFO ]: Without dead ends: 91 [2018-06-22 02:12:12,605 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2018-06-22 02:12:12,605 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 02:12:12,607 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 25. [2018-06-22 02:12:12,607 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 02:12:12,607 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. [2018-06-22 02:12:12,607 INFO ]: Start accepts. Automaton has 25 states and 44 transitions. Word has length 17 [2018-06-22 02:12:12,607 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:12,607 INFO ]: Abstraction has 25 states and 44 transitions. [2018-06-22 02:12:12,607 INFO ]: Interpolant automaton has 24 states. [2018-06-22 02:12:12,607 INFO ]: Start isEmpty. Operand 25 states and 44 transitions. [2018-06-22 02:12:12,608 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 02:12:12,608 INFO ]: Found error trace [2018-06-22 02:12:12,608 INFO ]: trace histogram [9, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:12,608 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:12,608 INFO ]: Analyzing trace with hash -777637360, now seen corresponding path program 14 times [2018-06-22 02:12:12,608 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:12,608 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:12,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:12,609 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:12:12,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:12,623 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:12,943 WARN ]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 02:12:13,136 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 02:12:13,353 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 02:12:13,583 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 02:12:13,666 INFO ]: Checked inductivity of 66 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:13,666 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:12:13,666 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:12:13,674 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:12:13,700 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:12:13,700 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:13,704 INFO ]: Computing forward predicates... [2018-06-22 02:12:13,855 INFO ]: Checked inductivity of 66 backedges. 2 proven. 63 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:12:13,874 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:12:13,875 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-06-22 02:12:13,875 INFO ]: Interpolant automaton has 23 states [2018-06-22 02:12:13,875 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 02:12:13,875 INFO ]: CoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2018-06-22 02:12:13,875 INFO ]: Start difference. First operand 25 states and 44 transitions. Second operand 23 states. [2018-06-22 02:12:19,353 WARN ]: Spent 260.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-06-22 02:12:19,767 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:19,768 INFO ]: Finished difference Result 216 states and 426 transitions. [2018-06-22 02:12:19,769 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-06-22 02:12:19,769 INFO ]: Start accepts. Automaton has 23 states. Word has length 18 [2018-06-22 02:12:19,769 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:19,770 INFO ]: With dead ends: 216 [2018-06-22 02:12:19,770 INFO ]: Without dead ends: 216 [2018-06-22 02:12:19,771 INFO ]: 0 DeclaredPredicates, 165 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9030 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2764, Invalid=21728, Unknown=0, NotChecked=0, Total=24492 [2018-06-22 02:12:19,771 INFO ]: Start minimizeSevpa. Operand 216 states. [2018-06-22 02:12:19,774 INFO ]: Finished minimizeSevpa. Reduced states from 216 to 22. [2018-06-22 02:12:19,774 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 02:12:19,774 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 38 transitions. [2018-06-22 02:12:19,774 INFO ]: Start accepts. Automaton has 22 states and 38 transitions. Word has length 18 [2018-06-22 02:12:19,774 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:19,774 INFO ]: Abstraction has 22 states and 38 transitions. [2018-06-22 02:12:19,774 INFO ]: Interpolant automaton has 23 states. [2018-06-22 02:12:19,774 INFO ]: Start isEmpty. Operand 22 states and 38 transitions. [2018-06-22 02:12:19,775 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 02:12:19,775 INFO ]: Found error trace [2018-06-22 02:12:19,775 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:19,775 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:19,775 INFO ]: Analyzing trace with hash 670608020, now seen corresponding path program 11 times [2018-06-22 02:12:19,775 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:19,775 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:19,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:19,776 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:12:19,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:19,787 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:19,971 WARN ]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 02:12:20,127 INFO ]: Checked inductivity of 66 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:20,127 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:12:20,128 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:12:20,134 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:12:20,160 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 02:12:20,160 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:20,164 INFO ]: Computing forward predicates... [2018-06-22 02:12:20,531 INFO ]: Checked inductivity of 66 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:20,552 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:12:20,552 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-22 02:12:20,552 INFO ]: Interpolant automaton has 24 states [2018-06-22 02:12:20,553 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 02:12:20,553 INFO ]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-06-22 02:12:20,553 INFO ]: Start difference. First operand 22 states and 38 transitions. Second operand 24 states. [2018-06-22 02:12:20,789 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:20,789 INFO ]: Finished difference Result 53 states and 100 transitions. [2018-06-22 02:12:20,790 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 02:12:20,790 INFO ]: Start accepts. Automaton has 24 states. Word has length 18 [2018-06-22 02:12:20,790 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:20,790 INFO ]: With dead ends: 53 [2018-06-22 02:12:20,790 INFO ]: Without dead ends: 53 [2018-06-22 02:12:20,791 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-06-22 02:12:20,791 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 02:12:20,793 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-06-22 02:12:20,793 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 02:12:20,793 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 58 transitions. [2018-06-22 02:12:20,793 INFO ]: Start accepts. Automaton has 32 states and 58 transitions. Word has length 18 [2018-06-22 02:12:20,793 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:20,793 INFO ]: Abstraction has 32 states and 58 transitions. [2018-06-22 02:12:20,793 INFO ]: Interpolant automaton has 24 states. [2018-06-22 02:12:20,793 INFO ]: Start isEmpty. Operand 32 states and 58 transitions. [2018-06-22 02:12:20,799 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 02:12:20,799 INFO ]: Found error trace [2018-06-22 02:12:20,799 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:20,799 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:20,799 INFO ]: Analyzing trace with hash -902258280, now seen corresponding path program 15 times [2018-06-22 02:12:20,799 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:20,799 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:20,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:20,799 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:12:20,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:20,808 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:21,010 INFO ]: Checked inductivity of 78 backedges. 67 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:21,010 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:12:21,010 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:12:21,020 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:12:21,047 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 02:12:21,047 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:21,049 INFO ]: Computing forward predicates... [2018-06-22 02:12:21,062 INFO ]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:21,082 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:12:21,082 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 15 [2018-06-22 02:12:21,082 INFO ]: Interpolant automaton has 15 states [2018-06-22 02:12:21,083 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 02:12:21,083 INFO ]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:12:21,083 INFO ]: Start difference. First operand 32 states and 58 transitions. Second operand 15 states. [2018-06-22 02:12:21,134 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:21,134 INFO ]: Finished difference Result 105 states and 208 transitions. [2018-06-22 02:12:21,135 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 02:12:21,135 INFO ]: Start accepts. Automaton has 15 states. Word has length 19 [2018-06-22 02:12:21,135 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:21,135 INFO ]: With dead ends: 105 [2018-06-22 02:12:21,135 INFO ]: Without dead ends: 0 [2018-06-22 02:12:21,135 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:12:21,135 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 02:12:21,135 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 02:12:21,135 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 02:12:21,135 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 02:12:21,135 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-06-22 02:12:21,135 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:21,135 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 02:12:21,135 INFO ]: Interpolant automaton has 15 states. [2018-06-22 02:12:21,135 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 02:12:21,135 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 02:12:21,140 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:12:21 BoogieIcfgContainer [2018-06-22 02:12:21,140 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 02:12:21,141 INFO ]: Toolchain (without parser) took 45214.28 ms. Allocated memory was 308.8 MB in the beginning and 585.6 MB in the end (delta: 276.8 MB). Free memory was 263.2 MB in the beginning and 262.2 MB in the end (delta: 991.0 kB). Peak memory consumption was 277.8 MB. Max. memory is 3.6 GB. [2018-06-22 02:12:21,142 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 02:12:21,142 INFO ]: ChcToBoogie took 58.84 ms. Allocated memory is still 308.8 MB. Free memory was 263.2 MB in the beginning and 261.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:12:21,143 INFO ]: Boogie Preprocessor took 34.49 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 260.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 02:12:21,143 INFO ]: RCFGBuilder took 181.56 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 252.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:12:21,143 INFO ]: TraceAbstraction took 44923.86 ms. Allocated memory was 308.8 MB in the beginning and 585.6 MB in the end (delta: 276.8 MB). Free memory was 252.2 MB in the beginning and 262.2 MB in the end (delta: -10.0 MB). Peak memory consumption was 266.8 MB. Max. memory is 3.6 GB. [2018-06-22 02:12:21,145 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 58.84 ms. Allocated memory is still 308.8 MB. Free memory was 263.2 MB in the beginning and 261.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 34.49 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 260.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 181.56 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 252.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 44923.86 ms. Allocated memory was 308.8 MB in the beginning and 585.6 MB in the end (delta: 276.8 MB). Free memory was 252.2 MB in the beginning and 262.2 MB in the end (delta: -10.0 MB). Peak memory consumption was 266.8 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 2 procedures, 10 locations, 1 error locations. SAFE Result, 44.8s OverallTime, 29 OverallIterations, 11 TraceHistogramMax, 26.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 207 SDtfs, 2 SDslu, 1299 SDs, 0 SdLazy, 5965 SolverSat, 973 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1108 GetRequests, 218 SyntacticMatches, 3 SemanticMatches, 887 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34386 ImplicationChecksByTransitivity, 33.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 1244 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 733 NumberOfCodeBlocks, 733 NumberOfCodeBlocksAsserted, 108 NumberOfCheckSat, 677 ConstructedInterpolants, 0 QuantifiedInterpolants, 95809 SizeOfPredicates, 101 NumberOfNonLiveVariables, 3596 ConjunctsInSsa, 1742 ConjunctsInUnsatCore, 56 InterpolantComputations, 5 PerfectInterpolantSequences, 222/1499 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/loop__break_single.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_02-12-21-155.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__break_single.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_02-12-21-155.csv Received shutdown request...