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/lamport_safe.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:41:12,426 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:41:12,429 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:41:12,446 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:41:12,446 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:41:12,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:41:12,448 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:41:12,451 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:41:12,453 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:41:12,454 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:41:12,454 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:41:12,455 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:41:12,455 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:41:12,456 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:41:12,457 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:41:12,458 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:41:12,461 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:41:12,463 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:41:12,465 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:41:12,476 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:41:12,477 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:41:12,479 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:41:12,479 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:41:12,479 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:41:12,480 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:41:12,481 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:41:12,481 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:41:12,482 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:41:12,484 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:41:12,484 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:41:12,484 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:41:12,485 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:41:12,485 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:41:12,486 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:41:12,487 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:41:12,487 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:41:12,510 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:41:12,510 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:41:12,511 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:41:12,511 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:41:12,512 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:41:12,512 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:41:12,512 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:41:12,512 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:41:12,513 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:41:12,514 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:41:12,514 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:41:12,514 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:41:12,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:41:12,515 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:41:12,515 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:41:12,515 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:41:12,515 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:41:12,515 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:41:12,515 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:41:12,516 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:41:12,516 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:41:12,517 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:41:12,517 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:41:12,575 INFO ]: Repository-Root is: /tmp [2018-06-25 00:41:12,594 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:41:12,600 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:41:12,601 INFO ]: Initializing SmtParser... [2018-06-25 00:41:12,601 INFO ]: SmtParser initialized [2018-06-25 00:41:12,602 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/conc/lamport_safe.smt2 [2018-06-25 00:41:12,603 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:41:12,693 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/conc/lamport_safe.smt2 unknown [2018-06-25 00:41:13,030 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/conc/lamport_safe.smt2 [2018-06-25 00:41:13,038 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:41:13,045 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:41:13,045 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:41:13,045 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:41:13,045 INFO ]: ChcToBoogie initialized [2018-06-25 00:41:13,048 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:41:13" (1/1) ... [2018-06-25 00:41:13,101 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:41:13 Unit [2018-06-25 00:41:13,101 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:41:13,102 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:41:13,102 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:41:13,102 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:41:13,118 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:41:13" (1/1) ... [2018-06-25 00:41:13,118 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:41:13" (1/1) ... [2018-06-25 00:41:13,125 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:41:13" (1/1) ... [2018-06-25 00:41:13,125 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:41:13" (1/1) ... [2018-06-25 00:41:13,131 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:41:13" (1/1) ... [2018-06-25 00:41:13,133 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:41:13" (1/1) ... [2018-06-25 00:41:13,135 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:41:13" (1/1) ... [2018-06-25 00:41:13,137 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:41:13,138 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:41:13,138 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:41:13,138 INFO ]: RCFGBuilder initialized [2018-06-25 00:41:13,139 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:41:13" (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:41:13,157 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:41:13,157 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:41:13,157 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:41:13,157 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:41:13,157 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:41:13,157 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:41:13,436 INFO ]: Using library mode [2018-06-25 00:41:13,436 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:41:13 BoogieIcfgContainer [2018-06-25 00:41:13,436 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:41:13,437 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:41:13,437 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:41:13,438 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:41:13,438 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:41:13" (1/1) ... [2018-06-25 00:41:13,452 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:41:13,453 INFO ]: Using Remove infeasible edges [2018-06-25 00:41:13,454 INFO ]: Using Maximize final states [2018-06-25 00:41:13,454 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:41:13,454 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:41:13,456 INFO ]: Using Remove sink states [2018-06-25 00:41:13,456 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:41:13,457 INFO ]: Using Use SBE [2018-06-25 00:41:13,461 WARN ]: expecting exponential blowup for input size 10 [2018-06-25 00:41:13,861 WARN ]: aborting because of expected exponential blowup for input size 56 [2018-06-25 00:41:13,884 WARN ]: aborting because of expected exponential blowup for input size 56 [2018-06-25 00:41:13,884 INFO ]: SBE split 1 edges [2018-06-25 00:41:13,895 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:41:13,897 INFO ]: 0 new accepting states [2018-06-25 00:41:14,797 INFO ]: Removed 67 edges and 2 locations by large block encoding [2018-06-25 00:41:14,799 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:41:14,801 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:41:14,801 INFO ]: 0 new accepting states [2018-06-25 00:41:14,801 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:41:14,801 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:41:14,801 INFO ]: Encoded RCFG 6 locations, 69 edges [2018-06-25 00:41:14,804 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:41:14 BasicIcfg [2018-06-25 00:41:14,804 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:41:14,807 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:41:14,807 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:41:14,810 INFO ]: TraceAbstraction initialized [2018-06-25 00:41:14,810 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:41:13" (1/4) ... [2018-06-25 00:41:14,811 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1385fb9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:41:14, skipping insertion in model container [2018-06-25 00:41:14,811 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:41:13" (2/4) ... [2018-06-25 00:41:14,811 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1385fb9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:41:14, skipping insertion in model container [2018-06-25 00:41:14,811 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:41:13" (3/4) ... [2018-06-25 00:41:14,811 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1385fb9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:41:14, skipping insertion in model container [2018-06-25 00:41:14,811 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:41:14" (4/4) ... [2018-06-25 00:41:14,813 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:41:14,824 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:41:14,831 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:41:14,881 INFO ]: Using default assertion order modulation [2018-06-25 00:41:14,881 INFO ]: Interprodecural is true [2018-06-25 00:41:14,881 INFO ]: Hoare is false [2018-06-25 00:41:14,881 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:41:14,881 INFO ]: Backedges is TWOTRACK [2018-06-25 00:41:14,881 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:41:14,881 INFO ]: Difference is false [2018-06-25 00:41:14,881 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:41:14,882 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:41:14,895 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:41:14,907 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:41:14,907 INFO ]: Found error trace [2018-06-25 00:41:14,908 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:41:14,908 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:14,913 INFO ]: Analyzing trace with hash 39039947, now seen corresponding path program 1 times [2018-06-25 00:41:14,915 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:14,916 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:14,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:14,961 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:14,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:15,013 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:15,117 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:15,120 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:41:15,120 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:41:15,122 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:41:15,136 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:41:15,137 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:15,139 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:41:15,620 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:15,620 INFO ]: Finished difference Result 7 states and 70 transitions. [2018-06-25 00:41:15,620 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:41:15,621 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:41:15,622 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:15,631 INFO ]: With dead ends: 7 [2018-06-25 00:41:15,632 INFO ]: Without dead ends: 7 [2018-06-25 00:41:15,633 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:15,651 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:41:15,675 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:41:15,676 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:41:15,677 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2018-06-25 00:41:15,678 INFO ]: Start accepts. Automaton has 7 states and 70 transitions. Word has length 5 [2018-06-25 00:41:15,679 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:15,679 INFO ]: Abstraction has 7 states and 70 transitions. [2018-06-25 00:41:15,679 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:41:15,679 INFO ]: Start isEmpty. Operand 7 states and 70 transitions. [2018-06-25 00:41:15,680 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:41:15,680 INFO ]: Found error trace [2018-06-25 00:41:15,680 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:41:15,680 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:15,680 INFO ]: Analyzing trace with hash 39069738, now seen corresponding path program 1 times [2018-06-25 00:41:15,680 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:15,680 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:15,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:15,681 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:15,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:15,689 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:15,735 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:15,735 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:41:15,736 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:41:15,737 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:41:15,737 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:41:15,737 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:15,737 INFO ]: Start difference. First operand 7 states and 70 transitions. Second operand 3 states. [2018-06-25 00:41:16,259 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:16,259 INFO ]: Finished difference Result 9 states and 72 transitions. [2018-06-25 00:41:16,260 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:41:16,260 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:41:16,260 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:16,261 INFO ]: With dead ends: 9 [2018-06-25 00:41:16,261 INFO ]: Without dead ends: 9 [2018-06-25 00:41:16,261 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:16,262 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:41:16,264 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 00:41:16,264 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:41:16,265 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2018-06-25 00:41:16,265 INFO ]: Start accepts. Automaton has 7 states and 70 transitions. Word has length 5 [2018-06-25 00:41:16,265 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:16,265 INFO ]: Abstraction has 7 states and 70 transitions. [2018-06-25 00:41:16,265 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:41:16,265 INFO ]: Start isEmpty. Operand 7 states and 70 transitions. [2018-06-25 00:41:16,266 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:41:16,266 INFO ]: Found error trace [2018-06-25 00:41:16,266 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:41:16,266 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:16,266 INFO ]: Analyzing trace with hash 37490815, now seen corresponding path program 1 times [2018-06-25 00:41:16,266 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:16,266 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:16,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:16,267 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:16,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:16,275 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:16,333 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:16,334 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:41:16,334 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:41:16,334 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:41:16,334 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:41:16,334 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:16,334 INFO ]: Start difference. First operand 7 states and 70 transitions. Second operand 3 states. [2018-06-25 00:41:16,429 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:16,429 INFO ]: Finished difference Result 9 states and 72 transitions. [2018-06-25 00:41:16,429 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:41:16,429 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:41:16,429 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:16,430 INFO ]: With dead ends: 9 [2018-06-25 00:41:16,430 INFO ]: Without dead ends: 9 [2018-06-25 00:41:16,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 00:41:16,430 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:41:16,433 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 00:41:16,433 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:41:16,434 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2018-06-25 00:41:16,434 INFO ]: Start accepts. Automaton has 7 states and 70 transitions. Word has length 5 [2018-06-25 00:41:16,434 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:16,434 INFO ]: Abstraction has 7 states and 70 transitions. [2018-06-25 00:41:16,434 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:41:16,434 INFO ]: Start isEmpty. Operand 7 states and 70 transitions. [2018-06-25 00:41:16,435 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:41:16,435 INFO ]: Found error trace [2018-06-25 00:41:16,435 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:41:16,435 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:16,435 INFO ]: Analyzing trace with hash 37729143, now seen corresponding path program 1 times [2018-06-25 00:41:16,435 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:16,435 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:16,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:16,436 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:16,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:16,442 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:16,456 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:16,456 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:41:16,456 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:41:16,456 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:41:16,456 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:41:16,456 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:16,456 INFO ]: Start difference. First operand 7 states and 70 transitions. Second operand 3 states. [2018-06-25 00:41:16,590 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:16,590 INFO ]: Finished difference Result 8 states and 71 transitions. [2018-06-25 00:41:16,590 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:41:16,590 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:41:16,590 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:16,591 INFO ]: With dead ends: 8 [2018-06-25 00:41:16,591 INFO ]: Without dead ends: 8 [2018-06-25 00:41:16,591 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:16,591 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 00:41:16,595 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-25 00:41:16,595 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:41:16,595 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2018-06-25 00:41:16,595 INFO ]: Start accepts. Automaton has 7 states and 70 transitions. Word has length 5 [2018-06-25 00:41:16,595 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:16,595 INFO ]: Abstraction has 7 states and 70 transitions. [2018-06-25 00:41:16,595 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:41:16,595 INFO ]: Start isEmpty. Operand 7 states and 70 transitions. [2018-06-25 00:41:16,596 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:41:16,596 INFO ]: Found error trace [2018-06-25 00:41:16,596 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:41:16,596 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:16,596 INFO ]: Analyzing trace with hash 1206281118, now seen corresponding path program 1 times [2018-06-25 00:41:16,596 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:16,596 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:16,597 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:16,597 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:16,597 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:16,676 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:16,748 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:16,748 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:41:16,748 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:41:16,748 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:41:16,748 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:41:16,748 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:16,748 INFO ]: Start difference. First operand 7 states and 70 transitions. Second operand 3 states. [2018-06-25 00:41:16,900 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:16,900 INFO ]: Finished difference Result 8 states and 70 transitions. [2018-06-25 00:41:16,900 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:41:16,900 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:41:16,900 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:16,901 INFO ]: With dead ends: 8 [2018-06-25 00:41:16,901 INFO ]: Without dead ends: 7 [2018-06-25 00:41:16,901 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:16,901 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:41:16,902 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:41:16,902 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:41:16,903 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2018-06-25 00:41:16,903 INFO ]: Start accepts. Automaton has 7 states and 38 transitions. Word has length 6 [2018-06-25 00:41:16,903 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:16,903 INFO ]: Abstraction has 7 states and 38 transitions. [2018-06-25 00:41:16,903 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:41:16,903 INFO ]: Start isEmpty. Operand 7 states and 38 transitions. [2018-06-25 00:41:16,903 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:41:16,903 INFO ]: Found error trace [2018-06-25 00:41:16,903 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:41:16,903 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:16,903 INFO ]: Analyzing trace with hash 1209975202, now seen corresponding path program 1 times [2018-06-25 00:41:16,904 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:16,904 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:16,904 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:16,904 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:16,904 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:16,926 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:17,026 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:17,027 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:41:17,027 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:41:17,027 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:41:17,027 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:41:17,027 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:17,027 INFO ]: Start difference. First operand 7 states and 38 transitions. Second operand 3 states. [2018-06-25 00:41:17,066 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:17,066 INFO ]: Finished difference Result 8 states and 38 transitions. [2018-06-25 00:41:17,066 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:41:17,066 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:41:17,066 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:17,067 INFO ]: With dead ends: 8 [2018-06-25 00:41:17,067 INFO ]: Without dead ends: 7 [2018-06-25 00:41:17,067 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:17,067 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:41:17,068 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:41:17,068 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:41:17,068 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-06-25 00:41:17,068 INFO ]: Start accepts. Automaton has 7 states and 30 transitions. Word has length 6 [2018-06-25 00:41:17,068 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:17,068 INFO ]: Abstraction has 7 states and 30 transitions. [2018-06-25 00:41:17,068 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:41:17,068 INFO ]: Start isEmpty. Operand 7 states and 30 transitions. [2018-06-25 00:41:17,069 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:41:17,069 INFO ]: Found error trace [2018-06-25 00:41:17,069 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:41:17,069 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:17,069 INFO ]: Analyzing trace with hash 1176728446, now seen corresponding path program 1 times [2018-06-25 00:41:17,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:17,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:17,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:17,070 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:17,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:17,102 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:17,144 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:17,145 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:41:17,145 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:41:17,145 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:41:17,145 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:41:17,145 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:17,145 INFO ]: Start difference. First operand 7 states and 30 transitions. Second operand 3 states. [2018-06-25 00:41:17,183 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:17,183 INFO ]: Finished difference Result 8 states and 30 transitions. [2018-06-25 00:41:17,183 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:41:17,183 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:41:17,183 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:17,183 INFO ]: With dead ends: 8 [2018-06-25 00:41:17,183 INFO ]: Without dead ends: 7 [2018-06-25 00:41:17,184 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:17,184 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:41:17,185 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:41:17,185 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:41:17,185 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2018-06-25 00:41:17,185 INFO ]: Start accepts. Automaton has 7 states and 26 transitions. Word has length 6 [2018-06-25 00:41:17,185 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:17,185 INFO ]: Abstraction has 7 states and 26 transitions. [2018-06-25 00:41:17,185 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:41:17,185 INFO ]: Start isEmpty. Operand 7 states and 26 transitions. [2018-06-25 00:41:17,185 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:41:17,185 INFO ]: Found error trace [2018-06-25 00:41:17,186 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:41:17,186 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:17,186 INFO ]: Analyzing trace with hash 1183193093, now seen corresponding path program 1 times [2018-06-25 00:41:17,186 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:17,186 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:17,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:17,186 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:17,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:17,202 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:17,268 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:17,268 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:41:17,268 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:41:17,268 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:41:17,268 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:41:17,268 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:41:17,268 INFO ]: Start difference. First operand 7 states and 26 transitions. Second operand 3 states. [2018-06-25 00:41:17,303 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:17,303 INFO ]: Finished difference Result 8 states and 26 transitions. [2018-06-25 00:41:17,304 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:41:17,304 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:41:17,304 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:17,304 INFO ]: With dead ends: 8 [2018-06-25 00:41:17,304 INFO ]: Without dead ends: 7 [2018-06-25 00:41:17,304 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:17,304 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:41:17,305 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:41:17,305 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:41:17,306 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-06-25 00:41:17,306 INFO ]: Start accepts. Automaton has 7 states and 25 transitions. Word has length 6 [2018-06-25 00:41:17,306 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:17,306 INFO ]: Abstraction has 7 states and 25 transitions. [2018-06-25 00:41:17,306 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:41:17,306 INFO ]: Start isEmpty. Operand 7 states and 25 transitions. [2018-06-25 00:41:17,306 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:41:17,306 INFO ]: Found error trace [2018-06-25 00:41:17,306 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:41:17,306 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:17,306 INFO ]: Analyzing trace with hash 1158258026, now seen corresponding path program 1 times [2018-06-25 00:41:17,306 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:17,306 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:17,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:17,307 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:17,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:17,325 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:17,462 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:17,462 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:17,462 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:17,475 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:17,519 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:17,528 INFO ]: Computing forward predicates... [2018-06-25 00:41:18,286 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:18,306 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:18,306 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 00:41:18,306 INFO ]: Interpolant automaton has 5 states [2018-06-25 00:41:18,306 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 00:41:18,306 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 00:41:18,306 INFO ]: Start difference. First operand 7 states and 25 transitions. Second operand 5 states. [2018-06-25 00:41:18,402 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:18,402 INFO ]: Finished difference Result 11 states and 29 transitions. [2018-06-25 00:41:18,402 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 00:41:18,402 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 00:41:18,402 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:18,403 INFO ]: With dead ends: 11 [2018-06-25 00:41:18,403 INFO ]: Without dead ends: 11 [2018-06-25 00:41:18,403 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:41:18,403 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:41:18,404 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-06-25 00:41:18,404 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:41:18,404 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-06-25 00:41:18,404 INFO ]: Start accepts. Automaton has 8 states and 26 transitions. Word has length 6 [2018-06-25 00:41:18,404 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:18,404 INFO ]: Abstraction has 8 states and 26 transitions. [2018-06-25 00:41:18,404 INFO ]: Interpolant automaton has 5 states. [2018-06-25 00:41:18,404 INFO ]: Start isEmpty. Operand 8 states and 26 transitions. [2018-06-25 00:41:18,405 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:41:18,405 INFO ]: Found error trace [2018-06-25 00:41:18,405 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:41:18,405 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:18,405 INFO ]: Analyzing trace with hash 1189657740, now seen corresponding path program 1 times [2018-06-25 00:41:18,405 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:18,405 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:18,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:18,406 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:18,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:18,423 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:18,834 WARN ]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-25 00:41:18,835 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:18,835 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:18,835 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) [2018-06-25 00:41:18,847 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:41:18,894 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:18,899 INFO ]: Computing forward predicates... [2018-06-25 00:41:19,715 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:19,735 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:19,735 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 00:41:19,735 INFO ]: Interpolant automaton has 5 states [2018-06-25 00:41:19,735 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 00:41:19,735 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 00:41:19,735 INFO ]: Start difference. First operand 8 states and 26 transitions. Second operand 5 states. [2018-06-25 00:41:19,776 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:19,776 INFO ]: Finished difference Result 16 states and 34 transitions. [2018-06-25 00:41:19,776 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 00:41:19,776 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 00:41:19,776 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:19,777 INFO ]: With dead ends: 16 [2018-06-25 00:41:19,777 INFO ]: Without dead ends: 16 [2018-06-25 00:41:19,777 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:41:19,777 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 00:41:19,778 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 8. [2018-06-25 00:41:19,778 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:41:19,779 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-06-25 00:41:19,779 INFO ]: Start accepts. Automaton has 8 states and 26 transitions. Word has length 6 [2018-06-25 00:41:19,779 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:19,779 INFO ]: Abstraction has 8 states and 26 transitions. [2018-06-25 00:41:19,779 INFO ]: Interpolant automaton has 5 states. [2018-06-25 00:41:19,779 INFO ]: Start isEmpty. Operand 8 states and 26 transitions. [2018-06-25 00:41:19,779 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:41:19,779 INFO ]: Found error trace [2018-06-25 00:41:19,779 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:41:19,779 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:19,779 INFO ]: Analyzing trace with hash 1198892950, now seen corresponding path program 1 times [2018-06-25 00:41:19,779 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:19,779 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:19,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:19,780 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:19,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:19,791 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:19,944 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:19,944 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:19,944 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:19,950 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:19,987 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:19,989 INFO ]: Computing forward predicates... [2018-06-25 00:41:20,824 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:20,856 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:41:20,857 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 00:41:20,857 INFO ]: Interpolant automaton has 5 states [2018-06-25 00:41:20,857 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 00:41:20,857 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-25 00:41:20,857 INFO ]: Start difference. First operand 8 states and 26 transitions. Second operand 5 states. [2018-06-25 00:41:20,963 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:41:20,963 INFO ]: Finished difference Result 11 states and 29 transitions. [2018-06-25 00:41:20,963 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 00:41:20,963 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 00:41:20,963 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:41:20,963 INFO ]: With dead ends: 11 [2018-06-25 00:41:20,963 INFO ]: Without dead ends: 11 [2018-06-25 00:41:20,964 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-25 00:41:20,964 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:41:20,965 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-25 00:41:20,965 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:41:20,965 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 27 transitions. [2018-06-25 00:41:20,965 INFO ]: Start accepts. Automaton has 9 states and 27 transitions. Word has length 6 [2018-06-25 00:41:20,965 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:41:20,965 INFO ]: Abstraction has 9 states and 27 transitions. [2018-06-25 00:41:20,965 INFO ]: Interpolant automaton has 5 states. [2018-06-25 00:41:20,965 INFO ]: Start isEmpty. Operand 9 states and 27 transitions. [2018-06-25 00:41:20,965 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:41:20,966 INFO ]: Found error trace [2018-06-25 00:41:20,966 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 00:41:20,966 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:41:20,966 INFO ]: Analyzing trace with hash 562801674, now seen corresponding path program 2 times [2018-06-25 00:41:20,966 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:41:20,966 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:41:20,966 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:20,966 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:41:20,966 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:41:21,008 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:21,218 WARN ]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-25 00:41:21,292 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:41:21,292 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:41:21,292 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:21,306 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:41:21,351 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:41:21,351 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:41:21,355 INFO ]: Computing forward predicates... [2018-06-25 00:41:24,798 WARN ]: expecting exponential blowup for input size 8 [2018-06-25 00:41:24,913 WARN ]: Simplifying disjunction of 12608 conjuctions. This might take some time... [2018-06-25 00:41:50,491 INFO ]: Simplified to disjunction of 12608 conjuctions. [2018-06-25 00:41:50,552 WARN ]: expecting exponential blowup for input size 8 [2018-06-25 00:41:50,685 WARN ]: Simplifying disjunction of 12608 conjuctions. This might take some time... Received shutdown request... [2018-06-25 00:42:28,062 INFO ]: Timeout while computing interpolants [2018-06-25 00:42:28,262 WARN ]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:42:28,262 WARN ]: Verification canceled [2018-06-25 00:42:28,264 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:42:28,265 WARN ]: Timeout [2018-06-25 00:42:28,265 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:42:28 BasicIcfg [2018-06-25 00:42:28,265 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:42:28,266 INFO ]: Toolchain (without parser) took 75227.16 ms. Allocated memory was 309.3 MB in the beginning and 584.1 MB in the end (delta: 274.7 MB). Free memory was 257.7 MB in the beginning and 294.8 MB in the end (delta: -37.1 MB). Peak memory consumption was 357.2 MB. Max. memory is 3.6 GB. [2018-06-25 00:42:28,266 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:42:28,267 INFO ]: ChcToBoogie took 56.28 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 255.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-25 00:42:28,267 INFO ]: Boogie Preprocessor took 35.80 ms. Allocated memory is still 309.3 MB. Free memory was 255.7 MB in the beginning and 253.7 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:28,268 INFO ]: RCFGBuilder took 298.47 ms. Allocated memory is still 309.3 MB. Free memory was 253.7 MB in the beginning and 238.7 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:42:28,268 INFO ]: BlockEncodingV2 took 1366.86 ms. Allocated memory was 309.3 MB in the beginning and 323.5 MB in the end (delta: 14.2 MB). Free memory was 238.7 MB in the beginning and 267.5 MB in the end (delta: -28.8 MB). Peak memory consumption was 55.9 MB. Max. memory is 3.6 GB. [2018-06-25 00:42:28,269 INFO ]: TraceAbstraction took 73458.07 ms. Allocated memory was 323.5 MB in the beginning and 584.1 MB in the end (delta: 260.6 MB). Free memory was 267.5 MB in the beginning and 294.8 MB in the end (delta: -27.3 MB). Peak memory consumption was 352.8 MB. Max. memory is 3.6 GB. [2018-06-25 00:42:28,280 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, 69 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 56.28 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 255.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 35.80 ms. Allocated memory is still 309.3 MB. Free memory was 255.7 MB in the beginning and 253.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 298.47 ms. Allocated memory is still 309.3 MB. Free memory was 253.7 MB in the beginning and 238.7 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1366.86 ms. Allocated memory was 309.3 MB in the beginning and 323.5 MB in the end (delta: 14.2 MB). Free memory was 238.7 MB in the beginning and 267.5 MB in the end (delta: -28.8 MB). Peak memory consumption was 55.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 73458.07 ms. Allocated memory was 323.5 MB in the beginning and 584.1 MB in the end (delta: 260.6 MB). Free memory was 267.5 MB in the beginning and 294.8 MB in the end (delta: -27.3 MB). Peak memory consumption was 352.8 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 analyzing trace of length 9 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 12608 conjuctions. . - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 73.3s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 502 SDtfs, 0 SDslu, 45 SDs, 0 SdLazy, 271 SolverSat, 266 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=11, 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, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 689 SizeOfPredicates, 25 NumberOfNonLiveVariables, 453 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 4/10 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/lamport_safe.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-42-28-291.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lamport_safe.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-42-28-291.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lamport_safe.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-42-28-291.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lamport_safe.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-42-28-291.csv Completed graceful shutdown