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/lustre/PRODUCER_CONSUMER_2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 06:39:15,429 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 06:39:15,431 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 06:39:15,449 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 06:39:15,449 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 06:39:15,450 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 06:39:15,451 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 06:39:15,453 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 06:39:15,455 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 06:39:15,456 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 06:39:15,456 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 06:39:15,457 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 06:39:15,457 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 06:39:15,458 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 06:39:15,459 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 06:39:15,460 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 06:39:15,462 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 06:39:15,464 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 06:39:15,465 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 06:39:15,466 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 06:39:15,468 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 06:39:15,470 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 06:39:15,470 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 06:39:15,471 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 06:39:15,472 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 06:39:15,473 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 06:39:15,473 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 06:39:15,474 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 06:39:15,475 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 06:39:15,476 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 06:39:15,476 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 06:39:15,477 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 06:39:15,477 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 06:39:15,478 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 06:39:15,479 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 06:39:15,479 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 06:39:15,493 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 06:39:15,494 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 06:39:15,494 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 06:39:15,494 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 06:39:15,495 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 06:39:15,495 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 06:39:15,496 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 06:39:15,496 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 06:39:15,496 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 06:39:15,496 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 06:39:15,497 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 06:39:15,498 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 06:39:15,498 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 06:39:15,498 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 06:39:15,499 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 06:39:15,499 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 06:39:15,499 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 06:39:15,499 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 06:39:15,499 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 06:39:15,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 06:39:15,500 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 06:39:15,501 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 06:39:15,501 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 06:39:15,556 INFO ]: Repository-Root is: /tmp [2018-06-25 06:39:15,575 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 06:39:15,582 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 06:39:15,583 INFO ]: Initializing SmtParser... [2018-06-25 06:39:15,583 INFO ]: SmtParser initialized [2018-06-25 06:39:15,584 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/PRODUCER_CONSUMER_2.smt2 [2018-06-25 06:39:15,585 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 06:39:15,682 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/PRODUCER_CONSUMER_2.smt2 unknown [2018-06-25 06:39:16,018 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/PRODUCER_CONSUMER_2.smt2 [2018-06-25 06:39:16,022 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 06:39:16,037 INFO ]: Walking toolchain with 5 elements. [2018-06-25 06:39:16,037 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 06:39:16,037 INFO ]: Initializing ChcToBoogie... [2018-06-25 06:39:16,038 INFO ]: ChcToBoogie initialized [2018-06-25 06:39:16,045 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:39:16" (1/1) ... [2018-06-25 06:39:16,106 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:39:16 Unit [2018-06-25 06:39:16,107 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 06:39:16,110 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 06:39:16,110 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 06:39:16,110 INFO ]: Boogie Preprocessor initialized [2018-06-25 06:39:16,128 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:39:16" (1/1) ... [2018-06-25 06:39:16,128 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:39:16" (1/1) ... [2018-06-25 06:39:16,135 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:39:16" (1/1) ... [2018-06-25 06:39:16,135 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:39:16" (1/1) ... [2018-06-25 06:39:16,140 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:39:16" (1/1) ... [2018-06-25 06:39:16,141 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:39:16" (1/1) ... [2018-06-25 06:39:16,143 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:39:16" (1/1) ... [2018-06-25 06:39:16,146 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 06:39:16,146 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 06:39:16,146 INFO ]: Initializing RCFGBuilder... [2018-06-25 06:39:16,147 INFO ]: RCFGBuilder initialized [2018-06-25 06:39:16,147 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:39:16" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 06:39:16,165 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 06:39:16,165 INFO ]: Found specification of procedure gotoProc [2018-06-25 06:39:16,165 INFO ]: Found implementation of procedure gotoProc [2018-06-25 06:39:16,165 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 06:39:16,165 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 06:39:16,165 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 06:39:16,526 INFO ]: Using library mode [2018-06-25 06:39:16,527 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:39:16 BoogieIcfgContainer [2018-06-25 06:39:16,527 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 06:39:16,527 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 06:39:16,527 INFO ]: Initializing BlockEncodingV2... [2018-06-25 06:39:16,528 INFO ]: BlockEncodingV2 initialized [2018-06-25 06:39:16,529 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:39:16" (1/1) ... [2018-06-25 06:39:16,547 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 06:39:16,549 INFO ]: Using Remove infeasible edges [2018-06-25 06:39:16,550 INFO ]: Using Maximize final states [2018-06-25 06:39:16,551 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 06:39:16,551 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 06:39:16,555 INFO ]: Using Remove sink states [2018-06-25 06:39:16,556 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 06:39:16,556 INFO ]: Using Use SBE [2018-06-25 06:39:16,562 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 06:39:17,741 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 06:39:19,269 WARN ]: aborting because of expected exponential blowup for input size 47 [2018-06-25 06:39:19,421 WARN ]: aborting because of expected exponential blowup for input size 47 [2018-06-25 06:39:19,435 INFO ]: SBE split 2 edges [2018-06-25 06:39:19,475 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 06:39:19,479 INFO ]: 0 new accepting states [2018-06-25 06:39:32,167 INFO ]: Removed 1202 edges and 2 locations by large block encoding [2018-06-25 06:39:32,169 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:39:32,206 INFO ]: Removed 18 edges and 0 locations because of local infeasibility [2018-06-25 06:39:32,207 INFO ]: 0 new accepting states [2018-06-25 06:39:32,208 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:39:32,208 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:39:32,339 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 06:39:32,341 INFO ]: 0 new accepting states [2018-06-25 06:39:32,342 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:39:32,343 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:39:32,381 INFO ]: Encoded RCFG 6 locations, 1186 edges [2018-06-25 06:39:32,382 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:39:32 BasicIcfg [2018-06-25 06:39:32,382 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 06:39:32,386 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 06:39:32,386 INFO ]: Initializing TraceAbstraction... [2018-06-25 06:39:32,390 INFO ]: TraceAbstraction initialized [2018-06-25 06:39:32,392 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:39:16" (1/4) ... [2018-06-25 06:39:32,393 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1425e683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 06:39:32, skipping insertion in model container [2018-06-25 06:39:32,394 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:39:16" (2/4) ... [2018-06-25 06:39:32,395 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1425e683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 06:39:32, skipping insertion in model container [2018-06-25 06:39:32,395 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:39:16" (3/4) ... [2018-06-25 06:39:32,396 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1425e683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:39:32, skipping insertion in model container [2018-06-25 06:39:32,396 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:39:32" (4/4) ... [2018-06-25 06:39:32,397 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 06:39:32,407 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 06:39:32,416 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 06:39:32,469 INFO ]: Using default assertion order modulation [2018-06-25 06:39:32,469 INFO ]: Interprodecural is true [2018-06-25 06:39:32,469 INFO ]: Hoare is false [2018-06-25 06:39:32,469 INFO ]: Compute interpolants for FPandBP [2018-06-25 06:39:32,469 INFO ]: Backedges is TWOTRACK [2018-06-25 06:39:32,469 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 06:39:32,469 INFO ]: Difference is false [2018-06-25 06:39:32,469 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 06:39:32,469 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 06:39:32,485 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 06:39:32,503 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:39:32,503 INFO ]: Found error trace [2018-06-25 06:39:32,504 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:39:32,504 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:32,510 INFO ]: Analyzing trace with hash 98320193, now seen corresponding path program 1 times [2018-06-25 06:39:32,512 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:32,513 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:32,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:32,555 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:32,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:32,614 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:32,752 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:32,755 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:39:32,755 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:39:32,757 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:39:32,773 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:39:32,773 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:32,777 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 06:39:35,454 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:35,454 INFO ]: Finished difference Result 7 states and 1187 transitions. [2018-06-25 06:39:35,455 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:39:35,456 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:39:35,456 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:35,472 INFO ]: With dead ends: 7 [2018-06-25 06:39:35,472 INFO ]: Without dead ends: 7 [2018-06-25 06:39:35,478 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 06:39:35,497 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:39:35,538 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:39:35,540 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:39:35,543 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1187 transitions. [2018-06-25 06:39:35,544 INFO ]: Start accepts. Automaton has 7 states and 1187 transitions. Word has length 5 [2018-06-25 06:39:35,545 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:35,545 INFO ]: Abstraction has 7 states and 1187 transitions. [2018-06-25 06:39:35,545 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:39:35,545 INFO ]: Start isEmpty. Operand 7 states and 1187 transitions. [2018-06-25 06:39:35,546 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:39:35,546 INFO ]: Found error trace [2018-06-25 06:39:35,546 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:39:35,547 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:35,547 INFO ]: Analyzing trace with hash -1313414541, now seen corresponding path program 1 times [2018-06-25 06:39:35,547 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:35,547 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:35,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:35,548 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:35,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:35,616 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:35,729 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:35,729 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:39:35,729 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:39:35,731 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:39:35,731 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:39:35,731 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:35,731 INFO ]: Start difference. First operand 7 states and 1187 transitions. Second operand 3 states. [2018-06-25 06:39:38,226 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:38,226 INFO ]: Finished difference Result 9 states and 1188 transitions. [2018-06-25 06:39:38,227 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:39:38,227 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:39:38,227 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:38,230 INFO ]: With dead ends: 9 [2018-06-25 06:39:38,230 INFO ]: Without dead ends: 8 [2018-06-25 06:39:38,230 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 06:39:38,230 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:39:38,242 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-25 06:39:38,242 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:39:38,244 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 675 transitions. [2018-06-25 06:39:38,244 INFO ]: Start accepts. Automaton has 7 states and 675 transitions. Word has length 6 [2018-06-25 06:39:38,244 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:38,244 INFO ]: Abstraction has 7 states and 675 transitions. [2018-06-25 06:39:38,244 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:39:38,244 INFO ]: Start isEmpty. Operand 7 states and 675 transitions. [2018-06-25 06:39:38,244 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:39:38,244 INFO ]: Found error trace [2018-06-25 06:39:38,244 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:39:38,245 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:38,245 INFO ]: Analyzing trace with hash -1312491020, now seen corresponding path program 1 times [2018-06-25 06:39:38,245 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:38,245 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:38,245 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:38,246 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:38,246 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:38,298 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:38,365 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:38,365 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:39:38,365 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:39:38,365 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:39:38,365 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:39:38,365 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:38,365 INFO ]: Start difference. First operand 7 states and 675 transitions. Second operand 3 states. [2018-06-25 06:39:39,850 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:39,850 INFO ]: Finished difference Result 8 states and 675 transitions. [2018-06-25 06:39:39,850 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:39:39,850 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:39:39,850 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:39,851 INFO ]: With dead ends: 8 [2018-06-25 06:39:39,851 INFO ]: Without dead ends: 7 [2018-06-25 06:39:39,851 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 06:39:39,851 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:39:39,855 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:39:39,855 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:39:39,857 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 547 transitions. [2018-06-25 06:39:39,858 INFO ]: Start accepts. Automaton has 7 states and 547 transitions. Word has length 6 [2018-06-25 06:39:39,858 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:39,858 INFO ]: Abstraction has 7 states and 547 transitions. [2018-06-25 06:39:39,858 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:39:39,858 INFO ]: Start isEmpty. Operand 7 states and 547 transitions. [2018-06-25 06:39:39,859 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:39:39,859 INFO ]: Found error trace [2018-06-25 06:39:39,859 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:39:39,859 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:39,859 INFO ]: Analyzing trace with hash -1786257293, now seen corresponding path program 1 times [2018-06-25 06:39:39,859 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:39,859 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:39,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:39,860 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:39,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:39,891 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:39,942 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:39,942 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:39:39,942 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:39:39,943 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:39:39,943 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:39:39,943 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:39,943 INFO ]: Start difference. First operand 7 states and 547 transitions. Second operand 3 states. [2018-06-25 06:39:40,631 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:40,631 INFO ]: Finished difference Result 8 states and 547 transitions. [2018-06-25 06:39:40,653 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:39:40,654 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:39:40,654 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:40,655 INFO ]: With dead ends: 8 [2018-06-25 06:39:40,655 INFO ]: Without dead ends: 7 [2018-06-25 06:39:40,655 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:40,655 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:39:40,659 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:39:40,659 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:39:40,660 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 419 transitions. [2018-06-25 06:39:40,660 INFO ]: Start accepts. Automaton has 7 states and 419 transitions. Word has length 6 [2018-06-25 06:39:40,660 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:40,660 INFO ]: Abstraction has 7 states and 419 transitions. [2018-06-25 06:39:40,660 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:39:40,660 INFO ]: Start isEmpty. Operand 7 states and 419 transitions. [2018-06-25 06:39:40,660 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:39:40,660 INFO ]: Found error trace [2018-06-25 06:39:40,660 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:39:40,660 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:40,661 INFO ]: Analyzing trace with hash -1785333772, now seen corresponding path program 1 times [2018-06-25 06:39:40,661 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:40,661 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:40,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:40,662 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:40,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:40,685 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:40,721 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:40,721 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:39:40,721 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:39:40,721 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:39:40,721 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:39:40,721 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:40,721 INFO ]: Start difference. First operand 7 states and 419 transitions. Second operand 3 states. [2018-06-25 06:39:41,246 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:41,246 INFO ]: Finished difference Result 8 states and 419 transitions. [2018-06-25 06:39:41,247 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:39:41,247 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:39:41,247 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:41,247 INFO ]: With dead ends: 8 [2018-06-25 06:39:41,247 INFO ]: Without dead ends: 7 [2018-06-25 06:39:41,247 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 06:39:41,247 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:39:41,249 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:39:41,249 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:39:41,250 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions. [2018-06-25 06:39:41,250 INFO ]: Start accepts. Automaton has 7 states and 227 transitions. Word has length 6 [2018-06-25 06:39:41,250 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:41,250 INFO ]: Abstraction has 7 states and 227 transitions. [2018-06-25 06:39:41,250 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:39:41,250 INFO ]: Start isEmpty. Operand 7 states and 227 transitions. [2018-06-25 06:39:41,251 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:39:41,251 INFO ]: Found error trace [2018-06-25 06:39:41,251 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:39:41,251 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:41,251 INFO ]: Analyzing trace with hash -1428854666, now seen corresponding path program 1 times [2018-06-25 06:39:41,251 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:41,251 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:41,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:41,252 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:41,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:41,294 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:41,384 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:41,384 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:39:41,384 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 06:39:41,392 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:41,474 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:41,484 INFO ]: Computing forward predicates... [2018-06-25 06:39:42,240 WARN ]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-06-25 06:39:42,252 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:42,285 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:39:42,286 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 06:39:42,286 INFO ]: Interpolant automaton has 6 states [2018-06-25 06:39:42,286 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 06:39:42,286 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 06:39:42,286 INFO ]: Start difference. First operand 7 states and 227 transitions. Second operand 6 states. [2018-06-25 06:39:42,604 WARN ]: Spent 246.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2018-06-25 06:39:44,902 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:44,902 INFO ]: Finished difference Result 10 states and 178 transitions. [2018-06-25 06:39:44,902 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 06:39:44,903 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 06:39:44,903 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:44,903 INFO ]: With dead ends: 10 [2018-06-25 06:39:44,903 INFO ]: Without dead ends: 10 [2018-06-25 06:39:44,903 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-25 06:39:44,903 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 06:39:44,905 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-25 06:39:44,906 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:39:44,906 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2018-06-25 06:39:44,906 INFO ]: Start accepts. Automaton has 8 states and 176 transitions. Word has length 6 [2018-06-25 06:39:44,906 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:44,906 INFO ]: Abstraction has 8 states and 176 transitions. [2018-06-25 06:39:44,906 INFO ]: Interpolant automaton has 6 states. [2018-06-25 06:39:44,906 INFO ]: Start isEmpty. Operand 8 states and 176 transitions. [2018-06-25 06:39:44,906 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:39:44,906 INFO ]: Found error trace [2018-06-25 06:39:44,906 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:39:44,906 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:44,907 INFO ]: Analyzing trace with hash -1427004741, now seen corresponding path program 1 times [2018-06-25 06:39:44,907 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:44,907 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:44,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:44,907 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:44,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:44,926 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:44,972 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:44,972 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:39:44,972 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:39:44,972 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:39:44,972 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:39:44,972 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:44,972 INFO ]: Start difference. First operand 8 states and 176 transitions. Second operand 3 states. [2018-06-25 06:39:45,063 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:45,063 INFO ]: Finished difference Result 9 states and 176 transitions. [2018-06-25 06:39:45,063 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:39:45,064 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:39:45,064 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:45,064 INFO ]: With dead ends: 9 [2018-06-25 06:39:45,064 INFO ]: Without dead ends: 8 [2018-06-25 06:39:45,064 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 06:39:45,064 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:39:45,066 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:39:45,066 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:39:45,066 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2018-06-25 06:39:45,066 INFO ]: Start accepts. Automaton has 8 states and 160 transitions. Word has length 6 [2018-06-25 06:39:45,067 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:45,067 INFO ]: Abstraction has 8 states and 160 transitions. [2018-06-25 06:39:45,067 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:39:45,067 INFO ]: Start isEmpty. Operand 8 states and 160 transitions. [2018-06-25 06:39:45,067 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:39:45,067 INFO ]: Found error trace [2018-06-25 06:39:45,067 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:39:45,067 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:45,067 INFO ]: Analyzing trace with hash -1845359754, now seen corresponding path program 1 times [2018-06-25 06:39:45,067 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:45,067 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:45,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:45,068 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:45,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:45,092 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:45,243 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:45,243 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:39:45,243 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:39:45,243 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:39:45,243 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:39:45,243 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:45,243 INFO ]: Start difference. First operand 8 states and 160 transitions. Second operand 3 states. [2018-06-25 06:39:45,464 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:45,464 INFO ]: Finished difference Result 10 states and 160 transitions. [2018-06-25 06:39:45,464 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:39:45,464 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:39:45,465 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:45,465 INFO ]: With dead ends: 10 [2018-06-25 06:39:45,465 INFO ]: Without dead ends: 8 [2018-06-25 06:39:45,465 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:45,465 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:39:45,467 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:39:45,467 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:39:45,467 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2018-06-25 06:39:45,467 INFO ]: Start accepts. Automaton has 8 states and 148 transitions. Word has length 6 [2018-06-25 06:39:45,467 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:45,467 INFO ]: Abstraction has 8 states and 148 transitions. [2018-06-25 06:39:45,467 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:39:45,467 INFO ]: Start isEmpty. Operand 8 states and 148 transitions. [2018-06-25 06:39:45,467 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:39:45,467 INFO ]: Found error trace [2018-06-25 06:39:45,468 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:39:45,468 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:45,468 INFO ]: Analyzing trace with hash -1953411711, now seen corresponding path program 1 times [2018-06-25 06:39:45,468 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:45,468 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:45,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:45,468 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:45,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:45,484 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:45,542 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:45,542 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:39:45,542 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 06:39:45,549 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:45,602 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:45,605 INFO ]: Computing forward predicates... [2018-06-25 06:39:45,648 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:45,669 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:39:45,669 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 06:39:45,669 INFO ]: Interpolant automaton has 6 states [2018-06-25 06:39:45,669 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 06:39:45,669 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 06:39:45,669 INFO ]: Start difference. First operand 8 states and 148 transitions. Second operand 6 states. [2018-06-25 06:39:46,327 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:46,328 INFO ]: Finished difference Result 16 states and 156 transitions. [2018-06-25 06:39:46,328 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 06:39:46,328 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 06:39:46,328 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:46,328 INFO ]: With dead ends: 16 [2018-06-25 06:39:46,328 INFO ]: Without dead ends: 16 [2018-06-25 06:39:46,329 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:39:46,329 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 06:39:46,330 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 8. [2018-06-25 06:39:46,331 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:39:46,331 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2018-06-25 06:39:46,331 INFO ]: Start accepts. Automaton has 8 states and 148 transitions. Word has length 6 [2018-06-25 06:39:46,331 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:46,331 INFO ]: Abstraction has 8 states and 148 transitions. [2018-06-25 06:39:46,331 INFO ]: Interpolant automaton has 6 states. [2018-06-25 06:39:46,331 INFO ]: Start isEmpty. Operand 8 states and 148 transitions. [2018-06-25 06:39:46,332 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:39:46,332 INFO ]: Found error trace [2018-06-25 06:39:46,332 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:39:46,332 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:46,332 INFO ]: Analyzing trace with hash 1022880450, now seen corresponding path program 1 times [2018-06-25 06:39:46,332 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:46,332 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:46,333 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:46,333 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:46,333 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:46,359 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:46,514 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 06:39:46,515 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:39:46,515 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:39:46,515 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:39:46,515 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:39:46,515 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:46,515 INFO ]: Start difference. First operand 8 states and 148 transitions. Second operand 3 states. [2018-06-25 06:39:47,567 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:47,567 INFO ]: Finished difference Result 9 states and 148 transitions. [2018-06-25 06:39:47,567 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:39:47,567 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 06:39:47,567 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:47,568 INFO ]: With dead ends: 9 [2018-06-25 06:39:47,568 INFO ]: Without dead ends: 8 [2018-06-25 06:39:47,568 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:47,568 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:39:47,570 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:39:47,570 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:39:47,570 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2018-06-25 06:39:47,570 INFO ]: Start accepts. Automaton has 8 states and 139 transitions. Word has length 7 [2018-06-25 06:39:47,570 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:47,570 INFO ]: Abstraction has 8 states and 139 transitions. [2018-06-25 06:39:47,570 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:39:47,570 INFO ]: Start isEmpty. Operand 8 states and 139 transitions. [2018-06-25 06:39:47,571 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:39:47,571 INFO ]: Found error trace [2018-06-25 06:39:47,571 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:39:47,571 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:47,571 INFO ]: Analyzing trace with hash -1411192031, now seen corresponding path program 1 times [2018-06-25 06:39:47,571 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:47,571 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:47,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:47,572 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:47,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:47,596 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:48,222 WARN ]: Spent 532.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2018-06-25 06:39:48,249 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:48,249 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:39:48,249 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 06:39:48,255 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:48,327 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:48,331 INFO ]: Computing forward predicates... [2018-06-25 06:39:48,538 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:48,572 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:39:48,572 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 06:39:48,573 INFO ]: Interpolant automaton has 8 states [2018-06-25 06:39:48,573 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 06:39:48,573 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:39:48,573 INFO ]: Start difference. First operand 8 states and 139 transitions. Second operand 8 states. [2018-06-25 06:39:51,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:51,247 INFO ]: Finished difference Result 11 states and 142 transitions. [2018-06-25 06:39:51,276 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 06:39:51,276 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 06:39:51,276 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:51,278 INFO ]: With dead ends: 11 [2018-06-25 06:39:51,278 INFO ]: Without dead ends: 8 [2018-06-25 06:39:51,278 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-25 06:39:51,278 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:39:51,279 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:39:51,279 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:39:51,279 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2018-06-25 06:39:51,279 INFO ]: Start accepts. Automaton has 8 states and 130 transitions. Word has length 7 [2018-06-25 06:39:51,279 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:51,279 INFO ]: Abstraction has 8 states and 130 transitions. [2018-06-25 06:39:51,280 INFO ]: Interpolant automaton has 8 states. [2018-06-25 06:39:51,280 INFO ]: Start isEmpty. Operand 8 states and 130 transitions. [2018-06-25 06:39:51,280 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:39:51,280 INFO ]: Found error trace [2018-06-25 06:39:51,280 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:39:51,280 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:51,280 INFO ]: Analyzing trace with hash 1167810143, now seen corresponding path program 1 times [2018-06-25 06:39:51,280 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:51,280 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:51,283 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:51,283 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:51,283 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:51,305 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:51,388 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 06:39:51,388 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:39:51,388 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:39:51,388 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:39:51,389 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:39:51,389 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:51,389 INFO ]: Start difference. First operand 8 states and 130 transitions. Second operand 3 states. [2018-06-25 06:39:51,429 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:51,429 INFO ]: Finished difference Result 9 states and 130 transitions. [2018-06-25 06:39:51,430 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:39:51,430 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 06:39:51,430 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:51,430 INFO ]: With dead ends: 9 [2018-06-25 06:39:51,430 INFO ]: Without dead ends: 8 [2018-06-25 06:39:51,430 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 06:39:51,430 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:39:51,431 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:39:51,431 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:39:51,432 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2018-06-25 06:39:51,432 INFO ]: Start accepts. Automaton has 8 states and 124 transitions. Word has length 7 [2018-06-25 06:39:51,432 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:51,432 INFO ]: Abstraction has 8 states and 124 transitions. [2018-06-25 06:39:51,432 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:39:51,432 INFO ]: Start isEmpty. Operand 8 states and 124 transitions. [2018-06-25 06:39:51,432 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:39:51,432 INFO ]: Found error trace [2018-06-25 06:39:51,432 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:39:51,432 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:51,432 INFO ]: Analyzing trace with hash 2054124532, now seen corresponding path program 1 times [2018-06-25 06:39:51,432 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:51,432 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:51,433 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:51,433 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:51,433 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:51,459 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:51,540 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:51,540 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:39:51,540 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 06:39:51,547 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:51,628 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:51,632 INFO ]: Computing forward predicates... [2018-06-25 06:39:51,810 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:51,831 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:39:51,831 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 06:39:51,832 INFO ]: Interpolant automaton has 8 states [2018-06-25 06:39:51,832 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 06:39:51,832 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:39:51,832 INFO ]: Start difference. First operand 8 states and 124 transitions. Second operand 8 states. [2018-06-25 06:39:52,004 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:52,004 INFO ]: Finished difference Result 6 states and 17 transitions. [2018-06-25 06:39:52,004 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:39:52,004 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 06:39:52,004 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:52,004 INFO ]: With dead ends: 6 [2018-06-25 06:39:52,004 INFO ]: Without dead ends: 0 [2018-06-25 06:39:52,004 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-25 06:39:52,004 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 06:39:52,004 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 06:39:52,004 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 06:39:52,004 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 06:39:52,004 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-25 06:39:52,004 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:52,004 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 06:39:52,004 INFO ]: Interpolant automaton has 8 states. [2018-06-25 06:39:52,004 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 06:39:52,004 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 06:39:52,006 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 06:39:52,007 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:39:52 BasicIcfg [2018-06-25 06:39:52,008 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 06:39:52,008 INFO ]: Toolchain (without parser) took 35985.47 ms. Allocated memory was 308.8 MB in the beginning and 1.0 GB in the end (delta: 721.4 MB). Free memory was 257.2 MB in the beginning and 810.3 MB in the end (delta: -553.1 MB). Peak memory consumption was 168.3 MB. Max. memory is 3.6 GB. [2018-06-25 06:39:52,009 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 06:39:52,009 INFO ]: ChcToBoogie took 69.70 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 254.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:39:52,009 INFO ]: Boogie Preprocessor took 36.07 ms. Allocated memory is still 308.8 MB. Free memory was 254.2 MB in the beginning and 253.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-25 06:39:52,010 INFO ]: RCFGBuilder took 380.26 ms. Allocated memory is still 308.8 MB. Free memory was 253.2 MB in the beginning and 234.2 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:39:52,014 INFO ]: BlockEncodingV2 took 15854.48 ms. Allocated memory was 308.8 MB in the beginning and 841.0 MB in the end (delta: 532.2 MB). Free memory was 234.2 MB in the beginning and 732.0 MB in the end (delta: -497.7 MB). Peak memory consumption was 471.7 MB. Max. memory is 3.6 GB. [2018-06-25 06:39:52,015 INFO ]: TraceAbstraction took 19621.15 ms. Allocated memory was 841.0 MB in the beginning and 1.0 GB in the end (delta: 189.3 MB). Free memory was 732.0 MB in the beginning and 810.3 MB in the end (delta: -78.3 MB). Peak memory consumption was 110.9 MB. Max. memory is 3.6 GB. [2018-06-25 06:39:52,022 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, 1186 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 69.70 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 254.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 36.07 ms. Allocated memory is still 308.8 MB. Free memory was 254.2 MB in the beginning and 253.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 380.26 ms. Allocated memory is still 308.8 MB. Free memory was 253.2 MB in the beginning and 234.2 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 15854.48 ms. Allocated memory was 308.8 MB in the beginning and 841.0 MB in the end (delta: 532.2 MB). Free memory was 234.2 MB in the beginning and 732.0 MB in the end (delta: -497.7 MB). Peak memory consumption was 471.7 MB. Max. memory is 3.6 GB. * TraceAbstraction took 19621.15 ms. Allocated memory was 841.0 MB in the beginning and 1.0 GB in the end (delta: 189.3 MB). Free memory was 732.0 MB in the beginning and 810.3 MB in the end (delta: -78.3 MB). Peak memory consumption was 110.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 19.5s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 15.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4978 SDtfs, 106 SDslu, 285 SDs, 0 SdLazy, 3890 SolverSat, 3158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=6, 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.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 1673 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1827 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 12/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/PRODUCER_CONSUMER_2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_06-39-52-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/PRODUCER_CONSUMER_2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_06-39-52-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/PRODUCER_CONSUMER_2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_06-39-52-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/PRODUCER_CONSUMER_2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_06-39-52-034.csv Received shutdown request...