java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/cav12/bubblesort-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 20:24:34,500 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 20:24:34,503 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 20:24:34,521 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 20:24:34,522 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 20:24:34,523 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 20:24:34,524 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 20:24:34,526 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 20:24:34,527 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 20:24:34,528 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 20:24:34,529 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 20:24:34,529 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 20:24:34,530 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 20:24:34,531 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 20:24:34,532 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 20:24:34,532 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 20:24:34,533 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 20:24:34,535 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 20:24:34,537 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 20:24:34,538 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 20:24:34,539 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 20:24:34,540 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 20:24:34,543 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 20:24:34,543 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 20:24:34,543 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 20:24:34,544 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 20:24:34,545 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 20:24:34,546 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 20:24:34,546 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 20:24:34,547 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 20:24:34,548 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 20:24:34,548 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 20:24:34,549 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 20:24:34,549 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 20:24:34,550 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 20:24:34,550 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 20:24:34,551 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 20:24:34,571 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 20:24:34,572 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 20:24:34,572 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 20:24:34,572 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 20:24:34,579 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 20:24:34,579 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 20:24:34,579 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 20:24:34,581 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 20:24:34,581 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 20:24:34,581 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 20:24:34,581 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 20:24:34,581 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 20:24:34,582 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:24:34,582 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 20:24:34,582 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 20:24:34,582 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 20:24:34,582 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 20:24:34,583 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 20:24:34,583 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 20:24:34,583 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 20:24:34,583 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 20:24:34,585 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 20:24:34,586 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 20:24:34,637 INFO ]: Repository-Root is: /tmp [2018-06-26 20:24:34,650 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 20:24:34,658 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 20:24:34,659 INFO ]: Initializing SmtParser... [2018-06-26 20:24:34,659 INFO ]: SmtParser initialized [2018-06-26 20:24:34,660 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/bubblesort-1.smt2 [2018-06-26 20:24:34,661 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-26 20:24:34,752 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/bubblesort-1.smt2 unknown [2018-06-26 20:24:35,189 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/bubblesort-1.smt2 [2018-06-26 20:24:35,194 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 20:24:35,200 INFO ]: Walking toolchain with 5 elements. [2018-06-26 20:24:35,201 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 20:24:35,201 INFO ]: Initializing ChcToBoogie... [2018-06-26 20:24:35,201 INFO ]: ChcToBoogie initialized [2018-06-26 20:24:35,204 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:24:35" (1/1) ... [2018-06-26 20:24:35,278 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:24:35 Unit [2018-06-26 20:24:35,278 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 20:24:35,278 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 20:24:35,278 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 20:24:35,278 INFO ]: Boogie Preprocessor initialized [2018-06-26 20:24:35,298 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:24:35" (1/1) ... [2018-06-26 20:24:35,298 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:24:35" (1/1) ... [2018-06-26 20:24:35,307 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:24:35" (1/1) ... [2018-06-26 20:24:35,307 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:24:35" (1/1) ... [2018-06-26 20:24:35,317 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:24:35" (1/1) ... [2018-06-26 20:24:35,319 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:24:35" (1/1) ... [2018-06-26 20:24:35,326 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:24:35" (1/1) ... [2018-06-26 20:24:35,329 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 20:24:35,330 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 20:24:35,330 INFO ]: Initializing RCFGBuilder... [2018-06-26 20:24:35,330 INFO ]: RCFGBuilder initialized [2018-06-26 20:24:35,330 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:24: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-26 20:24:35,340 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 20:24:35,340 INFO ]: Found specification of procedure gotoProc [2018-06-26 20:24:35,340 INFO ]: Found implementation of procedure gotoProc [2018-06-26 20:24:35,340 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 20:24:35,340 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 20:24:35,340 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-26 20:24:35,745 INFO ]: Using library mode [2018-06-26 20:24:35,746 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:24:35 BoogieIcfgContainer [2018-06-26 20:24:35,746 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 20:24:35,746 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 20:24:35,746 INFO ]: Initializing BlockEncodingV2... [2018-06-26 20:24:35,747 INFO ]: BlockEncodingV2 initialized [2018-06-26 20:24:35,748 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:24:35" (1/1) ... [2018-06-26 20:24:35,768 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 20:24:35,771 INFO ]: Using Remove infeasible edges [2018-06-26 20:24:35,771 INFO ]: Using Maximize final states [2018-06-26 20:24:35,772 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 20:24:35,772 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 20:24:35,773 INFO ]: Using Remove sink states [2018-06-26 20:24:35,776 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 20:24:35,776 INFO ]: Using Use SBE [2018-06-26 20:24:36,250 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 20:24:42,782 INFO ]: SBE split 1 edges [2018-06-26 20:24:43,463 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 20:24:43,467 INFO ]: 0 new accepting states [2018-06-26 20:24:43,523 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 20:24:43,526 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:24:44,823 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 20:24:44,825 INFO ]: 0 new accepting states [2018-06-26 20:24:44,827 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 20:24:44,827 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:24:45,807 INFO ]: Encoded RCFG 6 locations, 3718 edges [2018-06-26 20:24:45,808 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:24:45 BasicIcfg [2018-06-26 20:24:45,808 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 20:24:45,809 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 20:24:45,809 INFO ]: Initializing TraceAbstraction... [2018-06-26 20:24:45,812 INFO ]: TraceAbstraction initialized [2018-06-26 20:24:45,812 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:24:35" (1/4) ... [2018-06-26 20:24:45,813 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1311de7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 08:24:45, skipping insertion in model container [2018-06-26 20:24:45,813 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:24:35" (2/4) ... [2018-06-26 20:24:45,814 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1311de7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 08:24:45, skipping insertion in model container [2018-06-26 20:24:45,814 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:24:35" (3/4) ... [2018-06-26 20:24:45,814 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1311de7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:24:45, skipping insertion in model container [2018-06-26 20:24:45,814 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:24:45" (4/4) ... [2018-06-26 20:24:45,815 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 20:24:45,825 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 20:24:45,834 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 20:24:45,874 INFO ]: Using default assertion order modulation [2018-06-26 20:24:45,874 INFO ]: Interprodecural is true [2018-06-26 20:24:45,874 INFO ]: Hoare is false [2018-06-26 20:24:45,874 INFO ]: Compute interpolants for FPandBP [2018-06-26 20:24:45,874 INFO ]: Backedges is TWOTRACK [2018-06-26 20:24:45,874 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 20:24:45,874 INFO ]: Difference is false [2018-06-26 20:24:45,874 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 20:24:45,874 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 20:24:45,892 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 20:24:45,924 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 20:24:45,924 INFO ]: Found error trace [2018-06-26 20:24:45,925 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 20:24:45,926 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:24:45,931 INFO ]: Analyzing trace with hash 149584738, now seen corresponding path program 1 times [2018-06-26 20:24:45,933 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:24:45,933 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:24:45,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:24:45,981 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:24:45,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:24:46,059 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:24:46,175 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:24:46,178 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:24:46,178 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:24:46,180 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:24:46,193 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:24:46,194 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:24:46,196 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 20:25:01,208 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:25:01,208 INFO ]: Finished difference Result 7 states and 56 transitions. [2018-06-26 20:25:01,208 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:25:01,209 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 20:25:01,209 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:25:01,218 INFO ]: With dead ends: 7 [2018-06-26 20:25:01,218 INFO ]: Without dead ends: 7 [2018-06-26 20:25:01,220 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-26 20:25:01,235 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 20:25:01,248 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 20:25:01,249 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 20:25:01,249 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-06-26 20:25:01,250 INFO ]: Start accepts. Automaton has 7 states and 56 transitions. Word has length 5 [2018-06-26 20:25:01,251 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:25:01,251 INFO ]: Abstraction has 7 states and 56 transitions. [2018-06-26 20:25:01,251 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:25:01,251 INFO ]: Start isEmpty. Operand 7 states and 56 transitions. [2018-06-26 20:25:01,251 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:25:01,251 INFO ]: Found error trace [2018-06-26 20:25:01,251 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:25:01,251 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:25:01,251 INFO ]: Analyzing trace with hash 273963337, now seen corresponding path program 1 times [2018-06-26 20:25:01,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:25:01,252 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:25:01,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:01,253 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:25:01,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:01,281 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:25:01,338 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:25:01,338 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:25:01,338 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:25:01,339 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:25:01,340 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:25:01,340 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:25:01,340 INFO ]: Start difference. First operand 7 states and 56 transitions. Second operand 3 states. [2018-06-26 20:25:01,616 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:25:01,616 INFO ]: Finished difference Result 9 states and 87 transitions. [2018-06-26 20:25:01,617 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:25:01,617 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:25:01,617 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:25:01,618 INFO ]: With dead ends: 9 [2018-06-26 20:25:01,618 INFO ]: Without dead ends: 9 [2018-06-26 20:25:01,618 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-26 20:25:01,618 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 20:25:01,620 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 20:25:01,621 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 20:25:01,621 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2018-06-26 20:25:01,621 INFO ]: Start accepts. Automaton has 9 states and 87 transitions. Word has length 6 [2018-06-26 20:25:01,621 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:25:01,621 INFO ]: Abstraction has 9 states and 87 transitions. [2018-06-26 20:25:01,621 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:25:01,621 INFO ]: Start isEmpty. Operand 9 states and 87 transitions. [2018-06-26 20:25:01,622 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:25:01,622 INFO ]: Found error trace [2018-06-26 20:25:01,622 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:25:01,622 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:25:01,622 INFO ]: Analyzing trace with hash 276078498, now seen corresponding path program 1 times [2018-06-26 20:25:01,622 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:25:01,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:25:01,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:01,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:25:01,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:01,652 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:25:01,688 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:25:01,688 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:25:01,688 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:25:01,689 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:25:01,689 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:25:01,689 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:25:01,689 INFO ]: Start difference. First operand 9 states and 87 transitions. Second operand 3 states. [2018-06-26 20:25:02,562 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:25:02,562 INFO ]: Finished difference Result 13 states and 112 transitions. [2018-06-26 20:25:02,562 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:25:02,562 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:25:02,562 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:25:02,563 INFO ]: With dead ends: 13 [2018-06-26 20:25:02,563 INFO ]: Without dead ends: 13 [2018-06-26 20:25:02,563 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-26 20:25:02,563 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 20:25:02,565 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 20:25:02,565 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 20:25:02,566 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2018-06-26 20:25:02,566 INFO ]: Start accepts. Automaton has 13 states and 112 transitions. Word has length 6 [2018-06-26 20:25:02,566 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:25:02,566 INFO ]: Abstraction has 13 states and 112 transitions. [2018-06-26 20:25:02,566 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:25:02,566 INFO ]: Start isEmpty. Operand 13 states and 112 transitions. [2018-06-26 20:25:02,566 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:25:02,566 INFO ]: Found error trace [2018-06-26 20:25:02,566 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:25:02,567 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:25:02,567 INFO ]: Analyzing trace with hash 270865073, now seen corresponding path program 1 times [2018-06-26 20:25:02,567 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:25:02,567 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:25:02,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:02,568 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:25:02,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:02,586 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:25:02,624 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:25:02,624 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:25:02,624 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:25:02,624 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:25:02,624 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:25:02,624 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:25:02,624 INFO ]: Start difference. First operand 13 states and 112 transitions. Second operand 3 states. [2018-06-26 20:25:02,726 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:25:02,727 INFO ]: Finished difference Result 20 states and 136 transitions. [2018-06-26 20:25:02,727 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:25:02,727 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:25:02,727 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:25:02,728 INFO ]: With dead ends: 20 [2018-06-26 20:25:02,728 INFO ]: Without dead ends: 20 [2018-06-26 20:25:02,728 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-26 20:25:02,728 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 20:25:02,732 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-06-26 20:25:02,732 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 20:25:02,732 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 128 transitions. [2018-06-26 20:25:02,733 INFO ]: Start accepts. Automaton has 17 states and 128 transitions. Word has length 6 [2018-06-26 20:25:02,733 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:25:02,733 INFO ]: Abstraction has 17 states and 128 transitions. [2018-06-26 20:25:02,733 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:25:02,733 INFO ]: Start isEmpty. Operand 17 states and 128 transitions. [2018-06-26 20:25:02,733 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:25:02,733 INFO ]: Found error trace [2018-06-26 20:25:02,733 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:25:02,733 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:25:02,733 INFO ]: Analyzing trace with hash 1515917958, now seen corresponding path program 1 times [2018-06-26 20:25:02,733 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:25:02,733 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:25:02,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:02,734 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:25:02,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:02,775 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:25:02,889 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:25:02,889 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:25:02,889 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:25:02,889 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:25:02,889 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:25:02,889 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:25:02,889 INFO ]: Start difference. First operand 17 states and 128 transitions. Second operand 3 states. [2018-06-26 20:25:02,970 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:25:02,970 INFO ]: Finished difference Result 18 states and 133 transitions. [2018-06-26 20:25:02,970 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:25:02,970 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:25:02,970 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:25:02,971 INFO ]: With dead ends: 18 [2018-06-26 20:25:02,971 INFO ]: Without dead ends: 18 [2018-06-26 20:25:02,971 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-26 20:25:02,971 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 20:25:02,974 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-26 20:25:02,974 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 20:25:02,975 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 133 transitions. [2018-06-26 20:25:02,975 INFO ]: Start accepts. Automaton has 18 states and 133 transitions. Word has length 8 [2018-06-26 20:25:02,975 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:25:02,975 INFO ]: Abstraction has 18 states and 133 transitions. [2018-06-26 20:25:02,975 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:25:02,975 INFO ]: Start isEmpty. Operand 18 states and 133 transitions. [2018-06-26 20:25:02,975 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:25:02,975 INFO ]: Found error trace [2018-06-26 20:25:02,975 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:25:02,975 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:25:02,976 INFO ]: Analyzing trace with hash 652286260, now seen corresponding path program 1 times [2018-06-26 20:25:02,976 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:25:02,976 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:25:02,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:02,976 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:25:02,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:02,993 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:25:03,025 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:25:03,025 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:25:03,025 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:25:03,026 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:25:03,026 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:25:03,026 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:25:03,026 INFO ]: Start difference. First operand 18 states and 133 transitions. Second operand 3 states. [2018-06-26 20:25:03,137 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:25:03,137 INFO ]: Finished difference Result 18 states and 99 transitions. [2018-06-26 20:25:03,137 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:25:03,137 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:25:03,137 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:25:03,138 INFO ]: With dead ends: 18 [2018-06-26 20:25:03,138 INFO ]: Without dead ends: 18 [2018-06-26 20:25:03,138 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-26 20:25:03,138 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 20:25:03,141 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-26 20:25:03,141 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 20:25:03,141 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 99 transitions. [2018-06-26 20:25:03,141 INFO ]: Start accepts. Automaton has 18 states and 99 transitions. Word has length 8 [2018-06-26 20:25:03,142 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:25:03,142 INFO ]: Abstraction has 18 states and 99 transitions. [2018-06-26 20:25:03,142 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:25:03,142 INFO ]: Start isEmpty. Operand 18 states and 99 transitions. [2018-06-26 20:25:03,142 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:25:03,142 INFO ]: Found error trace [2018-06-26 20:25:03,142 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:25:03,142 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:25:03,142 INFO ]: Analyzing trace with hash 365994750, now seen corresponding path program 1 times [2018-06-26 20:25:03,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:25:03,142 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:25:03,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:03,143 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:25:03,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:03,159 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:25:03,222 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:25:03,222 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:25:03,222 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:25:03,222 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:25:03,222 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:25:03,222 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:25:03,222 INFO ]: Start difference. First operand 18 states and 99 transitions. Second operand 3 states. [2018-06-26 20:25:03,309 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:25:03,309 INFO ]: Finished difference Result 20 states and 81 transitions. [2018-06-26 20:25:03,310 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:25:03,310 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:25:03,310 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:25:03,310 INFO ]: With dead ends: 20 [2018-06-26 20:25:03,310 INFO ]: Without dead ends: 18 [2018-06-26 20:25:03,311 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-26 20:25:03,311 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 20:25:03,313 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-06-26 20:25:03,313 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 20:25:03,314 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2018-06-26 20:25:03,314 INFO ]: Start accepts. Automaton has 17 states and 70 transitions. Word has length 8 [2018-06-26 20:25:03,314 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:25:03,314 INFO ]: Abstraction has 17 states and 70 transitions. [2018-06-26 20:25:03,314 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:25:03,314 INFO ]: Start isEmpty. Operand 17 states and 70 transitions. [2018-06-26 20:25:03,314 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:25:03,314 INFO ]: Found error trace [2018-06-26 20:25:03,314 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:25:03,314 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:25:03,315 INFO ]: Analyzing trace with hash 1012459450, now seen corresponding path program 1 times [2018-06-26 20:25:03,315 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:25:03,315 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:25:03,315 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:03,316 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:25:03,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:03,329 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:25:03,394 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:25:03,394 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:25:03,394 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:25:03,394 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:25:03,394 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:25:03,394 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:25:03,394 INFO ]: Start difference. First operand 17 states and 70 transitions. Second operand 3 states. [2018-06-26 20:25:03,664 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:25:03,664 INFO ]: Finished difference Result 18 states and 53 transitions. [2018-06-26 20:25:03,664 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:25:03,664 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:25:03,664 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:25:03,664 INFO ]: With dead ends: 18 [2018-06-26 20:25:03,664 INFO ]: Without dead ends: 17 [2018-06-26 20:25:03,665 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-26 20:25:03,665 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 20:25:03,667 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 20:25:03,667 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 20:25:03,667 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions. [2018-06-26 20:25:03,667 INFO ]: Start accepts. Automaton has 17 states and 51 transitions. Word has length 8 [2018-06-26 20:25:03,667 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:25:03,667 INFO ]: Abstraction has 17 states and 51 transitions. [2018-06-26 20:25:03,667 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:25:03,668 INFO ]: Start isEmpty. Operand 17 states and 51 transitions. [2018-06-26 20:25:03,668 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:25:03,668 INFO ]: Found error trace [2018-06-26 20:25:03,668 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:25:03,668 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:25:03,668 INFO ]: Analyzing trace with hash -1209797847, now seen corresponding path program 1 times [2018-06-26 20:25:03,668 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:25:03,668 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:25:03,669 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:03,669 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:25:03,669 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:03,689 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:25:03,719 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:25:03,719 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:25:03,719 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:25:03,720 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:25:03,720 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:25:03,720 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:25:03,720 INFO ]: Start difference. First operand 17 states and 51 transitions. Second operand 3 states. [2018-06-26 20:25:03,806 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:25:03,806 INFO ]: Finished difference Result 18 states and 36 transitions. [2018-06-26 20:25:03,806 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:25:03,806 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:25:03,806 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:25:03,806 INFO ]: With dead ends: 18 [2018-06-26 20:25:03,806 INFO ]: Without dead ends: 17 [2018-06-26 20:25:03,807 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-26 20:25:03,807 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 20:25:03,808 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 20:25:03,808 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 20:25:03,809 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 35 transitions. [2018-06-26 20:25:03,809 INFO ]: Start accepts. Automaton has 17 states and 35 transitions. Word has length 8 [2018-06-26 20:25:03,809 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:25:03,809 INFO ]: Abstraction has 17 states and 35 transitions. [2018-06-26 20:25:03,809 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:25:03,809 INFO ]: Start isEmpty. Operand 17 states and 35 transitions. [2018-06-26 20:25:03,809 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:25:03,809 INFO ]: Found error trace [2018-06-26 20:25:03,809 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:25:03,809 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:25:03,810 INFO ]: Analyzing trace with hash 1548499667, now seen corresponding path program 1 times [2018-06-26 20:25:03,810 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:25:03,810 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:25:03,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:03,810 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:25:03,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:03,838 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:25:03,914 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:25:03,915 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:25:03,915 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:25:03,915 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:25:03,915 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:25:03,915 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:25:03,915 INFO ]: Start difference. First operand 17 states and 35 transitions. Second operand 3 states. [2018-06-26 20:25:04,418 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:25:04,418 INFO ]: Finished difference Result 22 states and 52 transitions. [2018-06-26 20:25:04,418 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:25:04,418 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:25:04,418 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:25:04,418 INFO ]: With dead ends: 22 [2018-06-26 20:25:04,418 INFO ]: Without dead ends: 22 [2018-06-26 20:25:04,419 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-26 20:25:04,419 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 20:25:04,421 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-06-26 20:25:04,421 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 20:25:04,421 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 36 transitions. [2018-06-26 20:25:04,421 INFO ]: Start accepts. Automaton has 18 states and 36 transitions. Word has length 10 [2018-06-26 20:25:04,421 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:25:04,421 INFO ]: Abstraction has 18 states and 36 transitions. [2018-06-26 20:25:04,421 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:25:04,421 INFO ]: Start isEmpty. Operand 18 states and 36 transitions. [2018-06-26 20:25:04,422 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:25:04,422 INFO ]: Found error trace [2018-06-26 20:25:04,422 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:25:04,422 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:25:04,422 INFO ]: Analyzing trace with hash -1035104099, now seen corresponding path program 1 times [2018-06-26 20:25:04,422 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:25:04,422 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:25:04,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:04,423 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:25:04,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:04,443 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:25:04,535 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:25:04,535 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:25:04,535 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:25:04,535 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:25:04,535 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:25:04,535 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:25:04,535 INFO ]: Start difference. First operand 18 states and 36 transitions. Second operand 3 states. [2018-06-26 20:25:04,796 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:25:04,797 INFO ]: Finished difference Result 23 states and 52 transitions. [2018-06-26 20:25:04,797 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:25:04,797 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:25:04,797 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:25:04,797 INFO ]: With dead ends: 23 [2018-06-26 20:25:04,797 INFO ]: Without dead ends: 23 [2018-06-26 20:25:04,798 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-26 20:25:04,798 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 20:25:04,800 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-06-26 20:25:04,800 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 20:25:04,800 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 51 transitions. [2018-06-26 20:25:04,800 INFO ]: Start accepts. Automaton has 22 states and 51 transitions. Word has length 10 [2018-06-26 20:25:04,800 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:25:04,800 INFO ]: Abstraction has 22 states and 51 transitions. [2018-06-26 20:25:04,800 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:25:04,800 INFO ]: Start isEmpty. Operand 22 states and 51 transitions. [2018-06-26 20:25:04,801 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:25:04,801 INFO ]: Found error trace [2018-06-26 20:25:04,801 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:25:04,801 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:25:04,801 INFO ]: Analyzing trace with hash -919881148, now seen corresponding path program 1 times [2018-06-26 20:25:04,801 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:25:04,801 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:25:04,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:04,802 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:25:04,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:04,828 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:25:04,909 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:25:04,909 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:25:04,909 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:25:04,909 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:25:04,909 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:25:04,909 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:25:04,909 INFO ]: Start difference. First operand 22 states and 51 transitions. Second operand 3 states. [2018-06-26 20:25:05,045 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:25:05,045 INFO ]: Finished difference Result 23 states and 49 transitions. [2018-06-26 20:25:05,046 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:25:05,046 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:25:05,046 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:25:05,046 INFO ]: With dead ends: 23 [2018-06-26 20:25:05,046 INFO ]: Without dead ends: 23 [2018-06-26 20:25:05,046 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-26 20:25:05,046 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 20:25:05,048 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-26 20:25:05,048 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 20:25:05,049 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 49 transitions. [2018-06-26 20:25:05,049 INFO ]: Start accepts. Automaton has 23 states and 49 transitions. Word has length 10 [2018-06-26 20:25:05,049 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:25:05,049 INFO ]: Abstraction has 23 states and 49 transitions. [2018-06-26 20:25:05,049 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:25:05,049 INFO ]: Start isEmpty. Operand 23 states and 49 transitions. [2018-06-26 20:25:05,049 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 20:25:05,049 INFO ]: Found error trace [2018-06-26 20:25:05,049 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:25:05,049 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:25:05,049 INFO ]: Analyzing trace with hash 685620158, now seen corresponding path program 1 times [2018-06-26 20:25:05,049 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:25:05,049 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:25:05,050 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:05,050 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:25:05,050 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:05,088 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:25:05,226 INFO ]: Checked inductivity of 45 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:25:05,226 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:25:05,226 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-26 20:25:05,237 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:25:05,472 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:25:05,493 INFO ]: Computing forward predicates... [2018-06-26 20:25:05,837 INFO ]: Checked inductivity of 45 backedges. 34 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 20:25:05,861 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:25:05,862 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-26 20:25:05,862 INFO ]: Interpolant automaton has 8 states [2018-06-26 20:25:05,862 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 20:25:05,862 INFO ]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-06-26 20:25:05,862 INFO ]: Start difference. First operand 23 states and 49 transitions. Second operand 8 states. [2018-06-26 20:25:06,575 WARN ]: Spent 159.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-06-26 20:25:06,757 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:25:06,757 INFO ]: Finished difference Result 37 states and 69 transitions. [2018-06-26 20:25:06,758 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 20:25:06,758 INFO ]: Start accepts. Automaton has 8 states. Word has length 14 [2018-06-26 20:25:06,758 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:25:06,758 INFO ]: With dead ends: 37 [2018-06-26 20:25:06,758 INFO ]: Without dead ends: 35 [2018-06-26 20:25:06,758 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-06-26 20:25:06,758 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 20:25:06,761 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-06-26 20:25:06,761 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-26 20:25:06,762 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 60 transitions. [2018-06-26 20:25:06,762 INFO ]: Start accepts. Automaton has 30 states and 60 transitions. Word has length 14 [2018-06-26 20:25:06,762 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:25:06,762 INFO ]: Abstraction has 30 states and 60 transitions. [2018-06-26 20:25:06,762 INFO ]: Interpolant automaton has 8 states. [2018-06-26 20:25:06,762 INFO ]: Start isEmpty. Operand 30 states and 60 transitions. [2018-06-26 20:25:06,762 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 20:25:06,762 INFO ]: Found error trace [2018-06-26 20:25:06,762 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:25:06,762 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:25:06,762 INFO ]: Analyzing trace with hash -1772162248, now seen corresponding path program 1 times [2018-06-26 20:25:06,762 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:25:06,763 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:25:06,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:06,764 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:25:06,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:06,810 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:25:07,093 INFO ]: Checked inductivity of 55 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 20:25:07,093 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:25:07,093 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-26 20:25:07,141 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:25:07,346 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:25:07,359 INFO ]: Computing forward predicates... [2018-06-26 20:25:07,466 INFO ]: Checked inductivity of 55 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-26 20:25:07,499 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 20:25:07,499 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2018-06-26 20:25:07,500 INFO ]: Interpolant automaton has 6 states [2018-06-26 20:25:07,500 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 20:25:07,500 INFO ]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:25:07,500 INFO ]: Start difference. First operand 30 states and 60 transitions. Second operand 6 states. [2018-06-26 20:25:08,261 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:25:08,261 INFO ]: Finished difference Result 36 states and 63 transitions. [2018-06-26 20:25:08,262 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 20:25:08,262 INFO ]: Start accepts. Automaton has 6 states. Word has length 15 [2018-06-26 20:25:08,262 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:25:08,262 INFO ]: With dead ends: 36 [2018-06-26 20:25:08,262 INFO ]: Without dead ends: 23 [2018-06-26 20:25:08,262 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:25:08,262 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 20:25:08,264 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-26 20:25:08,264 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 20:25:08,264 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2018-06-26 20:25:08,264 INFO ]: Start accepts. Automaton has 21 states and 32 transitions. Word has length 15 [2018-06-26 20:25:08,264 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:25:08,264 INFO ]: Abstraction has 21 states and 32 transitions. [2018-06-26 20:25:08,264 INFO ]: Interpolant automaton has 6 states. [2018-06-26 20:25:08,264 INFO ]: Start isEmpty. Operand 21 states and 32 transitions. [2018-06-26 20:25:08,265 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:25:08,265 INFO ]: Found error trace [2018-06-26 20:25:08,265 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:25:08,265 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:25:08,265 INFO ]: Analyzing trace with hash 2040130454, now seen corresponding path program 1 times [2018-06-26 20:25:08,265 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:25:08,265 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:25:08,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:08,266 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:25:08,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:08,307 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:25:08,546 INFO ]: Checked inductivity of 78 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-26 20:25:08,546 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:25:08,546 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) [2018-06-26 20:25:08,564 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:25:08,803 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:25:08,813 INFO ]: Computing forward predicates... [2018-06-26 20:25:08,827 INFO ]: Checked inductivity of 78 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 20:25:08,859 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 20:25:08,859 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-06-26 20:25:08,859 INFO ]: Interpolant automaton has 4 states [2018-06-26 20:25:08,860 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 20:25:08,860 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 20:25:08,860 INFO ]: Start difference. First operand 21 states and 32 transitions. Second operand 4 states. [2018-06-26 20:25:08,981 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:25:08,981 INFO ]: Finished difference Result 25 states and 36 transitions. [2018-06-26 20:25:08,981 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:25:08,981 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-26 20:25:08,981 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:25:08,981 INFO ]: With dead ends: 25 [2018-06-26 20:25:08,981 INFO ]: Without dead ends: 21 [2018-06-26 20:25:08,982 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 20:25:08,982 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 20:25:08,983 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-26 20:25:08,983 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 20:25:08,984 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2018-06-26 20:25:08,984 INFO ]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 17 [2018-06-26 20:25:08,984 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:25:08,984 INFO ]: Abstraction has 21 states and 31 transitions. [2018-06-26 20:25:08,984 INFO ]: Interpolant automaton has 4 states. [2018-06-26 20:25:08,984 INFO ]: Start isEmpty. Operand 21 states and 31 transitions. [2018-06-26 20:25:08,985 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 20:25:08,985 INFO ]: Found error trace [2018-06-26 20:25:08,985 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:25:08,986 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:25:08,986 INFO ]: Analyzing trace with hash 1888889476, now seen corresponding path program 1 times [2018-06-26 20:25:08,986 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:25:08,986 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:25:08,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:08,986 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:25:08,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:09,029 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:25:09,222 INFO ]: Checked inductivity of 91 backedges. 51 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-26 20:25:09,222 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:25:09,222 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-26 20:25:09,230 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:25:09,442 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:25:09,451 INFO ]: Computing forward predicates... [2018-06-26 20:25:09,502 INFO ]: Checked inductivity of 91 backedges. 51 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-26 20:25:09,524 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:25:09,524 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2018-06-26 20:25:09,524 INFO ]: Interpolant automaton has 8 states [2018-06-26 20:25:09,524 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 20:25:09,524 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-26 20:25:09,524 INFO ]: Start difference. First operand 21 states and 31 transitions. Second operand 8 states. [2018-06-26 20:25:09,775 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:25:09,775 INFO ]: Finished difference Result 42 states and 67 transitions. [2018-06-26 20:25:09,775 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 20:25:09,775 INFO ]: Start accepts. Automaton has 8 states. Word has length 18 [2018-06-26 20:25:09,775 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:25:09,775 INFO ]: With dead ends: 42 [2018-06-26 20:25:09,776 INFO ]: Without dead ends: 20 [2018-06-26 20:25:09,776 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-26 20:25:09,776 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 20:25:09,777 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-26 20:25:09,778 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 20:25:09,778 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-06-26 20:25:09,778 INFO ]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 18 [2018-06-26 20:25:09,778 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:25:09,778 INFO ]: Abstraction has 20 states and 29 transitions. [2018-06-26 20:25:09,778 INFO ]: Interpolant automaton has 8 states. [2018-06-26 20:25:09,778 INFO ]: Start isEmpty. Operand 20 states and 29 transitions. [2018-06-26 20:25:09,779 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 20:25:09,779 INFO ]: Found error trace [2018-06-26 20:25:09,779 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:25:09,779 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:25:09,779 INFO ]: Analyzing trace with hash 1559171119, now seen corresponding path program 1 times [2018-06-26 20:25:09,779 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:25:09,779 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:25:09,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:09,779 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:25:09,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:25:09,813 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:25:09,890 INFO ]: Checked inductivity of 91 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-26 20:25:09,890 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:25:09,890 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:25:09,890 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:25:09,890 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:25:09,890 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:25:09,890 INFO ]: Start difference. First operand 20 states and 29 transitions. Second operand 3 states. [2018-06-26 20:25:09,963 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:25:09,964 INFO ]: Finished difference Result 5 states and 5 transitions. [2018-06-26 20:25:09,964 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:25:09,964 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-26 20:25:09,964 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:25:09,964 INFO ]: With dead ends: 5 [2018-06-26 20:25:09,964 INFO ]: Without dead ends: 0 [2018-06-26 20:25:09,964 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-26 20:25:09,964 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 20:25:09,964 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 20:25:09,964 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 20:25:09,964 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 20:25:09,965 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-06-26 20:25:09,965 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:25:09,965 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 20:25:09,965 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:25:09,965 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 20:25:09,965 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 20:25:09,967 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 20:25:09,968 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:25:09 BasicIcfg [2018-06-26 20:25:09,969 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 20:25:09,969 INFO ]: Toolchain (without parser) took 34775.09 ms. Allocated memory was 308.8 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 247.2 MB in the beginning and 1.1 GB in the end (delta: -872.5 MB). Peak memory consumption was 403.1 MB. Max. memory is 3.6 GB. [2018-06-26 20:25:09,970 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 20:25:09,970 INFO ]: ChcToBoogie took 77.04 ms. Allocated memory is still 308.8 MB. Free memory was 247.2 MB in the beginning and 245.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:25:09,971 INFO ]: Boogie Preprocessor took 50.57 ms. Allocated memory is still 308.8 MB. Free memory was 245.2 MB in the beginning and 243.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:25:09,971 INFO ]: RCFGBuilder took 416.51 ms. Allocated memory is still 308.8 MB. Free memory was 243.2 MB in the beginning and 217.0 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 3.6 GB. [2018-06-26 20:25:09,971 INFO ]: BlockEncodingV2 took 10061.51 ms. Allocated memory was 308.8 MB in the beginning and 1.3 GB in the end (delta: 978.8 MB). Free memory was 217.0 MB in the beginning and 686.4 MB in the end (delta: -469.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 3.6 GB. [2018-06-26 20:25:09,972 INFO ]: TraceAbstraction took 24159.59 ms. Allocated memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: 296.7 MB). Free memory was 686.4 MB in the beginning and 1.1 GB in the end (delta: -433.3 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 20:25:09,975 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 3718 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 77.04 ms. Allocated memory is still 308.8 MB. Free memory was 247.2 MB in the beginning and 245.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 50.57 ms. Allocated memory is still 308.8 MB. Free memory was 245.2 MB in the beginning and 243.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 416.51 ms. Allocated memory is still 308.8 MB. Free memory was 243.2 MB in the beginning and 217.0 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 10061.51 ms. Allocated memory was 308.8 MB in the beginning and 1.3 GB in the end (delta: 978.8 MB). Free memory was 217.0 MB in the beginning and 686.4 MB in the end (delta: -469.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 3.6 GB. * TraceAbstraction took 24159.59 ms. Allocated memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: 296.7 MB). Free memory was 686.4 MB in the beginning and 1.1 GB in the end (delta: -433.3 MB). There was no memory consumed. 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, 6 locations, 1 error locations. SAFE Result, 24.1s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 19.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 78 SDtfs, 4 SDslu, 97 SDs, 0 SdLazy, 1016 SolverSat, 7784 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=13, 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.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 16 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 4845 SizeOfPredicates, 0 NumberOfNonLiveVariables, 7030 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 630/707 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/bubblesort-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_20-25-09-985.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubblesort-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_20-25-09-985.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubblesort-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_20-25-09-985.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubblesort-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_20-25-09-985.csv Received shutdown request...