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_2_BUG.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:07:49,954 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:07:49,957 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:07:49,969 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:07:49,970 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:07:49,970 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:07:49,974 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:07:49,976 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:07:49,977 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:07:49,978 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:07:49,980 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:07:49,980 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:07:49,981 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:07:49,982 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:07:49,985 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:07:49,986 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:07:49,987 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:07:49,997 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:07:49,999 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:07:50,000 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:07:50,001 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:07:50,002 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:07:50,006 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:07:50,006 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:07:50,007 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:07:50,008 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:07:50,008 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:07:50,009 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:07:50,013 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:07:50,013 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:07:50,014 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:07:50,015 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:07:50,015 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:07:50,015 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:07:50,017 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:07:50,018 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:07:50,035 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:07:50,035 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:07:50,036 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:07:50,036 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:07:50,037 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:07:50,037 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:07:50,037 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:07:50,037 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:07:50,038 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:07:50,038 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:07:50,038 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:07:50,038 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:07:50,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:07:50,039 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:07:50,039 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:07:50,039 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:07:50,039 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:07:50,039 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:07:50,040 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:07:50,040 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:07:50,040 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:07:50,041 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:07:50,042 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:07:50,088 INFO ]: Repository-Root is: /tmp [2018-06-25 00:07:50,108 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:07:50,115 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:07:50,116 INFO ]: Initializing SmtParser... [2018-06-25 00:07:50,117 INFO ]: SmtParser initialized [2018-06-25 00:07:50,118 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_2_BUG.cil.smt2 [2018-06-25 00:07:50,119 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:07:50,211 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_2_BUG.cil.smt2 unknown [2018-06-25 00:07:50,774 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_2_BUG.cil.smt2 [2018-06-25 00:07:50,782 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:07:50,788 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:07:50,788 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:07:50,788 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:07:50,789 INFO ]: ChcToBoogie initialized [2018-06-25 00:07:50,792 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:07:50" (1/1) ... [2018-06-25 00:07:50,868 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:07:50 Unit [2018-06-25 00:07:50,869 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:07:50,869 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:07:50,869 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:07:50,869 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:07:50,909 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:07:50" (1/1) ... [2018-06-25 00:07:50,909 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:07:50" (1/1) ... [2018-06-25 00:07:50,935 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:07:50" (1/1) ... [2018-06-25 00:07:50,935 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:07:50" (1/1) ... [2018-06-25 00:07:50,955 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:07:50" (1/1) ... [2018-06-25 00:07:50,956 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:07:50" (1/1) ... [2018-06-25 00:07:50,961 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:07:50" (1/1) ... [2018-06-25 00:07:50,966 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:07:50,966 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:07:50,966 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:07:50,966 INFO ]: RCFGBuilder initialized [2018-06-25 00:07:50,967 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:07:50" (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:07:50,977 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:07:50,977 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:07:50,977 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:07:50,977 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:07:50,977 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:07:50,977 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:07:51,411 INFO ]: Using library mode [2018-06-25 00:07:51,414 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:07:51 BoogieIcfgContainer [2018-06-25 00:07:51,414 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:07:51,415 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:07:51,415 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:07:51,416 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:07:51,416 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:07:51" (1/1) ... [2018-06-25 00:07:51,437 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:07:51,439 INFO ]: Using Remove infeasible edges [2018-06-25 00:07:51,439 INFO ]: Using Maximize final states [2018-06-25 00:07:51,440 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:07:51,441 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:07:51,442 INFO ]: Using Remove sink states [2018-06-25 00:07:51,443 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:07:51,443 INFO ]: Using Use SBE [2018-06-25 00:07:52,589 WARN ]: Simplifying disjunction of 7032 conjuctions. This might take some time... [2018-06-25 00:08:15,391 INFO ]: Simplified to disjunction of 7032 conjuctions. [2018-06-25 00:08:16,291 INFO ]: SBE split 1 edges [2018-06-25 00:08:16,394 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:08:16,396 INFO ]: 0 new accepting states [2018-06-25 00:08:16,458 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-25 00:08:16,460 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:08:16,556 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:08:16,556 INFO ]: 0 new accepting states [2018-06-25 00:08:16,558 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:08:16,559 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:08:16,680 INFO ]: Encoded RCFG 6 locations, 884 edges [2018-06-25 00:08:16,680 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:08:16 BasicIcfg [2018-06-25 00:08:16,680 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:08:16,682 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:08:16,683 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:08:16,686 INFO ]: TraceAbstraction initialized [2018-06-25 00:08:16,686 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:07:50" (1/4) ... [2018-06-25 00:08:16,687 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1200d1a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:08:16, skipping insertion in model container [2018-06-25 00:08:16,687 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:07:50" (2/4) ... [2018-06-25 00:08:16,687 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1200d1a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:08:16, skipping insertion in model container [2018-06-25 00:08:16,688 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:07:51" (3/4) ... [2018-06-25 00:08:16,688 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1200d1a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:08:16, skipping insertion in model container [2018-06-25 00:08:16,688 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:08:16" (4/4) ... [2018-06-25 00:08:16,689 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:08:16,699 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:08:16,708 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:08:16,752 INFO ]: Using default assertion order modulation [2018-06-25 00:08:16,752 INFO ]: Interprodecural is true [2018-06-25 00:08:16,752 INFO ]: Hoare is false [2018-06-25 00:08:16,752 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:08:16,752 INFO ]: Backedges is TWOTRACK [2018-06-25 00:08:16,752 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:08:16,752 INFO ]: Difference is false [2018-06-25 00:08:16,752 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:08:16,752 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:08:16,765 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:08:16,784 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:08:16,784 INFO ]: Found error trace [2018-06-25 00:08:16,785 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:08:16,786 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:16,789 INFO ]: Analyzing trace with hash 62433570, now seen corresponding path program 1 times [2018-06-25 00:08:16,791 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:16,791 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:16,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:16,822 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:16,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:16,883 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:16,966 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:08:16,968 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:08:16,968 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:08:16,970 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:08:16,981 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:08:16,982 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:16,984 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:08:22,900 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:08:22,901 INFO ]: Finished difference Result 7 states and 981 transitions. [2018-06-25 00:08:22,901 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:08:22,902 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:08:22,902 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:08:22,916 INFO ]: With dead ends: 7 [2018-06-25 00:08:22,916 INFO ]: Without dead ends: 7 [2018-06-25 00:08:22,918 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:08:22,931 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:08:22,969 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:08:22,971 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:08:22,974 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 981 transitions. [2018-06-25 00:08:22,975 INFO ]: Start accepts. Automaton has 7 states and 981 transitions. Word has length 5 [2018-06-25 00:08:22,976 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:08:22,976 INFO ]: Abstraction has 7 states and 981 transitions. [2018-06-25 00:08:22,976 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:08:22,976 INFO ]: Start isEmpty. Operand 7 states and 981 transitions. [2018-06-25 00:08:22,977 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:08:22,977 INFO ]: Found error trace [2018-06-25 00:08:22,977 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:08:22,977 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:22,977 INFO ]: Analyzing trace with hash 1912782371, now seen corresponding path program 1 times [2018-06-25 00:08:22,977 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:22,977 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:22,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:22,978 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:22,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:23,016 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:23,060 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:08:23,060 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:08:23,060 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:08:23,061 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:08:23,061 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:08:23,061 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:23,061 INFO ]: Start difference. First operand 7 states and 981 transitions. Second operand 3 states. [2018-06-25 00:08:25,892 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:08:25,892 INFO ]: Finished difference Result 8 states and 983 transitions. [2018-06-25 00:08:25,892 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:08:25,892 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:08:25,893 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:08:25,894 INFO ]: With dead ends: 8 [2018-06-25 00:08:25,894 INFO ]: Without dead ends: 8 [2018-06-25 00:08:25,895 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:08:25,895 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 00:08:25,905 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 00:08:25,905 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:08:25,907 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 983 transitions. [2018-06-25 00:08:25,907 INFO ]: Start accepts. Automaton has 8 states and 983 transitions. Word has length 6 [2018-06-25 00:08:25,908 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:08:25,908 INFO ]: Abstraction has 8 states and 983 transitions. [2018-06-25 00:08:25,908 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:08:25,908 INFO ]: Start isEmpty. Operand 8 states and 983 transitions. [2018-06-25 00:08:25,908 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:08:25,908 INFO ]: Found error trace [2018-06-25 00:08:25,908 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:08:25,908 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:25,908 INFO ]: Analyzing trace with hash 1913914429, now seen corresponding path program 1 times [2018-06-25 00:08:25,908 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:25,908 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:25,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:25,909 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:25,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:25,940 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:26,013 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:08:26,013 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:08:26,013 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:08:26,013 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:08:26,013 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:08:26,013 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:26,013 INFO ]: Start difference. First operand 8 states and 983 transitions. Second operand 3 states. [2018-06-25 00:08:29,061 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:08:29,061 INFO ]: Finished difference Result 9 states and 985 transitions. [2018-06-25 00:08:29,064 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:08:29,064 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:08:29,064 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:08:29,065 INFO ]: With dead ends: 9 [2018-06-25 00:08:29,065 INFO ]: Without dead ends: 9 [2018-06-25 00:08:29,066 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:08:29,066 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:08:29,071 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 00:08:29,072 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:08:29,073 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 985 transitions. [2018-06-25 00:08:29,074 INFO ]: Start accepts. Automaton has 9 states and 985 transitions. Word has length 6 [2018-06-25 00:08:29,075 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:08:29,075 INFO ]: Abstraction has 9 states and 985 transitions. [2018-06-25 00:08:29,075 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:08:29,075 INFO ]: Start isEmpty. Operand 9 states and 985 transitions. [2018-06-25 00:08:29,075 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:08:29,075 INFO ]: Found error trace [2018-06-25 00:08:29,075 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:08:29,076 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:29,076 INFO ]: Analyzing trace with hash -841488927, now seen corresponding path program 1 times [2018-06-25 00:08:29,076 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:29,076 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:29,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:29,077 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:29,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:29,129 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:29,217 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:08:29,217 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:08:29,217 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:08:29,218 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:08:29,218 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:08:29,218 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:29,218 INFO ]: Start difference. First operand 9 states and 985 transitions. Second operand 3 states. [2018-06-25 00:08:32,256 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:08:32,256 INFO ]: Finished difference Result 11 states and 1025 transitions. [2018-06-25 00:08:32,256 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:08:32,257 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:08:32,257 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:08:32,258 INFO ]: With dead ends: 11 [2018-06-25 00:08:32,258 INFO ]: Without dead ends: 11 [2018-06-25 00:08:32,258 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:08:32,258 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:08:32,262 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-25 00:08:32,262 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 00:08:32,264 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1023 transitions. [2018-06-25 00:08:32,264 INFO ]: Start accepts. Automaton has 10 states and 1023 transitions. Word has length 8 [2018-06-25 00:08:32,265 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:08:32,265 INFO ]: Abstraction has 10 states and 1023 transitions. [2018-06-25 00:08:32,265 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:08:32,265 INFO ]: Start isEmpty. Operand 10 states and 1023 transitions. [2018-06-25 00:08:32,265 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:08:32,265 INFO ]: Found error trace [2018-06-25 00:08:32,265 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:08:32,265 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:32,266 INFO ]: Analyzing trace with hash -226133161, now seen corresponding path program 1 times [2018-06-25 00:08:32,266 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:32,266 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:32,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:32,266 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:32,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:32,316 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:32,435 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:08:32,435 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:08:32,435 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:08:32,435 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:08:32,435 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:08:32,435 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:32,436 INFO ]: Start difference. First operand 10 states and 1023 transitions. Second operand 3 states. [2018-06-25 00:08:34,942 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:08:34,942 INFO ]: Finished difference Result 12 states and 1063 transitions. [2018-06-25 00:08:34,947 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:08:34,947 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:08:34,947 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:08:34,949 INFO ]: With dead ends: 12 [2018-06-25 00:08:34,949 INFO ]: Without dead ends: 12 [2018-06-25 00:08:34,949 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:08:34,949 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 00:08:34,955 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-25 00:08:34,955 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 00:08:34,957 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1023 transitions. [2018-06-25 00:08:34,957 INFO ]: Start accepts. Automaton has 10 states and 1023 transitions. Word has length 9 [2018-06-25 00:08:34,957 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:08:34,957 INFO ]: Abstraction has 10 states and 1023 transitions. [2018-06-25 00:08:34,957 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:08:34,957 INFO ]: Start isEmpty. Operand 10 states and 1023 transitions. [2018-06-25 00:08:34,958 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:08:34,958 INFO ]: Found error trace [2018-06-25 00:08:34,958 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:08:34,958 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:34,958 INFO ]: Analyzing trace with hash -343420328, now seen corresponding path program 1 times [2018-06-25 00:08:34,958 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:34,958 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:34,959 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:34,959 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:34,959 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:35,010 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:35,111 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:08:35,111 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:08:35,111 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:08:35,111 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:08:35,111 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:08:35,111 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:35,111 INFO ]: Start difference. First operand 10 states and 1023 transitions. Second operand 3 states. [2018-06-25 00:08:37,483 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:08:37,484 INFO ]: Finished difference Result 12 states and 1111 transitions. [2018-06-25 00:08:37,512 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:08:37,512 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:08:37,513 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:08:37,514 INFO ]: With dead ends: 12 [2018-06-25 00:08:37,514 INFO ]: Without dead ends: 12 [2018-06-25 00:08:37,514 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:08:37,515 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 00:08:37,520 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-25 00:08:37,520 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 00:08:37,522 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1109 transitions. [2018-06-25 00:08:37,522 INFO ]: Start accepts. Automaton has 11 states and 1109 transitions. Word has length 9 [2018-06-25 00:08:37,523 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:08:37,523 INFO ]: Abstraction has 11 states and 1109 transitions. [2018-06-25 00:08:37,523 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:08:37,523 INFO ]: Start isEmpty. Operand 11 states and 1109 transitions. [2018-06-25 00:08:37,523 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:08:37,523 INFO ]: Found error trace [2018-06-25 00:08:37,524 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:08:37,524 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:37,525 INFO ]: Analyzing trace with hash 308585498, now seen corresponding path program 1 times [2018-06-25 00:08:37,525 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:37,525 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:37,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:37,526 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:37,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:37,564 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:37,662 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:08:37,662 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:08:37,662 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:08:37,662 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:08:37,662 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:08:37,662 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:37,662 INFO ]: Start difference. First operand 11 states and 1109 transitions. Second operand 3 states. [2018-06-25 00:08:40,424 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:08:40,424 INFO ]: Finished difference Result 13 states and 1241 transitions. [2018-06-25 00:08:40,427 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:08:40,427 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:08:40,427 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:08:40,429 INFO ]: With dead ends: 13 [2018-06-25 00:08:40,429 INFO ]: Without dead ends: 12 [2018-06-25 00:08:40,429 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:08:40,429 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 00:08:40,443 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 00:08:40,444 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 00:08:40,447 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1240 transitions. [2018-06-25 00:08:40,447 INFO ]: Start accepts. Automaton has 12 states and 1240 transitions. Word has length 9 [2018-06-25 00:08:40,447 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:08:40,447 INFO ]: Abstraction has 12 states and 1240 transitions. [2018-06-25 00:08:40,447 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:08:40,447 INFO ]: Start isEmpty. Operand 12 states and 1240 transitions. [2018-06-25 00:08:40,448 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:08:40,448 INFO ]: Found error trace [2018-06-25 00:08:40,448 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:08:40,448 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:40,448 INFO ]: Analyzing trace with hash -1969569860, now seen corresponding path program 1 times [2018-06-25 00:08:40,448 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:40,448 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:40,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:40,449 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:40,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:40,486 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:40,592 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:08:40,592 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:08:40,593 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:08:40,593 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:08:40,593 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:08:40,593 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:40,593 INFO ]: Start difference. First operand 12 states and 1240 transitions. Second operand 3 states. [2018-06-25 00:08:43,135 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:08:43,135 INFO ]: Finished difference Result 17 states and 1751 transitions. [2018-06-25 00:08:43,207 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:08:43,207 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:08:43,208 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:08:43,210 INFO ]: With dead ends: 17 [2018-06-25 00:08:43,210 INFO ]: Without dead ends: 17 [2018-06-25 00:08:43,210 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:08:43,211 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 00:08:43,218 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-25 00:08:43,218 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 00:08:43,220 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1751 transitions. [2018-06-25 00:08:43,220 INFO ]: Start accepts. Automaton has 17 states and 1751 transitions. Word has length 10 [2018-06-25 00:08:43,220 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:08:43,220 INFO ]: Abstraction has 17 states and 1751 transitions. [2018-06-25 00:08:43,220 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:08:43,220 INFO ]: Start isEmpty. Operand 17 states and 1751 transitions. [2018-06-25 00:08:43,221 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:08:43,221 INFO ]: Found error trace [2018-06-25 00:08:43,221 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:08:43,221 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:43,221 INFO ]: Analyzing trace with hash -1731063114, now seen corresponding path program 1 times [2018-06-25 00:08:43,221 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:43,221 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:43,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:43,222 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:43,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:43,256 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:43,345 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:08:43,345 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:08:43,345 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:08:43,345 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:08:43,345 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:08:43,345 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:43,345 INFO ]: Start difference. First operand 17 states and 1751 transitions. Second operand 3 states. [2018-06-25 00:08:45,933 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:08:45,933 INFO ]: Finished difference Result 22 states and 2235 transitions. [2018-06-25 00:08:45,933 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:08:45,933 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:08:45,933 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:08:45,935 INFO ]: With dead ends: 22 [2018-06-25 00:08:45,935 INFO ]: Without dead ends: 22 [2018-06-25 00:08:45,935 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:08:45,935 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 00:08:45,945 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-25 00:08:45,945 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 00:08:45,949 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2235 transitions. [2018-06-25 00:08:45,949 INFO ]: Start accepts. Automaton has 22 states and 2235 transitions. Word has length 10 [2018-06-25 00:08:45,949 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:08:45,949 INFO ]: Abstraction has 22 states and 2235 transitions. [2018-06-25 00:08:45,949 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:08:45,949 INFO ]: Start isEmpty. Operand 22 states and 2235 transitions. [2018-06-25 00:08:45,951 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:08:45,951 INFO ]: Found error trace [2018-06-25 00:08:45,951 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:08:45,951 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:45,951 INFO ]: Analyzing trace with hash -1437383436, now seen corresponding path program 1 times [2018-06-25 00:08:45,951 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:45,951 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:45,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:45,953 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:45,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:45,983 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:46,075 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:08:46,075 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:08:46,075 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:08:46,075 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:08:46,076 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:08:46,076 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:46,076 INFO ]: Start difference. First operand 22 states and 2235 transitions. Second operand 3 states. [2018-06-25 00:08:48,366 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:08:48,366 INFO ]: Finished difference Result 32 states and 2874 transitions. [2018-06-25 00:08:48,366 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:08:48,366 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:08:48,366 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:08:48,369 INFO ]: With dead ends: 32 [2018-06-25 00:08:48,369 INFO ]: Without dead ends: 32 [2018-06-25 00:08:48,369 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:08:48,369 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-25 00:08:48,380 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-25 00:08:48,380 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-25 00:08:48,385 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2874 transitions. [2018-06-25 00:08:48,385 INFO ]: Start accepts. Automaton has 32 states and 2874 transitions. Word has length 10 [2018-06-25 00:08:48,385 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:08:48,385 INFO ]: Abstraction has 32 states and 2874 transitions. [2018-06-25 00:08:48,385 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:08:48,385 INFO ]: Start isEmpty. Operand 32 states and 2874 transitions. [2018-06-25 00:08:48,387 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:08:48,387 INFO ]: Found error trace [2018-06-25 00:08:48,387 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:08:48,387 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:48,387 INFO ]: Analyzing trace with hash 2100296640, now seen corresponding path program 1 times [2018-06-25 00:08:48,387 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:48,387 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:48,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:48,388 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:48,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:48,418 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:48,519 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:08:48,519 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:08:48,519 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:08:48,519 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:08:48,519 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:08:48,519 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:48,519 INFO ]: Start difference. First operand 32 states and 2874 transitions. Second operand 3 states. [2018-06-25 00:08:51,045 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:08:51,045 INFO ]: Finished difference Result 57 states and 5014 transitions. [2018-06-25 00:08:51,045 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:08:51,045 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:08:51,045 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:08:51,051 INFO ]: With dead ends: 57 [2018-06-25 00:08:51,051 INFO ]: Without dead ends: 52 [2018-06-25 00:08:51,052 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:08:51,052 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-25 00:08:51,066 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-06-25 00:08:51,066 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-25 00:08:51,070 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 4999 transitions. [2018-06-25 00:08:51,070 INFO ]: Start accepts. Automaton has 52 states and 4999 transitions. Word has length 10 [2018-06-25 00:08:51,070 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:08:51,070 INFO ]: Abstraction has 52 states and 4999 transitions. [2018-06-25 00:08:51,070 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:08:51,070 INFO ]: Start isEmpty. Operand 52 states and 4999 transitions. [2018-06-25 00:08:51,072 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:08:51,072 INFO ]: Found error trace [2018-06-25 00:08:51,072 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:08:51,072 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:51,072 INFO ]: Analyzing trace with hash -1879749995, now seen corresponding path program 1 times [2018-06-25 00:08:51,072 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:51,073 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:51,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:51,073 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:51,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:51,119 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:51,208 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 00:08:51,208 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:08:51,208 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:08:51,208 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:08:51,208 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:08:51,208 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:51,209 INFO ]: Start difference. First operand 52 states and 4999 transitions. Second operand 3 states. [2018-06-25 00:08:53,589 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:08:53,589 INFO ]: Finished difference Result 67 states and 5556 transitions. [2018-06-25 00:08:53,646 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:08:53,647 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:08:53,647 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:08:53,655 INFO ]: With dead ends: 67 [2018-06-25 00:08:53,655 INFO ]: Without dead ends: 67 [2018-06-25 00:08:53,655 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:08:53,655 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-25 00:08:53,673 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-06-25 00:08:53,673 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-25 00:08:53,679 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 5546 transitions. [2018-06-25 00:08:53,680 INFO ]: Start accepts. Automaton has 62 states and 5546 transitions. Word has length 10 [2018-06-25 00:08:53,680 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:08:53,680 INFO ]: Abstraction has 62 states and 5546 transitions. [2018-06-25 00:08:53,680 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:08:53,680 INFO ]: Start isEmpty. Operand 62 states and 5546 transitions. [2018-06-25 00:08:53,682 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:08:53,682 INFO ]: Found error trace [2018-06-25 00:08:53,682 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:08:53,682 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:53,682 INFO ]: Analyzing trace with hash -1465089066, now seen corresponding path program 1 times [2018-06-25 00:08:53,682 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:53,682 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:53,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:53,687 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:53,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:53,715 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:53,781 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 00:08:53,781 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:08:53,781 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:08:53,781 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:08:53,782 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:08:53,782 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:53,782 INFO ]: Start difference. First operand 62 states and 5546 transitions. Second operand 3 states. [2018-06-25 00:08:55,983 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:08:55,983 INFO ]: Finished difference Result 77 states and 7069 transitions. [2018-06-25 00:08:55,983 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:08:55,983 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:08:55,983 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:08:55,988 INFO ]: With dead ends: 77 [2018-06-25 00:08:55,988 INFO ]: Without dead ends: 77 [2018-06-25 00:08:55,988 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:08:55,988 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-25 00:08:56,002 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 72. [2018-06-25 00:08:56,002 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-25 00:08:56,008 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 7059 transitions. [2018-06-25 00:08:56,009 INFO ]: Start accepts. Automaton has 72 states and 7059 transitions. Word has length 10 [2018-06-25 00:08:56,009 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:08:56,009 INFO ]: Abstraction has 72 states and 7059 transitions. [2018-06-25 00:08:56,009 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:08:56,009 INFO ]: Start isEmpty. Operand 72 states and 7059 transitions. [2018-06-25 00:08:56,013 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:08:56,013 INFO ]: Found error trace [2018-06-25 00:08:56,013 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:08:56,013 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:56,013 INFO ]: Analyzing trace with hash -2045060254, now seen corresponding path program 1 times [2018-06-25 00:08:56,013 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:56,013 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:56,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:56,014 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:56,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:56,039 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:56,095 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 00:08:56,095 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:08:56,095 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:08:56,095 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:08:56,095 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:08:56,095 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:56,095 INFO ]: Start difference. First operand 72 states and 7059 transitions. Second operand 3 states. [2018-06-25 00:08:58,330 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:08:58,330 INFO ]: Finished difference Result 87 states and 8810 transitions. [2018-06-25 00:08:58,330 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:08:58,330 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:08:58,330 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:08:58,335 INFO ]: With dead ends: 87 [2018-06-25 00:08:58,335 INFO ]: Without dead ends: 87 [2018-06-25 00:08:58,336 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:08:58,336 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-25 00:08:58,353 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 82. [2018-06-25 00:08:58,353 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-25 00:08:58,359 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 8800 transitions. [2018-06-25 00:08:58,359 INFO ]: Start accepts. Automaton has 82 states and 8800 transitions. Word has length 10 [2018-06-25 00:08:58,359 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:08:58,359 INFO ]: Abstraction has 82 states and 8800 transitions. [2018-06-25 00:08:58,359 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:08:58,359 INFO ]: Start isEmpty. Operand 82 states and 8800 transitions. [2018-06-25 00:08:58,362 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:08:58,362 INFO ]: Found error trace [2018-06-25 00:08:58,362 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:08:58,362 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:58,362 INFO ]: Analyzing trace with hash 1535822642, now seen corresponding path program 1 times [2018-06-25 00:08:58,362 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:58,362 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:58,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:58,363 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:58,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:58,386 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:58,471 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:08:58,471 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:08:58,472 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:08:58,472 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:08:58,472 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:08:58,472 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:58,472 INFO ]: Start difference. First operand 82 states and 8800 transitions. Second operand 3 states. [2018-06-25 00:09:00,897 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:09:00,897 INFO ]: Finished difference Result 97 states and 9696 transitions. [2018-06-25 00:09:00,898 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:09:00,898 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:09:00,898 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:09:00,904 INFO ]: With dead ends: 97 [2018-06-25 00:09:00,904 INFO ]: Without dead ends: 97 [2018-06-25 00:09:00,904 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:09:00,904 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-25 00:09:00,921 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-06-25 00:09:00,921 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-25 00:09:00,927 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 9696 transitions. [2018-06-25 00:09:00,927 INFO ]: Start accepts. Automaton has 97 states and 9696 transitions. Word has length 10 [2018-06-25 00:09:00,927 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:09:00,927 INFO ]: Abstraction has 97 states and 9696 transitions. [2018-06-25 00:09:00,927 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:09:00,927 INFO ]: Start isEmpty. Operand 97 states and 9696 transitions. [2018-06-25 00:09:00,930 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:09:00,930 INFO ]: Found error trace [2018-06-25 00:09:00,930 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:09:00,930 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:00,930 INFO ]: Analyzing trace with hash 1558672339, now seen corresponding path program 1 times [2018-06-25 00:09:00,930 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:00,930 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:00,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:00,931 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:00,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:00,951 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:01,035 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:09:01,035 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:09:01,035 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:09:01,035 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:09:01,035 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:09:01,035 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:09:01,036 INFO ]: Start difference. First operand 97 states and 9696 transitions. Second operand 3 states. Received shutdown request... [2018-06-25 00:09:02,086 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:09:02,086 WARN ]: Verification canceled [2018-06-25 00:09:02,089 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:09:02,090 WARN ]: Timeout [2018-06-25 00:09:02,090 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:09:02 BasicIcfg [2018-06-25 00:09:02,090 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:09:02,091 INFO ]: Toolchain (without parser) took 71308.41 ms. Allocated memory was 308.8 MB in the beginning and 1.1 GB in the end (delta: 793.8 MB). Free memory was 243.2 MB in the beginning and 820.7 MB in the end (delta: -577.5 MB). Peak memory consumption was 216.3 MB. Max. memory is 3.6 GB. [2018-06-25 00:09:02,092 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:09:02,092 INFO ]: ChcToBoogie took 80.52 ms. Allocated memory is still 308.8 MB. Free memory was 242.2 MB in the beginning and 239.2 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:09:02,093 INFO ]: Boogie Preprocessor took 96.74 ms. Allocated memory is still 308.8 MB. Free memory was 239.2 MB in the beginning and 237.2 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:09:02,093 INFO ]: RCFGBuilder took 447.99 ms. Allocated memory is still 308.8 MB. Free memory was 237.2 MB in the beginning and 205.2 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:09:02,094 INFO ]: BlockEncodingV2 took 25265.68 ms. Allocated memory was 308.8 MB in the beginning and 392.7 MB in the end (delta: 83.9 MB). Free memory was 205.2 MB in the beginning and 191.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 106.2 MB. Max. memory is 3.6 GB. [2018-06-25 00:09:02,094 INFO ]: TraceAbstraction took 45408.24 ms. Allocated memory was 392.7 MB in the beginning and 1.1 GB in the end (delta: 709.9 MB). Free memory was 191.8 MB in the beginning and 820.7 MB in the end (delta: -628.9 MB). Peak memory consumption was 81.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:09:02,102 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, 884 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.10 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 80.52 ms. Allocated memory is still 308.8 MB. Free memory was 242.2 MB in the beginning and 239.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 96.74 ms. Allocated memory is still 308.8 MB. Free memory was 239.2 MB in the beginning and 237.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 447.99 ms. Allocated memory is still 308.8 MB. Free memory was 237.2 MB in the beginning and 205.2 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 25265.68 ms. Allocated memory was 308.8 MB in the beginning and 392.7 MB in the end (delta: 83.9 MB). Free memory was 205.2 MB in the beginning and 191.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 106.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 45408.24 ms. Allocated memory was 392.7 MB in the beginning and 1.1 GB in the end (delta: 709.9 MB). Free memory was 191.8 MB in the beginning and 820.7 MB in the end (delta: -628.9 MB). Peak memory consumption was 81.0 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 (97states) and interpolant automaton (currently 3 states, 3 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 45.3s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 42.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 77 SDtfs, 0 SDslu, 58 SDs, 0 SdLazy, 13411 SolverSat, 9861 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=15, 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.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 19 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 1278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 173/173 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_2_BUG.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-09-02-115.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_2_BUG.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-09-02-115.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_2_BUG.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-09-02-115.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_2_BUG.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-09-02-115.csv Completed graceful shutdown