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_13.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:04:08,503 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:04:08,505 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:04:08,519 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:04:08,519 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:04:08,520 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:04:08,521 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:04:08,523 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:04:08,525 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:04:08,527 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:04:08,528 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:04:08,528 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:04:08,529 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:04:08,530 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:04:08,534 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:04:08,535 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:04:08,536 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:04:08,549 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:04:08,551 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:04:08,552 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:04:08,553 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:04:08,555 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:04:08,555 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:04:08,556 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:04:08,556 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:04:08,557 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:04:08,562 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:04:08,563 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:04:08,564 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:04:08,564 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:04:08,565 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:04:08,571 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:04:08,572 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:04:08,572 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:04:08,573 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:04:08,573 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:04:08,592 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:04:08,592 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:04:08,592 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:04:08,593 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:04:08,596 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:04:08,596 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:04:08,596 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:04:08,597 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:04:08,597 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:04:08,597 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:04:08,597 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:04:08,597 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:04:08,598 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:04:08,598 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:04:08,598 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:04:08,598 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:04:08,598 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:04:08,599 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:04:08,600 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:04:08,600 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:04:08,600 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:04:08,601 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:04:08,602 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:04:08,650 INFO ]: Repository-Root is: /tmp [2018-06-25 00:04:08,667 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:04:08,672 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:04:08,674 INFO ]: Initializing SmtParser... [2018-06-25 00:04:08,674 INFO ]: SmtParser initialized [2018-06-25 00:04:08,675 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_13.cil.smt2 [2018-06-25 00:04:08,676 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:04:08,763 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_13.cil.smt2 unknown [2018-06-25 00:04:09,287 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_13.cil.smt2 [2018-06-25 00:04:09,291 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:04:09,296 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:04:09,297 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:04:09,297 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:04:09,297 INFO ]: ChcToBoogie initialized [2018-06-25 00:04:09,300 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:04:09" (1/1) ... [2018-06-25 00:04:09,363 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:04:09 Unit [2018-06-25 00:04:09,363 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:04:09,364 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:04:09,364 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:04:09,364 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:04:09,385 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:04:09" (1/1) ... [2018-06-25 00:04:09,385 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:04:09" (1/1) ... [2018-06-25 00:04:09,410 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:04:09" (1/1) ... [2018-06-25 00:04:09,410 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:04:09" (1/1) ... [2018-06-25 00:04:09,425 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:04:09" (1/1) ... [2018-06-25 00:04:09,428 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:04:09" (1/1) ... [2018-06-25 00:04:09,436 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:04:09" (1/1) ... [2018-06-25 00:04:09,441 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:04:09,441 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:04:09,441 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:04:09,441 INFO ]: RCFGBuilder initialized [2018-06-25 00:04:09,442 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:04:09" (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:04:09,455 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:04:09,455 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:04:09,455 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:04:09,455 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:04:09,455 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:04:09,455 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:04:09,832 INFO ]: Using library mode [2018-06-25 00:04:09,833 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:04:09 BoogieIcfgContainer [2018-06-25 00:04:09,833 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:04:09,833 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:04:09,833 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:04:09,834 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:04:09,835 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:04:09" (1/1) ... [2018-06-25 00:04:09,851 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:04:09,852 INFO ]: Using Remove infeasible edges [2018-06-25 00:04:09,853 INFO ]: Using Maximize final states [2018-06-25 00:04:09,853 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:04:09,853 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:04:09,855 INFO ]: Using Remove sink states [2018-06-25 00:04:09,856 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:04:09,856 INFO ]: Using Use SBE [2018-06-25 00:04:10,762 WARN ]: Simplifying disjunction of 8624 conjuctions. This might take some time... [2018-06-25 00:04:46,741 INFO ]: Simplified to disjunction of 8624 conjuctions. [2018-06-25 00:04:47,841 INFO ]: SBE split 1 edges [2018-06-25 00:04:47,946 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:04:47,950 INFO ]: 0 new accepting states [2018-06-25 00:04:48,007 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-25 00:04:48,009 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:04:48,136 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:04:48,137 INFO ]: 0 new accepting states [2018-06-25 00:04:48,138 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:04:48,138 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:04:48,286 INFO ]: Encoded RCFG 6 locations, 1083 edges [2018-06-25 00:04:48,287 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:04:48 BasicIcfg [2018-06-25 00:04:48,287 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:04:48,289 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:04:48,289 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:04:48,293 INFO ]: TraceAbstraction initialized [2018-06-25 00:04:48,293 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:04:09" (1/4) ... [2018-06-25 00:04:48,294 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3761308e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:04:48, skipping insertion in model container [2018-06-25 00:04:48,295 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:04:09" (2/4) ... [2018-06-25 00:04:48,296 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3761308e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:04:48, skipping insertion in model container [2018-06-25 00:04:48,296 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:04:09" (3/4) ... [2018-06-25 00:04:48,296 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3761308e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:04:48, skipping insertion in model container [2018-06-25 00:04:48,296 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:04:48" (4/4) ... [2018-06-25 00:04:48,298 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:04:48,309 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:04:48,318 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:04:48,354 INFO ]: Using default assertion order modulation [2018-06-25 00:04:48,354 INFO ]: Interprodecural is true [2018-06-25 00:04:48,354 INFO ]: Hoare is false [2018-06-25 00:04:48,354 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:04:48,354 INFO ]: Backedges is TWOTRACK [2018-06-25 00:04:48,354 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:04:48,354 INFO ]: Difference is false [2018-06-25 00:04:48,355 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:04:48,355 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:04:48,369 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:04:48,386 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:04:48,386 INFO ]: Found error trace [2018-06-25 00:04:48,387 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:04:48,387 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:04:48,392 INFO ]: Analyzing trace with hash 68553218, now seen corresponding path program 1 times [2018-06-25 00:04:48,393 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:04:48,393 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:04:48,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:04:48,427 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:04:48,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:04:48,502 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:04:48,642 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:04:48,646 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:04:48,646 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:04:48,648 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:04:48,663 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:04:48,664 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:04:48,671 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:04:55,644 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:04:55,644 INFO ]: Finished difference Result 7 states and 1179 transitions. [2018-06-25 00:04:55,644 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:04:55,645 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:04:55,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:04:55,660 INFO ]: With dead ends: 7 [2018-06-25 00:04:55,660 INFO ]: Without dead ends: 7 [2018-06-25 00:04:55,662 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:04:55,682 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:04:55,717 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:04:55,718 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:04:55,721 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1179 transitions. [2018-06-25 00:04:55,722 INFO ]: Start accepts. Automaton has 7 states and 1179 transitions. Word has length 5 [2018-06-25 00:04:55,723 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:04:55,723 INFO ]: Abstraction has 7 states and 1179 transitions. [2018-06-25 00:04:55,723 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:04:55,723 INFO ]: Start isEmpty. Operand 7 states and 1179 transitions. [2018-06-25 00:04:55,724 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:04:55,724 INFO ]: Found error trace [2018-06-25 00:04:55,724 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:04:55,724 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:04:55,725 INFO ]: Analyzing trace with hash 2099018405, now seen corresponding path program 1 times [2018-06-25 00:04:55,725 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:04:55,725 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:04:55,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:04:55,725 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:04:55,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:04:55,765 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:04:55,820 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:04:55,820 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:04:55,820 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:04:55,822 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:04:55,822 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:04:55,822 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:04:55,822 INFO ]: Start difference. First operand 7 states and 1179 transitions. Second operand 3 states. [2018-06-25 00:04:59,278 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:04:59,278 INFO ]: Finished difference Result 8 states and 1181 transitions. [2018-06-25 00:04:59,278 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:04:59,279 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:04:59,279 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:04:59,280 INFO ]: With dead ends: 8 [2018-06-25 00:04:59,280 INFO ]: Without dead ends: 8 [2018-06-25 00:04:59,281 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:04:59,281 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 00:04:59,295 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 00:04:59,295 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:04:59,298 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1181 transitions. [2018-06-25 00:04:59,298 INFO ]: Start accepts. Automaton has 8 states and 1181 transitions. Word has length 6 [2018-06-25 00:04:59,298 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:04:59,298 INFO ]: Abstraction has 8 states and 1181 transitions. [2018-06-25 00:04:59,298 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:04:59,298 INFO ]: Start isEmpty. Operand 8 states and 1181 transitions. [2018-06-25 00:04:59,299 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:04:59,299 INFO ]: Found error trace [2018-06-25 00:04:59,299 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:04:59,299 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:04:59,299 INFO ]: Analyzing trace with hash 2123476816, now seen corresponding path program 1 times [2018-06-25 00:04:59,299 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:04:59,299 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:04:59,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:04:59,300 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:04:59,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:04:59,325 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:04:59,376 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:04:59,376 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:04:59,377 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:04:59,377 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:04:59,377 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:04:59,377 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:04:59,377 INFO ]: Start difference. First operand 8 states and 1181 transitions. Second operand 3 states. [2018-06-25 00:05:02,936 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:05:02,936 INFO ]: Finished difference Result 9 states and 1191 transitions. [2018-06-25 00:05:02,937 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:05:02,937 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:05:02,937 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:05:02,939 INFO ]: With dead ends: 9 [2018-06-25 00:05:02,939 INFO ]: Without dead ends: 9 [2018-06-25 00:05:02,939 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:05:02,939 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:05:02,946 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 00:05:02,946 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:05:02,948 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1191 transitions. [2018-06-25 00:05:02,948 INFO ]: Start accepts. Automaton has 9 states and 1191 transitions. Word has length 6 [2018-06-25 00:05:02,948 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:05:02,948 INFO ]: Abstraction has 9 states and 1191 transitions. [2018-06-25 00:05:02,948 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:05:02,948 INFO ]: Start isEmpty. Operand 9 states and 1191 transitions. [2018-06-25 00:05:02,949 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:05:02,949 INFO ]: Found error trace [2018-06-25 00:05:02,949 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:05:02,949 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:05:02,949 INFO ]: Analyzing trace with hash 157917839, now seen corresponding path program 1 times [2018-06-25 00:05:02,950 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:05:02,950 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:05:02,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:05:02,952 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:05:02,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:05:03,015 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:05:03,101 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:05:03,101 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:05:03,101 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:05:03,101 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:05:03,101 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:05:03,101 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:05:03,101 INFO ]: Start difference. First operand 9 states and 1191 transitions. Second operand 3 states. [2018-06-25 00:05:06,150 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:05:06,150 INFO ]: Finished difference Result 11 states and 1479 transitions. [2018-06-25 00:05:06,151 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:05:06,151 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:05:06,151 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:05:06,153 INFO ]: With dead ends: 11 [2018-06-25 00:05:06,153 INFO ]: Without dead ends: 11 [2018-06-25 00:05:06,153 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:05:06,153 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:05:06,159 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-25 00:05:06,159 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 00:05:06,162 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1469 transitions. [2018-06-25 00:05:06,162 INFO ]: Start accepts. Automaton has 10 states and 1469 transitions. Word has length 8 [2018-06-25 00:05:06,162 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:05:06,162 INFO ]: Abstraction has 10 states and 1469 transitions. [2018-06-25 00:05:06,162 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:05:06,162 INFO ]: Start isEmpty. Operand 10 states and 1469 transitions. [2018-06-25 00:05:06,163 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:05:06,163 INFO ]: Found error trace [2018-06-25 00:05:06,163 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:05:06,163 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:05:06,163 INFO ]: Analyzing trace with hash 1361194252, now seen corresponding path program 1 times [2018-06-25 00:05:06,163 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:05:06,163 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:05:06,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:05:06,165 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:05:06,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:05:06,223 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:05:06,342 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:05:06,342 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:05:06,343 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:05:06,343 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:05:06,343 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:05:06,343 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:05:06,343 INFO ]: Start difference. First operand 10 states and 1469 transitions. Second operand 3 states. [2018-06-25 00:05:09,246 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:05:09,246 INFO ]: Finished difference Result 12 states and 1757 transitions. [2018-06-25 00:05:09,246 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:05:09,247 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:05:09,247 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:05:09,249 INFO ]: With dead ends: 12 [2018-06-25 00:05:09,249 INFO ]: Without dead ends: 12 [2018-06-25 00:05:09,249 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:05:09,249 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 00:05:09,255 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-25 00:05:09,255 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 00:05:09,258 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1469 transitions. [2018-06-25 00:05:09,258 INFO ]: Start accepts. Automaton has 10 states and 1469 transitions. Word has length 9 [2018-06-25 00:05:09,258 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:05:09,258 INFO ]: Abstraction has 10 states and 1469 transitions. [2018-06-25 00:05:09,258 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:05:09,258 INFO ]: Start isEmpty. Operand 10 states and 1469 transitions. [2018-06-25 00:05:09,259 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:05:09,259 INFO ]: Found error trace [2018-06-25 00:05:09,259 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:05:09,259 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:05:09,259 INFO ]: Analyzing trace with hash 1365811857, now seen corresponding path program 1 times [2018-06-25 00:05:09,259 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:05:09,259 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:05:09,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:05:09,260 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:05:09,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:05:09,300 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:05:09,395 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:05:09,395 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:05:09,395 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:05:09,395 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:05:09,395 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:05:09,396 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:05:09,396 INFO ]: Start difference. First operand 10 states and 1469 transitions. Second operand 3 states. [2018-06-25 00:05:12,093 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:05:12,094 INFO ]: Finished difference Result 12 states and 1785 transitions. [2018-06-25 00:05:12,095 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:05:12,095 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:05:12,095 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:05:12,097 INFO ]: With dead ends: 12 [2018-06-25 00:05:12,097 INFO ]: Without dead ends: 12 [2018-06-25 00:05:12,097 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:05:12,097 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 00:05:12,103 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-25 00:05:12,104 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 00:05:12,107 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1775 transitions. [2018-06-25 00:05:12,107 INFO ]: Start accepts. Automaton has 11 states and 1775 transitions. Word has length 9 [2018-06-25 00:05:12,108 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:05:12,108 INFO ]: Abstraction has 11 states and 1775 transitions. [2018-06-25 00:05:12,108 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:05:12,108 INFO ]: Start isEmpty. Operand 11 states and 1775 transitions. [2018-06-25 00:05:12,109 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:05:12,109 INFO ]: Found error trace [2018-06-25 00:05:12,109 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:05:12,109 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:05:12,109 INFO ]: Analyzing trace with hash 1367658899, now seen corresponding path program 1 times [2018-06-25 00:05:12,109 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:05:12,109 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:05:12,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:05:12,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:05:12,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:05:12,142 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:05:12,230 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:05:12,230 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:05:12,230 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:05:12,230 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:05:12,230 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:05:12,230 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:05:12,230 INFO ]: Start difference. First operand 11 states and 1775 transitions. Second operand 3 states. [2018-06-25 00:05:14,922 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:05:14,922 INFO ]: Finished difference Result 13 states and 1931 transitions. [2018-06-25 00:05:15,015 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:05:15,015 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:05:15,015 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:05:15,017 INFO ]: With dead ends: 13 [2018-06-25 00:05:15,017 INFO ]: Without dead ends: 12 [2018-06-25 00:05:15,017 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:05:15,018 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 00:05:15,027 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 00:05:15,027 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 00:05:15,029 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1930 transitions. [2018-06-25 00:05:15,029 INFO ]: Start accepts. Automaton has 12 states and 1930 transitions. Word has length 9 [2018-06-25 00:05:15,029 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:05:15,029 INFO ]: Abstraction has 12 states and 1930 transitions. [2018-06-25 00:05:15,029 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:05:15,029 INFO ]: Start isEmpty. Operand 12 states and 1930 transitions. [2018-06-25 00:05:15,030 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:05:15,030 INFO ]: Found error trace [2018-06-25 00:05:15,030 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:05:15,030 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:05:15,030 INFO ]: Analyzing trace with hash 915133609, now seen corresponding path program 1 times [2018-06-25 00:05:15,030 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:05:15,030 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:05:15,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:05:15,034 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:05:15,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:05:15,059 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:05:15,145 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:05:15,146 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:05:15,146 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:05:15,146 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:05:15,146 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:05:15,146 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:05:15,146 INFO ]: Start difference. First operand 12 states and 1930 transitions. Second operand 3 states. [2018-06-25 00:05:18,127 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:05:18,127 INFO ]: Finished difference Result 17 states and 2771 transitions. [2018-06-25 00:05:18,128 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:05:18,128 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:05:18,128 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:05:18,130 INFO ]: With dead ends: 17 [2018-06-25 00:05:18,130 INFO ]: Without dead ends: 17 [2018-06-25 00:05:18,130 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:05:18,130 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 00:05:18,139 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-25 00:05:18,139 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 00:05:18,141 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2771 transitions. [2018-06-25 00:05:18,142 INFO ]: Start accepts. Automaton has 17 states and 2771 transitions. Word has length 9 [2018-06-25 00:05:18,142 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:05:18,142 INFO ]: Abstraction has 17 states and 2771 transitions. [2018-06-25 00:05:18,142 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:05:18,142 INFO ]: Start isEmpty. Operand 17 states and 2771 transitions. [2018-06-25 00:05:18,144 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:05:18,144 INFO ]: Found error trace [2018-06-25 00:05:18,144 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:05:18,144 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:05:18,144 INFO ]: Analyzing trace with hash 1085719223, now seen corresponding path program 1 times [2018-06-25 00:05:18,144 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:05:18,144 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:05:18,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:05:18,145 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:05:18,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:05:18,170 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:05:18,259 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:05:18,260 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:05:18,260 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:05:18,260 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:05:18,260 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:05:18,260 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:05:18,260 INFO ]: Start difference. First operand 17 states and 2771 transitions. Second operand 3 states. [2018-06-25 00:05:21,298 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:05:21,298 INFO ]: Finished difference Result 22 states and 3642 transitions. [2018-06-25 00:05:21,298 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:05:21,298 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:05:21,298 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:05:21,302 INFO ]: With dead ends: 22 [2018-06-25 00:05:21,302 INFO ]: Without dead ends: 22 [2018-06-25 00:05:21,302 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:05:21,302 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 00:05:21,317 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-25 00:05:21,317 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 00:05:21,321 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3642 transitions. [2018-06-25 00:05:21,321 INFO ]: Start accepts. Automaton has 22 states and 3642 transitions. Word has length 9 [2018-06-25 00:05:21,321 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:05:21,321 INFO ]: Abstraction has 22 states and 3642 transitions. [2018-06-25 00:05:21,321 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:05:21,321 INFO ]: Start isEmpty. Operand 22 states and 3642 transitions. [2018-06-25 00:05:21,324 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:05:21,325 INFO ]: Found error trace [2018-06-25 00:05:21,325 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:05:21,325 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:05:21,325 INFO ]: Analyzing trace with hash -2096710072, now seen corresponding path program 1 times [2018-06-25 00:05:21,325 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:05:21,325 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:05:21,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:05:21,325 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:05:21,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:05:21,356 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:05:21,444 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 00:05:21,444 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:05:21,444 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:05:21,444 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:05:21,444 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:05:21,444 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:05:21,444 INFO ]: Start difference. First operand 22 states and 3642 transitions. Second operand 3 states. Received shutdown request... [2018-06-25 00:05:23,189 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:05:23,189 WARN ]: Verification canceled [2018-06-25 00:05:23,192 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:05:23,193 WARN ]: Timeout [2018-06-25 00:05:23,193 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:05:23 BasicIcfg [2018-06-25 00:05:23,194 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:05:23,194 INFO ]: Toolchain (without parser) took 73902.74 ms. Allocated memory was 305.7 MB in the beginning and 1.2 GB in the end (delta: 889.2 MB). Free memory was 239.1 MB in the beginning and 906.6 MB in the end (delta: -667.5 MB). Peak memory consumption was 221.7 MB. Max. memory is 3.6 GB. [2018-06-25 00:05:23,195 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.7 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:05:23,196 INFO ]: ChcToBoogie took 66.97 ms. Allocated memory is still 305.7 MB. Free memory was 239.1 MB in the beginning and 236.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:05:23,196 INFO ]: Boogie Preprocessor took 76.92 ms. Allocated memory is still 305.7 MB. Free memory was 236.1 MB in the beginning and 234.1 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:05:23,196 INFO ]: RCFGBuilder took 391.26 ms. Allocated memory is still 305.7 MB. Free memory was 234.1 MB in the beginning and 202.0 MB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 3.6 GB. [2018-06-25 00:05:23,197 INFO ]: BlockEncodingV2 took 38453.71 ms. Allocated memory was 305.7 MB in the beginning and 398.5 MB in the end (delta: 92.8 MB). Free memory was 202.0 MB in the beginning and 255.8 MB in the end (delta: -53.8 MB). Peak memory consumption was 135.1 MB. Max. memory is 3.6 GB. [2018-06-25 00:05:23,197 INFO ]: TraceAbstraction took 34904.16 ms. Allocated memory was 398.5 MB in the beginning and 1.2 GB in the end (delta: 796.4 MB). Free memory was 255.8 MB in the beginning and 906.6 MB in the end (delta: -650.7 MB). Peak memory consumption was 145.7 MB. Max. memory is 3.6 GB. [2018-06-25 00:05:23,200 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, 1083 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 305.7 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 66.97 ms. Allocated memory is still 305.7 MB. Free memory was 239.1 MB in the beginning and 236.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 76.92 ms. Allocated memory is still 305.7 MB. Free memory was 236.1 MB in the beginning and 234.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 391.26 ms. Allocated memory is still 305.7 MB. Free memory was 234.1 MB in the beginning and 202.0 MB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 38453.71 ms. Allocated memory was 305.7 MB in the beginning and 398.5 MB in the end (delta: 92.8 MB). Free memory was 202.0 MB in the beginning and 255.8 MB in the end (delta: -53.8 MB). Peak memory consumption was 135.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 34904.16 ms. Allocated memory was 398.5 MB in the beginning and 1.2 GB in the end (delta: 796.4 MB). Free memory was 255.8 MB in the beginning and 906.6 MB in the end (delta: -650.7 MB). Peak memory consumption was 145.7 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 (22states) and interpolant automaton (currently 3 states, 3 states before enhancement), while ReachableStatesComputation was computing reachable states (16 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 34.8s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 33.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 47 SDtfs, 0 SDslu, 34 SDs, 0 SdLazy, 9871 SolverSat, 7626 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=9, 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, 9 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 628 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 73/73 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_13.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-05-23-211.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_13.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-05-23-211.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_13.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-05-23-211.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_13.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-05-23-211.csv Completed graceful shutdown