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_clnt_4.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 20:40:50,366 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 20:40:50,368 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 20:40:50,379 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 20:40:50,380 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 20:40:50,380 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 20:40:50,381 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 20:40:50,388 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 20:40:50,390 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 20:40:50,391 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 20:40:50,393 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 20:40:50,394 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 20:40:50,395 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 20:40:50,395 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 20:40:50,396 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 20:40:50,399 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 20:40:50,400 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 20:40:50,401 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 20:40:50,404 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 20:40:50,405 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 20:40:50,406 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 20:40:50,407 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 20:40:50,410 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 20:40:50,410 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 20:40:50,410 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 20:40:50,411 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 20:40:50,412 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 20:40:50,412 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 20:40:50,413 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 20:40:50,414 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 20:40:50,414 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 20:40:50,415 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 20:40:50,415 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 20:40:50,415 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 20:40:50,416 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 20:40:50,417 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 20:40:50,417 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:40:50,432 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 20:40:50,432 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 20:40:50,432 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 20:40:50,432 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 20:40:50,433 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 20:40:50,433 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 20:40:50,434 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 20:40:50,434 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 20:40:50,434 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 20:40:50,434 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 20:40:50,434 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 20:40:50,435 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 20:40:50,435 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:40:50,435 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 20:40:50,435 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 20:40:50,435 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 20:40:50,436 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 20:40:50,436 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 20:40:50,436 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 20:40:50,436 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 20:40:50,436 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 20:40:50,438 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 20:40:50,438 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 20:40:50,475 INFO ]: Repository-Root is: /tmp [2018-06-26 20:40:50,492 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 20:40:50,497 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 20:40:50,499 INFO ]: Initializing SmtParser... [2018-06-26 20:40:50,499 INFO ]: SmtParser initialized [2018-06-26 20:40:50,500 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_clnt_4.cil.smt2 [2018-06-26 20:40:50,501 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:40:50,591 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_clnt_4.cil.smt2 unknown [2018-06-26 20:40:51,165 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_clnt_4.cil.smt2 [2018-06-26 20:40:51,169 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 20:40:51,174 INFO ]: Walking toolchain with 5 elements. [2018-06-26 20:40:51,175 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 20:40:51,175 INFO ]: Initializing ChcToBoogie... [2018-06-26 20:40:51,176 INFO ]: ChcToBoogie initialized [2018-06-26 20:40:51,179 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:40:51" (1/1) ... [2018-06-26 20:40:51,257 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:40:51 Unit [2018-06-26 20:40:51,257 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 20:40:51,258 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 20:40:51,258 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 20:40:51,258 INFO ]: Boogie Preprocessor initialized [2018-06-26 20:40:51,278 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:40:51" (1/1) ... [2018-06-26 20:40:51,278 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:40:51" (1/1) ... [2018-06-26 20:40:51,297 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:40:51" (1/1) ... [2018-06-26 20:40:51,298 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:40:51" (1/1) ... [2018-06-26 20:40:51,310 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:40:51" (1/1) ... [2018-06-26 20:40:51,311 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:40:51" (1/1) ... [2018-06-26 20:40:51,315 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:40:51" (1/1) ... [2018-06-26 20:40:51,320 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 20:40:51,321 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 20:40:51,321 INFO ]: Initializing RCFGBuilder... [2018-06-26 20:40:51,321 INFO ]: RCFGBuilder initialized [2018-06-26 20:40:51,322 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:40:51" (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:40:51,338 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 20:40:51,338 INFO ]: Found specification of procedure gotoProc [2018-06-26 20:40:51,338 INFO ]: Found implementation of procedure gotoProc [2018-06-26 20:40:51,338 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 20:40:51,338 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 20:40:51,338 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:40:51,802 INFO ]: Using library mode [2018-06-26 20:40:51,803 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:40:51 BoogieIcfgContainer [2018-06-26 20:40:51,803 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 20:40:51,803 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 20:40:51,803 INFO ]: Initializing BlockEncodingV2... [2018-06-26 20:40:51,804 INFO ]: BlockEncodingV2 initialized [2018-06-26 20:40:51,805 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:40:51" (1/1) ... [2018-06-26 20:40:51,821 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 20:40:51,822 INFO ]: Using Remove infeasible edges [2018-06-26 20:40:51,823 INFO ]: Using Maximize final states [2018-06-26 20:40:51,824 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 20:40:51,824 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 20:40:51,826 INFO ]: Using Remove sink states [2018-06-26 20:40:51,827 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 20:40:51,827 INFO ]: Using Use SBE [2018-06-26 20:40:52,686 INFO ]: SBE split 1 edges [2018-06-26 20:40:52,741 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 20:40:52,745 INFO ]: 0 new accepting states [2018-06-26 20:40:52,804 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 20:40:52,806 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:40:52,872 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 20:40:52,873 INFO ]: 0 new accepting states [2018-06-26 20:40:52,873 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 20:40:52,874 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:40:52,939 INFO ]: Encoded RCFG 6 locations, 524 edges [2018-06-26 20:40:52,940 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:40:52 BasicIcfg [2018-06-26 20:40:52,940 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 20:40:52,942 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 20:40:52,942 INFO ]: Initializing TraceAbstraction... [2018-06-26 20:40:52,946 INFO ]: TraceAbstraction initialized [2018-06-26 20:40:52,947 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:40:51" (1/4) ... [2018-06-26 20:40:52,948 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3eae6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 08:40:52, skipping insertion in model container [2018-06-26 20:40:52,948 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:40:51" (2/4) ... [2018-06-26 20:40:52,948 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3eae6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 08:40:52, skipping insertion in model container [2018-06-26 20:40:52,948 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:40:51" (3/4) ... [2018-06-26 20:40:52,948 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3eae6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:40:52, skipping insertion in model container [2018-06-26 20:40:52,948 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:40:52" (4/4) ... [2018-06-26 20:40:52,950 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 20:40:52,961 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 20:40:52,970 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 20:40:53,017 INFO ]: Using default assertion order modulation [2018-06-26 20:40:53,018 INFO ]: Interprodecural is true [2018-06-26 20:40:53,018 INFO ]: Hoare is false [2018-06-26 20:40:53,018 INFO ]: Compute interpolants for FPandBP [2018-06-26 20:40:53,018 INFO ]: Backedges is TWOTRACK [2018-06-26 20:40:53,018 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 20:40:53,018 INFO ]: Difference is false [2018-06-26 20:40:53,018 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 20:40:53,018 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 20:40:53,036 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 20:40:53,056 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 20:40:53,056 INFO ]: Found error trace [2018-06-26 20:40:53,057 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 20:40:53,060 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:53,065 INFO ]: Analyzing trace with hash 51362850, now seen corresponding path program 1 times [2018-06-26 20:40:53,067 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:53,067 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:53,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:53,102 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:53,102 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:53,160 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:53,278 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:40:53,280 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:53,280 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:53,281 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:53,292 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:53,292 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:53,294 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 20:40:57,056 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:57,056 INFO ]: Finished difference Result 7 states and 394 transitions. [2018-06-26 20:40:57,056 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:57,057 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 20:40:57,057 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:57,068 INFO ]: With dead ends: 7 [2018-06-26 20:40:57,068 INFO ]: Without dead ends: 7 [2018-06-26 20:40:57,069 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:40:57,087 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 20:40:57,111 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 20:40:57,112 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 20:40:57,114 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 394 transitions. [2018-06-26 20:40:57,115 INFO ]: Start accepts. Automaton has 7 states and 394 transitions. Word has length 5 [2018-06-26 20:40:57,115 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:57,115 INFO ]: Abstraction has 7 states and 394 transitions. [2018-06-26 20:40:57,115 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:57,115 INFO ]: Start isEmpty. Operand 7 states and 394 transitions. [2018-06-26 20:40:57,116 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:40:57,116 INFO ]: Found error trace [2018-06-26 20:40:57,116 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:40:57,116 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:57,116 INFO ]: Analyzing trace with hash 1584228964, now seen corresponding path program 1 times [2018-06-26 20:40:57,116 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:57,116 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:57,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:57,117 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:57,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:57,144 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:57,223 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:40:57,223 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:57,223 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:57,225 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:57,225 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:57,225 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:57,225 INFO ]: Start difference. First operand 7 states and 394 transitions. Second operand 3 states. [2018-06-26 20:40:59,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:59,667 INFO ]: Finished difference Result 8 states and 396 transitions. [2018-06-26 20:40:59,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:59,667 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:40:59,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:59,668 INFO ]: With dead ends: 8 [2018-06-26 20:40:59,668 INFO ]: Without dead ends: 8 [2018-06-26 20:40:59,668 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:40:59,669 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 20:40:59,679 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 20:40:59,679 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 20:40:59,681 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 396 transitions. [2018-06-26 20:40:59,681 INFO ]: Start accepts. Automaton has 8 states and 396 transitions. Word has length 6 [2018-06-26 20:40:59,681 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:59,681 INFO ]: Abstraction has 8 states and 396 transitions. [2018-06-26 20:40:59,681 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:59,681 INFO ]: Start isEmpty. Operand 8 states and 396 transitions. [2018-06-26 20:40:59,681 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 20:40:59,681 INFO ]: Found error trace [2018-06-26 20:40:59,681 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:59,682 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:59,682 INFO ]: Analyzing trace with hash 1851675685, now seen corresponding path program 1 times [2018-06-26 20:40:59,682 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:59,682 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:59,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:59,684 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:59,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:59,726 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:59,770 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:40:59,770 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:59,770 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:59,771 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:59,771 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:59,771 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:59,771 INFO ]: Start difference. First operand 8 states and 396 transitions. Second operand 3 states. [2018-06-26 20:41:01,490 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:01,491 INFO ]: Finished difference Result 9 states and 779 transitions. [2018-06-26 20:41:01,491 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:01,491 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 20:41:01,491 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:01,492 INFO ]: With dead ends: 9 [2018-06-26 20:41:01,492 INFO ]: Without dead ends: 9 [2018-06-26 20:41:01,492 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:41:01,492 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 20:41:01,497 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 20:41:01,497 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 20:41:01,498 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 779 transitions. [2018-06-26 20:41:01,498 INFO ]: Start accepts. Automaton has 9 states and 779 transitions. Word has length 7 [2018-06-26 20:41:01,499 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:01,499 INFO ]: Abstraction has 9 states and 779 transitions. [2018-06-26 20:41:01,499 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:01,499 INFO ]: Start isEmpty. Operand 9 states and 779 transitions. [2018-06-26 20:41:01,502 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:41:01,502 INFO ]: Found error trace [2018-06-26 20:41:01,502 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:01,502 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:01,502 INFO ]: Analyzing trace with hash 1560186149, now seen corresponding path program 1 times [2018-06-26 20:41:01,502 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:01,502 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:01,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:01,503 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:01,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:01,565 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:01,662 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:41:01,662 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:01,663 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:01,663 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:01,663 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:01,663 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:01,663 INFO ]: Start difference. First operand 9 states and 779 transitions. Second operand 3 states. [2018-06-26 20:41:03,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:03,689 INFO ]: Finished difference Result 10 states and 1159 transitions. [2018-06-26 20:41:03,689 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:03,689 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:41:03,689 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:03,690 INFO ]: With dead ends: 10 [2018-06-26 20:41:03,690 INFO ]: Without dead ends: 10 [2018-06-26 20:41:03,690 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:41:03,690 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 20:41:03,694 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 20:41:03,694 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 20:41:03,696 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1159 transitions. [2018-06-26 20:41:03,697 INFO ]: Start accepts. Automaton has 10 states and 1159 transitions. Word has length 8 [2018-06-26 20:41:03,697 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:03,697 INFO ]: Abstraction has 10 states and 1159 transitions. [2018-06-26 20:41:03,697 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:03,697 INFO ]: Start isEmpty. Operand 10 states and 1159 transitions. [2018-06-26 20:41:03,698 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:41:03,698 INFO ]: Found error trace [2018-06-26 20:41:03,698 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:03,698 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:03,698 INFO ]: Analyzing trace with hash 907999942, now seen corresponding path program 1 times [2018-06-26 20:41:03,698 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:03,698 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:03,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:03,699 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:03,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:03,754 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:03,803 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:41:03,803 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:03,803 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:03,803 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:03,803 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:03,803 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:03,803 INFO ]: Start difference. First operand 10 states and 1159 transitions. Second operand 3 states. [2018-06-26 20:41:05,483 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:05,483 INFO ]: Finished difference Result 11 states and 1419 transitions. [2018-06-26 20:41:05,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:05,486 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:41:05,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:05,488 INFO ]: With dead ends: 11 [2018-06-26 20:41:05,488 INFO ]: Without dead ends: 11 [2018-06-26 20:41:05,488 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:41:05,488 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 20:41:05,493 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 20:41:05,493 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 20:41:05,496 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1419 transitions. [2018-06-26 20:41:05,496 INFO ]: Start accepts. Automaton has 11 states and 1419 transitions. Word has length 9 [2018-06-26 20:41:05,496 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:05,496 INFO ]: Abstraction has 11 states and 1419 transitions. [2018-06-26 20:41:05,496 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:05,496 INFO ]: Start isEmpty. Operand 11 states and 1419 transitions. [2018-06-26 20:41:05,497 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:41:05,497 INFO ]: Found error trace [2018-06-26 20:41:05,497 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:05,497 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:05,497 INFO ]: Analyzing trace with hash 1134414569, now seen corresponding path program 1 times [2018-06-26 20:41:05,498 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:05,498 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:05,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:05,498 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:05,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:05,553 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:05,657 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:41:05,657 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:05,657 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:05,657 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:05,657 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:05,657 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:05,657 INFO ]: Start difference. First operand 11 states and 1419 transitions. Second operand 3 states. [2018-06-26 20:41:07,911 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:07,911 INFO ]: Finished difference Result 12 states and 1667 transitions. [2018-06-26 20:41:07,911 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:07,911 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:41:07,911 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:07,913 INFO ]: With dead ends: 12 [2018-06-26 20:41:07,913 INFO ]: Without dead ends: 12 [2018-06-26 20:41:07,913 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:41:07,914 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 20:41:07,919 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-26 20:41:07,919 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 20:41:07,922 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1667 transitions. [2018-06-26 20:41:07,922 INFO ]: Start accepts. Automaton has 12 states and 1667 transitions. Word has length 10 [2018-06-26 20:41:07,922 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:07,922 INFO ]: Abstraction has 12 states and 1667 transitions. [2018-06-26 20:41:07,922 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:07,922 INFO ]: Start isEmpty. Operand 12 states and 1667 transitions. [2018-06-26 20:41:07,925 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:41:07,925 INFO ]: Found error trace [2018-06-26 20:41:07,925 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:07,925 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:07,925 INFO ]: Analyzing trace with hash -2069122839, now seen corresponding path program 1 times [2018-06-26 20:41:07,925 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:07,925 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:07,926 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:07,926 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:07,926 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:07,965 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:08,053 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:41:08,053 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:08,053 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:08,053 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:08,053 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:08,053 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:08,053 INFO ]: Start difference. First operand 12 states and 1667 transitions. Second operand 3 states. [2018-06-26 20:41:09,573 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:09,573 INFO ]: Finished difference Result 13 states and 1867 transitions. [2018-06-26 20:41:09,576 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:09,576 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:41:09,576 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:09,579 INFO ]: With dead ends: 13 [2018-06-26 20:41:09,579 INFO ]: Without dead ends: 13 [2018-06-26 20:41:09,579 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:41:09,579 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 20:41:09,593 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 20:41:09,593 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 20:41:09,595 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1867 transitions. [2018-06-26 20:41:09,595 INFO ]: Start accepts. Automaton has 13 states and 1867 transitions. Word has length 11 [2018-06-26 20:41:09,595 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:09,595 INFO ]: Abstraction has 13 states and 1867 transitions. [2018-06-26 20:41:09,595 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:09,595 INFO ]: Start isEmpty. Operand 13 states and 1867 transitions. [2018-06-26 20:41:09,596 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:41:09,596 INFO ]: Found error trace [2018-06-26 20:41:09,596 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:09,596 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:09,596 INFO ]: Analyzing trace with hash -501060640, now seen corresponding path program 1 times [2018-06-26 20:41:09,596 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:09,597 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:09,597 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:09,597 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:09,597 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:09,638 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:09,721 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:41:09,721 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:09,721 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:09,721 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:09,721 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:09,721 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:09,722 INFO ]: Start difference. First operand 13 states and 1867 transitions. Second operand 3 states. [2018-06-26 20:41:11,358 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:11,358 INFO ]: Finished difference Result 14 states and 1563 transitions. [2018-06-26 20:41:11,358 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:11,359 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:41:11,359 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:11,360 INFO ]: With dead ends: 14 [2018-06-26 20:41:11,360 INFO ]: Without dead ends: 14 [2018-06-26 20:41:11,360 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:11,360 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 20:41:11,365 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 20:41:11,365 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 20:41:11,368 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1563 transitions. [2018-06-26 20:41:11,368 INFO ]: Start accepts. Automaton has 14 states and 1563 transitions. Word has length 11 [2018-06-26 20:41:11,368 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:11,368 INFO ]: Abstraction has 14 states and 1563 transitions. [2018-06-26 20:41:11,368 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:11,368 INFO ]: Start isEmpty. Operand 14 states and 1563 transitions. [2018-06-26 20:41:11,369 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:41:11,369 INFO ]: Found error trace [2018-06-26 20:41:11,369 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:11,369 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:11,369 INFO ]: Analyzing trace with hash 119027184, now seen corresponding path program 1 times [2018-06-26 20:41:11,369 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:11,369 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:11,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:11,370 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:11,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:11,405 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:11,490 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:41:11,491 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:11,491 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:11,491 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:11,491 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:11,491 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:11,491 INFO ]: Start difference. First operand 14 states and 1563 transitions. Second operand 3 states. [2018-06-26 20:41:13,013 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:13,013 INFO ]: Finished difference Result 15 states and 1343 transitions. [2018-06-26 20:41:13,033 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:13,033 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:41:13,033 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:13,035 INFO ]: With dead ends: 15 [2018-06-26 20:41:13,035 INFO ]: Without dead ends: 15 [2018-06-26 20:41:13,035 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:41:13,035 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 20:41:13,040 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-26 20:41:13,040 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 20:41:13,041 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1343 transitions. [2018-06-26 20:41:13,042 INFO ]: Start accepts. Automaton has 15 states and 1343 transitions. Word has length 12 [2018-06-26 20:41:13,042 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:13,042 INFO ]: Abstraction has 15 states and 1343 transitions. [2018-06-26 20:41:13,042 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:13,042 INFO ]: Start isEmpty. Operand 15 states and 1343 transitions. [2018-06-26 20:41:13,043 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:41:13,043 INFO ]: Found error trace [2018-06-26 20:41:13,043 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:13,043 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:13,043 INFO ]: Analyzing trace with hash -1914244099, now seen corresponding path program 1 times [2018-06-26 20:41:13,043 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:13,043 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:13,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:13,044 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:13,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:13,079 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:13,156 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:41:13,156 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:13,156 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:13,156 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:13,156 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:13,156 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:13,157 INFO ]: Start difference. First operand 15 states and 1343 transitions. Second operand 3 states. [2018-06-26 20:41:14,532 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:14,532 INFO ]: Finished difference Result 16 states and 1379 transitions. [2018-06-26 20:41:14,532 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:14,532 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:41:14,532 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:14,534 INFO ]: With dead ends: 16 [2018-06-26 20:41:14,534 INFO ]: Without dead ends: 16 [2018-06-26 20:41:14,534 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:41:14,534 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 20:41:14,537 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-26 20:41:14,537 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 20:41:14,539 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1379 transitions. [2018-06-26 20:41:14,539 INFO ]: Start accepts. Automaton has 16 states and 1379 transitions. Word has length 12 [2018-06-26 20:41:14,539 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:14,539 INFO ]: Abstraction has 16 states and 1379 transitions. [2018-06-26 20:41:14,539 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:14,539 INFO ]: Start isEmpty. Operand 16 states and 1379 transitions. [2018-06-26 20:41:14,540 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:41:14,540 INFO ]: Found error trace [2018-06-26 20:41:14,540 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:14,540 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:14,540 INFO ]: Analyzing trace with hash -127466509, now seen corresponding path program 1 times [2018-06-26 20:41:14,540 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:14,540 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:14,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:14,541 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:14,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:14,585 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:14,681 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 20:41:14,681 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:14,681 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:14,681 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:14,681 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:14,681 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:14,681 INFO ]: Start difference. First operand 16 states and 1379 transitions. Second operand 3 states. [2018-06-26 20:41:17,024 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:17,024 INFO ]: Finished difference Result 24 states and 1379 transitions. [2018-06-26 20:41:17,024 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:17,024 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:41:17,024 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:17,026 INFO ]: With dead ends: 24 [2018-06-26 20:41:17,026 INFO ]: Without dead ends: 16 [2018-06-26 20:41:17,026 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:41:17,026 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 20:41:17,030 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-26 20:41:17,030 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 20:41:17,031 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1159 transitions. [2018-06-26 20:41:17,031 INFO ]: Start accepts. Automaton has 16 states and 1159 transitions. Word has length 13 [2018-06-26 20:41:17,031 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:17,031 INFO ]: Abstraction has 16 states and 1159 transitions. [2018-06-26 20:41:17,031 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:17,031 INFO ]: Start isEmpty. Operand 16 states and 1159 transitions. [2018-06-26 20:41:17,032 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:41:17,032 INFO ]: Found error trace [2018-06-26 20:41:17,032 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:17,032 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:17,032 INFO ]: Analyzing trace with hash 1695465749, now seen corresponding path program 1 times [2018-06-26 20:41:17,032 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:17,032 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:17,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:17,033 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:17,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:17,072 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:17,171 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 20:41:17,171 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:17,171 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:17,172 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:17,172 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:17,172 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:17,172 INFO ]: Start difference. First operand 16 states and 1159 transitions. Second operand 3 states. [2018-06-26 20:41:18,512 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:18,512 INFO ]: Finished difference Result 17 states and 1187 transitions. [2018-06-26 20:41:18,512 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:18,512 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:41:18,512 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:18,514 INFO ]: With dead ends: 17 [2018-06-26 20:41:18,514 INFO ]: Without dead ends: 17 [2018-06-26 20:41:18,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-26 20:41:18,514 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 20:41:18,518 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 20:41:18,519 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 20:41:18,520 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1187 transitions. [2018-06-26 20:41:18,520 INFO ]: Start accepts. Automaton has 17 states and 1187 transitions. Word has length 13 [2018-06-26 20:41:18,520 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:18,520 INFO ]: Abstraction has 17 states and 1187 transitions. [2018-06-26 20:41:18,520 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:18,520 INFO ]: Start isEmpty. Operand 17 states and 1187 transitions. [2018-06-26 20:41:18,521 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:41:18,521 INFO ]: Found error trace [2018-06-26 20:41:18,521 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:18,522 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:18,522 INFO ]: Analyzing trace with hash -1823772011, now seen corresponding path program 1 times [2018-06-26 20:41:18,522 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:18,522 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:18,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:18,523 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:18,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:18,555 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:18,715 INFO ]: Checked inductivity of 36 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-26 20:41:18,716 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:41:18,716 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:41:18,722 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:18,980 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:19,000 INFO ]: Computing forward predicates... [2018-06-26 20:41:19,223 INFO ]: Checked inductivity of 36 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-26 20:41:19,247 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:41:19,248 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 20:41:19,248 INFO ]: Interpolant automaton has 6 states [2018-06-26 20:41:19,248 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 20:41:19,248 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:41:19,248 INFO ]: Start difference. First operand 17 states and 1187 transitions. Second operand 6 states. [2018-06-26 20:41:23,747 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:23,747 INFO ]: Finished difference Result 35 states and 2713 transitions. [2018-06-26 20:41:23,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 20:41:23,767 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-26 20:41:23,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:23,770 INFO ]: With dead ends: 35 [2018-06-26 20:41:23,770 INFO ]: Without dead ends: 35 [2018-06-26 20:41:23,770 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-06-26 20:41:23,770 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 20:41:23,791 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-06-26 20:41:23,791 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-26 20:41:23,794 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2453 transitions. [2018-06-26 20:41:23,794 INFO ]: Start accepts. Automaton has 30 states and 2453 transitions. Word has length 13 [2018-06-26 20:41:23,794 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:23,794 INFO ]: Abstraction has 30 states and 2453 transitions. [2018-06-26 20:41:23,794 INFO ]: Interpolant automaton has 6 states. [2018-06-26 20:41:23,794 INFO ]: Start isEmpty. Operand 30 states and 2453 transitions. [2018-06-26 20:41:23,795 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:41:23,795 INFO ]: Found error trace [2018-06-26 20:41:23,795 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:23,796 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:23,796 INFO ]: Analyzing trace with hash -473997617, now seen corresponding path program 1 times [2018-06-26 20:41:23,796 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:23,796 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:23,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:23,796 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:23,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:23,835 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:23,992 INFO ]: Checked inductivity of 36 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-26 20:41:23,992 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:41:23,992 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:41:24,005 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:24,220 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:24,232 INFO ]: Computing forward predicates... [2018-06-26 20:41:24,446 INFO ]: Checked inductivity of 36 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-26 20:41:24,479 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:41:24,479 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 20:41:24,480 INFO ]: Interpolant automaton has 6 states [2018-06-26 20:41:24,480 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 20:41:24,480 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:41:24,480 INFO ]: Start difference. First operand 30 states and 2453 transitions. Second operand 6 states. [2018-06-26 20:41:28,863 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:28,863 INFO ]: Finished difference Result 51 states and 4161 transitions. [2018-06-26 20:41:28,863 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 20:41:28,863 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-26 20:41:28,863 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:28,866 INFO ]: With dead ends: 51 [2018-06-26 20:41:28,866 INFO ]: Without dead ends: 51 [2018-06-26 20:41:28,867 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-06-26 20:41:28,867 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-26 20:41:28,888 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 41. [2018-06-26 20:41:28,888 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 20:41:28,891 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 3412 transitions. [2018-06-26 20:41:28,891 INFO ]: Start accepts. Automaton has 41 states and 3412 transitions. Word has length 13 [2018-06-26 20:41:28,891 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:28,891 INFO ]: Abstraction has 41 states and 3412 transitions. [2018-06-26 20:41:28,891 INFO ]: Interpolant automaton has 6 states. [2018-06-26 20:41:28,891 INFO ]: Start isEmpty. Operand 41 states and 3412 transitions. [2018-06-26 20:41:28,896 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:41:28,896 INFO ]: Found error trace [2018-06-26 20:41:28,896 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:28,896 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:28,896 INFO ]: Analyzing trace with hash 1384838121, now seen corresponding path program 1 times [2018-06-26 20:41:28,896 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:28,896 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:28,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:28,897 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:28,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:28,926 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:29,007 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 20:41:29,007 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:29,007 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:29,007 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:29,007 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:29,007 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:29,008 INFO ]: Start difference. First operand 41 states and 3412 transitions. Second operand 3 states. [2018-06-26 20:41:31,147 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:31,147 INFO ]: Finished difference Result 45 states and 3162 transitions. [2018-06-26 20:41:31,148 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:31,148 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:41:31,148 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:31,151 INFO ]: With dead ends: 45 [2018-06-26 20:41:31,151 INFO ]: Without dead ends: 45 [2018-06-26 20:41:31,151 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:41:31,151 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-26 20:41:31,173 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-06-26 20:41:31,173 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-26 20:41:31,176 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 3132 transitions. [2018-06-26 20:41:31,176 INFO ]: Start accepts. Automaton has 44 states and 3132 transitions. Word has length 13 [2018-06-26 20:41:31,176 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:31,176 INFO ]: Abstraction has 44 states and 3132 transitions. [2018-06-26 20:41:31,176 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:31,176 INFO ]: Start isEmpty. Operand 44 states and 3132 transitions. [2018-06-26 20:41:31,177 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:41:31,177 INFO ]: Found error trace [2018-06-26 20:41:31,177 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:31,177 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:31,178 INFO ]: Analyzing trace with hash -1992786355, now seen corresponding path program 1 times [2018-06-26 20:41:31,178 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:31,178 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:31,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:31,178 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:31,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:31,205 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:31,280 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 20:41:31,280 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:31,280 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:31,281 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:31,281 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:31,281 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:31,281 INFO ]: Start difference. First operand 44 states and 3132 transitions. Second operand 3 states. [2018-06-26 20:41:32,707 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:32,707 INFO ]: Finished difference Result 80 states and 5528 transitions. [2018-06-26 20:41:32,708 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:32,708 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:41:32,708 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:32,714 INFO ]: With dead ends: 80 [2018-06-26 20:41:32,714 INFO ]: Without dead ends: 80 [2018-06-26 20:41:32,714 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:41:32,714 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-26 20:41:32,738 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 76. [2018-06-26 20:41:32,738 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-26 20:41:32,742 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 5088 transitions. [2018-06-26 20:41:32,743 INFO ]: Start accepts. Automaton has 76 states and 5088 transitions. Word has length 13 [2018-06-26 20:41:32,744 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:32,744 INFO ]: Abstraction has 76 states and 5088 transitions. [2018-06-26 20:41:32,744 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:32,744 INFO ]: Start isEmpty. Operand 76 states and 5088 transitions. [2018-06-26 20:41:32,746 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:41:32,746 INFO ]: Found error trace [2018-06-26 20:41:32,746 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:32,746 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:32,746 INFO ]: Analyzing trace with hash 137906610, now seen corresponding path program 1 times [2018-06-26 20:41:32,746 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:32,746 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:32,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:32,747 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:32,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:32,770 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:32,851 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 20:41:32,852 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:32,852 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:32,852 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:32,852 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:32,852 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:32,852 INFO ]: Start difference. First operand 76 states and 5088 transitions. Second operand 3 states. [2018-06-26 20:41:34,184 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:34,184 INFO ]: Finished difference Result 144 states and 6042 transitions. [2018-06-26 20:41:34,201 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:34,201 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:41:34,201 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:34,205 INFO ]: With dead ends: 144 [2018-06-26 20:41:34,205 INFO ]: Without dead ends: 144 [2018-06-26 20:41:34,206 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:41:34,206 INFO ]: Start minimizeSevpa. Operand 144 states. [2018-06-26 20:41:34,225 INFO ]: Finished minimizeSevpa. Reduced states from 144 to 127. [2018-06-26 20:41:34,225 INFO ]: Start removeUnreachable. Operand 127 states. [2018-06-26 20:41:34,233 INFO ]: Finished removeUnreachable. Reduced from 127 states to 127 states and 5817 transitions. [2018-06-26 20:41:34,233 INFO ]: Start accepts. Automaton has 127 states and 5817 transitions. Word has length 13 [2018-06-26 20:41:34,233 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:34,233 INFO ]: Abstraction has 127 states and 5817 transitions. [2018-06-26 20:41:34,233 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:34,233 INFO ]: Start isEmpty. Operand 127 states and 5817 transitions. [2018-06-26 20:41:34,235 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:41:34,235 INFO ]: Found error trace [2018-06-26 20:41:34,235 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:34,235 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:34,236 INFO ]: Analyzing trace with hash 2145323068, now seen corresponding path program 1 times [2018-06-26 20:41:34,237 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:34,237 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:34,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:34,238 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:34,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:34,265 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:34,365 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 20:41:34,365 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:34,365 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:34,365 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:34,365 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:34,365 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:34,366 INFO ]: Start difference. First operand 127 states and 5817 transitions. Second operand 3 states. [2018-06-26 20:41:35,696 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:35,696 INFO ]: Finished difference Result 190 states and 9025 transitions. [2018-06-26 20:41:35,696 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:35,696 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:41:35,696 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:35,702 INFO ]: With dead ends: 190 [2018-06-26 20:41:35,702 INFO ]: Without dead ends: 190 [2018-06-26 20:41:35,702 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 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:41:35,702 INFO ]: Start minimizeSevpa. Operand 190 states. [2018-06-26 20:41:35,730 INFO ]: Finished minimizeSevpa. Reduced states from 190 to 134. [2018-06-26 20:41:35,730 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-26 20:41:35,734 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 6229 transitions. [2018-06-26 20:41:35,734 INFO ]: Start accepts. Automaton has 134 states and 6229 transitions. Word has length 13 [2018-06-26 20:41:35,734 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:35,734 INFO ]: Abstraction has 134 states and 6229 transitions. [2018-06-26 20:41:35,734 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:35,734 INFO ]: Start isEmpty. Operand 134 states and 6229 transitions. [2018-06-26 20:41:35,738 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:41:35,738 INFO ]: Found error trace [2018-06-26 20:41:35,739 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:35,739 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:35,739 INFO ]: Analyzing trace with hash -487369532, now seen corresponding path program 1 times [2018-06-26 20:41:35,739 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:35,739 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:35,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:35,739 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:35,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:35,761 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:35,855 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 20:41:35,855 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:35,856 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:35,856 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:35,856 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:35,856 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:35,856 INFO ]: Start difference. First operand 134 states and 6229 transitions. Second operand 3 states. [2018-06-26 20:41:38,425 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:38,426 INFO ]: Finished difference Result 192 states and 9023 transitions. [2018-06-26 20:41:38,426 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:38,426 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:41:38,426 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:38,433 INFO ]: With dead ends: 192 [2018-06-26 20:41:38,433 INFO ]: Without dead ends: 192 [2018-06-26 20:41:38,434 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:41:38,434 INFO ]: Start minimizeSevpa. Operand 192 states. [2018-06-26 20:41:38,454 INFO ]: Finished minimizeSevpa. Reduced states from 192 to 141. [2018-06-26 20:41:38,454 INFO ]: Start removeUnreachable. Operand 141 states. [2018-06-26 20:41:38,459 INFO ]: Finished removeUnreachable. Reduced from 141 states to 141 states and 6457 transitions. [2018-06-26 20:41:38,459 INFO ]: Start accepts. Automaton has 141 states and 6457 transitions. Word has length 13 [2018-06-26 20:41:38,459 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:38,459 INFO ]: Abstraction has 141 states and 6457 transitions. [2018-06-26 20:41:38,459 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:38,459 INFO ]: Start isEmpty. Operand 141 states and 6457 transitions. [2018-06-26 20:41:38,462 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:41:38,462 INFO ]: Found error trace [2018-06-26 20:41:38,462 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:38,462 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:38,462 INFO ]: Analyzing trace with hash -1379544238, now seen corresponding path program 1 times [2018-06-26 20:41:38,462 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:38,462 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:38,464 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:38,464 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:38,464 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:38,485 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:38,560 INFO ]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-26 20:41:38,560 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:38,560 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:38,561 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:38,561 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:38,561 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:38,561 INFO ]: Start difference. First operand 141 states and 6457 transitions. Second operand 3 states. [2018-06-26 20:41:39,958 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:39,958 INFO ]: Finished difference Result 197 states and 8975 transitions. [2018-06-26 20:41:39,958 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:39,958 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:41:39,958 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:39,972 INFO ]: With dead ends: 197 [2018-06-26 20:41:39,972 INFO ]: Without dead ends: 197 [2018-06-26 20:41:39,972 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:41:39,972 INFO ]: Start minimizeSevpa. Operand 197 states. [2018-06-26 20:41:39,998 INFO ]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-06-26 20:41:39,999 INFO ]: Start removeUnreachable. Operand 197 states. [2018-06-26 20:41:40,004 INFO ]: Finished removeUnreachable. Reduced from 197 states to 197 states and 8975 transitions. [2018-06-26 20:41:40,005 INFO ]: Start accepts. Automaton has 197 states and 8975 transitions. Word has length 13 [2018-06-26 20:41:40,005 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:40,005 INFO ]: Abstraction has 197 states and 8975 transitions. [2018-06-26 20:41:40,005 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:40,005 INFO ]: Start isEmpty. Operand 197 states and 8975 transitions. [2018-06-26 20:41:40,008 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 20:41:40,008 INFO ]: Found error trace [2018-06-26 20:41:40,008 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:40,008 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:40,008 INFO ]: Analyzing trace with hash 1230122981, now seen corresponding path program 1 times [2018-06-26 20:41:40,008 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:40,008 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:40,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:40,009 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:40,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:40,035 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:40,113 INFO ]: Checked inductivity of 55 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 20:41:40,113 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:40,113 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:40,113 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:40,113 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:40,113 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:40,113 INFO ]: Start difference. First operand 197 states and 8975 transitions. Second operand 3 states. [2018-06-26 20:41:41,213 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:41,213 INFO ]: Finished difference Result 89 states and 2964 transitions. [2018-06-26 20:41:41,214 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:41,214 INFO ]: Start accepts. Automaton has 3 states. Word has length 15 [2018-06-26 20:41:41,214 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:41,215 INFO ]: With dead ends: 89 [2018-06-26 20:41:41,215 INFO ]: Without dead ends: 74 [2018-06-26 20:41:41,215 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:41:41,215 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-26 20:41:41,220 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-06-26 20:41:41,220 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-26 20:41:41,221 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 2357 transitions. [2018-06-26 20:41:41,221 INFO ]: Start accepts. Automaton has 74 states and 2357 transitions. Word has length 15 [2018-06-26 20:41:41,221 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:41,221 INFO ]: Abstraction has 74 states and 2357 transitions. [2018-06-26 20:41:41,221 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:41,221 INFO ]: Start isEmpty. Operand 74 states and 2357 transitions. [2018-06-26 20:41:41,222 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 20:41:41,222 INFO ]: Found error trace [2018-06-26 20:41:41,222 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:41,222 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:41,222 INFO ]: Analyzing trace with hash -983612592, now seen corresponding path program 1 times [2018-06-26 20:41:41,222 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:41,222 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:41,223 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:41,223 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:41,223 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:41,245 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:41,334 INFO ]: Checked inductivity of 55 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 20:41:41,334 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:41,335 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:41,335 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:41,335 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:41,335 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:41,335 INFO ]: Start difference. First operand 74 states and 2357 transitions. Second operand 3 states. [2018-06-26 20:41:42,254 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:42,254 INFO ]: Finished difference Result 80 states and 2429 transitions. [2018-06-26 20:41:42,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:42,256 INFO ]: Start accepts. Automaton has 3 states. Word has length 15 [2018-06-26 20:41:42,256 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:42,257 INFO ]: With dead ends: 80 [2018-06-26 20:41:42,257 INFO ]: Without dead ends: 80 [2018-06-26 20:41:42,257 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:41:42,257 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-26 20:41:42,261 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-06-26 20:41:42,261 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-26 20:41:42,262 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 2357 transitions. [2018-06-26 20:41:42,262 INFO ]: Start accepts. Automaton has 74 states and 2357 transitions. Word has length 15 [2018-06-26 20:41:42,262 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:42,262 INFO ]: Abstraction has 74 states and 2357 transitions. [2018-06-26 20:41:42,262 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:42,263 INFO ]: Start isEmpty. Operand 74 states and 2357 transitions. [2018-06-26 20:41:42,263 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:41:42,264 INFO ]: Found error trace [2018-06-26 20:41:42,264 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:42,264 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:42,264 INFO ]: Analyzing trace with hash 51469644, now seen corresponding path program 1 times [2018-06-26 20:41:42,264 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:42,264 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:42,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:42,264 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:42,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:42,288 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:42,371 INFO ]: Checked inductivity of 78 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-26 20:41:42,371 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:42,371 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:42,371 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:42,371 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:42,371 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:42,371 INFO ]: Start difference. First operand 74 states and 2357 transitions. Second operand 3 states. [2018-06-26 20:41:43,597 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:43,597 INFO ]: Finished difference Result 140 states and 3717 transitions. [2018-06-26 20:41:43,597 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:43,597 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-26 20:41:43,598 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:43,600 INFO ]: With dead ends: 140 [2018-06-26 20:41:43,600 INFO ]: Without dead ends: 140 [2018-06-26 20:41:43,600 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:41:43,600 INFO ]: Start minimizeSevpa. Operand 140 states. [2018-06-26 20:41:43,609 INFO ]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-06-26 20:41:43,609 INFO ]: Start removeUnreachable. Operand 140 states. [2018-06-26 20:41:43,612 INFO ]: Finished removeUnreachable. Reduced from 140 states to 140 states and 3717 transitions. [2018-06-26 20:41:43,612 INFO ]: Start accepts. Automaton has 140 states and 3717 transitions. Word has length 17 [2018-06-26 20:41:43,612 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:43,612 INFO ]: Abstraction has 140 states and 3717 transitions. [2018-06-26 20:41:43,612 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:43,612 INFO ]: Start isEmpty. Operand 140 states and 3717 transitions. [2018-06-26 20:41:43,613 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:41:43,613 INFO ]: Found error trace [2018-06-26 20:41:43,614 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:43,614 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:43,614 INFO ]: Analyzing trace with hash -1758695621, now seen corresponding path program 1 times [2018-06-26 20:41:43,614 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:43,614 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:43,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:43,614 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:43,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:43,640 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:43,735 INFO ]: Checked inductivity of 78 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-26 20:41:43,735 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:43,735 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:43,736 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:43,736 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:43,736 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:43,736 INFO ]: Start difference. First operand 140 states and 3717 transitions. Second operand 3 states. [2018-06-26 20:41:44,891 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:44,891 INFO ]: Finished difference Result 152 states and 3357 transitions. [2018-06-26 20:41:44,892 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:44,892 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-26 20:41:44,892 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:44,893 INFO ]: With dead ends: 152 [2018-06-26 20:41:44,893 INFO ]: Without dead ends: 140 [2018-06-26 20:41:44,894 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:41:44,894 INFO ]: Start minimizeSevpa. Operand 140 states. [2018-06-26 20:41:44,899 INFO ]: Finished minimizeSevpa. Reduced states from 140 to 128. [2018-06-26 20:41:44,899 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-26 20:41:44,900 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 3152 transitions. [2018-06-26 20:41:44,900 INFO ]: Start accepts. Automaton has 128 states and 3152 transitions. Word has length 17 [2018-06-26 20:41:44,901 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:44,901 INFO ]: Abstraction has 128 states and 3152 transitions. [2018-06-26 20:41:44,901 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:44,901 INFO ]: Start isEmpty. Operand 128 states and 3152 transitions. [2018-06-26 20:41:44,902 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 20:41:44,902 INFO ]: Found error trace [2018-06-26 20:41:44,902 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:44,902 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:44,902 INFO ]: Analyzing trace with hash 1124580979, now seen corresponding path program 1 times [2018-06-26 20:41:44,902 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:44,902 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:44,903 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:44,903 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:44,903 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:44,924 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:45,020 INFO ]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-26 20:41:45,021 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:45,073 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:45,073 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:45,073 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:45,073 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:45,073 INFO ]: Start difference. First operand 128 states and 3152 transitions. Second operand 3 states. [2018-06-26 20:41:46,069 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:46,069 INFO ]: Finished difference Result 140 states and 2992 transitions. [2018-06-26 20:41:46,069 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:46,069 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-26 20:41:46,069 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:46,071 INFO ]: With dead ends: 140 [2018-06-26 20:41:46,072 INFO ]: Without dead ends: 128 [2018-06-26 20:41:46,072 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:41:46,072 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-26 20:41:46,079 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-06-26 20:41:46,079 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-26 20:41:46,082 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 2892 transitions. [2018-06-26 20:41:46,082 INFO ]: Start accepts. Automaton has 128 states and 2892 transitions. Word has length 18 [2018-06-26 20:41:46,082 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:46,082 INFO ]: Abstraction has 128 states and 2892 transitions. [2018-06-26 20:41:46,082 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:46,082 INFO ]: Start isEmpty. Operand 128 states and 2892 transitions. [2018-06-26 20:41:46,083 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 20:41:46,083 INFO ]: Found error trace [2018-06-26 20:41:46,083 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:46,084 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:46,084 INFO ]: Analyzing trace with hash 1597500699, now seen corresponding path program 1 times [2018-06-26 20:41:46,084 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:46,084 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:46,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:46,084 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:46,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:46,110 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:46,202 INFO ]: Checked inductivity of 105 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-26 20:41:46,203 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:46,203 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:46,203 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:46,203 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:46,203 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:46,203 INFO ]: Start difference. First operand 128 states and 2892 transitions. Second operand 3 states. [2018-06-26 20:41:47,610 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:47,610 INFO ]: Finished difference Result 140 states and 2892 transitions. [2018-06-26 20:41:47,610 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:47,610 INFO ]: Start accepts. Automaton has 3 states. Word has length 19 [2018-06-26 20:41:47,610 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:47,611 INFO ]: With dead ends: 140 [2018-06-26 20:41:47,611 INFO ]: Without dead ends: 128 [2018-06-26 20:41:47,612 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:41:47,612 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-26 20:41:47,618 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-06-26 20:41:47,618 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-26 20:41:47,620 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 2832 transitions. [2018-06-26 20:41:47,620 INFO ]: Start accepts. Automaton has 128 states and 2832 transitions. Word has length 19 [2018-06-26 20:41:47,620 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:47,620 INFO ]: Abstraction has 128 states and 2832 transitions. [2018-06-26 20:41:47,620 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:47,620 INFO ]: Start isEmpty. Operand 128 states and 2832 transitions. [2018-06-26 20:41:47,622 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 20:41:47,622 INFO ]: Found error trace [2018-06-26 20:41:47,622 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:47,622 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:47,622 INFO ]: Analyzing trace with hash -2146263254, now seen corresponding path program 1 times [2018-06-26 20:41:47,622 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:47,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:47,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:47,622 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:47,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:47,648 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:47,723 INFO ]: Checked inductivity of 105 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-26 20:41:47,723 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:47,723 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:47,723 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:47,723 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:47,723 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:47,723 INFO ]: Start difference. First operand 128 states and 2832 transitions. Second operand 3 states. [2018-06-26 20:41:49,141 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:49,141 INFO ]: Finished difference Result 128 states and 2672 transitions. [2018-06-26 20:41:49,141 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:49,141 INFO ]: Start accepts. Automaton has 3 states. Word has length 19 [2018-06-26 20:41:49,141 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:49,143 INFO ]: With dead ends: 128 [2018-06-26 20:41:49,143 INFO ]: Without dead ends: 128 [2018-06-26 20:41:49,143 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:41:49,143 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-26 20:41:49,147 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-06-26 20:41:49,147 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-26 20:41:49,149 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 2672 transitions. [2018-06-26 20:41:49,149 INFO ]: Start accepts. Automaton has 128 states and 2672 transitions. Word has length 19 [2018-06-26 20:41:49,149 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:49,149 INFO ]: Abstraction has 128 states and 2672 transitions. [2018-06-26 20:41:49,149 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:49,149 INFO ]: Start isEmpty. Operand 128 states and 2672 transitions. [2018-06-26 20:41:49,150 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 20:41:49,150 INFO ]: Found error trace [2018-06-26 20:41:49,150 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:49,151 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:49,151 INFO ]: Analyzing trace with hash -607477333, now seen corresponding path program 1 times [2018-06-26 20:41:49,151 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:49,151 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:49,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:49,151 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:49,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:49,176 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:49,252 INFO ]: Checked inductivity of 105 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-26 20:41:49,252 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:49,252 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:49,252 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:49,252 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:49,252 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:49,252 INFO ]: Start difference. First operand 128 states and 2672 transitions. Second operand 3 states. [2018-06-26 20:41:50,467 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:50,467 INFO ]: Finished difference Result 140 states and 2482 transitions. [2018-06-26 20:41:50,467 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:50,467 INFO ]: Start accepts. Automaton has 3 states. Word has length 19 [2018-06-26 20:41:50,467 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:50,468 INFO ]: With dead ends: 140 [2018-06-26 20:41:50,468 INFO ]: Without dead ends: 128 [2018-06-26 20:41:50,468 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:41:50,469 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-26 20:41:50,474 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-06-26 20:41:50,474 INFO ]: Start removeUnreachable. Operand 126 states. [2018-06-26 20:41:50,476 INFO ]: Finished removeUnreachable. Reduced from 126 states to 126 states and 2418 transitions. [2018-06-26 20:41:50,476 INFO ]: Start accepts. Automaton has 126 states and 2418 transitions. Word has length 19 [2018-06-26 20:41:50,476 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:50,476 INFO ]: Abstraction has 126 states and 2418 transitions. [2018-06-26 20:41:50,476 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:50,476 INFO ]: Start isEmpty. Operand 126 states and 2418 transitions. [2018-06-26 20:41:50,477 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 20:41:50,477 INFO ]: Found error trace [2018-06-26 20:41:50,477 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:50,477 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:50,477 INFO ]: Analyzing trace with hash 87926955, now seen corresponding path program 1 times [2018-06-26 20:41:50,477 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:50,478 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:50,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:50,478 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:50,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:50,497 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:50,585 INFO ]: Checked inductivity of 105 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-26 20:41:50,586 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:50,586 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:50,586 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:50,586 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:50,586 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:50,586 INFO ]: Start difference. First operand 126 states and 2418 transitions. Second operand 3 states. [2018-06-26 20:41:52,124 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:52,124 INFO ]: Finished difference Result 138 states and 2418 transitions. [2018-06-26 20:41:52,124 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:52,124 INFO ]: Start accepts. Automaton has 3 states. Word has length 19 [2018-06-26 20:41:52,124 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:52,126 INFO ]: With dead ends: 138 [2018-06-26 20:41:52,126 INFO ]: Without dead ends: 126 [2018-06-26 20:41:52,126 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:41:52,126 INFO ]: Start minimizeSevpa. Operand 126 states. [2018-06-26 20:41:52,134 INFO ]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-06-26 20:41:52,134 INFO ]: Start removeUnreachable. Operand 126 states. [2018-06-26 20:41:52,136 INFO ]: Finished removeUnreachable. Reduced from 126 states to 126 states and 2328 transitions. [2018-06-26 20:41:52,136 INFO ]: Start accepts. Automaton has 126 states and 2328 transitions. Word has length 19 [2018-06-26 20:41:52,136 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:52,136 INFO ]: Abstraction has 126 states and 2328 transitions. [2018-06-26 20:41:52,136 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:52,136 INFO ]: Start isEmpty. Operand 126 states and 2328 transitions. [2018-06-26 20:41:52,138 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 20:41:52,138 INFO ]: Found error trace [2018-06-26 20:41:52,138 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:52,138 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:52,138 INFO ]: Analyzing trace with hash 781417487, now seen corresponding path program 1 times [2018-06-26 20:41:52,138 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:52,139 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:52,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:52,139 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:52,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:52,162 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:52,246 INFO ]: Checked inductivity of 105 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-26 20:41:52,247 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:52,247 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:52,247 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:52,247 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:52,247 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:52,247 INFO ]: Start difference. First operand 126 states and 2328 transitions. Second operand 3 states. Received shutdown request... [2018-06-26 20:41:52,877 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:52,877 WARN ]: Verification canceled [2018-06-26 20:41:52,881 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 20:41:52,882 WARN ]: Timeout [2018-06-26 20:41:52,882 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:41:52 BasicIcfg [2018-06-26 20:41:52,882 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 20:41:52,883 INFO ]: Toolchain (without parser) took 61713.25 ms. Allocated memory was 303.0 MB in the beginning and 1.0 GB in the end (delta: 713.6 MB). Free memory was 241.6 MB in the beginning and 726.6 MB in the end (delta: -485.0 MB). Peak memory consumption was 228.6 MB. Max. memory is 3.6 GB. [2018-06-26 20:41:52,884 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 303.0 MB. Free memory is still 267.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 20:41:52,884 INFO ]: ChcToBoogie took 82.16 ms. Allocated memory is still 303.0 MB. Free memory was 241.6 MB in the beginning and 237.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:41:52,885 INFO ]: Boogie Preprocessor took 62.60 ms. Allocated memory is still 303.0 MB. Free memory was 237.6 MB in the beginning and 235.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:41:52,885 INFO ]: RCFGBuilder took 481.62 ms. Allocated memory is still 303.0 MB. Free memory was 235.6 MB in the beginning and 209.7 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:41:52,885 INFO ]: BlockEncodingV2 took 1136.78 ms. Allocated memory was 303.0 MB in the beginning and 377.5 MB in the end (delta: 74.4 MB). Free memory was 209.7 MB in the beginning and 289.0 MB in the end (delta: -79.4 MB). Peak memory consumption was 66.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:41:52,887 INFO ]: TraceAbstraction took 59940.38 ms. Allocated memory was 377.5 MB in the beginning and 1.0 GB in the end (delta: 639.1 MB). Free memory was 289.0 MB in the beginning and 726.6 MB in the end (delta: -437.6 MB). Peak memory consumption was 201.5 MB. Max. memory is 3.6 GB. [2018-06-26 20:41:52,890 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, 524 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 303.0 MB. Free memory is still 267.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 82.16 ms. Allocated memory is still 303.0 MB. Free memory was 241.6 MB in the beginning and 237.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 62.60 ms. Allocated memory is still 303.0 MB. Free memory was 237.6 MB in the beginning and 235.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 481.62 ms. Allocated memory is still 303.0 MB. Free memory was 235.6 MB in the beginning and 209.7 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1136.78 ms. Allocated memory was 303.0 MB in the beginning and 377.5 MB in the end (delta: 74.4 MB). Free memory was 209.7 MB in the beginning and 289.0 MB in the end (delta: -79.4 MB). Peak memory consumption was 66.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59940.38 ms. Allocated memory was 377.5 MB in the beginning and 1.0 GB in the end (delta: 639.1 MB). Free memory was 289.0 MB in the beginning and 726.6 MB in the end (delta: -437.6 MB). Peak memory consumption was 201.5 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 (126states) and interpolant automaton (currently 3 states, 3 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 59.8s OverallTime, 30 OverallIterations, 2 TraceHistogramMax, 54.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 147 SDtfs, 0 SDslu, 130 SDs, 0 SdLazy, 17294 SolverSat, 15476 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 48.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=20, 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.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 164 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 424 NumberOfCodeBlocks, 424 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 392 ConstructedInterpolants, 0 QuantifiedInterpolants, 6282 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3093 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 32 InterpolantComputations, 28 PerfectInterpolantSequences, 1443/1447 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_clnt_4.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_20-41-52-909.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt_4.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_20-41-52-909.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt_4.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_20-41-52-909.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt_4.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_20-41-52-909.csv Completed graceful shutdown