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/llreve-bench/smt2/rec__limit2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 19:03:04,476 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 19:03:04,478 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 19:03:04,489 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 19:03:04,490 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 19:03:04,490 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 19:03:04,491 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 19:03:04,496 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 19:03:04,498 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 19:03:04,499 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 19:03:04,499 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 19:03:04,500 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 19:03:04,500 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 19:03:04,501 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 19:03:04,502 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 19:03:04,503 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 19:03:04,503 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 19:03:04,505 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 19:03:04,512 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 19:03:04,513 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 19:03:04,514 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 19:03:04,515 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 19:03:04,517 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 19:03:04,517 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 19:03:04,518 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 19:03:04,518 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 19:03:04,519 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 19:03:04,520 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 19:03:04,521 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 19:03:04,529 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 19:03:04,529 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 19:03:04,530 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 19:03:04,530 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 19:03:04,530 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 19:03:04,531 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 19:03:04,531 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 19:03:04,531 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 19:03:04,547 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 19:03:04,547 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 19:03:04,547 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 19:03:04,547 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 19:03:04,548 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 19:03:04,549 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 19:03:04,549 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 19:03:04,549 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 19:03:04,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 19:03:04,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 19:03:04,549 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 19:03:04,550 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 19:03:04,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 19:03:04,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 19:03:04,550 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 19:03:04,550 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 19:03:04,550 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 19:03:04,551 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 19:03:04,551 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 19:03:04,551 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 19:03:04,551 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 19:03:04,552 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 19:03:04,553 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 19:03:04,585 INFO ]: Repository-Root is: /tmp [2018-06-26 19:03:04,601 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 19:03:04,608 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 19:03:04,609 INFO ]: Initializing SmtParser... [2018-06-26 19:03:04,609 INFO ]: SmtParser initialized [2018-06-26 19:03:04,610 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__limit2.smt2 [2018-06-26 19:03:04,611 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 19:03:04,693 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__limit2.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@11dd9e40 [2018-06-26 19:03:04,922 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__limit2.smt2 [2018-06-26 19:03:04,927 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 19:03:04,933 INFO ]: Walking toolchain with 5 elements. [2018-06-26 19:03:04,933 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 19:03:04,933 INFO ]: Initializing ChcToBoogie... [2018-06-26 19:03:04,933 INFO ]: ChcToBoogie initialized [2018-06-26 19:03:04,937 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 07:03:04" (1/1) ... [2018-06-26 19:03:04,997 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:03:04 Unit [2018-06-26 19:03:04,997 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 19:03:04,998 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 19:03:05,000 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 19:03:05,000 INFO ]: Boogie Preprocessor initialized [2018-06-26 19:03:05,020 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:03:04" (1/1) ... [2018-06-26 19:03:05,020 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:03:04" (1/1) ... [2018-06-26 19:03:05,023 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:03:04" (1/1) ... [2018-06-26 19:03:05,024 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:03:04" (1/1) ... [2018-06-26 19:03:05,028 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:03:04" (1/1) ... [2018-06-26 19:03:05,030 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:03:04" (1/1) ... [2018-06-26 19:03:05,031 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:03:04" (1/1) ... [2018-06-26 19:03:05,033 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 19:03:05,034 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 19:03:05,034 INFO ]: Initializing RCFGBuilder... [2018-06-26 19:03:05,034 INFO ]: RCFGBuilder initialized [2018-06-26 19:03:05,035 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:03:04" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 19:03:05,049 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 19:03:05,049 INFO ]: Found specification of procedure gotoProc [2018-06-26 19:03:05,049 INFO ]: Found implementation of procedure gotoProc [2018-06-26 19:03:05,049 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 19:03:05,049 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 19:03:05,049 INFO ]: Found implementation of procedure Ultimate.START [2018-06-26 19:03:05,454 INFO ]: Using library mode [2018-06-26 19:03:05,455 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 07:03:05 BoogieIcfgContainer [2018-06-26 19:03:05,455 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 19:03:05,455 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 19:03:05,455 INFO ]: Initializing BlockEncodingV2... [2018-06-26 19:03:05,456 INFO ]: BlockEncodingV2 initialized [2018-06-26 19:03:05,457 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 07:03:05" (1/1) ... [2018-06-26 19:03:05,475 INFO ]: Initial Icfg 28 locations, 48 edges [2018-06-26 19:03:05,476 INFO ]: Using Remove infeasible edges [2018-06-26 19:03:05,477 INFO ]: Using Maximize final states [2018-06-26 19:03:05,477 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 19:03:05,477 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 19:03:05,479 INFO ]: Using Remove sink states [2018-06-26 19:03:05,479 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 19:03:05,480 INFO ]: Using Use SBE [2018-06-26 19:03:05,488 INFO ]: SBE split 0 edges [2018-06-26 19:03:05,492 INFO ]: Removed 5 edges and 2 locations because of local infeasibility [2018-06-26 19:03:05,494 INFO ]: 0 new accepting states [2018-06-26 19:03:05,542 INFO ]: Removed 18 edges and 6 locations by large block encoding [2018-06-26 19:03:05,545 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 19:03:05,547 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 19:03:05,547 INFO ]: 0 new accepting states [2018-06-26 19:03:05,547 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 19:03:05,548 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 19:03:05,548 INFO ]: Encoded RCFG 20 locations, 37 edges [2018-06-26 19:03:05,548 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 07:03:05 BasicIcfg [2018-06-26 19:03:05,548 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 19:03:05,552 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 19:03:05,552 INFO ]: Initializing TraceAbstraction... [2018-06-26 19:03:05,556 INFO ]: TraceAbstraction initialized [2018-06-26 19:03:05,556 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 07:03:04" (1/4) ... [2018-06-26 19:03:05,557 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6685a849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 07:03:05, skipping insertion in model container [2018-06-26 19:03:05,557 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:03:04" (2/4) ... [2018-06-26 19:03:05,557 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6685a849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 07:03:05, skipping insertion in model container [2018-06-26 19:03:05,557 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 07:03:05" (3/4) ... [2018-06-26 19:03:05,558 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6685a849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 07:03:05, skipping insertion in model container [2018-06-26 19:03:05,558 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 07:03:05" (4/4) ... [2018-06-26 19:03:05,562 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 19:03:05,574 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 19:03:05,585 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 19:03:05,620 INFO ]: Using default assertion order modulation [2018-06-26 19:03:05,621 INFO ]: Interprodecural is true [2018-06-26 19:03:05,621 INFO ]: Hoare is false [2018-06-26 19:03:05,621 INFO ]: Compute interpolants for FPandBP [2018-06-26 19:03:05,621 INFO ]: Backedges is TWOTRACK [2018-06-26 19:03:05,621 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 19:03:05,621 INFO ]: Difference is false [2018-06-26 19:03:05,621 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 19:03:05,621 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 19:03:05,635 INFO ]: Start isEmpty. Operand 20 states. [2018-06-26 19:03:05,648 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 19:03:05,648 INFO ]: Found error trace [2018-06-26 19:03:05,649 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 19:03:05,650 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:03:05,653 INFO ]: Analyzing trace with hash 45874798, now seen corresponding path program 1 times [2018-06-26 19:03:05,654 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:03:05,655 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:03:05,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:05,686 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:03:05,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:05,726 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:03:05,788 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:03:05,791 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:03:05,791 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:03:05,792 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:03:05,803 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:03:05,804 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:03:05,805 INFO ]: Start difference. First operand 20 states. Second operand 3 states. [2018-06-26 19:03:06,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:03:06,053 INFO ]: Finished difference Result 34 states and 65 transitions. [2018-06-26 19:03:06,054 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:03:06,055 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 19:03:06,055 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:03:06,066 INFO ]: With dead ends: 34 [2018-06-26 19:03:06,066 INFO ]: Without dead ends: 34 [2018-06-26 19:03:06,068 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 19:03:06,086 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-26 19:03:06,111 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-26 19:03:06,112 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 19:03:06,115 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 65 transitions. [2018-06-26 19:03:06,116 INFO ]: Start accepts. Automaton has 34 states and 65 transitions. Word has length 5 [2018-06-26 19:03:06,117 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:03:06,117 INFO ]: Abstraction has 34 states and 65 transitions. [2018-06-26 19:03:06,117 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:03:06,117 INFO ]: Start isEmpty. Operand 34 states and 65 transitions. [2018-06-26 19:03:06,121 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 19:03:06,121 INFO ]: Found error trace [2018-06-26 19:03:06,121 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 19:03:06,121 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:03:06,121 INFO ]: Analyzing trace with hash 45993001, now seen corresponding path program 1 times [2018-06-26 19:03:06,121 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:03:06,121 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:03:06,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:06,122 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:03:06,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:06,126 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:03:06,186 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:03:06,186 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:03:06,186 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:03:06,187 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:03:06,187 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:03:06,187 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:03:06,188 INFO ]: Start difference. First operand 34 states and 65 transitions. Second operand 3 states. [2018-06-26 19:03:06,356 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:03:06,356 INFO ]: Finished difference Result 48 states and 94 transitions. [2018-06-26 19:03:06,356 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:03:06,356 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 19:03:06,357 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:03:06,359 INFO ]: With dead ends: 48 [2018-06-26 19:03:06,359 INFO ]: Without dead ends: 48 [2018-06-26 19:03:06,360 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 19:03:06,360 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-26 19:03:06,370 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-26 19:03:06,370 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-26 19:03:06,373 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 94 transitions. [2018-06-26 19:03:06,373 INFO ]: Start accepts. Automaton has 48 states and 94 transitions. Word has length 5 [2018-06-26 19:03:06,373 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:03:06,373 INFO ]: Abstraction has 48 states and 94 transitions. [2018-06-26 19:03:06,373 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:03:06,373 INFO ]: Start isEmpty. Operand 48 states and 94 transitions. [2018-06-26 19:03:06,375 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 19:03:06,375 INFO ]: Found error trace [2018-06-26 19:03:06,375 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 19:03:06,376 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:03:06,376 INFO ]: Analyzing trace with hash 1428295401, now seen corresponding path program 1 times [2018-06-26 19:03:06,376 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:03:06,376 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:03:06,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:06,377 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:03:06,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:06,387 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:03:06,441 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:03:06,441 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:03:06,441 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:03:06,441 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:03:06,441 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:03:06,441 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:03:06,441 INFO ]: Start difference. First operand 48 states and 94 transitions. Second operand 3 states. [2018-06-26 19:03:06,458 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:03:06,458 INFO ]: Finished difference Result 51 states and 97 transitions. [2018-06-26 19:03:06,458 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:03:06,458 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 19:03:06,459 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:03:06,461 INFO ]: With dead ends: 51 [2018-06-26 19:03:06,461 INFO ]: Without dead ends: 51 [2018-06-26 19:03:06,461 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 19:03:06,461 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-26 19:03:06,470 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-06-26 19:03:06,470 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-26 19:03:06,473 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 97 transitions. [2018-06-26 19:03:06,473 INFO ]: Start accepts. Automaton has 51 states and 97 transitions. Word has length 6 [2018-06-26 19:03:06,473 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:03:06,473 INFO ]: Abstraction has 51 states and 97 transitions. [2018-06-26 19:03:06,473 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:03:06,473 INFO ]: Start isEmpty. Operand 51 states and 97 transitions. [2018-06-26 19:03:06,480 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 19:03:06,480 INFO ]: Found error trace [2018-06-26 19:03:06,480 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 19:03:06,480 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:03:06,480 INFO ]: Analyzing trace with hash 1428892182, now seen corresponding path program 1 times [2018-06-26 19:03:06,480 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:03:06,480 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:03:06,481 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:06,481 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:03:06,481 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:06,493 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:03:06,509 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:03:06,509 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:03:06,509 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:03:06,509 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:03:06,509 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:03:06,510 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:03:06,510 INFO ]: Start difference. First operand 51 states and 97 transitions. Second operand 3 states. [2018-06-26 19:03:06,548 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:03:06,548 INFO ]: Finished difference Result 72 states and 150 transitions. [2018-06-26 19:03:06,548 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:03:06,549 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 19:03:06,549 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:03:06,553 INFO ]: With dead ends: 72 [2018-06-26 19:03:06,553 INFO ]: Without dead ends: 72 [2018-06-26 19:03:06,554 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 19:03:06,554 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-26 19:03:06,566 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 54. [2018-06-26 19:03:06,566 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-26 19:03:06,567 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 103 transitions. [2018-06-26 19:03:06,568 INFO ]: Start accepts. Automaton has 54 states and 103 transitions. Word has length 6 [2018-06-26 19:03:06,568 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:03:06,568 INFO ]: Abstraction has 54 states and 103 transitions. [2018-06-26 19:03:06,568 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:03:06,568 INFO ]: Start isEmpty. Operand 54 states and 103 transitions. [2018-06-26 19:03:06,570 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 19:03:06,570 INFO ]: Found error trace [2018-06-26 19:03:06,570 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:03:06,570 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:03:06,570 INFO ]: Analyzing trace with hash -1669044908, now seen corresponding path program 1 times [2018-06-26 19:03:06,570 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:03:06,570 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:03:06,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:06,571 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:03:06,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:06,585 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:03:06,603 INFO ]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 19:03:06,603 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:03:06,603 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:03:06,603 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:03:06,603 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:03:06,603 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:03:06,603 INFO ]: Start difference. First operand 54 states and 103 transitions. Second operand 3 states. [2018-06-26 19:03:06,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:03:06,663 INFO ]: Finished difference Result 61 states and 123 transitions. [2018-06-26 19:03:06,663 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:03:06,663 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 19:03:06,664 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:03:06,665 INFO ]: With dead ends: 61 [2018-06-26 19:03:06,666 INFO ]: Without dead ends: 58 [2018-06-26 19:03:06,666 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 19:03:06,666 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-26 19:03:06,675 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-06-26 19:03:06,675 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-26 19:03:06,676 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 97 transitions. [2018-06-26 19:03:06,676 INFO ]: Start accepts. Automaton has 51 states and 97 transitions. Word has length 12 [2018-06-26 19:03:06,676 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:03:06,676 INFO ]: Abstraction has 51 states and 97 transitions. [2018-06-26 19:03:06,676 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:03:06,676 INFO ]: Start isEmpty. Operand 51 states and 97 transitions. [2018-06-26 19:03:06,677 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 19:03:06,677 INFO ]: Found error trace [2018-06-26 19:03:06,678 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:03:06,678 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:03:06,678 INFO ]: Analyzing trace with hash -2026064790, now seen corresponding path program 1 times [2018-06-26 19:03:06,678 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:03:06,678 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:03:06,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:06,679 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:03:06,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:06,691 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:03:06,740 INFO ]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 19:03:06,740 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:03:06,740 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:03:06,740 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:03:06,740 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:03:06,741 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:03:06,741 INFO ]: Start difference. First operand 51 states and 97 transitions. Second operand 3 states. [2018-06-26 19:03:06,801 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:03:06,801 INFO ]: Finished difference Result 54 states and 100 transitions. [2018-06-26 19:03:06,801 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:03:06,801 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 19:03:06,802 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:03:06,803 INFO ]: With dead ends: 54 [2018-06-26 19:03:06,803 INFO ]: Without dead ends: 54 [2018-06-26 19:03:06,803 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 19:03:06,803 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-26 19:03:06,809 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-06-26 19:03:06,809 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-26 19:03:06,811 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 100 transitions. [2018-06-26 19:03:06,811 INFO ]: Start accepts. Automaton has 54 states and 100 transitions. Word has length 12 [2018-06-26 19:03:06,811 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:03:06,811 INFO ]: Abstraction has 54 states and 100 transitions. [2018-06-26 19:03:06,811 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:03:06,811 INFO ]: Start isEmpty. Operand 54 states and 100 transitions. [2018-06-26 19:03:06,812 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 19:03:06,812 INFO ]: Found error trace [2018-06-26 19:03:06,812 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:03:06,812 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:03:06,812 INFO ]: Analyzing trace with hash -327796295, now seen corresponding path program 1 times [2018-06-26 19:03:06,812 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:03:06,813 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:03:06,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:06,813 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:03:06,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:06,827 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:03:07,013 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 19:03:07,013 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:03:07,013 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-26 19:03:07,014 INFO ]: Interpolant automaton has 8 states [2018-06-26 19:03:07,014 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 19:03:07,014 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-26 19:03:07,014 INFO ]: Start difference. First operand 54 states and 100 transitions. Second operand 8 states. [2018-06-26 19:03:07,510 WARN ]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-26 19:03:07,740 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:03:07,741 INFO ]: Finished difference Result 94 states and 213 transitions. [2018-06-26 19:03:07,743 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 19:03:07,743 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-26 19:03:07,743 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:03:07,746 INFO ]: With dead ends: 94 [2018-06-26 19:03:07,746 INFO ]: Without dead ends: 94 [2018-06-26 19:03:07,746 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-06-26 19:03:07,746 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-26 19:03:07,775 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 65. [2018-06-26 19:03:07,776 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-26 19:03:07,777 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 127 transitions. [2018-06-26 19:03:07,777 INFO ]: Start accepts. Automaton has 65 states and 127 transitions. Word has length 12 [2018-06-26 19:03:07,777 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:03:07,777 INFO ]: Abstraction has 65 states and 127 transitions. [2018-06-26 19:03:07,777 INFO ]: Interpolant automaton has 8 states. [2018-06-26 19:03:07,777 INFO ]: Start isEmpty. Operand 65 states and 127 transitions. [2018-06-26 19:03:07,783 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 19:03:07,783 INFO ]: Found error trace [2018-06-26 19:03:07,783 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:03:07,783 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:03:07,784 INFO ]: Analyzing trace with hash 1615498943, now seen corresponding path program 1 times [2018-06-26 19:03:07,784 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:03:07,784 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:03:07,784 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:07,784 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:03:07,784 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:07,808 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:03:07,847 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 19:03:07,847 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:03:07,847 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 19:03:07,854 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:03:07,890 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:03:07,898 INFO ]: Computing forward predicates... [2018-06-26 19:03:07,923 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 19:03:07,954 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:03:07,954 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 19:03:07,955 INFO ]: Interpolant automaton has 5 states [2018-06-26 19:03:07,955 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 19:03:07,955 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:03:07,955 INFO ]: Start difference. First operand 65 states and 127 transitions. Second operand 5 states. [2018-06-26 19:03:08,152 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:03:08,152 INFO ]: Finished difference Result 62 states and 127 transitions. [2018-06-26 19:03:08,153 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 19:03:08,153 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-26 19:03:08,153 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:03:08,153 INFO ]: With dead ends: 62 [2018-06-26 19:03:08,153 INFO ]: Without dead ends: 62 [2018-06-26 19:03:08,154 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-26 19:03:08,154 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-26 19:03:08,161 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 57. [2018-06-26 19:03:08,161 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-26 19:03:08,162 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 107 transitions. [2018-06-26 19:03:08,162 INFO ]: Start accepts. Automaton has 57 states and 107 transitions. Word has length 13 [2018-06-26 19:03:08,163 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:03:08,163 INFO ]: Abstraction has 57 states and 107 transitions. [2018-06-26 19:03:08,163 INFO ]: Interpolant automaton has 5 states. [2018-06-26 19:03:08,163 INFO ]: Start isEmpty. Operand 57 states and 107 transitions. [2018-06-26 19:03:08,164 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 19:03:08,164 INFO ]: Found error trace [2018-06-26 19:03:08,164 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:03:08,164 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:03:08,164 INFO ]: Analyzing trace with hash 1665116640, now seen corresponding path program 1 times [2018-06-26 19:03:08,164 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:03:08,164 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:03:08,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:08,165 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:03:08,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:08,173 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:03:08,204 INFO ]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 19:03:08,204 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:03:08,204 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:03:08,204 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:03:08,204 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:03:08,204 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:03:08,204 INFO ]: Start difference. First operand 57 states and 107 transitions. Second operand 3 states. [2018-06-26 19:03:08,260 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:03:08,260 INFO ]: Finished difference Result 73 states and 136 transitions. [2018-06-26 19:03:08,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:03:08,261 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-26 19:03:08,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:03:08,262 INFO ]: With dead ends: 73 [2018-06-26 19:03:08,262 INFO ]: Without dead ends: 53 [2018-06-26 19:03:08,262 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 19:03:08,262 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-26 19:03:08,267 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-06-26 19:03:08,267 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-26 19:03:08,268 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 94 transitions. [2018-06-26 19:03:08,268 INFO ]: Start accepts. Automaton has 53 states and 94 transitions. Word has length 14 [2018-06-26 19:03:08,268 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:03:08,268 INFO ]: Abstraction has 53 states and 94 transitions. [2018-06-26 19:03:08,268 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:03:08,268 INFO ]: Start isEmpty. Operand 53 states and 94 transitions. [2018-06-26 19:03:08,269 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 19:03:08,269 INFO ]: Found error trace [2018-06-26 19:03:08,269 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:03:08,270 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:03:08,270 INFO ]: Analyzing trace with hash 88323341, now seen corresponding path program 1 times [2018-06-26 19:03:08,270 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:03:08,270 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:03:08,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:08,270 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:03:08,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:08,286 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:03:08,610 INFO ]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 19:03:08,610 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:03:08,610 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 19:03:08,616 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:03:08,652 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:03:08,655 INFO ]: Computing forward predicates... [2018-06-26 19:03:08,856 INFO ]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 19:03:08,884 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:03:08,884 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-26 19:03:08,884 INFO ]: Interpolant automaton has 12 states [2018-06-26 19:03:08,884 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 19:03:08,884 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-26 19:03:08,884 INFO ]: Start difference. First operand 53 states and 94 transitions. Second operand 12 states. [2018-06-26 19:03:09,181 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:03:09,181 INFO ]: Finished difference Result 65 states and 117 transitions. [2018-06-26 19:03:09,181 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 19:03:09,181 INFO ]: Start accepts. Automaton has 12 states. Word has length 18 [2018-06-26 19:03:09,181 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:03:09,182 INFO ]: With dead ends: 65 [2018-06-26 19:03:09,183 INFO ]: Without dead ends: 65 [2018-06-26 19:03:09,183 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-06-26 19:03:09,183 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-26 19:03:09,188 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 42. [2018-06-26 19:03:09,188 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-26 19:03:09,189 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 68 transitions. [2018-06-26 19:03:09,189 INFO ]: Start accepts. Automaton has 42 states and 68 transitions. Word has length 18 [2018-06-26 19:03:09,189 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:03:09,189 INFO ]: Abstraction has 42 states and 68 transitions. [2018-06-26 19:03:09,189 INFO ]: Interpolant automaton has 12 states. [2018-06-26 19:03:09,189 INFO ]: Start isEmpty. Operand 42 states and 68 transitions. [2018-06-26 19:03:09,190 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 19:03:09,190 INFO ]: Found error trace [2018-06-26 19:03:09,190 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:03:09,190 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:03:09,190 INFO ]: Analyzing trace with hash 631321636, now seen corresponding path program 1 times [2018-06-26 19:03:09,190 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:03:09,190 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:03:09,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:09,191 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:03:09,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:03:09,201 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:03:09,280 INFO ]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 19:03:09,280 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:03:09,280 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 19:03:09,280 INFO ]: Interpolant automaton has 5 states [2018-06-26 19:03:09,281 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 19:03:09,281 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 19:03:09,281 INFO ]: Start difference. First operand 42 states and 68 transitions. Second operand 5 states. [2018-06-26 19:03:09,336 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:03:09,336 INFO ]: Finished difference Result 20 states and 29 transitions. [2018-06-26 19:03:09,336 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 19:03:09,336 INFO ]: Start accepts. Automaton has 5 states. Word has length 18 [2018-06-26 19:03:09,336 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:03:09,336 INFO ]: With dead ends: 20 [2018-06-26 19:03:09,337 INFO ]: Without dead ends: 0 [2018-06-26 19:03:09,337 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 19:03:09,337 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 19:03:09,337 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 19:03:09,337 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 19:03:09,337 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 19:03:09,337 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-06-26 19:03:09,337 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:03:09,337 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 19:03:09,337 INFO ]: Interpolant automaton has 5 states. [2018-06-26 19:03:09,337 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 19:03:09,337 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 19:03:09,339 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 19:03:09,340 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 07:03:09 BasicIcfg [2018-06-26 19:03:09,340 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 19:03:09,341 INFO ]: Toolchain (without parser) took 4413.45 ms. Allocated memory was 308.3 MB in the beginning and 340.3 MB in the end (delta: 32.0 MB). Free memory was 261.6 MB in the beginning and 293.6 MB in the end (delta: -32.0 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 19:03:09,342 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 308.3 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 19:03:09,342 INFO ]: ChcToBoogie took 64.17 ms. Allocated memory is still 308.3 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 19:03:09,343 INFO ]: Boogie Preprocessor took 35.53 ms. Allocated memory is still 308.3 MB. Free memory was 258.6 MB in the beginning and 257.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 19:03:09,343 INFO ]: RCFGBuilder took 421.28 ms. Allocated memory is still 308.3 MB. Free memory was 257.6 MB in the beginning and 244.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. [2018-06-26 19:03:09,344 INFO ]: BlockEncodingV2 took 92.86 ms. Allocated memory is still 308.3 MB. Free memory was 244.6 MB in the beginning and 239.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-26 19:03:09,344 INFO ]: TraceAbstraction took 3787.86 ms. Allocated memory was 308.3 MB in the beginning and 340.3 MB in the end (delta: 32.0 MB). Free memory was 239.6 MB in the beginning and 293.6 MB in the end (delta: -54.1 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 19:03:09,348 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 28 locations, 48 edges - StatisticsResult: Encoded RCFG 20 locations, 37 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.3 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.17 ms. Allocated memory is still 308.3 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 35.53 ms. Allocated memory is still 308.3 MB. Free memory was 258.6 MB in the beginning and 257.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 421.28 ms. Allocated memory is still 308.3 MB. Free memory was 257.6 MB in the beginning and 244.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 92.86 ms. Allocated memory is still 308.3 MB. Free memory was 244.6 MB in the beginning and 239.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 3787.86 ms. Allocated memory was 308.3 MB in the beginning and 340.3 MB in the end (delta: 32.0 MB). Free memory was 239.6 MB in the beginning and 293.6 MB in the end (delta: -54.1 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, 20 locations, 1 error locations. SAFE Result, 3.7s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 428 SDtfs, 149 SDslu, 590 SDs, 0 SdLazy, 294 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=7, 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, 11 MinimizatonAttempts, 82 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 6285 SizeOfPredicates, 10 NumberOfNonLiveVariables, 235 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 45/49 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/rec__limit2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_19-03-09-359.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__limit2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_19-03-09-359.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__limit2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_19-03-09-359.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__limit2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_19-03-09-359.csv Received shutdown request...