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/s3_srvr_9.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:12:14,533 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:12:14,539 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:12:14,549 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:12:14,550 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:12:14,551 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:12:14,553 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:12:14,555 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:12:14,556 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:12:14,557 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:12:14,558 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:12:14,558 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:12:14,559 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:12:14,560 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:12:14,560 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:12:14,561 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:12:14,563 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:12:14,565 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:12:14,567 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:12:14,568 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:12:14,569 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:12:14,571 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:12:14,571 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:12:14,572 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:12:14,573 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:12:14,574 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:12:14,574 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:12:14,575 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:12:14,576 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:12:14,576 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:12:14,577 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:12:14,578 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:12:14,578 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:12:14,579 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:12:14,579 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:12:14,580 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 00:12:14,601 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:12:14,601 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:12:14,601 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:12:14,602 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:12:14,602 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:12:14,603 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:12:14,603 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:12:14,603 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:12:14,603 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:12:14,604 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:12:14,604 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:12:14,604 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:12:14,604 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:12:14,604 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:12:14,604 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:12:14,605 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:12:14,605 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:12:14,605 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:12:14,605 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:12:14,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:12:14,605 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:12:14,607 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:12:14,607 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:12:14,660 INFO ]: Repository-Root is: /tmp [2018-06-25 00:12:14,677 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:12:14,680 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:12:14,682 INFO ]: Initializing SmtParser... [2018-06-25 00:12:14,682 INFO ]: SmtParser initialized [2018-06-25 00:12:14,683 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_9.cil.smt2 [2018-06-25 00:12:14,686 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-25 00:12:14,777 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_9.cil.smt2 unknown [2018-06-25 00:12:15,365 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_9.cil.smt2 [2018-06-25 00:12:15,370 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:12:15,375 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:12:15,375 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:12:15,375 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:12:15,376 INFO ]: ChcToBoogie initialized [2018-06-25 00:12:15,379 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:12:15" (1/1) ... [2018-06-25 00:12:15,505 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:12:15 Unit [2018-06-25 00:12:15,505 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:12:15,506 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:12:15,506 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:12:15,506 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:12:15,526 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:12:15" (1/1) ... [2018-06-25 00:12:15,527 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:12:15" (1/1) ... [2018-06-25 00:12:15,537 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:12:15" (1/1) ... [2018-06-25 00:12:15,537 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:12:15" (1/1) ... [2018-06-25 00:12:15,552 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:12:15" (1/1) ... [2018-06-25 00:12:15,554 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:12:15" (1/1) ... [2018-06-25 00:12:15,558 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:12:15" (1/1) ... [2018-06-25 00:12:15,563 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:12:15,564 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:12:15,564 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:12:15,564 INFO ]: RCFGBuilder initialized [2018-06-25 00:12:15,565 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:12:15" (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-25 00:12:15,609 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:12:15,609 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:12:15,609 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:12:15,609 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:12:15,609 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:12:15,609 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-25 00:12:16,071 INFO ]: Using library mode [2018-06-25 00:12:16,072 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:12:16 BoogieIcfgContainer [2018-06-25 00:12:16,073 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:12:16,074 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:12:16,074 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:12:16,075 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:12:16,075 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:12:16" (1/1) ... [2018-06-25 00:12:16,094 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:12:16,095 INFO ]: Using Remove infeasible edges [2018-06-25 00:12:16,096 INFO ]: Using Maximize final states [2018-06-25 00:12:16,097 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:12:16,097 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:12:16,099 INFO ]: Using Remove sink states [2018-06-25 00:12:16,099 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:12:16,100 INFO ]: Using Use SBE [2018-06-25 00:12:17,435 WARN ]: Simplifying disjunction of 8888 conjuctions. This might take some time... [2018-06-25 00:12:56,647 INFO ]: Simplified to disjunction of 8888 conjuctions. [2018-06-25 00:12:57,775 INFO ]: SBE split 1 edges [2018-06-25 00:12:57,884 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:12:57,886 INFO ]: 0 new accepting states [2018-06-25 00:12:57,953 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-25 00:12:57,955 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:12:58,078 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:12:58,079 INFO ]: 0 new accepting states [2018-06-25 00:12:58,080 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:12:58,080 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:12:58,262 INFO ]: Encoded RCFG 6 locations, 1116 edges [2018-06-25 00:12:58,263 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:12:58 BasicIcfg [2018-06-25 00:12:58,263 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:12:58,265 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:12:58,265 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:12:58,268 INFO ]: TraceAbstraction initialized [2018-06-25 00:12:58,268 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:12:15" (1/4) ... [2018-06-25 00:12:58,270 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dd41ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:12:58, skipping insertion in model container [2018-06-25 00:12:58,270 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:12:15" (2/4) ... [2018-06-25 00:12:58,270 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dd41ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:12:58, skipping insertion in model container [2018-06-25 00:12:58,270 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:12:16" (3/4) ... [2018-06-25 00:12:58,270 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dd41ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:12:58, skipping insertion in model container [2018-06-25 00:12:58,270 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:12:58" (4/4) ... [2018-06-25 00:12:58,272 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:12:58,285 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:12:58,294 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:12:58,347 INFO ]: Using default assertion order modulation [2018-06-25 00:12:58,348 INFO ]: Interprodecural is true [2018-06-25 00:12:58,348 INFO ]: Hoare is false [2018-06-25 00:12:58,348 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:12:58,348 INFO ]: Backedges is TWOTRACK [2018-06-25 00:12:58,348 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:12:58,348 INFO ]: Difference is false [2018-06-25 00:12:58,348 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:12:58,348 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:12:58,362 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:12:58,386 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:12:58,386 INFO ]: Found error trace [2018-06-25 00:12:58,387 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:12:58,388 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:12:58,392 INFO ]: Analyzing trace with hash 69568034, now seen corresponding path program 1 times [2018-06-25 00:12:58,394 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:12:58,394 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:12:58,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:12:58,425 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:12:58,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:12:58,488 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:12:58,593 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:12:58,595 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:12:58,595 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:12:58,596 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:12:58,607 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:12:58,607 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:12:58,610 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:13:05,712 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:13:05,713 INFO ]: Finished difference Result 7 states and 1229 transitions. [2018-06-25 00:13:05,713 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:13:05,714 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:13:05,714 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:13:05,728 INFO ]: With dead ends: 7 [2018-06-25 00:13:05,728 INFO ]: Without dead ends: 7 [2018-06-25 00:13:05,730 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-25 00:13:05,752 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:13:05,797 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:13:05,798 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:13:05,801 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1229 transitions. [2018-06-25 00:13:05,803 INFO ]: Start accepts. Automaton has 7 states and 1229 transitions. Word has length 5 [2018-06-25 00:13:05,804 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:13:05,804 INFO ]: Abstraction has 7 states and 1229 transitions. [2018-06-25 00:13:05,804 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:13:05,804 INFO ]: Start isEmpty. Operand 7 states and 1229 transitions. [2018-06-25 00:13:05,805 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:13:05,805 INFO ]: Found error trace [2018-06-25 00:13:05,805 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:13:05,805 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:13:05,806 INFO ]: Analyzing trace with hash -2138867413, now seen corresponding path program 1 times [2018-06-25 00:13:05,806 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:13:05,806 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:13:05,807 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:13:05,807 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:13:05,807 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:13:05,879 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:13:06,050 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:13:06,051 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:13:06,051 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:13:06,052 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:13:06,052 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:13:06,052 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:13:06,052 INFO ]: Start difference. First operand 7 states and 1229 transitions. Second operand 3 states. [2018-06-25 00:13:09,557 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:13:09,557 INFO ]: Finished difference Result 8 states and 1231 transitions. [2018-06-25 00:13:09,557 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:13:09,557 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:13:09,557 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:13:09,559 INFO ]: With dead ends: 8 [2018-06-25 00:13:09,559 INFO ]: Without dead ends: 8 [2018-06-25 00:13:09,559 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-25 00:13:09,559 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 00:13:09,573 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 00:13:09,573 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:13:09,576 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1231 transitions. [2018-06-25 00:13:09,576 INFO ]: Start accepts. Automaton has 8 states and 1231 transitions. Word has length 6 [2018-06-25 00:13:09,576 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:13:09,576 INFO ]: Abstraction has 8 states and 1231 transitions. [2018-06-25 00:13:09,576 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:13:09,576 INFO ]: Start isEmpty. Operand 8 states and 1231 transitions. [2018-06-25 00:13:09,577 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:13:09,577 INFO ]: Found error trace [2018-06-25 00:13:09,577 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:13:09,577 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:13:09,577 INFO ]: Analyzing trace with hash -2141101738, now seen corresponding path program 1 times [2018-06-25 00:13:09,577 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:13:09,577 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:13:09,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:13:09,578 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:13:09,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:13:09,606 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:13:09,649 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:13:09,649 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:13:09,649 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:13:09,649 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:13:09,649 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:13:09,649 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:13:09,649 INFO ]: Start difference. First operand 8 states and 1231 transitions. Second operand 3 states. [2018-06-25 00:13:13,343 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:13:13,343 INFO ]: Finished difference Result 9 states and 1241 transitions. [2018-06-25 00:13:13,343 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:13:13,343 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:13:13,343 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:13:13,345 INFO ]: With dead ends: 9 [2018-06-25 00:13:13,345 INFO ]: Without dead ends: 9 [2018-06-25 00:13:13,345 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-25 00:13:13,346 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:13:13,353 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 00:13:13,353 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:13:13,356 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1241 transitions. [2018-06-25 00:13:13,356 INFO ]: Start accepts. Automaton has 9 states and 1241 transitions. Word has length 6 [2018-06-25 00:13:13,356 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:13:13,356 INFO ]: Abstraction has 9 states and 1241 transitions. [2018-06-25 00:13:13,356 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:13:13,356 INFO ]: Start isEmpty. Operand 9 states and 1241 transitions. [2018-06-25 00:13:13,358 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:13:13,358 INFO ]: Found error trace [2018-06-25 00:13:13,358 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:13:13,358 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:13:13,358 INFO ]: Analyzing trace with hash -1032222471, now seen corresponding path program 1 times [2018-06-25 00:13:13,358 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:13:13,358 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:13:13,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:13:13,359 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:13:13,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:13:13,408 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:13:13,471 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:13:13,471 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:13:13,471 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:13:13,472 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:13:13,472 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:13:13,472 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:13:13,472 INFO ]: Start difference. First operand 9 states and 1241 transitions. Second operand 3 states. [2018-06-25 00:13:16,903 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:13:16,903 INFO ]: Finished difference Result 11 states and 1505 transitions. [2018-06-25 00:13:16,903 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:13:16,903 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:13:16,903 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:13:16,905 INFO ]: With dead ends: 11 [2018-06-25 00:13:16,905 INFO ]: Without dead ends: 11 [2018-06-25 00:13:16,906 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-25 00:13:16,906 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:13:16,912 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-25 00:13:16,912 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 00:13:16,914 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1495 transitions. [2018-06-25 00:13:16,914 INFO ]: Start accepts. Automaton has 10 states and 1495 transitions. Word has length 8 [2018-06-25 00:13:16,915 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:13:16,915 INFO ]: Abstraction has 10 states and 1495 transitions. [2018-06-25 00:13:16,915 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:13:16,915 INFO ]: Start isEmpty. Operand 10 states and 1495 transitions. [2018-06-25 00:13:16,916 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:13:16,916 INFO ]: Found error trace [2018-06-25 00:13:16,916 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:13:16,916 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:13:16,916 INFO ]: Analyzing trace with hash -1976193145, now seen corresponding path program 1 times [2018-06-25 00:13:16,916 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:13:16,916 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:13:16,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:13:16,917 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:13:16,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:13:16,962 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:13:17,029 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:13:17,029 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:13:17,029 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:13:17,029 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:13:17,029 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:13:17,029 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:13:17,029 INFO ]: Start difference. First operand 10 states and 1495 transitions. Second operand 3 states. [2018-06-25 00:13:20,179 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:13:20,179 INFO ]: Finished difference Result 13 states and 2330 transitions. [2018-06-25 00:13:20,179 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:13:20,179 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:13:20,180 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:13:20,183 INFO ]: With dead ends: 13 [2018-06-25 00:13:20,183 INFO ]: Without dead ends: 13 [2018-06-25 00:13:20,183 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-25 00:13:20,183 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 00:13:20,194 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-25 00:13:20,194 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 00:13:20,198 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2320 transitions. [2018-06-25 00:13:20,198 INFO ]: Start accepts. Automaton has 12 states and 2320 transitions. Word has length 9 [2018-06-25 00:13:20,198 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:13:20,198 INFO ]: Abstraction has 12 states and 2320 transitions. [2018-06-25 00:13:20,198 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:13:20,198 INFO ]: Start isEmpty. Operand 12 states and 2320 transitions. [2018-06-25 00:13:20,201 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:13:20,201 INFO ]: Found error trace [2018-06-25 00:13:20,201 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:13:20,201 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:13:20,201 INFO ]: Analyzing trace with hash -1975269624, now seen corresponding path program 1 times [2018-06-25 00:13:20,201 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:13:20,201 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:13:20,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:13:20,202 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:13:20,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:13:20,243 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:13:20,357 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 00:13:20,357 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:13:20,357 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:13:20,357 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:13:20,357 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:13:20,357 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:13:20,357 INFO ]: Start difference. First operand 12 states and 2320 transitions. Second operand 3 states. [2018-06-25 00:13:23,581 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:13:23,581 INFO ]: Finished difference Result 15 states and 2882 transitions. [2018-06-25 00:13:23,581 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:13:23,582 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:13:23,582 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:13:23,585 INFO ]: With dead ends: 15 [2018-06-25 00:13:23,585 INFO ]: Without dead ends: 15 [2018-06-25 00:13:23,586 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-25 00:13:23,586 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 00:13:23,596 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-25 00:13:23,596 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 00:13:23,599 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2872 transitions. [2018-06-25 00:13:23,599 INFO ]: Start accepts. Automaton has 14 states and 2872 transitions. Word has length 9 [2018-06-25 00:13:23,599 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:13:23,599 INFO ]: Abstraction has 14 states and 2872 transitions. [2018-06-25 00:13:23,599 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:13:23,599 INFO ]: Start isEmpty. Operand 14 states and 2872 transitions. [2018-06-25 00:13:23,601 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:13:23,601 INFO ]: Found error trace [2018-06-25 00:13:23,601 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:13:23,601 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:13:23,601 INFO ]: Analyzing trace with hash -1966034414, now seen corresponding path program 1 times [2018-06-25 00:13:23,601 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:13:23,601 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:13:23,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:13:23,602 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:13:23,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:13:23,634 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:13:23,705 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 00:13:23,706 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:13:23,706 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:13:23,706 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:13:23,706 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:13:23,706 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:13:23,706 INFO ]: Start difference. First operand 14 states and 2872 transitions. Second operand 3 states. [2018-06-25 00:13:26,715 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:13:26,716 INFO ]: Finished difference Result 17 states and 3470 transitions. [2018-06-25 00:13:26,717 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:13:26,717 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:13:26,717 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:13:26,721 INFO ]: With dead ends: 17 [2018-06-25 00:13:26,721 INFO ]: Without dead ends: 17 [2018-06-25 00:13:26,722 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-25 00:13:26,722 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 00:13:26,733 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-06-25 00:13:26,733 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 00:13:26,735 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3460 transitions. [2018-06-25 00:13:26,735 INFO ]: Start accepts. Automaton has 16 states and 3460 transitions. Word has length 9 [2018-06-25 00:13:26,735 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:13:26,735 INFO ]: Abstraction has 16 states and 3460 transitions. [2018-06-25 00:13:26,735 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:13:26,736 INFO ]: Start isEmpty. Operand 16 states and 3460 transitions. [2018-06-25 00:13:26,737 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:13:26,737 INFO ]: Found error trace [2018-06-25 00:13:26,737 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:13:26,737 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:13:26,738 INFO ]: Analyzing trace with hash 1385094420, now seen corresponding path program 1 times [2018-06-25 00:13:26,738 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:13:26,738 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:13:26,738 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:13:26,738 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:13:26,738 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:13:26,765 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:13:26,853 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 00:13:26,854 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:13:26,854 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:13:26,854 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:13:26,854 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:13:26,854 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:13:26,854 INFO ]: Start difference. First operand 16 states and 3460 transitions. Second operand 3 states. Received shutdown request... [2018-06-25 00:13:29,139 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:13:29,140 WARN ]: Verification canceled [2018-06-25 00:13:29,143 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:13:29,144 WARN ]: Timeout [2018-06-25 00:13:29,144 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:13:29 BasicIcfg [2018-06-25 00:13:29,144 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:13:29,145 INFO ]: Toolchain (without parser) took 73774.86 ms. Allocated memory was 306.7 MB in the beginning and 1.0 GB in the end (delta: 733.0 MB). Free memory was 239.3 MB in the beginning and 301.5 MB in the end (delta: -62.2 MB). Peak memory consumption was 670.8 MB. Max. memory is 3.6 GB. [2018-06-25 00:13:29,146 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 306.7 MB. Free memory is still 271.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:13:29,147 INFO ]: ChcToBoogie took 129.88 ms. Allocated memory is still 306.7 MB. Free memory was 239.3 MB in the beginning and 237.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:13:29,147 INFO ]: Boogie Preprocessor took 57.93 ms. Allocated memory is still 306.7 MB. Free memory was 237.3 MB in the beginning and 235.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:13:29,147 INFO ]: RCFGBuilder took 509.13 ms. Allocated memory is still 306.7 MB. Free memory was 235.3 MB in the beginning and 201.4 MB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 3.6 GB. [2018-06-25 00:13:29,148 INFO ]: BlockEncodingV2 took 42189.23 ms. Allocated memory was 306.7 MB in the beginning and 399.5 MB in the end (delta: 92.8 MB). Free memory was 201.4 MB in the beginning and 191.0 MB in the end (delta: 10.4 MB). Peak memory consumption was 130.6 MB. Max. memory is 3.6 GB. [2018-06-25 00:13:29,148 INFO ]: TraceAbstraction took 30878.99 ms. Allocated memory was 399.5 MB in the beginning and 1.0 GB in the end (delta: 640.2 MB). Free memory was 191.0 MB in the beginning and 301.5 MB in the end (delta: -110.5 MB). Peak memory consumption was 529.6 MB. Max. memory is 3.6 GB. [2018-06-25 00:13:29,152 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, 1116 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 306.7 MB. Free memory is still 271.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 129.88 ms. Allocated memory is still 306.7 MB. Free memory was 239.3 MB in the beginning and 237.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 57.93 ms. Allocated memory is still 306.7 MB. Free memory was 237.3 MB in the beginning and 235.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 509.13 ms. Allocated memory is still 306.7 MB. Free memory was 235.3 MB in the beginning and 201.4 MB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 42189.23 ms. Allocated memory was 306.7 MB in the beginning and 399.5 MB in the end (delta: 92.8 MB). Free memory was 201.4 MB in the beginning and 191.0 MB in the end (delta: 10.4 MB). Peak memory consumption was 130.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 30878.99 ms. Allocated memory was 399.5 MB in the beginning and 1.0 GB in the end (delta: 640.2 MB). Free memory was 191.0 MB in the beginning and 301.5 MB in the end (delta: -110.5 MB). Peak memory consumption was 529.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (16states) and interpolant automaton (currently 3 states, 3 states before enhancement), while ReachableStatesComputation was computing reachable states (11 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 30.8s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 29.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 37 SDtfs, 0 SDslu, 26 SDs, 0 SdLazy, 7593 SolverSat, 7394 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred 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, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 457 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 48/48 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_9.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-13-29-163.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_9.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-13-29-163.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_9.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-13-29-163.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_9.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-13-29-163.csv Completed graceful shutdown