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/conc/fib_bench_safe_v3.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:40:56,401 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:40:56,403 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:40:56,417 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:40:56,418 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:40:56,419 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:40:56,420 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:40:56,422 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:40:56,424 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:40:56,424 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:40:56,426 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:40:56,427 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:40:56,427 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:40:56,428 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:40:56,429 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:40:56,430 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:40:56,432 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:40:56,434 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:40:56,444 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:40:56,445 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:40:56,446 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:40:56,449 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:40:56,449 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:40:56,449 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:40:56,450 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:40:56,451 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:40:56,459 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:40:56,460 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:40:56,461 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:40:56,461 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:40:56,462 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:40:56,463 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:40:56,463 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:40:56,464 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:40:56,464 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:40:56,464 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 00:40:56,490 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:40:56,490 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:40:56,490 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:40:56,491 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:40:56,492 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:40:56,492 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:40:56,492 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:40:56,492 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:40:56,492 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:40:56,493 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:40:56,493 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:40:56,493 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:40:56,493 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:40:56,493 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:40:56,494 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:40:56,494 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:40:56,494 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:40:56,494 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:40:56,494 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:40:56,495 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:40:56,495 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:40:56,496 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:40:56,496 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:40:56,546 INFO ]: Repository-Root is: /tmp [2018-06-25 00:40:56,557 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:40:56,561 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:40:56,562 INFO ]: Initializing SmtParser... [2018-06-25 00:40:56,562 INFO ]: SmtParser initialized [2018-06-25 00:40:56,565 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/conc/fib_bench_safe_v3.smt2 [2018-06-25 00:40:56,566 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 00:40:56,653 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/conc/fib_bench_safe_v3.smt2 unknown [2018-06-25 00:40:56,885 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/conc/fib_bench_safe_v3.smt2 [2018-06-25 00:40:56,890 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:40:56,896 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:40:56,897 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:40:56,897 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:40:56,897 INFO ]: ChcToBoogie initialized [2018-06-25 00:40:56,900 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:40:56" (1/1) ... [2018-06-25 00:40:56,958 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:40:56 Unit [2018-06-25 00:40:56,958 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:40:56,959 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:40:56,959 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:40:56,959 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:40:56,981 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:40:56" (1/1) ... [2018-06-25 00:40:56,982 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:40:56" (1/1) ... [2018-06-25 00:40:56,988 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:40:56" (1/1) ... [2018-06-25 00:40:56,988 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:40:56" (1/1) ... [2018-06-25 00:40:56,992 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:40:56" (1/1) ... [2018-06-25 00:40:56,994 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:40:56" (1/1) ... [2018-06-25 00:40:56,995 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:40:56" (1/1) ... [2018-06-25 00:40:57,002 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:40:57,002 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:40:57,002 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:40:57,003 INFO ]: RCFGBuilder initialized [2018-06-25 00:40:57,003 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:40:56" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 00:40:57,017 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:40:57,017 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:40:57,017 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:40:57,017 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:40:57,017 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:40:57,017 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:40:57,238 INFO ]: Using library mode [2018-06-25 00:40:57,239 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:40:57 BoogieIcfgContainer [2018-06-25 00:40:57,239 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:40:57,239 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:40:57,240 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:40:57,250 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:40:57,250 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:40:57" (1/1) ... [2018-06-25 00:40:57,267 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:40:57,268 INFO ]: Using Remove infeasible edges [2018-06-25 00:40:57,269 INFO ]: Using Maximize final states [2018-06-25 00:40:57,269 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:40:57,271 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:40:57,273 INFO ]: Using Remove sink states [2018-06-25 00:40:57,274 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:40:57,274 INFO ]: Using Use SBE [2018-06-25 00:40:57,330 WARN ]: expecting exponential blowup for input size 18 [2018-06-25 00:40:57,718 WARN ]: Simplifying disjunction of 12992 conjuctions. This might take some time... [2018-06-25 00:41:00,726 INFO ]: Simplified to disjunction of 2048 conjuctions. [2018-06-25 00:41:00,798 INFO ]: SBE split 2 edges [2018-06-25 00:41:00,804 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:41:00,806 INFO ]: 0 new accepting states [2018-06-25 00:41:01,281 INFO ]: Removed 35 edges and 2 locations by large block encoding [2018-06-25 00:41:01,283 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:41:01,285 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:41:01,285 INFO ]: 0 new accepting states [2018-06-25 00:41:01,286 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:41:01,286 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:41:01,287 INFO ]: Encoded RCFG 6 locations, 76 edges [2018-06-25 00:41:01,287 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:41:01 BasicIcfg [2018-06-25 00:41:01,287 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:41:01,288 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:41:01,288 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:41:01,292 INFO ]: TraceAbstraction initialized [2018-06-25 00:41:01,292 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:40:56" (1/4) ... [2018-06-25 00:41:01,293 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bc6d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:41:01, skipping insertion in model container [2018-06-25 00:41:01,293 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:40:56" (2/4) ... [2018-06-25 00:41:01,293 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bc6d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:41:01, skipping insertion in model container [2018-06-25 00:41:01,293 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:40:57" (3/4) ... [2018-06-25 00:41:01,293 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bc6d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:41:01, skipping insertion in model container [2018-06-25 00:41:01,293 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:41:01" (4/4) ... [2018-06-25 00:41:01,295 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:41:01,305 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:41:01,314 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:41:01,356 INFO ]: Using default assertion order modulation [2018-06-25 00:41:01,356 INFO ]: Interprodecural is true [2018-06-25 00:41:01,356 INFO ]: Hoare is false [2018-06-25 00:41:01,356 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:41:01,356 INFO ]: Backedges is TWOTRACK [2018-06-25 00:41:01,356 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:41:01,356 INFO ]: Difference is false [2018-06-25 00:41:01,356 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:41:01,357 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:41:01,367 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:41:01,379 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:41:01,379 INFO ]: Found error trace [2018-06-25 00:41:01,380 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:41:01,380 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:01,384 INFO ]: Analyzing trace with hash 37646497, now seen corresponding path program 1 times [2018-06-25 00:41:01,385 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:01,385 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:01,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:01,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:01,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:01,457 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:01,506 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:01,508 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:41:01,508 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:41:01,509 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:41:01,520 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:41:01,520 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:01,522 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:41:02,043 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:02,043 INFO ]: Finished difference Result 7 states and 98 transitions. [2018-06-25 00:41:02,043 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:41:02,044 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:41:02,044 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:02,053 INFO ]: With dead ends: 7 [2018-06-25 00:41:02,053 INFO ]: Without dead ends: 7 [2018-06-25 00:41:02,055 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:02,071 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:41:02,090 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:41:02,091 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:41:02,092 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2018-06-25 00:41:02,095 INFO ]: Start accepts. Automaton has 7 states and 98 transitions. Word has length 5 [2018-06-25 00:41:02,096 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:02,096 INFO ]: Abstraction has 7 states and 98 transitions. [2018-06-25 00:41:02,096 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:41:02,096 INFO ]: Start isEmpty. Operand 7 states and 98 transitions. [2018-06-25 00:41:02,097 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:41:02,097 INFO ]: Found error trace [2018-06-25 00:41:02,097 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:41:02,097 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:02,098 INFO ]: Analyzing trace with hash 37676288, now seen corresponding path program 1 times [2018-06-25 00:41:02,098 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:02,098 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:02,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:02,099 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:02,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:02,110 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:02,181 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:02,181 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:41:02,181 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:41:02,183 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:41:02,183 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:41:02,183 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:02,183 INFO ]: Start difference. First operand 7 states and 98 transitions. Second operand 3 states. [2018-06-25 00:41:02,937 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:02,937 INFO ]: Finished difference Result 9 states and 132 transitions. [2018-06-25 00:41:02,960 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:41:02,960 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:41:02,960 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:02,961 INFO ]: With dead ends: 9 [2018-06-25 00:41:02,961 INFO ]: Without dead ends: 9 [2018-06-25 00:41:02,961 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:02,961 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:41:02,964 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 00:41:02,964 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:41:02,965 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2018-06-25 00:41:02,965 INFO ]: Start accepts. Automaton has 9 states and 132 transitions. Word has length 5 [2018-06-25 00:41:02,965 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:02,965 INFO ]: Abstraction has 9 states and 132 transitions. [2018-06-25 00:41:02,965 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:41:02,966 INFO ]: Start isEmpty. Operand 9 states and 132 transitions. [2018-06-25 00:41:02,966 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:41:02,966 INFO ]: Found error trace [2018-06-25 00:41:02,966 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:41:02,966 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:02,966 INFO ]: Analyzing trace with hash 37795452, now seen corresponding path program 1 times [2018-06-25 00:41:02,966 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:02,966 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:02,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:02,967 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:02,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:02,973 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:02,989 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:02,990 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:41:02,990 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:41:02,990 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:41:02,990 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:41:02,990 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:02,990 INFO ]: Start difference. First operand 9 states and 132 transitions. Second operand 3 states. [2018-06-25 00:41:03,174 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:03,174 INFO ]: Finished difference Result 13 states and 186 transitions. [2018-06-25 00:41:03,174 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:41:03,174 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:41:03,174 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:03,175 INFO ]: With dead ends: 13 [2018-06-25 00:41:03,175 INFO ]: Without dead ends: 13 [2018-06-25 00:41:03,176 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:03,176 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 00:41:03,179 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 00:41:03,179 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 00:41:03,180 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 186 transitions. [2018-06-25 00:41:03,180 INFO ]: Start accepts. Automaton has 13 states and 186 transitions. Word has length 5 [2018-06-25 00:41:03,180 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:03,180 INFO ]: Abstraction has 13 states and 186 transitions. [2018-06-25 00:41:03,180 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:41:03,180 INFO ]: Start isEmpty. Operand 13 states and 186 transitions. [2018-06-25 00:41:03,181 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:41:03,181 INFO ]: Found error trace [2018-06-25 00:41:03,181 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:41:03,181 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:03,181 INFO ]: Analyzing trace with hash 37944407, now seen corresponding path program 1 times [2018-06-25 00:41:03,181 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:03,181 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:03,182 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:03,182 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:03,182 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:03,189 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:03,228 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:03,228 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:41:03,229 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:41:03,229 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:41:03,229 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:41:03,229 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:03,229 INFO ]: Start difference. First operand 13 states and 186 transitions. Second operand 3 states. [2018-06-25 00:41:03,443 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:03,443 INFO ]: Finished difference Result 21 states and 336 transitions. [2018-06-25 00:41:03,443 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:41:03,443 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:41:03,443 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:03,444 INFO ]: With dead ends: 21 [2018-06-25 00:41:03,444 INFO ]: Without dead ends: 21 [2018-06-25 00:41:03,444 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:03,445 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 00:41:03,451 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-25 00:41:03,451 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 00:41:03,452 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 336 transitions. [2018-06-25 00:41:03,452 INFO ]: Start accepts. Automaton has 21 states and 336 transitions. Word has length 5 [2018-06-25 00:41:03,452 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:03,452 INFO ]: Abstraction has 21 states and 336 transitions. [2018-06-25 00:41:03,452 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:41:03,452 INFO ]: Start isEmpty. Operand 21 states and 336 transitions. [2018-06-25 00:41:03,453 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:41:03,453 INFO ]: Found error trace [2018-06-25 00:41:03,453 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:41:03,453 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:03,453 INFO ]: Analyzing trace with hash 38242317, now seen corresponding path program 1 times [2018-06-25 00:41:03,453 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:03,453 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:03,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:03,454 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:03,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:03,459 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:03,488 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:03,488 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:41:03,488 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:41:03,488 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:41:03,488 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:41:03,488 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:03,488 INFO ]: Start difference. First operand 21 states and 336 transitions. Second operand 3 states. [2018-06-25 00:41:03,715 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:03,715 INFO ]: Finished difference Result 29 states and 486 transitions. [2018-06-25 00:41:03,716 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:41:03,716 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:41:03,716 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:03,717 INFO ]: With dead ends: 29 [2018-06-25 00:41:03,717 INFO ]: Without dead ends: 29 [2018-06-25 00:41:03,718 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:03,718 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 00:41:03,724 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-25 00:41:03,724 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-25 00:41:03,726 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 486 transitions. [2018-06-25 00:41:03,726 INFO ]: Start accepts. Automaton has 29 states and 486 transitions. Word has length 5 [2018-06-25 00:41:03,726 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:03,726 INFO ]: Abstraction has 29 states and 486 transitions. [2018-06-25 00:41:03,726 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:41:03,726 INFO ]: Start isEmpty. Operand 29 states and 486 transitions. [2018-06-25 00:41:03,727 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:41:03,727 INFO ]: Found error trace [2018-06-25 00:41:03,727 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:41:03,727 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:03,727 INFO ]: Analyzing trace with hash 1170717391, now seen corresponding path program 1 times [2018-06-25 00:41:03,727 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:03,728 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:03,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:03,728 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:03,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:03,736 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:03,756 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:03,756 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:41:03,756 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:41:03,757 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:41:03,757 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:41:03,757 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:03,757 INFO ]: Start difference. First operand 29 states and 486 transitions. Second operand 3 states. [2018-06-25 00:41:04,010 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:04,010 INFO ]: Finished difference Result 53 states and 738 transitions. [2018-06-25 00:41:04,012 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:41:04,012 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:41:04,012 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:04,014 INFO ]: With dead ends: 53 [2018-06-25 00:41:04,014 INFO ]: Without dead ends: 53 [2018-06-25 00:41:04,014 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:04,014 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-25 00:41:04,023 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-06-25 00:41:04,023 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-25 00:41:04,025 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 738 transitions. [2018-06-25 00:41:04,025 INFO ]: Start accepts. Automaton has 53 states and 738 transitions. Word has length 6 [2018-06-25 00:41:04,025 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:04,025 INFO ]: Abstraction has 53 states and 738 transitions. [2018-06-25 00:41:04,025 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:41:04,025 INFO ]: Start isEmpty. Operand 53 states and 738 transitions. [2018-06-25 00:41:04,026 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:41:04,026 INFO ]: Found error trace [2018-06-25 00:41:04,026 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:04,026 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:04,026 INFO ]: Analyzing trace with hash 1931201640, now seen corresponding path program 1 times [2018-06-25 00:41:04,026 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:04,026 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:04,027 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:04,027 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:04,027 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:04,042 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:04,088 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:04,088 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:04,088 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-25 00:41:04,095 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:04,123 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:04,129 INFO ]: Computing forward predicates... [2018-06-25 00:41:04,207 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:04,228 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:04,228 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 00:41:04,229 INFO ]: Interpolant automaton has 7 states [2018-06-25 00:41:04,229 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 00:41:04,229 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:41:04,229 INFO ]: Start difference. First operand 53 states and 738 transitions. Second operand 7 states. [2018-06-25 00:41:05,115 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:05,115 INFO ]: Finished difference Result 101 states and 1430 transitions. [2018-06-25 00:41:05,115 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 00:41:05,115 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 00:41:05,115 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:05,120 INFO ]: With dead ends: 101 [2018-06-25 00:41:05,120 INFO ]: Without dead ends: 101 [2018-06-25 00:41:05,120 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:41:05,121 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-25 00:41:05,133 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 84. [2018-06-25 00:41:05,133 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-25 00:41:05,136 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 1195 transitions. [2018-06-25 00:41:05,136 INFO ]: Start accepts. Automaton has 84 states and 1195 transitions. Word has length 7 [2018-06-25 00:41:05,136 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:05,136 INFO ]: Abstraction has 84 states and 1195 transitions. [2018-06-25 00:41:05,136 INFO ]: Interpolant automaton has 7 states. [2018-06-25 00:41:05,136 INFO ]: Start isEmpty. Operand 84 states and 1195 transitions. [2018-06-25 00:41:05,137 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:41:05,137 INFO ]: Found error trace [2018-06-25 00:41:05,137 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:05,137 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:05,137 INFO ]: Analyzing trace with hash 1930546238, now seen corresponding path program 1 times [2018-06-25 00:41:05,138 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:05,138 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:05,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:05,138 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:05,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:05,147 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:05,164 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:05,164 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:41:05,164 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:41:05,165 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:41:05,165 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:41:05,165 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:05,165 INFO ]: Start difference. First operand 84 states and 1195 transitions. Second operand 3 states. [2018-06-25 00:41:05,301 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:05,301 INFO ]: Finished difference Result 72 states and 653 transitions. [2018-06-25 00:41:05,305 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:41:05,305 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 00:41:05,305 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:05,307 INFO ]: With dead ends: 72 [2018-06-25 00:41:05,307 INFO ]: Without dead ends: 72 [2018-06-25 00:41:05,307 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:05,307 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-25 00:41:05,314 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-06-25 00:41:05,314 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-25 00:41:05,316 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 653 transitions. [2018-06-25 00:41:05,316 INFO ]: Start accepts. Automaton has 72 states and 653 transitions. Word has length 7 [2018-06-25 00:41:05,316 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:05,316 INFO ]: Abstraction has 72 states and 653 transitions. [2018-06-25 00:41:05,316 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:41:05,316 INFO ]: Start isEmpty. Operand 72 states and 653 transitions. [2018-06-25 00:41:05,317 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:41:05,317 INFO ]: Found error trace [2018-06-25 00:41:05,317 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:05,317 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:05,317 INFO ]: Analyzing trace with hash -2105030821, now seen corresponding path program 1 times [2018-06-25 00:41:05,317 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:05,318 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:05,318 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:05,318 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:05,318 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:05,328 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:05,409 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:05,409 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:05,409 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-25 00:41:05,416 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:05,450 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:05,452 INFO ]: Computing forward predicates... [2018-06-25 00:41:05,494 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:05,515 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:05,516 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 00:41:05,516 INFO ]: Interpolant automaton has 7 states [2018-06-25 00:41:05,516 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 00:41:05,516 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:41:05,516 INFO ]: Start difference. First operand 72 states and 653 transitions. Second operand 7 states. [2018-06-25 00:41:07,684 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:07,684 INFO ]: Finished difference Result 152 states and 1397 transitions. [2018-06-25 00:41:07,690 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 00:41:07,690 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 00:41:07,690 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:07,693 INFO ]: With dead ends: 152 [2018-06-25 00:41:07,693 INFO ]: Without dead ends: 152 [2018-06-25 00:41:07,693 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:41:07,694 INFO ]: Start minimizeSevpa. Operand 152 states. [2018-06-25 00:41:07,717 INFO ]: Finished minimizeSevpa. Reduced states from 152 to 104. [2018-06-25 00:41:07,717 INFO ]: Start removeUnreachable. Operand 104 states. [2018-06-25 00:41:07,718 INFO ]: Finished removeUnreachable. Reduced from 104 states to 104 states and 955 transitions. [2018-06-25 00:41:07,718 INFO ]: Start accepts. Automaton has 104 states and 955 transitions. Word has length 7 [2018-06-25 00:41:07,718 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:07,718 INFO ]: Abstraction has 104 states and 955 transitions. [2018-06-25 00:41:07,718 INFO ]: Interpolant automaton has 7 states. [2018-06-25 00:41:07,718 INFO ]: Start isEmpty. Operand 104 states and 955 transitions. [2018-06-25 00:41:07,724 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:41:07,724 INFO ]: Found error trace [2018-06-25 00:41:07,724 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:07,724 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:07,724 INFO ]: Analyzing trace with hash -2104941448, now seen corresponding path program 1 times [2018-06-25 00:41:07,724 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:07,724 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:07,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:07,725 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:07,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:07,737 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:07,769 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:07,770 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:41:07,770 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:41:07,770 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:41:07,770 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:41:07,770 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:07,770 INFO ]: Start difference. First operand 104 states and 955 transitions. Second operand 3 states. [2018-06-25 00:41:07,872 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:07,872 INFO ]: Finished difference Result 76 states and 446 transitions. [2018-06-25 00:41:07,873 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:41:07,873 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 00:41:07,873 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:07,874 INFO ]: With dead ends: 76 [2018-06-25 00:41:07,874 INFO ]: Without dead ends: 76 [2018-06-25 00:41:07,874 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:07,874 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-25 00:41:07,880 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-06-25 00:41:07,880 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-25 00:41:07,881 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 446 transitions. [2018-06-25 00:41:07,881 INFO ]: Start accepts. Automaton has 76 states and 446 transitions. Word has length 7 [2018-06-25 00:41:07,881 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:07,881 INFO ]: Abstraction has 76 states and 446 transitions. [2018-06-25 00:41:07,881 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:41:07,881 INFO ]: Start isEmpty. Operand 76 states and 446 transitions. [2018-06-25 00:41:07,882 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:41:07,882 INFO ]: Found error trace [2018-06-25 00:41:07,882 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:07,882 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:07,882 INFO ]: Analyzing trace with hash 1817480202, now seen corresponding path program 1 times [2018-06-25 00:41:07,882 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:07,882 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:07,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:07,883 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:07,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:07,895 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:07,954 INFO ]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:07,954 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:07,982 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:07,988 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:08,031 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:08,034 INFO ]: Computing forward predicates... [2018-06-25 00:41:08,358 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:08,390 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:08,390 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-25 00:41:08,391 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:41:08,391 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:41:08,391 INFO ]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:41:08,391 INFO ]: Start difference. First operand 76 states and 446 transitions. Second operand 9 states. [2018-06-25 00:41:09,211 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:09,211 INFO ]: Finished difference Result 126 states and 744 transitions. [2018-06-25 00:41:09,213 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 00:41:09,213 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-25 00:41:09,213 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:09,215 INFO ]: With dead ends: 126 [2018-06-25 00:41:09,215 INFO ]: Without dead ends: 126 [2018-06-25 00:41:09,215 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:41:09,215 INFO ]: Start minimizeSevpa. Operand 126 states. [2018-06-25 00:41:09,221 INFO ]: Finished minimizeSevpa. Reduced states from 126 to 92. [2018-06-25 00:41:09,222 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-25 00:41:09,223 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 542 transitions. [2018-06-25 00:41:09,223 INFO ]: Start accepts. Automaton has 92 states and 542 transitions. Word has length 9 [2018-06-25 00:41:09,223 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:09,223 INFO ]: Abstraction has 92 states and 542 transitions. [2018-06-25 00:41:09,223 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:41:09,223 INFO ]: Start isEmpty. Operand 92 states and 542 transitions. [2018-06-25 00:41:09,224 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:41:09,224 INFO ]: Found error trace [2018-06-25 00:41:09,224 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:09,225 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:09,225 INFO ]: Analyzing trace with hash 865637937, now seen corresponding path program 1 times [2018-06-25 00:41:09,225 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:09,225 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:09,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:09,225 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:09,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:09,237 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:09,434 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:09,434 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:09,434 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:09,448 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:09,485 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:09,487 INFO ]: Computing forward predicates... [2018-06-25 00:41:09,804 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:09,834 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:09,834 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-25 00:41:09,834 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:41:09,835 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:41:09,835 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:41:09,835 INFO ]: Start difference. First operand 92 states and 542 transitions. Second operand 9 states. [2018-06-25 00:41:11,985 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:11,985 INFO ]: Finished difference Result 157 states and 934 transitions. [2018-06-25 00:41:11,986 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 00:41:11,986 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-25 00:41:11,986 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:11,988 INFO ]: With dead ends: 157 [2018-06-25 00:41:11,988 INFO ]: Without dead ends: 157 [2018-06-25 00:41:11,988 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-25 00:41:11,989 INFO ]: Start minimizeSevpa. Operand 157 states. [2018-06-25 00:41:12,006 INFO ]: Finished minimizeSevpa. Reduced states from 157 to 107. [2018-06-25 00:41:12,006 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-25 00:41:12,007 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 636 transitions. [2018-06-25 00:41:12,008 INFO ]: Start accepts. Automaton has 107 states and 636 transitions. Word has length 9 [2018-06-25 00:41:12,008 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:12,008 INFO ]: Abstraction has 107 states and 636 transitions. [2018-06-25 00:41:12,008 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:41:12,008 INFO ]: Start isEmpty. Operand 107 states and 636 transitions. [2018-06-25 00:41:12,009 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:41:12,009 INFO ]: Found error trace [2018-06-25 00:41:12,009 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:12,009 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:12,009 INFO ]: Analyzing trace with hash 233965269, now seen corresponding path program 1 times [2018-06-25 00:41:12,009 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:12,009 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:12,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:12,010 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:12,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:12,030 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:12,132 INFO ]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:12,132 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:12,132 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:12,140 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:12,168 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:12,170 INFO ]: Computing forward predicates... [2018-06-25 00:41:12,262 INFO ]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:12,281 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:12,281 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-25 00:41:12,281 INFO ]: Interpolant automaton has 11 states [2018-06-25 00:41:12,281 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 00:41:12,281 INFO ]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-06-25 00:41:12,281 INFO ]: Start difference. First operand 107 states and 636 transitions. Second operand 11 states. [2018-06-25 00:41:13,556 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:13,556 INFO ]: Finished difference Result 161 states and 948 transitions. [2018-06-25 00:41:13,556 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 00:41:13,556 INFO ]: Start accepts. Automaton has 11 states. Word has length 10 [2018-06-25 00:41:13,556 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:13,558 INFO ]: With dead ends: 161 [2018-06-25 00:41:13,558 INFO ]: Without dead ends: 161 [2018-06-25 00:41:13,558 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-06-25 00:41:13,558 INFO ]: Start minimizeSevpa. Operand 161 states. [2018-06-25 00:41:13,564 INFO ]: Finished minimizeSevpa. Reduced states from 161 to 107. [2018-06-25 00:41:13,564 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-25 00:41:13,566 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 636 transitions. [2018-06-25 00:41:13,566 INFO ]: Start accepts. Automaton has 107 states and 636 transitions. Word has length 10 [2018-06-25 00:41:13,566 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:13,566 INFO ]: Abstraction has 107 states and 636 transitions. [2018-06-25 00:41:13,566 INFO ]: Interpolant automaton has 11 states. [2018-06-25 00:41:13,566 INFO ]: Start isEmpty. Operand 107 states and 636 transitions. [2018-06-25 00:41:13,567 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:41:13,567 INFO ]: Found error trace [2018-06-25 00:41:13,567 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:13,567 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:13,567 INFO ]: Analyzing trace with hash -1147272486, now seen corresponding path program 1 times [2018-06-25 00:41:13,567 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:13,567 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:13,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:13,568 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:13,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:13,578 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:13,665 INFO ]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:13,665 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:13,665 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:13,672 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:13,714 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:13,716 INFO ]: Computing forward predicates... [2018-06-25 00:41:13,796 INFO ]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:13,818 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:13,818 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-25 00:41:13,818 INFO ]: Interpolant automaton has 11 states [2018-06-25 00:41:13,818 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 00:41:13,818 INFO ]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-06-25 00:41:13,819 INFO ]: Start difference. First operand 107 states and 636 transitions. Second operand 11 states. [2018-06-25 00:41:14,566 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:14,566 INFO ]: Finished difference Result 180 states and 1056 transitions. [2018-06-25 00:41:14,567 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 00:41:14,567 INFO ]: Start accepts. Automaton has 11 states. Word has length 10 [2018-06-25 00:41:14,567 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:14,568 INFO ]: With dead ends: 180 [2018-06-25 00:41:14,568 INFO ]: Without dead ends: 180 [2018-06-25 00:41:14,568 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-06-25 00:41:14,569 INFO ]: Start minimizeSevpa. Operand 180 states. [2018-06-25 00:41:14,574 INFO ]: Finished minimizeSevpa. Reduced states from 180 to 123. [2018-06-25 00:41:14,574 INFO ]: Start removeUnreachable. Operand 123 states. [2018-06-25 00:41:14,579 INFO ]: Finished removeUnreachable. Reduced from 123 states to 123 states and 732 transitions. [2018-06-25 00:41:14,579 INFO ]: Start accepts. Automaton has 123 states and 732 transitions. Word has length 10 [2018-06-25 00:41:14,579 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:14,579 INFO ]: Abstraction has 123 states and 732 transitions. [2018-06-25 00:41:14,579 INFO ]: Interpolant automaton has 11 states. [2018-06-25 00:41:14,579 INFO ]: Start isEmpty. Operand 123 states and 732 transitions. [2018-06-25 00:41:14,580 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:41:14,580 INFO ]: Found error trace [2018-06-25 00:41:14,580 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:14,580 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:14,580 INFO ]: Analyzing trace with hash 1332474658, now seen corresponding path program 1 times [2018-06-25 00:41:14,580 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:14,580 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:14,585 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:14,585 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:14,585 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:14,599 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:14,681 INFO ]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:14,681 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:14,681 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:14,687 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:14,721 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:14,724 INFO ]: Computing forward predicates... [2018-06-25 00:41:14,805 INFO ]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:14,825 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:14,825 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-25 00:41:14,825 INFO ]: Interpolant automaton has 13 states [2018-06-25 00:41:14,825 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 00:41:14,825 INFO ]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-06-25 00:41:14,825 INFO ]: Start difference. First operand 123 states and 732 transitions. Second operand 13 states. [2018-06-25 00:41:16,113 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:16,113 INFO ]: Finished difference Result 248 states and 1460 transitions. [2018-06-25 00:41:16,113 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 00:41:16,113 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-25 00:41:16,113 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:16,115 INFO ]: With dead ends: 248 [2018-06-25 00:41:16,115 INFO ]: Without dead ends: 248 [2018-06-25 00:41:16,116 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-06-25 00:41:16,116 INFO ]: Start minimizeSevpa. Operand 248 states. [2018-06-25 00:41:16,124 INFO ]: Finished minimizeSevpa. Reduced states from 248 to 157. [2018-06-25 00:41:16,124 INFO ]: Start removeUnreachable. Operand 157 states. [2018-06-25 00:41:16,125 INFO ]: Finished removeUnreachable. Reduced from 157 states to 157 states and 935 transitions. [2018-06-25 00:41:16,126 INFO ]: Start accepts. Automaton has 157 states and 935 transitions. Word has length 12 [2018-06-25 00:41:16,126 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:16,126 INFO ]: Abstraction has 157 states and 935 transitions. [2018-06-25 00:41:16,126 INFO ]: Interpolant automaton has 13 states. [2018-06-25 00:41:16,126 INFO ]: Start isEmpty. Operand 157 states and 935 transitions. [2018-06-25 00:41:16,127 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:41:16,127 INFO ]: Found error trace [2018-06-25 00:41:16,127 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:16,127 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:16,127 INFO ]: Analyzing trace with hash 1334470655, now seen corresponding path program 1 times [2018-06-25 00:41:16,127 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:16,127 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:16,128 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:16,128 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:16,128 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:16,139 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:16,262 INFO ]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:16,262 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:16,262 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:16,281 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:16,314 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:16,316 INFO ]: Computing forward predicates... [2018-06-25 00:41:16,363 INFO ]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:16,386 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:16,386 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-25 00:41:16,386 INFO ]: Interpolant automaton has 13 states [2018-06-25 00:41:16,386 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 00:41:16,386 INFO ]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-06-25 00:41:16,386 INFO ]: Start difference. First operand 157 states and 935 transitions. Second operand 13 states. [2018-06-25 00:41:17,354 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:17,354 INFO ]: Finished difference Result 237 states and 1420 transitions. [2018-06-25 00:41:17,355 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 00:41:17,355 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-25 00:41:17,355 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:17,356 INFO ]: With dead ends: 237 [2018-06-25 00:41:17,356 INFO ]: Without dead ends: 237 [2018-06-25 00:41:17,357 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-06-25 00:41:17,357 INFO ]: Start minimizeSevpa. Operand 237 states. [2018-06-25 00:41:17,363 INFO ]: Finished minimizeSevpa. Reduced states from 237 to 142. [2018-06-25 00:41:17,363 INFO ]: Start removeUnreachable. Operand 142 states. [2018-06-25 00:41:17,364 INFO ]: Finished removeUnreachable. Reduced from 142 states to 142 states and 840 transitions. [2018-06-25 00:41:17,364 INFO ]: Start accepts. Automaton has 142 states and 840 transitions. Word has length 12 [2018-06-25 00:41:17,364 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:17,364 INFO ]: Abstraction has 142 states and 840 transitions. [2018-06-25 00:41:17,364 INFO ]: Interpolant automaton has 13 states. [2018-06-25 00:41:17,364 INFO ]: Start isEmpty. Operand 142 states and 840 transitions. [2018-06-25 00:41:17,365 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:41:17,365 INFO ]: Found error trace [2018-06-25 00:41:17,365 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:17,365 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:17,365 INFO ]: Analyzing trace with hash 939054712, now seen corresponding path program 1 times [2018-06-25 00:41:17,365 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:17,365 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:17,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:17,366 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:17,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:17,376 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:17,867 INFO ]: Checked inductivity of 28 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:17,867 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:17,867 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:17,873 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:17,934 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:17,937 INFO ]: Computing forward predicates... [2018-06-25 00:41:18,126 INFO ]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:18,147 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:18,162 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-25 00:41:18,162 INFO ]: Interpolant automaton has 12 states [2018-06-25 00:41:18,162 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 00:41:18,162 INFO ]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-06-25 00:41:18,163 INFO ]: Start difference. First operand 142 states and 840 transitions. Second operand 12 states. [2018-06-25 00:41:23,790 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:23,790 INFO ]: Finished difference Result 196 states and 1152 transitions. [2018-06-25 00:41:23,791 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 00:41:23,791 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-25 00:41:23,791 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:23,792 INFO ]: With dead ends: 196 [2018-06-25 00:41:23,792 INFO ]: Without dead ends: 196 [2018-06-25 00:41:23,792 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-06-25 00:41:23,792 INFO ]: Start minimizeSevpa. Operand 196 states. [2018-06-25 00:41:23,796 INFO ]: Finished minimizeSevpa. Reduced states from 196 to 127. [2018-06-25 00:41:23,796 INFO ]: Start removeUnreachable. Operand 127 states. [2018-06-25 00:41:23,797 INFO ]: Finished removeUnreachable. Reduced from 127 states to 127 states and 746 transitions. [2018-06-25 00:41:23,797 INFO ]: Start accepts. Automaton has 127 states and 746 transitions. Word has length 12 [2018-06-25 00:41:23,797 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:23,797 INFO ]: Abstraction has 127 states and 746 transitions. [2018-06-25 00:41:23,797 INFO ]: Interpolant automaton has 12 states. [2018-06-25 00:41:23,797 INFO ]: Start isEmpty. Operand 127 states and 746 transitions. [2018-06-25 00:41:23,798 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:41:23,798 INFO ]: Found error trace [2018-06-25 00:41:23,798 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:23,798 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:23,798 INFO ]: Analyzing trace with hash 959701049, now seen corresponding path program 1 times [2018-06-25 00:41:23,798 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:23,798 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:23,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:23,799 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:23,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:23,813 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:23,927 INFO ]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:23,927 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:23,927 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:23,934 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:23,967 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:23,969 INFO ]: Computing forward predicates... [2018-06-25 00:41:24,069 INFO ]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:24,089 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:24,089 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-25 00:41:24,089 INFO ]: Interpolant automaton has 12 states [2018-06-25 00:41:24,089 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 00:41:24,089 INFO ]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-06-25 00:41:24,089 INFO ]: Start difference. First operand 127 states and 746 transitions. Second operand 12 states. [2018-06-25 00:41:25,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:25,068 INFO ]: Finished difference Result 276 states and 1638 transitions. [2018-06-25 00:41:25,068 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 00:41:25,068 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-25 00:41:25,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:25,070 INFO ]: With dead ends: 276 [2018-06-25 00:41:25,070 INFO ]: Without dead ends: 276 [2018-06-25 00:41:25,071 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-06-25 00:41:25,071 INFO ]: Start minimizeSevpa. Operand 276 states. [2018-06-25 00:41:25,077 INFO ]: Finished minimizeSevpa. Reduced states from 276 to 147. [2018-06-25 00:41:25,077 INFO ]: Start removeUnreachable. Operand 147 states. [2018-06-25 00:41:25,079 INFO ]: Finished removeUnreachable. Reduced from 147 states to 147 states and 857 transitions. [2018-06-25 00:41:25,079 INFO ]: Start accepts. Automaton has 147 states and 857 transitions. Word has length 12 [2018-06-25 00:41:25,079 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:25,079 INFO ]: Abstraction has 147 states and 857 transitions. [2018-06-25 00:41:25,079 INFO ]: Interpolant automaton has 12 states. [2018-06-25 00:41:25,079 INFO ]: Start isEmpty. Operand 147 states and 857 transitions. [2018-06-25 00:41:25,080 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:41:25,080 INFO ]: Found error trace [2018-06-25 00:41:25,080 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:25,080 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:25,080 INFO ]: Analyzing trace with hash 961697046, now seen corresponding path program 1 times [2018-06-25 00:41:25,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:25,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:25,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:25,082 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:25,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:25,098 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:25,328 INFO ]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:25,328 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:25,328 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:25,333 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:25,364 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:25,366 INFO ]: Computing forward predicates... [2018-06-25 00:41:25,413 INFO ]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:25,432 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:25,432 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-25 00:41:25,432 INFO ]: Interpolant automaton has 12 states [2018-06-25 00:41:25,432 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 00:41:25,432 INFO ]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-06-25 00:41:25,432 INFO ]: Start difference. First operand 147 states and 857 transitions. Second operand 12 states. [2018-06-25 00:41:26,323 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:26,323 INFO ]: Finished difference Result 238 states and 1422 transitions. [2018-06-25 00:41:26,324 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 00:41:26,324 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-25 00:41:26,324 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:26,326 INFO ]: With dead ends: 238 [2018-06-25 00:41:26,326 INFO ]: Without dead ends: 238 [2018-06-25 00:41:26,326 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-06-25 00:41:26,327 INFO ]: Start minimizeSevpa. Operand 238 states. [2018-06-25 00:41:26,332 INFO ]: Finished minimizeSevpa. Reduced states from 238 to 131. [2018-06-25 00:41:26,332 INFO ]: Start removeUnreachable. Operand 131 states. [2018-06-25 00:41:26,333 INFO ]: Finished removeUnreachable. Reduced from 131 states to 131 states and 760 transitions. [2018-06-25 00:41:26,333 INFO ]: Start accepts. Automaton has 131 states and 760 transitions. Word has length 12 [2018-06-25 00:41:26,333 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:26,333 INFO ]: Abstraction has 131 states and 760 transitions. [2018-06-25 00:41:26,333 INFO ]: Interpolant automaton has 12 states. [2018-06-25 00:41:26,333 INFO ]: Start isEmpty. Operand 131 states and 760 transitions. [2018-06-25 00:41:26,334 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:41:26,334 INFO ]: Found error trace [2018-06-25 00:41:26,334 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:26,334 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:26,334 INFO ]: Analyzing trace with hash 424207824, now seen corresponding path program 1 times [2018-06-25 00:41:26,334 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:26,334 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:26,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:26,335 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:26,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:26,351 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:26,570 INFO ]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:26,570 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:26,570 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:26,577 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:26,609 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:26,612 INFO ]: Computing forward predicates... [2018-06-25 00:41:26,684 INFO ]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:26,703 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:26,703 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-25 00:41:26,703 INFO ]: Interpolant automaton has 12 states [2018-06-25 00:41:26,703 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 00:41:26,703 INFO ]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-25 00:41:26,703 INFO ]: Start difference. First operand 131 states and 760 transitions. Second operand 12 states. [2018-06-25 00:41:30,898 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:30,898 INFO ]: Finished difference Result 226 states and 1340 transitions. [2018-06-25 00:41:30,898 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 00:41:30,898 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-25 00:41:30,899 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:30,900 INFO ]: With dead ends: 226 [2018-06-25 00:41:30,900 INFO ]: Without dead ends: 226 [2018-06-25 00:41:30,900 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-06-25 00:41:30,900 INFO ]: Start minimizeSevpa. Operand 226 states. [2018-06-25 00:41:30,906 INFO ]: Finished minimizeSevpa. Reduced states from 226 to 146. [2018-06-25 00:41:30,906 INFO ]: Start removeUnreachable. Operand 146 states. [2018-06-25 00:41:30,907 INFO ]: Finished removeUnreachable. Reduced from 146 states to 146 states and 854 transitions. [2018-06-25 00:41:30,907 INFO ]: Start accepts. Automaton has 146 states and 854 transitions. Word has length 12 [2018-06-25 00:41:30,907 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:30,907 INFO ]: Abstraction has 146 states and 854 transitions. [2018-06-25 00:41:30,907 INFO ]: Interpolant automaton has 12 states. [2018-06-25 00:41:30,907 INFO ]: Start isEmpty. Operand 146 states and 854 transitions. [2018-06-25 00:41:30,908 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:41:30,908 INFO ]: Found error trace [2018-06-25 00:41:30,908 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:30,908 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:30,908 INFO ]: Analyzing trace with hash 1087802355, now seen corresponding path program 1 times [2018-06-25 00:41:30,908 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:30,908 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:30,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:30,909 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:30,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:30,917 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:31,371 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-25 00:41:31,891 INFO ]: Checked inductivity of 28 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:31,891 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:31,891 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:31,898 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:31,931 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:31,933 INFO ]: Computing forward predicates... [2018-06-25 00:41:32,125 INFO ]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:32,145 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:32,145 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-25 00:41:32,145 INFO ]: Interpolant automaton has 13 states [2018-06-25 00:41:32,145 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 00:41:32,145 INFO ]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-06-25 00:41:32,145 INFO ]: Start difference. First operand 146 states and 854 transitions. Second operand 13 states. [2018-06-25 00:41:33,466 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:33,466 INFO ]: Finished difference Result 200 states and 1166 transitions. [2018-06-25 00:41:33,466 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 00:41:33,466 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-25 00:41:33,466 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:33,467 INFO ]: With dead ends: 200 [2018-06-25 00:41:33,467 INFO ]: Without dead ends: 200 [2018-06-25 00:41:33,467 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-06-25 00:41:33,467 INFO ]: Start minimizeSevpa. Operand 200 states. [2018-06-25 00:41:33,471 INFO ]: Finished minimizeSevpa. Reduced states from 200 to 131. [2018-06-25 00:41:33,471 INFO ]: Start removeUnreachable. Operand 131 states. [2018-06-25 00:41:33,472 INFO ]: Finished removeUnreachable. Reduced from 131 states to 131 states and 760 transitions. [2018-06-25 00:41:33,472 INFO ]: Start accepts. Automaton has 131 states and 760 transitions. Word has length 12 [2018-06-25 00:41:33,472 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:33,472 INFO ]: Abstraction has 131 states and 760 transitions. [2018-06-25 00:41:33,472 INFO ]: Interpolant automaton has 13 states. [2018-06-25 00:41:33,472 INFO ]: Start isEmpty. Operand 131 states and 760 transitions. [2018-06-25 00:41:33,473 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:41:33,473 INFO ]: Found error trace [2018-06-25 00:41:33,473 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:33,473 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:33,473 INFO ]: Analyzing trace with hash 128973932, now seen corresponding path program 1 times [2018-06-25 00:41:33,473 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:33,473 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:33,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:33,474 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:33,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:33,489 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:33,570 INFO ]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:33,570 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:33,570 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:33,576 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:33,607 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:33,609 INFO ]: Computing forward predicates... [2018-06-25 00:41:33,713 INFO ]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:33,732 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:33,732 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-25 00:41:33,732 INFO ]: Interpolant automaton has 11 states [2018-06-25 00:41:33,732 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 00:41:33,732 INFO ]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-25 00:41:33,732 INFO ]: Start difference. First operand 131 states and 760 transitions. Second operand 11 states. [2018-06-25 00:41:37,550 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:37,551 INFO ]: Finished difference Result 219 states and 1274 transitions. [2018-06-25 00:41:37,553 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 00:41:37,553 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-25 00:41:37,553 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:37,554 INFO ]: With dead ends: 219 [2018-06-25 00:41:37,554 INFO ]: Without dead ends: 219 [2018-06-25 00:41:37,555 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-25 00:41:37,555 INFO ]: Start minimizeSevpa. Operand 219 states. [2018-06-25 00:41:37,559 INFO ]: Finished minimizeSevpa. Reduced states from 219 to 150. [2018-06-25 00:41:37,559 INFO ]: Start removeUnreachable. Operand 150 states. [2018-06-25 00:41:37,561 INFO ]: Finished removeUnreachable. Reduced from 150 states to 150 states and 868 transitions. [2018-06-25 00:41:37,561 INFO ]: Start accepts. Automaton has 150 states and 868 transitions. Word has length 12 [2018-06-25 00:41:37,561 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:37,561 INFO ]: Abstraction has 150 states and 868 transitions. [2018-06-25 00:41:37,562 INFO ]: Interpolant automaton has 11 states. [2018-06-25 00:41:37,562 INFO ]: Start isEmpty. Operand 150 states and 868 transitions. [2018-06-25 00:41:37,562 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:41:37,562 INFO ]: Found error trace [2018-06-25 00:41:37,562 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:37,562 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:37,563 INFO ]: Analyzing trace with hash 244563012, now seen corresponding path program 1 times [2018-06-25 00:41:37,563 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:37,563 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:37,563 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:37,563 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:37,563 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:37,582 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:37,832 INFO ]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:37,832 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:37,833 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:37,841 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:37,873 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:37,875 INFO ]: Computing forward predicates... [2018-06-25 00:41:37,979 INFO ]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:37,998 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:37,999 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-25 00:41:37,999 INFO ]: Interpolant automaton has 13 states [2018-06-25 00:41:37,999 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 00:41:37,999 INFO ]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-06-25 00:41:37,999 INFO ]: Start difference. First operand 150 states and 868 transitions. Second operand 13 states. [2018-06-25 00:41:39,346 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:39,346 INFO ]: Finished difference Result 238 states and 1382 transitions. [2018-06-25 00:41:39,372 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 00:41:39,372 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-25 00:41:39,372 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:39,374 INFO ]: With dead ends: 238 [2018-06-25 00:41:39,374 INFO ]: Without dead ends: 238 [2018-06-25 00:41:39,374 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-06-25 00:41:39,374 INFO ]: Start minimizeSevpa. Operand 238 states. [2018-06-25 00:41:39,380 INFO ]: Finished minimizeSevpa. Reduced states from 238 to 181. [2018-06-25 00:41:39,380 INFO ]: Start removeUnreachable. Operand 181 states. [2018-06-25 00:41:39,381 INFO ]: Finished removeUnreachable. Reduced from 181 states to 181 states and 1058 transitions. [2018-06-25 00:41:39,381 INFO ]: Start accepts. Automaton has 181 states and 1058 transitions. Word has length 12 [2018-06-25 00:41:39,382 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:39,382 INFO ]: Abstraction has 181 states and 1058 transitions. [2018-06-25 00:41:39,382 INFO ]: Interpolant automaton has 13 states. [2018-06-25 00:41:39,382 INFO ]: Start isEmpty. Operand 181 states and 1058 transitions. [2018-06-25 00:41:39,382 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:41:39,382 INFO ]: Found error trace [2018-06-25 00:41:39,382 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:39,383 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:39,383 INFO ]: Analyzing trace with hash -1336716999, now seen corresponding path program 1 times [2018-06-25 00:41:39,383 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:39,383 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:39,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:39,383 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:39,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:39,391 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:39,602 INFO ]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:39,603 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:39,603 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:39,608 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:39,639 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:39,641 INFO ]: Computing forward predicates... [2018-06-25 00:41:39,714 INFO ]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:39,742 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:39,742 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-25 00:41:39,742 INFO ]: Interpolant automaton has 13 states [2018-06-25 00:41:39,742 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 00:41:39,742 INFO ]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-06-25 00:41:39,742 INFO ]: Start difference. First operand 181 states and 1058 transitions. Second operand 13 states. [2018-06-25 00:41:40,935 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:40,935 INFO ]: Finished difference Result 303 states and 1774 transitions. [2018-06-25 00:41:40,936 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 00:41:40,936 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-25 00:41:40,936 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:40,937 INFO ]: With dead ends: 303 [2018-06-25 00:41:40,937 INFO ]: Without dead ends: 303 [2018-06-25 00:41:40,937 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-06-25 00:41:40,938 INFO ]: Start minimizeSevpa. Operand 303 states. [2018-06-25 00:41:40,944 INFO ]: Finished minimizeSevpa. Reduced states from 303 to 197. [2018-06-25 00:41:40,944 INFO ]: Start removeUnreachable. Operand 197 states. [2018-06-25 00:41:40,945 INFO ]: Finished removeUnreachable. Reduced from 197 states to 197 states and 1155 transitions. [2018-06-25 00:41:40,945 INFO ]: Start accepts. Automaton has 197 states and 1155 transitions. Word has length 12 [2018-06-25 00:41:40,946 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:40,946 INFO ]: Abstraction has 197 states and 1155 transitions. [2018-06-25 00:41:40,946 INFO ]: Interpolant automaton has 13 states. [2018-06-25 00:41:40,946 INFO ]: Start isEmpty. Operand 197 states and 1155 transitions. [2018-06-25 00:41:40,946 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:41:40,947 INFO ]: Found error trace [2018-06-25 00:41:40,947 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:40,947 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:40,947 INFO ]: Analyzing trace with hash -1334721002, now seen corresponding path program 1 times [2018-06-25 00:41:40,947 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:40,947 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:40,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:40,947 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:40,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:40,957 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:41,077 INFO ]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:41,077 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:41,077 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:41,083 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:41,132 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:41,135 INFO ]: Computing forward predicates... [2018-06-25 00:41:41,344 INFO ]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:41,363 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:41,363 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-25 00:41:41,363 INFO ]: Interpolant automaton has 13 states [2018-06-25 00:41:41,363 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 00:41:41,364 INFO ]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-06-25 00:41:41,364 INFO ]: Start difference. First operand 197 states and 1155 transitions. Second operand 13 states. [2018-06-25 00:41:42,531 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:42,531 INFO ]: Finished difference Result 277 states and 1640 transitions. [2018-06-25 00:41:42,531 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 00:41:42,531 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-25 00:41:42,531 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:42,533 INFO ]: With dead ends: 277 [2018-06-25 00:41:42,533 INFO ]: Without dead ends: 277 [2018-06-25 00:41:42,533 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-06-25 00:41:42,533 INFO ]: Start minimizeSevpa. Operand 277 states. [2018-06-25 00:41:42,539 INFO ]: Finished minimizeSevpa. Reduced states from 277 to 181. [2018-06-25 00:41:42,539 INFO ]: Start removeUnreachable. Operand 181 states. [2018-06-25 00:41:42,540 INFO ]: Finished removeUnreachable. Reduced from 181 states to 181 states and 1058 transitions. [2018-06-25 00:41:42,541 INFO ]: Start accepts. Automaton has 181 states and 1058 transitions. Word has length 12 [2018-06-25 00:41:42,541 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:42,541 INFO ]: Abstraction has 181 states and 1058 transitions. [2018-06-25 00:41:42,541 INFO ]: Interpolant automaton has 13 states. [2018-06-25 00:41:42,541 INFO ]: Start isEmpty. Operand 181 states and 1058 transitions. [2018-06-25 00:41:42,541 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:41:42,542 INFO ]: Found error trace [2018-06-25 00:41:42,542 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:42,542 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:42,542 INFO ]: Analyzing trace with hash 1104663520, now seen corresponding path program 1 times [2018-06-25 00:41:42,542 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:42,542 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:42,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:42,542 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:42,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:42,551 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:42,703 INFO ]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:42,703 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:42,703 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:42,711 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:42,748 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:42,751 INFO ]: Computing forward predicates... [2018-06-25 00:41:42,919 INFO ]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:42,939 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:42,939 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-25 00:41:42,939 INFO ]: Interpolant automaton has 12 states [2018-06-25 00:41:42,939 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 00:41:42,939 INFO ]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-25 00:41:42,939 INFO ]: Start difference. First operand 181 states and 1058 transitions. Second operand 12 states. [2018-06-25 00:41:43,925 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:43,925 INFO ]: Finished difference Result 315 states and 1856 transitions. [2018-06-25 00:41:43,926 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 00:41:43,926 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-25 00:41:43,926 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:43,928 INFO ]: With dead ends: 315 [2018-06-25 00:41:43,928 INFO ]: Without dead ends: 315 [2018-06-25 00:41:43,928 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-06-25 00:41:43,928 INFO ]: Start minimizeSevpa. Operand 315 states. [2018-06-25 00:41:43,934 INFO ]: Finished minimizeSevpa. Reduced states from 315 to 201. [2018-06-25 00:41:43,934 INFO ]: Start removeUnreachable. Operand 201 states. [2018-06-25 00:41:43,936 INFO ]: Finished removeUnreachable. Reduced from 201 states to 201 states and 1169 transitions. [2018-06-25 00:41:43,936 INFO ]: Start accepts. Automaton has 201 states and 1169 transitions. Word has length 12 [2018-06-25 00:41:43,936 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:43,936 INFO ]: Abstraction has 201 states and 1169 transitions. [2018-06-25 00:41:43,936 INFO ]: Interpolant automaton has 12 states. [2018-06-25 00:41:43,937 INFO ]: Start isEmpty. Operand 201 states and 1169 transitions. [2018-06-25 00:41:43,937 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:41:43,937 INFO ]: Found error trace [2018-06-25 00:41:43,937 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:43,937 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:43,938 INFO ]: Analyzing trace with hash 1106659517, now seen corresponding path program 1 times [2018-06-25 00:41:43,938 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:43,938 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:43,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:43,938 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:43,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:43,948 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:44,118 INFO ]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:44,118 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:44,118 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:44,124 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:44,158 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:44,160 INFO ]: Computing forward predicates... [2018-06-25 00:41:44,258 INFO ]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:44,278 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:44,278 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-25 00:41:44,278 INFO ]: Interpolant automaton has 12 states [2018-06-25 00:41:44,278 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 00:41:44,278 INFO ]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-06-25 00:41:44,278 INFO ]: Start difference. First operand 201 states and 1169 transitions. Second operand 12 states. [2018-06-25 00:41:45,190 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:45,190 INFO ]: Finished difference Result 277 states and 1640 transitions. [2018-06-25 00:41:45,206 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 00:41:45,206 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-25 00:41:45,206 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:45,208 INFO ]: With dead ends: 277 [2018-06-25 00:41:45,208 INFO ]: Without dead ends: 277 [2018-06-25 00:41:45,208 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-06-25 00:41:45,208 INFO ]: Start minimizeSevpa. Operand 277 states. [2018-06-25 00:41:45,212 INFO ]: Finished minimizeSevpa. Reduced states from 277 to 185. [2018-06-25 00:41:45,212 INFO ]: Start removeUnreachable. Operand 185 states. [2018-06-25 00:41:45,213 INFO ]: Finished removeUnreachable. Reduced from 185 states to 185 states and 1072 transitions. [2018-06-25 00:41:45,213 INFO ]: Start accepts. Automaton has 185 states and 1072 transitions. Word has length 12 [2018-06-25 00:41:45,214 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:45,214 INFO ]: Abstraction has 185 states and 1072 transitions. [2018-06-25 00:41:45,214 INFO ]: Interpolant automaton has 12 states. [2018-06-25 00:41:45,214 INFO ]: Start isEmpty. Operand 185 states and 1072 transitions. [2018-06-25 00:41:45,214 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:41:45,214 INFO ]: Found error trace [2018-06-25 00:41:45,215 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:45,215 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:45,217 INFO ]: Analyzing trace with hash 569170295, now seen corresponding path program 1 times [2018-06-25 00:41:45,217 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:45,217 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:45,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:45,217 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:45,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:45,225 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:45,348 INFO ]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:45,348 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:45,348 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:45,355 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:45,392 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:45,394 INFO ]: Computing forward predicates... [2018-06-25 00:41:45,434 INFO ]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:41:45,453 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:45,453 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-25 00:41:45,453 INFO ]: Interpolant automaton has 12 states [2018-06-25 00:41:45,454 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 00:41:45,454 INFO ]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-06-25 00:41:45,454 INFO ]: Start difference. First operand 185 states and 1072 transitions. Second operand 12 states. [2018-06-25 00:41:50,895 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:50,895 INFO ]: Finished difference Result 250 states and 1464 transitions. [2018-06-25 00:41:50,896 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 00:41:50,896 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-25 00:41:50,896 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:50,897 INFO ]: With dead ends: 250 [2018-06-25 00:41:50,897 INFO ]: Without dead ends: 250 [2018-06-25 00:41:50,898 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-06-25 00:41:50,898 INFO ]: Start minimizeSevpa. Operand 250 states. [2018-06-25 00:41:50,904 INFO ]: Finished minimizeSevpa. Reduced states from 250 to 185. [2018-06-25 00:41:50,904 INFO ]: Start removeUnreachable. Operand 185 states. [2018-06-25 00:41:50,904 INFO ]: Finished removeUnreachable. Reduced from 185 states to 185 states and 1072 transitions. [2018-06-25 00:41:50,904 INFO ]: Start accepts. Automaton has 185 states and 1072 transitions. Word has length 12 [2018-06-25 00:41:50,905 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:50,905 INFO ]: Abstraction has 185 states and 1072 transitions. [2018-06-25 00:41:50,905 INFO ]: Interpolant automaton has 12 states. [2018-06-25 00:41:50,905 INFO ]: Start isEmpty. Operand 185 states and 1072 transitions. [2018-06-25 00:41:50,905 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:41:50,905 INFO ]: Found error trace [2018-06-25 00:41:50,905 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1] [2018-06-25 00:41:50,905 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:50,905 INFO ]: Analyzing trace with hash -1779754680, now seen corresponding path program 2 times [2018-06-25 00:41:50,905 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:50,905 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:50,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:50,906 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:50,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:50,912 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:51,215 INFO ]: Checked inductivity of 36 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:41:51,215 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:51,215 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:51,223 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:41:51,288 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:41:51,288 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:51,291 INFO ]: Computing forward predicates... [2018-06-25 00:41:51,408 INFO ]: Checked inductivity of 36 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:41:51,426 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:51,426 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-06-25 00:41:51,426 INFO ]: Interpolant automaton has 15 states [2018-06-25 00:41:51,426 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 00:41:51,426 INFO ]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-06-25 00:41:51,426 INFO ]: Start difference. First operand 185 states and 1072 transitions. Second operand 15 states. [2018-06-25 00:41:52,738 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:52,738 INFO ]: Finished difference Result 273 states and 1586 transitions. [2018-06-25 00:41:52,738 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 00:41:52,738 INFO ]: Start accepts. Automaton has 15 states. Word has length 13 [2018-06-25 00:41:52,738 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:52,739 INFO ]: With dead ends: 273 [2018-06-25 00:41:52,739 INFO ]: Without dead ends: 273 [2018-06-25 00:41:52,739 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-06-25 00:41:52,740 INFO ]: Start minimizeSevpa. Operand 273 states. [2018-06-25 00:41:52,745 INFO ]: Finished minimizeSevpa. Reduced states from 273 to 181. [2018-06-25 00:41:52,745 INFO ]: Start removeUnreachable. Operand 181 states. [2018-06-25 00:41:52,746 INFO ]: Finished removeUnreachable. Reduced from 181 states to 181 states and 1058 transitions. [2018-06-25 00:41:52,746 INFO ]: Start accepts. Automaton has 181 states and 1058 transitions. Word has length 13 [2018-06-25 00:41:52,746 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:52,746 INFO ]: Abstraction has 181 states and 1058 transitions. [2018-06-25 00:41:52,746 INFO ]: Interpolant automaton has 15 states. [2018-06-25 00:41:52,746 INFO ]: Start isEmpty. Operand 181 states and 1058 transitions. [2018-06-25 00:41:52,747 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 00:41:52,747 INFO ]: Found error trace [2018-06-25 00:41:52,747 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:52,747 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:52,747 INFO ]: Analyzing trace with hash -1883241208, now seen corresponding path program 1 times [2018-06-25 00:41:52,747 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:52,747 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:52,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:52,748 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:41:52,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:52,758 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:52,874 INFO ]: Checked inductivity of 55 backedges. 3 proven. 50 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:41:52,874 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:52,874 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:52,880 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:52,920 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:52,923 INFO ]: Computing forward predicates... [2018-06-25 00:41:53,007 INFO ]: Checked inductivity of 55 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:41:53,026 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:53,026 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2018-06-25 00:41:53,026 INFO ]: Interpolant automaton has 17 states [2018-06-25 00:41:53,026 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 00:41:53,026 INFO ]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-06-25 00:41:53,027 INFO ]: Start difference. First operand 181 states and 1058 transitions. Second operand 17 states. [2018-06-25 00:41:54,390 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:54,390 INFO ]: Finished difference Result 380 states and 2208 transitions. [2018-06-25 00:41:54,391 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 00:41:54,391 INFO ]: Start accepts. Automaton has 17 states. Word has length 15 [2018-06-25 00:41:54,391 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:54,393 INFO ]: With dead ends: 380 [2018-06-25 00:41:54,393 INFO ]: Without dead ends: 380 [2018-06-25 00:41:54,393 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-06-25 00:41:54,393 INFO ]: Start minimizeSevpa. Operand 380 states. [2018-06-25 00:41:54,397 INFO ]: Finished minimizeSevpa. Reduced states from 380 to 217. [2018-06-25 00:41:54,397 INFO ]: Start removeUnreachable. Operand 217 states. [2018-06-25 00:41:54,398 INFO ]: Finished removeUnreachable. Reduced from 217 states to 217 states and 1265 transitions. [2018-06-25 00:41:54,398 INFO ]: Start accepts. Automaton has 217 states and 1265 transitions. Word has length 15 [2018-06-25 00:41:54,398 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:54,398 INFO ]: Abstraction has 217 states and 1265 transitions. [2018-06-25 00:41:54,398 INFO ]: Interpolant automaton has 17 states. [2018-06-25 00:41:54,399 INFO ]: Start isEmpty. Operand 217 states and 1265 transitions. [2018-06-25 00:41:54,399 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 00:41:54,399 INFO ]: Found error trace [2018-06-25 00:41:54,400 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:54,400 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:54,400 INFO ]: Analyzing trace with hash -1881245211, now seen corresponding path program 1 times [2018-06-25 00:41:54,400 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:54,400 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:54,400 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:54,400 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:54,400 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:54,410 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:54,641 INFO ]: Checked inductivity of 55 backedges. 3 proven. 50 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:41:54,642 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:54,642 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:54,647 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:54,688 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:54,691 INFO ]: Computing forward predicates... [2018-06-25 00:41:54,778 INFO ]: Checked inductivity of 55 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:41:54,797 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:54,797 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2018-06-25 00:41:54,798 INFO ]: Interpolant automaton has 17 states [2018-06-25 00:41:54,798 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 00:41:54,798 INFO ]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-06-25 00:41:54,798 INFO ]: Start difference. First operand 217 states and 1265 transitions. Second operand 17 states. [2018-06-25 00:41:56,609 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:56,609 INFO ]: Finished difference Result 480 states and 2845 transitions. [2018-06-25 00:41:56,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 00:41:56,609 INFO ]: Start accepts. Automaton has 17 states. Word has length 15 [2018-06-25 00:41:56,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:56,611 INFO ]: With dead ends: 480 [2018-06-25 00:41:56,611 INFO ]: Without dead ends: 480 [2018-06-25 00:41:56,612 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-06-25 00:41:56,612 INFO ]: Start minimizeSevpa. Operand 480 states. [2018-06-25 00:41:56,619 INFO ]: Finished minimizeSevpa. Reduced states from 480 to 248. [2018-06-25 00:41:56,619 INFO ]: Start removeUnreachable. Operand 248 states. [2018-06-25 00:41:56,621 INFO ]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1456 transitions. [2018-06-25 00:41:56,621 INFO ]: Start accepts. Automaton has 248 states and 1456 transitions. Word has length 15 [2018-06-25 00:41:56,621 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:56,621 INFO ]: Abstraction has 248 states and 1456 transitions. [2018-06-25 00:41:56,621 INFO ]: Interpolant automaton has 17 states. [2018-06-25 00:41:56,621 INFO ]: Start isEmpty. Operand 248 states and 1456 transitions. [2018-06-25 00:41:56,622 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 00:41:56,622 INFO ]: Found error trace [2018-06-25 00:41:56,622 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:41:56,622 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:56,622 INFO ]: Analyzing trace with hash 1876232863, now seen corresponding path program 1 times [2018-06-25 00:41:56,622 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:56,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:56,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:56,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:56,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:56,632 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:57,394 INFO ]: Checked inductivity of 55 backedges. 3 proven. 50 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:41:57,394 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:57,394 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 00:41:57,408 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:57,453 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:57,456 INFO ]: Computing forward predicates... [2018-06-25 00:41:58,514 INFO ]: Checked inductivity of 55 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:41:58,534 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:58,534 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2018-06-25 00:41:58,534 INFO ]: Interpolant automaton has 17 states [2018-06-25 00:41:58,534 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 00:41:58,535 INFO ]: CoverageRelationStatistics Valid=58, Invalid=213, Unknown=1, NotChecked=0, Total=272 [2018-06-25 00:41:58,535 INFO ]: Start difference. First operand 248 states and 1456 transitions. Second operand 17 states. Received shutdown request... [2018-06-25 00:42:01,896 WARN ]: Spent 893.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-25 00:42:02,004 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 00:42:02,004 WARN ]: Verification canceled [2018-06-25 00:42:02,006 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:42:02,007 WARN ]: Timeout [2018-06-25 00:42:02,008 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:42:02 BasicIcfg [2018-06-25 00:42:02,008 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:42:02,008 INFO ]: Toolchain (without parser) took 65118.15 ms. Allocated memory was 309.3 MB in the beginning and 760.2 MB in the end (delta: 450.9 MB). Free memory was 263.9 MB in the beginning and 445.0 MB in the end (delta: -181.2 MB). Peak memory consumption was 269.7 MB. Max. memory is 3.6 GB. [2018-06-25 00:42:02,009 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 309.3 MB. Free memory is still 274.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:42:02,009 INFO ]: ChcToBoogie took 62.19 ms. Allocated memory is still 309.3 MB. Free memory was 263.9 MB in the beginning and 261.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:42:02,010 INFO ]: Boogie Preprocessor took 42.68 ms. Allocated memory is still 309.3 MB. Free memory was 261.9 MB in the beginning and 259.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:42:02,010 INFO ]: RCFGBuilder took 236.63 ms. Allocated memory is still 309.3 MB. Free memory was 259.9 MB in the beginning and 250.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:42:02,010 INFO ]: BlockEncodingV2 took 4047.99 ms. Allocated memory was 309.3 MB in the beginning and 341.3 MB in the end (delta: 32.0 MB). Free memory was 250.9 MB in the beginning and 194.4 MB in the end (delta: 56.5 MB). Peak memory consumption was 88.5 MB. Max. memory is 3.6 GB. [2018-06-25 00:42:02,011 INFO ]: TraceAbstraction took 60719.48 ms. Allocated memory was 341.3 MB in the beginning and 760.2 MB in the end (delta: 418.9 MB). Free memory was 194.4 MB in the beginning and 445.0 MB in the end (delta: -250.6 MB). Peak memory consumption was 168.3 MB. Max. memory is 3.6 GB. [2018-06-25 00:42:02,013 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, 76 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 309.3 MB. Free memory is still 274.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 62.19 ms. Allocated memory is still 309.3 MB. Free memory was 263.9 MB in the beginning and 261.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 42.68 ms. Allocated memory is still 309.3 MB. Free memory was 261.9 MB in the beginning and 259.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 236.63 ms. Allocated memory is still 309.3 MB. Free memory was 259.9 MB in the beginning and 250.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 4047.99 ms. Allocated memory was 309.3 MB in the beginning and 341.3 MB in the end (delta: 32.0 MB). Free memory was 250.9 MB in the beginning and 194.4 MB in the end (delta: 56.5 MB). Peak memory consumption was 88.5 MB. Max. memory is 3.6 GB. * TraceAbstraction took 60719.48 ms. Allocated memory was 341.3 MB in the beginning and 760.2 MB in the end (delta: 418.9 MB). Free memory was 194.4 MB in the beginning and 445.0 MB in the end (delta: -250.6 MB). Peak memory consumption was 168.3 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 (248states) and interpolant automaton (currently 10 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (86 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 60.6s OverallTime, 32 OverallIterations, 3 TraceHistogramMax, 48.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1141 SDtfs, 9 SDslu, 489 SDs, 0 SdLazy, 35406 SolverSat, 9355 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 42.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 529 GetRequests, 249 SyntacticMatches, 6 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 1986 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 601 NumberOfCodeBlocks, 601 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 545 ConstructedInterpolants, 38 QuantifiedInterpolants, 34989 SizeOfPredicates, 48 NumberOfNonLiveVariables, 7487 ConjunctsInSsa, 852 ConjunctsInUnsatCore, 56 InterpolantComputations, 8 PerfectInterpolantSequences, 87/1305 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/fib_bench_safe_v3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-42-02-024.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fib_bench_safe_v3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-42-02-024.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fib_bench_safe_v3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-42-02-024.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fib_bench_safe_v3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-42-02-024.csv Completed graceful shutdown