java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_1.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:07:15,381 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:07:15,382 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:07:15,393 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:07:15,394 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:07:15,395 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:07:15,396 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:07:15,400 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:07:15,401 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:07:15,403 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:07:15,404 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:07:15,404 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:07:15,405 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:07:15,406 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:07:15,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:07:15,410 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:07:15,412 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:07:15,416 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:07:15,417 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:07:15,418 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:07:15,419 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:07:15,422 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:07:15,422 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:07:15,422 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:07:15,423 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:07:15,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:07:15,424 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:07:15,425 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:07:15,426 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:07:15,427 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:07:15,427 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:07:15,428 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:07:15,428 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:07:15,429 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:07:15,429 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:07:15,430 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:07:15,447 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:07:15,447 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:07:15,447 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:07:15,448 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:07:15,454 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:07:15,454 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:07:15,455 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:07:15,455 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:07:15,455 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:07:15,455 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:07:15,456 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:07:15,456 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:07:15,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:07:15,456 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:07:15,456 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:07:15,457 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:07:15,457 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:07:15,457 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:07:15,457 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:07:15,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:07:15,457 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:07:15,463 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:07:15,463 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:07:15,506 INFO ]: Repository-Root is: /tmp [2018-06-25 00:07:15,522 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:07:15,526 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:07:15,530 INFO ]: Initializing SmtParser... [2018-06-25 00:07:15,530 INFO ]: SmtParser initialized [2018-06-25 00:07:15,531 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_1.cil.smt2 [2018-06-25 00:07:15,532 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:07:15,625 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_1.cil.smt2 unknown [2018-06-25 00:07:16,091 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_1.cil.smt2 [2018-06-25 00:07:16,096 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:07:16,101 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:07:16,102 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:07:16,102 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:07:16,102 INFO ]: ChcToBoogie initialized [2018-06-25 00:07:16,105 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:07:16" (1/1) ... [2018-06-25 00:07:16,196 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:07:16 Unit [2018-06-25 00:07:16,196 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:07:16,202 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:07:16,202 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:07:16,202 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:07:16,222 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:07:16" (1/1) ... [2018-06-25 00:07:16,222 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:07:16" (1/1) ... [2018-06-25 00:07:16,243 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:07:16" (1/1) ... [2018-06-25 00:07:16,243 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:07:16" (1/1) ... [2018-06-25 00:07:16,264 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:07:16" (1/1) ... [2018-06-25 00:07:16,272 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:07:16" (1/1) ... [2018-06-25 00:07:16,284 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:07:16" (1/1) ... [2018-06-25 00:07:16,289 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:07:16,289 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:07:16,289 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:07:16,289 INFO ]: RCFGBuilder initialized [2018-06-25 00:07:16,296 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:07: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) [2018-06-25 00:07:16,306 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:07:16,306 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:07:16,306 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:07:16,306 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:07:16,306 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:07:16,306 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:07:16,793 INFO ]: Using library mode [2018-06-25 00:07:16,794 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:07:16 BoogieIcfgContainer [2018-06-25 00:07:16,794 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:07:16,795 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:07:16,795 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:07:16,795 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:07:16,796 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:07:16" (1/1) ... [2018-06-25 00:07:16,816 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:07:16,818 INFO ]: Using Remove infeasible edges [2018-06-25 00:07:16,819 INFO ]: Using Maximize final states [2018-06-25 00:07:16,819 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:07:16,820 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:07:16,824 INFO ]: Using Remove sink states [2018-06-25 00:07:16,824 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:07:16,824 INFO ]: Using Use SBE [2018-06-25 00:07:17,841 WARN ]: Simplifying disjunction of 7288 conjuctions. This might take some time... [2018-06-25 00:07:40,720 INFO ]: Simplified to disjunction of 7288 conjuctions. [2018-06-25 00:07:41,697 INFO ]: SBE split 1 edges [2018-06-25 00:07:41,768 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:07:41,771 INFO ]: 0 new accepting states [2018-06-25 00:07:41,822 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-25 00:07:41,824 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:07:41,917 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:07:41,918 INFO ]: 0 new accepting states [2018-06-25 00:07:41,919 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:07:41,920 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:07:42,052 INFO ]: Encoded RCFG 6 locations, 916 edges [2018-06-25 00:07:42,053 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:07:42 BasicIcfg [2018-06-25 00:07:42,053 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:07:42,055 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:07:42,055 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:07:42,061 INFO ]: TraceAbstraction initialized [2018-06-25 00:07:42,061 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:07:16" (1/4) ... [2018-06-25 00:07:42,062 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284941b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:07:42, skipping insertion in model container [2018-06-25 00:07:42,062 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:07:16" (2/4) ... [2018-06-25 00:07:42,063 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284941b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:07:42, skipping insertion in model container [2018-06-25 00:07:42,063 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:07:16" (3/4) ... [2018-06-25 00:07:42,063 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284941b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:07:42, skipping insertion in model container [2018-06-25 00:07:42,063 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:07:42" (4/4) ... [2018-06-25 00:07:42,065 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:07:42,071 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:07:42,077 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:07:42,120 INFO ]: Using default assertion order modulation [2018-06-25 00:07:42,120 INFO ]: Interprodecural is true [2018-06-25 00:07:42,121 INFO ]: Hoare is false [2018-06-25 00:07:42,121 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:07:42,121 INFO ]: Backedges is TWOTRACK [2018-06-25 00:07:42,121 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:07:42,121 INFO ]: Difference is false [2018-06-25 00:07:42,121 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:07:42,121 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:07:42,132 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:07:42,148 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:07:42,148 INFO ]: Found error trace [2018-06-25 00:07:42,149 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:07:42,149 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:07:42,154 INFO ]: Analyzing trace with hash 63417634, now seen corresponding path program 1 times [2018-06-25 00:07:42,156 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:07:42,156 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:07:42,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:07:42,188 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:07:42,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:07:42,261 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:07:42,434 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:07:42,437 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:07:42,438 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:07:42,439 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:07:42,452 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:07:42,453 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:07:42,454 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:07:48,331 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:07:48,331 INFO ]: Finished difference Result 7 states and 1029 transitions. [2018-06-25 00:07:48,331 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:07:48,332 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:07:48,332 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:07:48,347 INFO ]: With dead ends: 7 [2018-06-25 00:07:48,347 INFO ]: Without dead ends: 7 [2018-06-25 00:07:48,350 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:07:48,363 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:07:48,391 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:07:48,392 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:07:48,395 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1029 transitions. [2018-06-25 00:07:48,396 INFO ]: Start accepts. Automaton has 7 states and 1029 transitions. Word has length 5 [2018-06-25 00:07:48,397 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:07:48,397 INFO ]: Abstraction has 7 states and 1029 transitions. [2018-06-25 00:07:48,397 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:07:48,397 INFO ]: Start isEmpty. Operand 7 states and 1029 transitions. [2018-06-25 00:07:48,398 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:07:48,398 INFO ]: Found error trace [2018-06-25 00:07:48,398 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:07:48,398 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:07:48,398 INFO ]: Analyzing trace with hash 1944272419, now seen corresponding path program 1 times [2018-06-25 00:07:48,398 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:07:48,398 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:07:48,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:07:48,399 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:07:48,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:07:48,432 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:07:48,492 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:07:48,493 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:07:48,493 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:07:48,494 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:07:48,494 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:07:48,494 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:07:48,494 INFO ]: Start difference. First operand 7 states and 1029 transitions. Second operand 3 states. [2018-06-25 00:07:51,273 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:07:51,273 INFO ]: Finished difference Result 9 states and 1035 transitions. [2018-06-25 00:07:51,274 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:07:51,274 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:07:51,274 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:07:51,275 INFO ]: With dead ends: 9 [2018-06-25 00:07:51,275 INFO ]: Without dead ends: 9 [2018-06-25 00:07:51,276 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:07:51,276 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:07:51,288 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 00:07:51,289 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:07:51,290 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1035 transitions. [2018-06-25 00:07:51,291 INFO ]: Start accepts. Automaton has 9 states and 1035 transitions. Word has length 6 [2018-06-25 00:07:51,291 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:07:51,291 INFO ]: Abstraction has 9 states and 1035 transitions. [2018-06-25 00:07:51,291 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:07:51,291 INFO ]: Start isEmpty. Operand 9 states and 1035 transitions. [2018-06-25 00:07:51,291 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:07:51,291 INFO ]: Found error trace [2018-06-25 00:07:51,292 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:07:51,292 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:07:51,292 INFO ]: Analyzing trace with hash 1701959016, now seen corresponding path program 1 times [2018-06-25 00:07:51,292 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:07:51,292 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:07:51,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:07:51,293 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:07:51,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:07:51,355 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:07:51,432 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:07:51,432 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:07:51,432 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:07:51,433 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:07:51,433 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:07:51,433 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:07:51,433 INFO ]: Start difference. First operand 9 states and 1035 transitions. Second operand 3 states. [2018-06-25 00:07:54,544 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:07:54,544 INFO ]: Finished difference Result 11 states and 1445 transitions. [2018-06-25 00:07:54,546 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:07:54,546 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:07:54,546 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:07:54,548 INFO ]: With dead ends: 11 [2018-06-25 00:07:54,548 INFO ]: Without dead ends: 11 [2018-06-25 00:07:54,549 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:07:54,549 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:07:54,555 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-25 00:07:54,555 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 00:07:54,558 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1441 transitions. [2018-06-25 00:07:54,558 INFO ]: Start accepts. Automaton has 10 states and 1441 transitions. Word has length 8 [2018-06-25 00:07:54,558 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:07:54,558 INFO ]: Abstraction has 10 states and 1441 transitions. [2018-06-25 00:07:54,558 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:07:54,558 INFO ]: Start isEmpty. Operand 10 states and 1441 transitions. [2018-06-25 00:07:54,559 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:07:54,559 INFO ]: Found error trace [2018-06-25 00:07:54,559 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:07:54,559 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:07:54,559 INFO ]: Analyzing trace with hash 1099707441, now seen corresponding path program 1 times [2018-06-25 00:07:54,559 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:07:54,559 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:07:54,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:07:54,560 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:07:54,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:07:54,623 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:07:54,696 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:07:54,697 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:07:54,697 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:07:54,697 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:07:54,697 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:07:54,697 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:07:54,697 INFO ]: Start difference. First operand 10 states and 1441 transitions. Second operand 3 states. [2018-06-25 00:07:57,487 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:07:57,487 INFO ]: Finished difference Result 13 states and 2138 transitions. [2018-06-25 00:07:57,488 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:07:57,488 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:07:57,488 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:07:57,491 INFO ]: With dead ends: 13 [2018-06-25 00:07:57,491 INFO ]: Without dead ends: 13 [2018-06-25 00:07:57,492 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:07:57,492 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 00:07:57,504 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-25 00:07:57,504 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 00:07:57,508 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2134 transitions. [2018-06-25 00:07:57,508 INFO ]: Start accepts. Automaton has 12 states and 2134 transitions. Word has length 9 [2018-06-25 00:07:57,508 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:07:57,508 INFO ]: Abstraction has 12 states and 2134 transitions. [2018-06-25 00:07:57,508 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:07:57,508 INFO ]: Start isEmpty. Operand 12 states and 2134 transitions. [2018-06-25 00:07:57,509 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:07:57,509 INFO ]: Found error trace [2018-06-25 00:07:57,509 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:07:57,509 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:07:57,509 INFO ]: Analyzing trace with hash -1220467579, now seen corresponding path program 1 times [2018-06-25 00:07:57,509 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:07:57,510 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:07:57,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:07:57,511 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:07:57,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:07:57,574 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:07:57,742 INFO ]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:07:57,743 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:07:57,743 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:07:57,752 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:07:57,960 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:07:57,975 INFO ]: Computing forward predicates... [2018-06-25 00:07:58,204 INFO ]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:07:58,228 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:07:58,228 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 00:07:58,229 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:07:58,229 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:07:58,229 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:07:58,229 INFO ]: Start difference. First operand 12 states and 2134 transitions. Second operand 6 states. [2018-06-25 00:08:05,795 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:08:05,796 INFO ]: Finished difference Result 31 states and 4523 transitions. [2018-06-25 00:08:05,796 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 00:08:05,796 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-25 00:08:05,796 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:08:05,801 INFO ]: With dead ends: 31 [2018-06-25 00:08:05,801 INFO ]: Without dead ends: 31 [2018-06-25 00:08:05,801 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-06-25 00:08:05,802 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-25 00:08:05,830 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-06-25 00:08:05,830 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 00:08:05,833 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3163 transitions. [2018-06-25 00:08:05,833 INFO ]: Start accepts. Automaton has 19 states and 3163 transitions. Word has length 10 [2018-06-25 00:08:05,833 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:08:05,833 INFO ]: Abstraction has 19 states and 3163 transitions. [2018-06-25 00:08:05,833 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:08:05,833 INFO ]: Start isEmpty. Operand 19 states and 3163 transitions. [2018-06-25 00:08:05,835 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:08:05,835 INFO ]: Found error trace [2018-06-25 00:08:05,835 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:08:05,835 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:05,835 INFO ]: Analyzing trace with hash 2001893844, now seen corresponding path program 1 times [2018-06-25 00:08:05,835 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:05,835 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:05,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:05,836 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:05,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:05,879 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:06,058 INFO ]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:08:06,058 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:08:06,058 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:08:06,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:06,233 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:06,240 INFO ]: Computing forward predicates... [2018-06-25 00:08:06,300 INFO ]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:08:06,322 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:08:06,322 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 00:08:06,323 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:08:06,323 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:08:06,323 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:08:06,323 INFO ]: Start difference. First operand 19 states and 3163 transitions. Second operand 6 states. [2018-06-25 00:08:14,073 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:08:14,073 INFO ]: Finished difference Result 56 states and 8539 transitions. [2018-06-25 00:08:14,073 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 00:08:14,073 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-25 00:08:14,073 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:08:14,081 INFO ]: With dead ends: 56 [2018-06-25 00:08:14,082 INFO ]: Without dead ends: 56 [2018-06-25 00:08:14,082 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-06-25 00:08:14,082 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-25 00:08:14,121 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 34. [2018-06-25 00:08:14,121 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-25 00:08:14,127 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 6528 transitions. [2018-06-25 00:08:14,127 INFO ]: Start accepts. Automaton has 34 states and 6528 transitions. Word has length 10 [2018-06-25 00:08:14,127 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:08:14,127 INFO ]: Abstraction has 34 states and 6528 transitions. [2018-06-25 00:08:14,127 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:08:14,127 INFO ]: Start isEmpty. Operand 34 states and 6528 transitions. [2018-06-25 00:08:14,132 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:08:14,132 INFO ]: Found error trace [2018-06-25 00:08:14,132 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:08:14,132 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:14,132 INFO ]: Analyzing trace with hash -491605773, now seen corresponding path program 1 times [2018-06-25 00:08:14,132 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:14,132 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:14,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:14,133 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:14,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:14,188 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:14,302 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 00:08:14,303 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:08:14,303 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:08:14,303 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:08:14,303 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:08:14,303 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:14,303 INFO ]: Start difference. First operand 34 states and 6528 transitions. Second operand 3 states. [2018-06-25 00:08:16,729 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:08:16,729 INFO ]: Finished difference Result 61 states and 11394 transitions. [2018-06-25 00:08:16,730 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:08:16,730 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:08:16,730 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:08:16,746 INFO ]: With dead ends: 61 [2018-06-25 00:08:16,746 INFO ]: Without dead ends: 61 [2018-06-25 00:08:16,747 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:08:16,747 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-25 00:08:16,787 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-06-25 00:08:16,787 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-25 00:08:16,797 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 11394 transitions. [2018-06-25 00:08:16,797 INFO ]: Start accepts. Automaton has 61 states and 11394 transitions. Word has length 13 [2018-06-25 00:08:16,798 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:08:16,798 INFO ]: Abstraction has 61 states and 11394 transitions. [2018-06-25 00:08:16,798 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:08:16,798 INFO ]: Start isEmpty. Operand 61 states and 11394 transitions. [2018-06-25 00:08:16,804 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:08:16,804 INFO ]: Found error trace [2018-06-25 00:08:16,804 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:08:16,804 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:16,804 INFO ]: Analyzing trace with hash 790934441, now seen corresponding path program 1 times [2018-06-25 00:08:16,804 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:16,804 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:16,805 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:16,805 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:16,805 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:16,849 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:16,953 INFO ]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 00:08:16,954 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:08:16,954 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:08:16,954 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:08:16,954 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:08:16,954 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:16,954 INFO ]: Start difference. First operand 61 states and 11394 transitions. Second operand 3 states. [2018-06-25 00:08:19,146 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:08:19,146 INFO ]: Finished difference Result 88 states and 11455 transitions. [2018-06-25 00:08:19,236 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:08:19,236 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:08:19,236 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:08:19,243 INFO ]: With dead ends: 88 [2018-06-25 00:08:19,243 INFO ]: Without dead ends: 88 [2018-06-25 00:08:19,243 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:08:19,243 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-25 00:08:19,283 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 65. [2018-06-25 00:08:19,284 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-25 00:08:19,296 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 11405 transitions. [2018-06-25 00:08:19,296 INFO ]: Start accepts. Automaton has 65 states and 11405 transitions. Word has length 13 [2018-06-25 00:08:19,296 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:08:19,296 INFO ]: Abstraction has 65 states and 11405 transitions. [2018-06-25 00:08:19,296 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:08:19,296 INFO ]: Start isEmpty. Operand 65 states and 11405 transitions. [2018-06-25 00:08:19,301 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:08:19,301 INFO ]: Found error trace [2018-06-25 00:08:19,301 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:08:19,301 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:19,301 INFO ]: Analyzing trace with hash 1655941834, now seen corresponding path program 1 times [2018-06-25 00:08:19,301 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:19,301 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:19,302 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:19,302 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:19,302 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:19,345 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:19,435 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 00:08:19,435 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:08:19,435 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:08:19,435 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:08:19,435 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:08:19,435 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:19,435 INFO ]: Start difference. First operand 65 states and 11405 transitions. Second operand 3 states. [2018-06-25 00:08:22,153 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:08:22,153 INFO ]: Finished difference Result 96 states and 14436 transitions. [2018-06-25 00:08:22,153 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:08:22,153 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:08:22,153 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:08:22,162 INFO ]: With dead ends: 96 [2018-06-25 00:08:22,162 INFO ]: Without dead ends: 96 [2018-06-25 00:08:22,162 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:08:22,163 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-25 00:08:22,193 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 92. [2018-06-25 00:08:22,193 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-25 00:08:22,203 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 14425 transitions. [2018-06-25 00:08:22,204 INFO ]: Start accepts. Automaton has 92 states and 14425 transitions. Word has length 13 [2018-06-25 00:08:22,204 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:08:22,204 INFO ]: Abstraction has 92 states and 14425 transitions. [2018-06-25 00:08:22,204 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:08:22,204 INFO ]: Start isEmpty. Operand 92 states and 14425 transitions. [2018-06-25 00:08:22,209 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:08:22,209 INFO ]: Found error trace [2018-06-25 00:08:22,209 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:08:22,209 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:08:22,209 INFO ]: Analyzing trace with hash -295232571, now seen corresponding path program 1 times [2018-06-25 00:08:22,209 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:08:22,209 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:08:22,210 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:22,210 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:08:22,210 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:08:22,248 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:08:22,363 INFO ]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 00:08:22,364 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:08:22,364 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:08:22,364 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:08:22,364 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:08:22,364 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:22,364 INFO ]: Start difference. First operand 92 states and 14425 transitions. Second operand 3 states. [2018-06-25 00:08:24,241 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:08:24,241 INFO ]: Finished difference Result 95 states and 8576 transitions. [2018-06-25 00:08:24,269 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:08:24,269 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:08:24,269 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:08:24,269 INFO ]: With dead ends: 95 [2018-06-25 00:08:24,270 INFO ]: Without dead ends: 0 [2018-06-25 00:08:24,270 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:08:24,270 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 00:08:24,270 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 00:08:24,270 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 00:08:24,270 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 00:08:24,270 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-06-25 00:08:24,270 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:08:24,270 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 00:08:24,270 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:08:24,270 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 00:08:24,270 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 00:08:24,272 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:08:24,274 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:08:24 BasicIcfg [2018-06-25 00:08:24,274 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:08:24,275 INFO ]: Toolchain (without parser) took 68178.27 ms. Allocated memory was 307.8 MB in the beginning and 1.1 GB in the end (delta: 789.6 MB). Free memory was 241.2 MB in the beginning and 409.4 MB in the end (delta: -168.2 MB). Peak memory consumption was 621.4 MB. Max. memory is 3.6 GB. [2018-06-25 00:08:24,276 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:08:24,277 INFO ]: ChcToBoogie took 95.46 ms. Allocated memory is still 307.8 MB. Free memory was 241.2 MB in the beginning and 238.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 00:08:24,277 INFO ]: Boogie Preprocessor took 86.70 ms. Allocated memory is still 307.8 MB. Free memory was 238.2 MB in the beginning and 235.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 00:08:24,278 INFO ]: RCFGBuilder took 504.98 ms. Allocated memory is still 307.8 MB. Free memory was 235.2 MB in the beginning and 203.2 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:08:24,278 INFO ]: BlockEncodingV2 took 25258.95 ms. Allocated memory was 307.8 MB in the beginning and 391.6 MB in the end (delta: 83.9 MB). Free memory was 203.2 MB in the beginning and 168.7 MB in the end (delta: 34.4 MB). Peak memory consumption was 127.2 MB. Max. memory is 3.6 GB. [2018-06-25 00:08:24,285 INFO ]: TraceAbstraction took 42219.33 ms. Allocated memory was 391.6 MB in the beginning and 1.1 GB in the end (delta: 705.7 MB). Free memory was 168.7 MB in the beginning and 409.4 MB in the end (delta: -240.6 MB). Peak memory consumption was 465.1 MB. Max. memory is 3.6 GB. [2018-06-25 00:08:24,288 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, 916 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 95.46 ms. Allocated memory is still 307.8 MB. Free memory was 241.2 MB in the beginning and 238.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 86.70 ms. Allocated memory is still 307.8 MB. Free memory was 238.2 MB in the beginning and 235.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 504.98 ms. Allocated memory is still 307.8 MB. Free memory was 235.2 MB in the beginning and 203.2 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 25258.95 ms. Allocated memory was 307.8 MB in the beginning and 391.6 MB in the end (delta: 83.9 MB). Free memory was 203.2 MB in the beginning and 168.7 MB in the end (delta: 34.4 MB). Peak memory consumption was 127.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 42219.33 ms. Allocated memory was 391.6 MB in the beginning and 1.1 GB in the end (delta: 705.7 MB). Free memory was 168.7 MB in the beginning and 409.4 MB in the end (delta: -240.6 MB). Peak memory consumption was 465.1 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, 42.1s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 39.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 47 SDtfs, 0 SDslu, 51 SDs, 0 SdLazy, 11554 SolverSat, 12800 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 63 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 1409 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2455 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 217/221 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/s3_srvr_1.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-08-24-307.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-08-24-307.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-08-24-307.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-08-24-307.csv Received shutdown request...