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_14.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 20:43:24,862 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 20:43:24,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 20:43:24,875 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 20:43:24,875 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 20:43:24,876 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 20:43:24,877 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 20:43:24,882 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 20:43:24,883 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 20:43:24,885 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 20:43:24,886 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 20:43:24,886 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 20:43:24,887 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 20:43:24,888 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 20:43:24,893 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 20:43:24,893 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 20:43:24,894 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 20:43:24,906 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 20:43:24,908 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 20:43:24,909 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 20:43:24,910 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 20:43:24,911 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 20:43:24,913 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 20:43:24,913 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 20:43:24,913 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 20:43:24,914 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 20:43:24,917 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 20:43:24,918 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 20:43:24,918 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 20:43:24,919 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 20:43:24,919 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 20:43:24,920 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 20:43:24,920 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 20:43:24,920 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 20:43:24,926 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 20:43:24,927 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 20:43:24,927 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 20:43:24,942 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 20:43:24,942 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 20:43:24,943 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 20:43:24,943 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 20:43:24,944 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 20:43:24,944 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 20:43:24,944 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 20:43:24,944 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 20:43:24,945 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 20:43:24,945 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 20:43:24,945 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 20:43:24,945 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 20:43:24,945 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:43:24,946 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 20:43:24,946 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 20:43:24,946 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 20:43:24,946 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 20:43:24,946 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 20:43:24,947 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 20:43:24,947 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 20:43:24,947 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 20:43:24,948 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 20:43:24,955 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 20:43:25,007 INFO ]: Repository-Root is: /tmp [2018-06-26 20:43:25,024 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 20:43:25,029 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 20:43:25,030 INFO ]: Initializing SmtParser... [2018-06-26 20:43:25,031 INFO ]: SmtParser initialized [2018-06-26 20:43:25,032 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_14.cil.smt2 [2018-06-26 20:43:25,033 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 20:43:25,120 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_14.cil.smt2 unknown [2018-06-26 20:43:25,693 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_14.cil.smt2 [2018-06-26 20:43:25,697 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 20:43:25,702 INFO ]: Walking toolchain with 5 elements. [2018-06-26 20:43:25,703 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 20:43:25,703 INFO ]: Initializing ChcToBoogie... [2018-06-26 20:43:25,703 INFO ]: ChcToBoogie initialized [2018-06-26 20:43:25,706 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:43:25" (1/1) ... [2018-06-26 20:43:25,812 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:43:25 Unit [2018-06-26 20:43:25,812 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 20:43:25,813 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 20:43:25,813 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 20:43:25,813 INFO ]: Boogie Preprocessor initialized [2018-06-26 20:43:25,855 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:43:25" (1/1) ... [2018-06-26 20:43:25,855 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:43:25" (1/1) ... [2018-06-26 20:43:25,879 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:43:25" (1/1) ... [2018-06-26 20:43:25,879 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:43:25" (1/1) ... [2018-06-26 20:43:25,899 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:43:25" (1/1) ... [2018-06-26 20:43:25,900 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:43:25" (1/1) ... [2018-06-26 20:43:25,910 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:43:25" (1/1) ... [2018-06-26 20:43:25,916 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 20:43:25,917 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 20:43:25,917 INFO ]: Initializing RCFGBuilder... [2018-06-26 20:43:25,917 INFO ]: RCFGBuilder initialized [2018-06-26 20:43:25,918 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:43:25" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 20:43:25,930 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 20:43:25,930 INFO ]: Found specification of procedure gotoProc [2018-06-26 20:43:25,930 INFO ]: Found implementation of procedure gotoProc [2018-06-26 20:43:25,930 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 20:43:25,930 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 20:43:25,930 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:43:26,406 INFO ]: Using library mode [2018-06-26 20:43:26,408 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:43:26 BoogieIcfgContainer [2018-06-26 20:43:26,408 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 20:43:26,409 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 20:43:26,409 INFO ]: Initializing BlockEncodingV2... [2018-06-26 20:43:26,410 INFO ]: BlockEncodingV2 initialized [2018-06-26 20:43:26,410 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:43:26" (1/1) ... [2018-06-26 20:43:26,430 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 20:43:26,432 INFO ]: Using Remove infeasible edges [2018-06-26 20:43:26,432 INFO ]: Using Maximize final states [2018-06-26 20:43:26,433 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 20:43:26,433 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 20:43:26,434 INFO ]: Using Remove sink states [2018-06-26 20:43:26,437 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 20:43:26,437 INFO ]: Using Use SBE [2018-06-26 20:43:28,501 INFO ]: SBE split 1 edges [2018-06-26 20:43:28,653 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 20:43:28,657 INFO ]: 0 new accepting states [2018-06-26 20:43:28,711 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 20:43:28,713 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:43:28,882 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 20:43:28,883 INFO ]: 0 new accepting states [2018-06-26 20:43:28,902 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 20:43:28,903 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:43:29,123 INFO ]: Encoded RCFG 6 locations, 1299 edges [2018-06-26 20:43:29,124 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:43:29 BasicIcfg [2018-06-26 20:43:29,124 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 20:43:29,125 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 20:43:29,125 INFO ]: Initializing TraceAbstraction... [2018-06-26 20:43:29,130 INFO ]: TraceAbstraction initialized [2018-06-26 20:43:29,130 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:43:25" (1/4) ... [2018-06-26 20:43:29,131 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e36f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 08:43:29, skipping insertion in model container [2018-06-26 20:43:29,131 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:43:25" (2/4) ... [2018-06-26 20:43:29,132 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e36f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 08:43:29, skipping insertion in model container [2018-06-26 20:43:29,132 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:43:26" (3/4) ... [2018-06-26 20:43:29,132 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e36f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:43:29, skipping insertion in model container [2018-06-26 20:43:29,132 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:43:29" (4/4) ... [2018-06-26 20:43:29,133 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 20:43:29,140 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 20:43:29,145 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 20:43:29,176 INFO ]: Using default assertion order modulation [2018-06-26 20:43:29,176 INFO ]: Interprodecural is true [2018-06-26 20:43:29,177 INFO ]: Hoare is false [2018-06-26 20:43:29,177 INFO ]: Compute interpolants for FPandBP [2018-06-26 20:43:29,177 INFO ]: Backedges is TWOTRACK [2018-06-26 20:43:29,177 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 20:43:29,177 INFO ]: Difference is false [2018-06-26 20:43:29,177 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 20:43:29,177 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 20:43:29,191 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 20:43:29,212 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 20:43:29,212 INFO ]: Found error trace [2018-06-26 20:43:29,213 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 20:43:29,213 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:43:29,217 INFO ]: Analyzing trace with hash 75195650, now seen corresponding path program 1 times [2018-06-26 20:43:29,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:43:29,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:43:29,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:29,261 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:43:29,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:29,331 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:43:29,444 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:43:29,447 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:43:29,447 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:43:29,449 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:43:29,464 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:43:29,465 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:29,476 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 20:43:37,366 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:43:37,366 INFO ]: Finished difference Result 7 states and 1507 transitions. [2018-06-26 20:43:37,366 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:43:37,367 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 20:43:37,367 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:43:37,384 INFO ]: With dead ends: 7 [2018-06-26 20:43:37,384 INFO ]: Without dead ends: 7 [2018-06-26 20:43:37,397 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:37,416 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 20:43:37,450 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 20:43:37,451 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 20:43:37,454 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1507 transitions. [2018-06-26 20:43:37,455 INFO ]: Start accepts. Automaton has 7 states and 1507 transitions. Word has length 5 [2018-06-26 20:43:37,456 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:43:37,456 INFO ]: Abstraction has 7 states and 1507 transitions. [2018-06-26 20:43:37,456 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:43:37,456 INFO ]: Start isEmpty. Operand 7 states and 1507 transitions. [2018-06-26 20:43:37,456 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:43:37,456 INFO ]: Found error trace [2018-06-26 20:43:37,456 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:43:37,457 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:43:37,457 INFO ]: Analyzing trace with hash -1999150506, now seen corresponding path program 1 times [2018-06-26 20:43:37,457 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:43:37,457 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:43:37,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:37,458 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:43:37,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:37,508 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:43:37,593 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:43:37,593 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:43:37,593 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:43:37,595 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:43:37,595 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:43:37,595 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:37,595 INFO ]: Start difference. First operand 7 states and 1507 transitions. Second operand 3 states. [2018-06-26 20:43:41,891 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:43:41,892 INFO ]: Finished difference Result 8 states and 1509 transitions. [2018-06-26 20:43:41,917 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:43:41,917 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:43:41,917 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:43:41,919 INFO ]: With dead ends: 8 [2018-06-26 20:43:41,919 INFO ]: Without dead ends: 8 [2018-06-26 20:43:41,920 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:41,920 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 20:43:41,930 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 20:43:41,930 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 20:43:41,934 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1509 transitions. [2018-06-26 20:43:41,934 INFO ]: Start accepts. Automaton has 8 states and 1509 transitions. Word has length 6 [2018-06-26 20:43:41,934 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:43:41,934 INFO ]: Abstraction has 8 states and 1509 transitions. [2018-06-26 20:43:41,934 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:43:41,934 INFO ]: Start isEmpty. Operand 8 states and 1509 transitions. [2018-06-26 20:43:41,935 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:43:41,935 INFO ]: Found error trace [2018-06-26 20:43:41,935 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:43:41,935 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:43:41,935 INFO ]: Analyzing trace with hash -1997065136, now seen corresponding path program 1 times [2018-06-26 20:43:41,935 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:43:41,935 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:43:41,936 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:41,936 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:43:41,936 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:41,966 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:43:42,006 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:43:42,006 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:43:42,006 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:43:42,006 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:43:42,006 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:43:42,006 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:42,006 INFO ]: Start difference. First operand 8 states and 1509 transitions. Second operand 3 states. [2018-06-26 20:43:45,815 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:43:45,815 INFO ]: Finished difference Result 9 states and 1511 transitions. [2018-06-26 20:43:45,816 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:43:45,816 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:43:45,816 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:43:45,818 INFO ]: With dead ends: 9 [2018-06-26 20:43:45,818 INFO ]: Without dead ends: 9 [2018-06-26 20:43:45,819 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:45,819 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 20:43:45,825 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 20:43:45,825 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 20:43:45,828 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1511 transitions. [2018-06-26 20:43:45,828 INFO ]: Start accepts. Automaton has 9 states and 1511 transitions. Word has length 6 [2018-06-26 20:43:45,828 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:43:45,828 INFO ]: Abstraction has 9 states and 1511 transitions. [2018-06-26 20:43:45,828 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:43:45,828 INFO ]: Start isEmpty. Operand 9 states and 1511 transitions. [2018-06-26 20:43:45,831 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:43:45,831 INFO ]: Found error trace [2018-06-26 20:43:45,831 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:43:45,831 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:43:45,831 INFO ]: Analyzing trace with hash 524540919, now seen corresponding path program 1 times [2018-06-26 20:43:45,831 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:43:45,831 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:43:45,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:45,832 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:43:45,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:45,889 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:43:46,012 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:43:46,012 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:43:46,012 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:43:46,013 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:43:46,013 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:43:46,013 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:46,013 INFO ]: Start difference. First operand 9 states and 1511 transitions. Second operand 3 states. [2018-06-26 20:43:50,030 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:43:50,031 INFO ]: Finished difference Result 11 states and 1647 transitions. [2018-06-26 20:43:50,031 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:43:50,031 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:43:50,031 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:43:50,034 INFO ]: With dead ends: 11 [2018-06-26 20:43:50,034 INFO ]: Without dead ends: 11 [2018-06-26 20:43:50,034 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:50,034 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 20:43:50,042 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-26 20:43:50,042 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 20:43:50,046 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1645 transitions. [2018-06-26 20:43:50,046 INFO ]: Start accepts. Automaton has 10 states and 1645 transitions. Word has length 8 [2018-06-26 20:43:50,046 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:43:50,046 INFO ]: Abstraction has 10 states and 1645 transitions. [2018-06-26 20:43:50,046 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:43:50,046 INFO ]: Start isEmpty. Operand 10 states and 1645 transitions. [2018-06-26 20:43:50,047 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:43:50,047 INFO ]: Found error trace [2018-06-26 20:43:50,047 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:43:50,047 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:43:50,047 INFO ]: Analyzing trace with hash 153876145, now seen corresponding path program 1 times [2018-06-26 20:43:50,047 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:43:50,047 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:43:50,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:50,049 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:43:50,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:50,101 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:43:50,158 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:43:50,158 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:43:50,159 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:43:50,159 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:43:50,159 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:43:50,159 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:50,159 INFO ]: Start difference. First operand 10 states and 1645 transitions. Second operand 3 states. [2018-06-26 20:43:53,436 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:43:53,436 INFO ]: Finished difference Result 12 states and 2073 transitions. [2018-06-26 20:43:53,436 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:43:53,436 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:43:53,436 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:43:53,439 INFO ]: With dead ends: 12 [2018-06-26 20:43:53,439 INFO ]: Without dead ends: 12 [2018-06-26 20:43:53,439 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:53,439 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 20:43:53,447 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-26 20:43:53,447 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 20:43:53,450 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2071 transitions. [2018-06-26 20:43:53,450 INFO ]: Start accepts. Automaton has 11 states and 2071 transitions. Word has length 9 [2018-06-26 20:43:53,450 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:43:53,450 INFO ]: Abstraction has 11 states and 2071 transitions. [2018-06-26 20:43:53,450 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:43:53,450 INFO ]: Start isEmpty. Operand 11 states and 2071 transitions. [2018-06-26 20:43:53,451 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:43:53,451 INFO ]: Found error trace [2018-06-26 20:43:53,451 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:43:53,451 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:43:53,452 INFO ]: Analyzing trace with hash -524911790, now seen corresponding path program 1 times [2018-06-26 20:43:53,452 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:43:53,452 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:43:53,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:53,452 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:43:53,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:53,492 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:43:53,582 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:43:53,582 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:43:53,582 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:43:53,582 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:43:53,582 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:43:53,582 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:53,583 INFO ]: Start difference. First operand 11 states and 2071 transitions. Second operand 3 states. [2018-06-26 20:43:57,017 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:43:57,017 INFO ]: Finished difference Result 13 states and 2323 transitions. [2018-06-26 20:43:57,018 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:43:57,018 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:43:57,018 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:43:57,021 INFO ]: With dead ends: 13 [2018-06-26 20:43:57,021 INFO ]: Without dead ends: 12 [2018-06-26 20:43:57,021 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:57,021 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 20:43:57,030 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-26 20:43:57,030 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 20:43:57,032 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2322 transitions. [2018-06-26 20:43:57,032 INFO ]: Start accepts. Automaton has 12 states and 2322 transitions. Word has length 9 [2018-06-26 20:43:57,032 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:43:57,032 INFO ]: Abstraction has 12 states and 2322 transitions. [2018-06-26 20:43:57,032 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:43:57,032 INFO ]: Start isEmpty. Operand 12 states and 2322 transitions. [2018-06-26 20:43:57,034 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:43:57,034 INFO ]: Found error trace [2018-06-26 20:43:57,034 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:43:57,034 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:43:57,035 INFO ]: Analyzing trace with hash 1313595705, now seen corresponding path program 1 times [2018-06-26 20:43:57,035 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:43:57,035 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:43:57,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:57,035 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:43:57,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:43:57,071 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:43:57,160 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:43:57,160 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:43:57,161 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:43:57,161 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:43:57,161 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:43:57,161 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:43:57,161 INFO ]: Start difference. First operand 12 states and 2322 transitions. Second operand 3 states. [2018-06-26 20:44:00,628 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:44:00,628 INFO ]: Finished difference Result 17 states and 2331 transitions. [2018-06-26 20:44:00,629 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:44:00,629 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:44:00,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:44:00,632 INFO ]: With dead ends: 17 [2018-06-26 20:44:00,632 INFO ]: Without dead ends: 17 [2018-06-26 20:44:00,632 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:44:00,632 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 20:44:00,648 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-26 20:44:00,648 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 20:44:00,650 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2327 transitions. [2018-06-26 20:44:00,650 INFO ]: Start accepts. Automaton has 15 states and 2327 transitions. Word has length 10 [2018-06-26 20:44:00,650 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:44:00,650 INFO ]: Abstraction has 15 states and 2327 transitions. [2018-06-26 20:44:00,650 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:44:00,650 INFO ]: Start isEmpty. Operand 15 states and 2327 transitions. [2018-06-26 20:44:00,653 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:44:00,653 INFO ]: Found error trace [2018-06-26 20:44:00,653 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:44:00,653 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:44:00,653 INFO ]: Analyzing trace with hash -402369417, now seen corresponding path program 1 times [2018-06-26 20:44:00,653 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:44:00,653 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:44:00,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:44:00,654 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:44:00,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:44:00,684 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:44:00,773 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:44:00,773 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:44:00,773 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:44:00,773 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:44:00,773 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:44:00,773 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:44:00,773 INFO ]: Start difference. First operand 15 states and 2327 transitions. Second operand 3 states. [2018-06-26 20:44:04,446 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:44:04,446 INFO ]: Finished difference Result 23 states and 3197 transitions. [2018-06-26 20:44:04,446 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:44:04,446 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:44:04,446 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:44:04,449 INFO ]: With dead ends: 23 [2018-06-26 20:44:04,449 INFO ]: Without dead ends: 23 [2018-06-26 20:44:04,450 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:44:04,450 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 20:44:04,460 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-06-26 20:44:04,460 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 20:44:04,463 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3190 transitions. [2018-06-26 20:44:04,463 INFO ]: Start accepts. Automaton has 19 states and 3190 transitions. Word has length 10 [2018-06-26 20:44:04,463 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:44:04,463 INFO ]: Abstraction has 19 states and 3190 transitions. [2018-06-26 20:44:04,463 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:44:04,463 INFO ]: Start isEmpty. Operand 19 states and 3190 transitions. [2018-06-26 20:44:04,466 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:44:04,466 INFO ]: Found error trace [2018-06-26 20:44:04,466 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:44:04,466 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:44:04,466 INFO ]: Analyzing trace with hash -2057591950, now seen corresponding path program 1 times [2018-06-26 20:44:04,466 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:44:04,466 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:44:04,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:44:04,467 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:44:04,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:44:04,507 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:44:04,610 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 20:44:04,610 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:44:04,610 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:44:04,610 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:44:04,610 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:44:04,610 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:44:04,610 INFO ]: Start difference. First operand 19 states and 3190 transitions. Second operand 3 states. [2018-06-26 20:44:08,596 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:44:08,597 INFO ]: Finished difference Result 31 states and 4853 transitions. [2018-06-26 20:44:08,597 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:44:08,597 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:44:08,597 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:44:08,602 INFO ]: With dead ends: 31 [2018-06-26 20:44:08,602 INFO ]: Without dead ends: 31 [2018-06-26 20:44:08,602 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:44:08,602 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 20:44:08,615 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-06-26 20:44:08,615 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 20:44:08,618 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4848 transitions. [2018-06-26 20:44:08,618 INFO ]: Start accepts. Automaton has 28 states and 4848 transitions. Word has length 12 [2018-06-26 20:44:08,618 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:44:08,618 INFO ]: Abstraction has 28 states and 4848 transitions. [2018-06-26 20:44:08,618 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:44:08,618 INFO ]: Start isEmpty. Operand 28 states and 4848 transitions. [2018-06-26 20:44:08,621 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:44:08,621 INFO ]: Found error trace [2018-06-26 20:44:08,621 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:44:08,621 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:44:08,621 INFO ]: Analyzing trace with hash 2090153212, now seen corresponding path program 1 times [2018-06-26 20:44:08,621 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:44:08,621 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:44:08,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:44:08,622 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:44:08,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:44:08,663 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:44:08,749 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 20:44:08,749 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:44:08,749 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:44:08,749 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:44:08,749 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:44:08,749 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:44:08,749 INFO ]: Start difference. First operand 28 states and 4848 transitions. Second operand 3 states. [2018-06-26 20:44:12,121 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:44:12,121 INFO ]: Finished difference Result 37 states and 6402 transitions. [2018-06-26 20:44:12,122 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:44:12,122 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:44:12,122 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:44:12,133 INFO ]: With dead ends: 37 [2018-06-26 20:44:12,133 INFO ]: Without dead ends: 37 [2018-06-26 20:44:12,133 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:44:12,133 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-26 20:44:12,146 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-26 20:44:12,146 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 20:44:12,155 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 6402 transitions. [2018-06-26 20:44:12,155 INFO ]: Start accepts. Automaton has 37 states and 6402 transitions. Word has length 12 [2018-06-26 20:44:12,155 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:44:12,155 INFO ]: Abstraction has 37 states and 6402 transitions. [2018-06-26 20:44:12,155 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:44:12,155 INFO ]: Start isEmpty. Operand 37 states and 6402 transitions. [2018-06-26 20:44:12,158 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:44:12,158 INFO ]: Found error trace [2018-06-26 20:44:12,158 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:44:12,158 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:44:12,159 INFO ]: Analyzing trace with hash -1141894833, now seen corresponding path program 1 times [2018-06-26 20:44:12,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:44:12,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:44:12,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:44:12,159 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:44:12,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:44:12,197 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:44:12,298 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 20:44:12,298 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:44:12,298 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:44:12,298 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:44:12,298 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:44:12,298 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:44:12,298 INFO ]: Start difference. First operand 37 states and 6402 transitions. Second operand 3 states. [2018-06-26 20:44:15,625 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:44:15,626 INFO ]: Finished difference Result 58 states and 8453 transitions. [2018-06-26 20:44:15,626 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:44:15,626 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:44:15,626 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:44:15,632 INFO ]: With dead ends: 58 [2018-06-26 20:44:15,632 INFO ]: Without dead ends: 58 [2018-06-26 20:44:15,632 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:44:15,632 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-26 20:44:15,648 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 55. [2018-06-26 20:44:15,648 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-26 20:44:15,656 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 8448 transitions. [2018-06-26 20:44:15,656 INFO ]: Start accepts. Automaton has 55 states and 8448 transitions. Word has length 12 [2018-06-26 20:44:15,656 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:44:15,656 INFO ]: Abstraction has 55 states and 8448 transitions. [2018-06-26 20:44:15,656 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:44:15,656 INFO ]: Start isEmpty. Operand 55 states and 8448 transitions. [2018-06-26 20:44:15,659 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:44:15,659 INFO ]: Found error trace [2018-06-26 20:44:15,659 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:44:15,659 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:44:15,659 INFO ]: Analyzing trace with hash -617723213, now seen corresponding path program 1 times [2018-06-26 20:44:15,659 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:44:15,659 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:44:15,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:44:15,660 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:44:15,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:44:15,700 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:44:15,864 INFO ]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-26 20:44:15,864 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:44:15,864 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:44:15,864 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:44:15,865 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:44:15,865 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:44:15,865 INFO ]: Start difference. First operand 55 states and 8448 transitions. Second operand 3 states. [2018-06-26 20:44:19,285 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:44:19,285 INFO ]: Finished difference Result 83 states and 13292 transitions. [2018-06-26 20:44:19,285 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:44:19,286 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:44:19,286 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:44:19,296 INFO ]: With dead ends: 83 [2018-06-26 20:44:19,296 INFO ]: Without dead ends: 83 [2018-06-26 20:44:19,296 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:44:19,296 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-26 20:44:19,314 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 75. [2018-06-26 20:44:19,314 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-26 20:44:19,320 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 13277 transitions. [2018-06-26 20:44:19,320 INFO ]: Start accepts. Automaton has 75 states and 13277 transitions. Word has length 12 [2018-06-26 20:44:19,321 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:44:19,321 INFO ]: Abstraction has 75 states and 13277 transitions. [2018-06-26 20:44:19,321 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:44:19,321 INFO ]: Start isEmpty. Operand 75 states and 13277 transitions. [2018-06-26 20:44:19,324 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:44:19,325 INFO ]: Found error trace [2018-06-26 20:44:19,325 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:44:19,325 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:44:19,325 INFO ]: Analyzing trace with hash -1068401461, now seen corresponding path program 1 times [2018-06-26 20:44:19,325 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:44:19,325 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:44:19,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:44:19,325 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:44:19,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:44:19,356 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:44:19,455 INFO ]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 20:44:19,455 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:44:19,456 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:44:19,456 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:44:19,456 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:44:19,456 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:44:19,456 INFO ]: Start difference. First operand 75 states and 13277 transitions. Second operand 3 states. [2018-06-26 20:44:22,964 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:44:22,964 INFO ]: Finished difference Result 97 states and 16917 transitions. [2018-06-26 20:44:22,964 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:44:22,964 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:44:22,964 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:44:22,975 INFO ]: With dead ends: 97 [2018-06-26 20:44:22,976 INFO ]: Without dead ends: 97 [2018-06-26 20:44:22,976 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:44:22,976 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-26 20:44:23,000 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 90. [2018-06-26 20:44:23,001 INFO ]: Start removeUnreachable. Operand 90 states. [2018-06-26 20:44:23,008 INFO ]: Finished removeUnreachable. Reduced from 90 states to 90 states and 16903 transitions. [2018-06-26 20:44:23,008 INFO ]: Start accepts. Automaton has 90 states and 16903 transitions. Word has length 12 [2018-06-26 20:44:23,009 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:44:23,009 INFO ]: Abstraction has 90 states and 16903 transitions. [2018-06-26 20:44:23,009 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:44:23,009 INFO ]: Start isEmpty. Operand 90 states and 16903 transitions. [2018-06-26 20:44:23,013 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:44:23,013 INFO ]: Found error trace [2018-06-26 20:44:23,013 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:44:23,013 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:44:23,014 INFO ]: Analyzing trace with hash -626034902, now seen corresponding path program 1 times [2018-06-26 20:44:23,014 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:44:23,014 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:44:23,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:44:23,014 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:44:23,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:44:23,043 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:44:23,147 INFO ]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 20:44:23,148 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:44:23,148 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:44:23,148 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:44:23,148 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:44:23,148 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:44:23,148 INFO ]: Start difference. First operand 90 states and 16903 transitions. Second operand 3 states. [2018-06-26 20:44:26,613 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:44:26,613 INFO ]: Finished difference Result 143 states and 27168 transitions. [2018-06-26 20:44:26,613 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:44:26,613 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:44:26,613 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:44:26,637 INFO ]: With dead ends: 143 [2018-06-26 20:44:26,637 INFO ]: Without dead ends: 143 [2018-06-26 20:44:26,637 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:44:26,638 INFO ]: Start minimizeSevpa. Operand 143 states. [2018-06-26 20:44:26,677 INFO ]: Finished minimizeSevpa. Reduced states from 143 to 95. [2018-06-26 20:44:26,677 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-26 20:44:26,689 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 19203 transitions. [2018-06-26 20:44:26,689 INFO ]: Start accepts. Automaton has 95 states and 19203 transitions. Word has length 12 [2018-06-26 20:44:26,690 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:44:26,690 INFO ]: Abstraction has 95 states and 19203 transitions. [2018-06-26 20:44:26,690 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:44:26,690 INFO ]: Start isEmpty. Operand 95 states and 19203 transitions. [2018-06-26 20:44:26,694 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:44:26,694 INFO ]: Found error trace [2018-06-26 20:44:26,694 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:44:26,694 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:44:26,694 INFO ]: Analyzing trace with hash -924395289, now seen corresponding path program 1 times [2018-06-26 20:44:26,694 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:44:26,694 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:44:26,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:44:26,696 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:44:26,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:44:26,724 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:44:26,811 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 20:44:26,811 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:44:26,811 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:44:26,812 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:44:26,812 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:44:26,812 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:44:26,812 INFO ]: Start difference. First operand 95 states and 19203 transitions. Second operand 3 states. [2018-06-26 20:44:29,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:44:29,216 INFO ]: Finished difference Result 117 states and 19349 transitions. [2018-06-26 20:44:29,216 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:44:29,216 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:44:29,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:44:29,228 INFO ]: With dead ends: 117 [2018-06-26 20:44:29,228 INFO ]: Without dead ends: 111 [2018-06-26 20:44:29,232 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:44:29,232 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-26 20:44:29,260 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-06-26 20:44:29,260 INFO ]: Start removeUnreachable. Operand 110 states. [2018-06-26 20:44:29,273 INFO ]: Finished removeUnreachable. Reduced from 110 states to 110 states and 19332 transitions. [2018-06-26 20:44:29,273 INFO ]: Start accepts. Automaton has 110 states and 19332 transitions. Word has length 12 [2018-06-26 20:44:29,273 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:44:29,273 INFO ]: Abstraction has 110 states and 19332 transitions. [2018-06-26 20:44:29,273 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:44:29,273 INFO ]: Start isEmpty. Operand 110 states and 19332 transitions. [2018-06-26 20:44:29,277 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:44:29,277 INFO ]: Found error trace [2018-06-26 20:44:29,277 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:44:29,277 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:44:29,277 INFO ]: Analyzing trace with hash -1287654562, now seen corresponding path program 1 times [2018-06-26 20:44:29,277 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:44:29,277 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:44:29,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:44:29,278 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:44:29,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:44:29,306 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:44:29,395 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 20:44:29,395 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:44:29,395 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:44:29,396 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:44:29,396 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:44:29,396 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:44:29,396 INFO ]: Start difference. First operand 110 states and 19332 transitions. Second operand 3 states. [2018-06-26 20:44:32,129 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:44:32,129 INFO ]: Finished difference Result 133 states and 19745 transitions. [2018-06-26 20:44:32,129 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:44:32,130 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:44:32,130 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:44:32,137 INFO ]: With dead ends: 133 [2018-06-26 20:44:32,137 INFO ]: Without dead ends: 127 [2018-06-26 20:44:32,138 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:44:32,138 INFO ]: Start minimizeSevpa. Operand 127 states. [2018-06-26 20:44:32,167 INFO ]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-06-26 20:44:32,167 INFO ]: Start removeUnreachable. Operand 125 states. [2018-06-26 20:44:32,180 INFO ]: Finished removeUnreachable. Reduced from 125 states to 125 states and 19727 transitions. [2018-06-26 20:44:32,180 INFO ]: Start accepts. Automaton has 125 states and 19727 transitions. Word has length 12 [2018-06-26 20:44:32,180 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:44:32,181 INFO ]: Abstraction has 125 states and 19727 transitions. [2018-06-26 20:44:32,181 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:44:32,181 INFO ]: Start isEmpty. Operand 125 states and 19727 transitions. [2018-06-26 20:44:32,185 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:44:32,185 INFO ]: Found error trace [2018-06-26 20:44:32,185 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:44:32,186 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:44:32,186 INFO ]: Analyzing trace with hash 1981097476, now seen corresponding path program 1 times [2018-06-26 20:44:32,186 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:44:32,186 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:44:32,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:44:32,186 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:44:32,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:44:32,218 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:44:32,329 INFO ]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 20:44:32,329 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:44:32,329 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:44:32,329 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:44:32,329 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:44:32,329 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:44:32,329 INFO ]: Start difference. First operand 125 states and 19727 transitions. Second operand 3 states. Received shutdown request... [2018-06-26 20:44:34,618 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:44:34,618 WARN ]: Verification canceled [2018-06-26 20:44:34,620 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 20:44:34,621 WARN ]: Timeout [2018-06-26 20:44:34,622 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:44:34 BasicIcfg [2018-06-26 20:44:34,622 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 20:44:34,622 INFO ]: Toolchain (without parser) took 68924.61 ms. Allocated memory was 309.3 MB in the beginning and 1.2 GB in the end (delta: 922.7 MB). Free memory was 241.8 MB in the beginning and 372.1 MB in the end (delta: -130.3 MB). Peak memory consumption was 792.4 MB. Max. memory is 3.6 GB. [2018-06-26 20:44:34,623 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 20:44:34,624 INFO ]: ChcToBoogie took 109.80 ms. Allocated memory is still 309.3 MB. Free memory was 241.8 MB in the beginning and 235.8 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:44:34,624 INFO ]: Boogie Preprocessor took 103.16 ms. Allocated memory is still 309.3 MB. Free memory was 235.8 MB in the beginning and 233.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:44:34,624 INFO ]: RCFGBuilder took 491.57 ms. Allocated memory is still 309.3 MB. Free memory was 233.8 MB in the beginning and 201.8 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:44:34,625 INFO ]: BlockEncodingV2 took 2714.85 ms. Allocated memory was 309.3 MB in the beginning and 534.8 MB in the end (delta: 225.4 MB). Free memory was 201.8 MB in the beginning and 460.5 MB in the end (delta: -258.7 MB). Peak memory consumption was 143.3 MB. Max. memory is 3.6 GB. [2018-06-26 20:44:34,625 INFO ]: TraceAbstraction took 65497.02 ms. Allocated memory was 534.8 MB in the beginning and 1.2 GB in the end (delta: 697.3 MB). Free memory was 460.5 MB in the beginning and 372.1 MB in the end (delta: 88.4 MB). Peak memory consumption was 785.7 MB. Max. memory is 3.6 GB. [2018-06-26 20:44:34,632 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, 1299 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 109.80 ms. Allocated memory is still 309.3 MB. Free memory was 241.8 MB in the beginning and 235.8 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 103.16 ms. Allocated memory is still 309.3 MB. Free memory was 235.8 MB in the beginning and 233.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 491.57 ms. Allocated memory is still 309.3 MB. Free memory was 233.8 MB in the beginning and 201.8 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 2714.85 ms. Allocated memory was 309.3 MB in the beginning and 534.8 MB in the end (delta: 225.4 MB). Free memory was 201.8 MB in the beginning and 460.5 MB in the end (delta: -258.7 MB). Peak memory consumption was 143.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 65497.02 ms. Allocated memory was 534.8 MB in the beginning and 1.2 GB in the end (delta: 697.3 MB). Free memory was 460.5 MB in the beginning and 372.1 MB in the end (delta: 88.4 MB). Peak memory consumption was 785.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 (125states) and interpolant automaton (currently 3 states, 3 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 65.4s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 62.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 82 SDtfs, 0 SDslu, 62 SDs, 0 SdLazy, 21106 SolverSat, 15844 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=16, 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.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 80 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 1854 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 318/318 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_14.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_20-44-34-647.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_14.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_20-44-34-647.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_14.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_20-44-34-647.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_14.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_20-44-34-647.csv Completed graceful shutdown