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/eldarica-misc/LIA/Consistency/graham-scan-full.34.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:30:01,799 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:30:01,803 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:30:01,817 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:30:01,817 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:30:01,818 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:30:01,820 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:30:01,824 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:30:01,827 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:30:01,828 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:30:01,828 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:30:01,829 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:30:01,829 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:30:01,831 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:30:01,831 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:30:01,832 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:30:01,843 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:30:01,845 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:30:01,846 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:30:01,847 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:30:01,850 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:30:01,852 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:30:01,852 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:30:01,852 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:30:01,853 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:30:01,854 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:30:01,854 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:30:01,855 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:30:01,856 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:30:01,856 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:30:01,857 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:30:01,857 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:30:01,858 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:30:01,858 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:30:01,859 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:30:01,859 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:30:01,878 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:30:01,878 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:30:01,879 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:30:01,879 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:30:01,880 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:30:01,880 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:30:01,880 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:30:01,880 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:30:01,881 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:30:01,881 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:30:01,881 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:30:01,881 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:30:01,882 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:30:01,882 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:30:01,882 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:30:01,882 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:30:01,882 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:30:01,883 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:30:01,884 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:30:01,884 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:30:01,884 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:30:01,886 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:30:01,886 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:30:01,941 INFO ]: Repository-Root is: /tmp [2018-06-24 20:30:01,961 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:30:01,966 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:30:01,968 INFO ]: Initializing SmtParser... [2018-06-24 20:30:01,968 INFO ]: SmtParser initialized [2018-06-24 20:30:01,969 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/graham-scan-full.34.smt2 [2018-06-24 20:30:01,970 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-24 20:30:02,064 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/graham-scan-full.34.smt2 unknown [2018-06-24 20:30:02,610 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/graham-scan-full.34.smt2 [2018-06-24 20:30:02,614 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:30:02,620 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:30:02,621 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:30:02,621 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:30:02,621 INFO ]: ChcToBoogie initialized [2018-06-24 20:30:02,624 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:30:02" (1/1) ... [2018-06-24 20:30:02,705 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:30:02 Unit [2018-06-24 20:30:02,706 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:30:02,706 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:30:02,706 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:30:02,706 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:30:02,720 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:30:02" (1/1) ... [2018-06-24 20:30:02,720 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:30:02" (1/1) ... [2018-06-24 20:30:02,731 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:30:02" (1/1) ... [2018-06-24 20:30:02,731 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:30:02" (1/1) ... [2018-06-24 20:30:02,747 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:30:02" (1/1) ... [2018-06-24 20:30:02,751 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:30:02" (1/1) ... [2018-06-24 20:30:02,755 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:30:02" (1/1) ... [2018-06-24 20:30:02,760 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:30:02,761 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:30:02,761 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:30:02,761 INFO ]: RCFGBuilder initialized [2018-06-24 20:30:02,766 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:30:02" (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-24 20:30:02,778 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:30:02,778 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:30:02,778 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:30:02,778 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:30:02,778 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:30:02,778 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-24 20:30:04,259 INFO ]: Using library mode [2018-06-24 20:30:04,260 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:30:04 BoogieIcfgContainer [2018-06-24 20:30:04,260 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:30:04,260 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:30:04,260 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:30:04,261 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:30:04,262 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:30:04" (1/1) ... [2018-06-24 20:30:04,314 INFO ]: Initial Icfg 145 locations, 278 edges [2018-06-24 20:30:04,316 INFO ]: Using Remove infeasible edges [2018-06-24 20:30:04,316 INFO ]: Using Maximize final states [2018-06-24 20:30:04,317 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:30:04,320 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:30:04,322 INFO ]: Using Remove sink states [2018-06-24 20:30:04,322 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:30:04,322 INFO ]: Using Use SBE [2018-06-24 20:30:04,342 INFO ]: SBE split 0 edges [2018-06-24 20:30:04,355 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 20:30:04,357 INFO ]: 0 new accepting states [2018-06-24 20:30:05,048 INFO ]: Removed 47 edges and 7 locations by large block encoding [2018-06-24 20:30:05,054 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-24 20:30:05,060 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:30:05,060 INFO ]: 0 new accepting states [2018-06-24 20:30:05,066 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:30:05,067 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:30:05,072 INFO ]: Encoded RCFG 135 locations, 267 edges [2018-06-24 20:30:05,073 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:30:05 BasicIcfg [2018-06-24 20:30:05,073 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:30:05,074 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:30:05,074 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:30:05,077 INFO ]: TraceAbstraction initialized [2018-06-24 20:30:05,077 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:30:02" (1/4) ... [2018-06-24 20:30:05,078 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0ba404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:30:05, skipping insertion in model container [2018-06-24 20:30:05,078 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:30:02" (2/4) ... [2018-06-24 20:30:05,079 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0ba404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:30:05, skipping insertion in model container [2018-06-24 20:30:05,079 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:30:04" (3/4) ... [2018-06-24 20:30:05,079 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0ba404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:30:05, skipping insertion in model container [2018-06-24 20:30:05,079 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:30:05" (4/4) ... [2018-06-24 20:30:05,081 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:30:05,092 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:30:05,112 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:30:05,160 INFO ]: Using default assertion order modulation [2018-06-24 20:30:05,160 INFO ]: Interprodecural is true [2018-06-24 20:30:05,160 INFO ]: Hoare is false [2018-06-24 20:30:05,160 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:30:05,160 INFO ]: Backedges is TWOTRACK [2018-06-24 20:30:05,160 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:30:05,160 INFO ]: Difference is false [2018-06-24 20:30:05,160 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:30:05,160 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:30:05,177 INFO ]: Start isEmpty. Operand 135 states. [2018-06-24 20:30:05,224 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:30:05,224 INFO ]: Found error trace [2018-06-24 20:30:05,225 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:30:05,226 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:30:05,231 INFO ]: Analyzing trace with hash 173900682, now seen corresponding path program 1 times [2018-06-24 20:30:05,233 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:30:05,234 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:30:05,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:30:05,290 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:30:05,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:30:05,373 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:30:05,598 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:30:05,601 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:30:05,602 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:30:05,603 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:30:05,614 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:30:05,614 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:30:05,616 INFO ]: Start difference. First operand 135 states. Second operand 3 states. [2018-06-24 20:30:08,062 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:30:08,062 INFO ]: Finished difference Result 267 states and 530 transitions. [2018-06-24 20:30:08,063 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:30:08,064 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:30:08,064 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:30:08,107 INFO ]: With dead ends: 267 [2018-06-24 20:30:08,107 INFO ]: Without dead ends: 267 [2018-06-24 20:30:08,109 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-24 20:30:08,128 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-24 20:30:08,259 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-06-24 20:30:08,260 INFO ]: Start removeUnreachable. Operand 267 states. [2018-06-24 20:30:08,279 INFO ]: Finished removeUnreachable. Reduced from 267 states to 267 states and 530 transitions. [2018-06-24 20:30:08,281 INFO ]: Start accepts. Automaton has 267 states and 530 transitions. Word has length 5 [2018-06-24 20:30:08,282 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:30:08,282 INFO ]: Abstraction has 267 states and 530 transitions. [2018-06-24 20:30:08,282 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:30:08,282 INFO ]: Start isEmpty. Operand 267 states and 530 transitions. [2018-06-24 20:30:08,296 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:30:08,296 INFO ]: Found error trace [2018-06-24 20:30:08,296 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:30:08,296 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:30:08,296 INFO ]: Analyzing trace with hash 173989094, now seen corresponding path program 1 times [2018-06-24 20:30:08,296 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:30:08,296 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:30:08,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:30:08,297 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:30:08,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:30:08,323 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:30:08,443 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:30:08,443 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:30:08,443 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:30:08,445 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:30:08,445 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:30:08,445 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:30:08,445 INFO ]: Start difference. First operand 267 states and 530 transitions. Second operand 3 states. [2018-06-24 20:30:10,201 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:30:10,201 INFO ]: Finished difference Result 399 states and 794 transitions. [2018-06-24 20:30:10,212 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:30:10,212 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:30:10,213 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:30:10,236 INFO ]: With dead ends: 399 [2018-06-24 20:30:10,236 INFO ]: Without dead ends: 399 [2018-06-24 20:30:10,237 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-24 20:30:10,237 INFO ]: Start minimizeSevpa. Operand 399 states. [2018-06-24 20:30:10,295 INFO ]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-06-24 20:30:10,295 INFO ]: Start removeUnreachable. Operand 399 states. [2018-06-24 20:30:10,311 INFO ]: Finished removeUnreachable. Reduced from 399 states to 399 states and 794 transitions. [2018-06-24 20:30:10,311 INFO ]: Start accepts. Automaton has 399 states and 794 transitions. Word has length 5 [2018-06-24 20:30:10,311 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:30:10,311 INFO ]: Abstraction has 399 states and 794 transitions. [2018-06-24 20:30:10,311 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:30:10,311 INFO ]: Start isEmpty. Operand 399 states and 794 transitions. [2018-06-24 20:30:10,335 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:30:10,335 INFO ]: Found error trace [2018-06-24 20:30:10,335 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:30:10,335 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:30:10,335 INFO ]: Analyzing trace with hash 49089306, now seen corresponding path program 1 times [2018-06-24 20:30:10,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:30:10,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:30:10,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:30:10,336 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:30:10,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:30:10,385 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:30:10,733 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:30:10,733 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:30:10,733 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:30:10,734 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:30:10,734 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:30:10,734 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:30:10,734 INFO ]: Start difference. First operand 399 states and 794 transitions. Second operand 5 states. [2018-06-24 20:30:14,505 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:30:14,505 INFO ]: Finished difference Result 888 states and 2663 transitions. [2018-06-24 20:30:14,506 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:30:14,506 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:30:14,506 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:30:14,625 INFO ]: With dead ends: 888 [2018-06-24 20:30:14,625 INFO ]: Without dead ends: 813 [2018-06-24 20:30:14,625 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:30:14,627 INFO ]: Start minimizeSevpa. Operand 813 states. [2018-06-24 20:30:14,907 INFO ]: Finished minimizeSevpa. Reduced states from 813 to 551. [2018-06-24 20:30:14,907 INFO ]: Start removeUnreachable. Operand 551 states. [2018-06-24 20:30:14,933 INFO ]: Finished removeUnreachable. Reduced from 551 states to 551 states and 1414 transitions. [2018-06-24 20:30:14,933 INFO ]: Start accepts. Automaton has 551 states and 1414 transitions. Word has length 9 [2018-06-24 20:30:14,934 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:30:14,934 INFO ]: Abstraction has 551 states and 1414 transitions. [2018-06-24 20:30:14,934 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:30:14,934 INFO ]: Start isEmpty. Operand 551 states and 1414 transitions. [2018-06-24 20:30:14,955 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:30:14,955 INFO ]: Found error trace [2018-06-24 20:30:14,955 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:30:14,955 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:30:14,955 INFO ]: Analyzing trace with hash 51859869, now seen corresponding path program 1 times [2018-06-24 20:30:14,956 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:30:14,956 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:30:14,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:30:14,957 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:30:14,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:30:15,003 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:30:15,110 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:30:15,110 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:30:15,110 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:30:15,110 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:30:15,110 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:30:15,110 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:30:15,110 INFO ]: Start difference. First operand 551 states and 1414 transitions. Second operand 5 states. [2018-06-24 20:30:19,655 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:30:19,655 INFO ]: Finished difference Result 1242 states and 4342 transitions. [2018-06-24 20:30:19,656 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:30:19,656 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:30:19,656 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:30:19,771 INFO ]: With dead ends: 1242 [2018-06-24 20:30:19,772 INFO ]: Without dead ends: 1236 [2018-06-24 20:30:19,772 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:30:19,773 INFO ]: Start minimizeSevpa. Operand 1236 states. [2018-06-24 20:30:20,175 INFO ]: Finished minimizeSevpa. Reduced states from 1236 to 928. [2018-06-24 20:30:20,175 INFO ]: Start removeUnreachable. Operand 928 states. [2018-06-24 20:30:20,210 INFO ]: Finished removeUnreachable. Reduced from 928 states to 928 states and 2880 transitions. [2018-06-24 20:30:20,210 INFO ]: Start accepts. Automaton has 928 states and 2880 transitions. Word has length 9 [2018-06-24 20:30:20,210 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:30:20,210 INFO ]: Abstraction has 928 states and 2880 transitions. [2018-06-24 20:30:20,210 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:30:20,210 INFO ]: Start isEmpty. Operand 928 states and 2880 transitions. [2018-06-24 20:30:20,242 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:30:20,242 INFO ]: Found error trace [2018-06-24 20:30:20,243 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:30:20,243 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:30:20,243 INFO ]: Analyzing trace with hash -642771251, now seen corresponding path program 1 times [2018-06-24 20:30:20,243 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:30:20,243 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:30:20,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:30:20,244 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:30:20,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:30:20,282 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:30:20,459 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:30:20,459 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:30:20,459 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:30:20,460 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:30:20,460 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:30:20,460 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:30:20,460 INFO ]: Start difference. First operand 928 states and 2880 transitions. Second operand 5 states. [2018-06-24 20:30:22,171 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:30:22,172 INFO ]: Finished difference Result 1619 states and 5910 transitions. [2018-06-24 20:30:22,172 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:30:22,172 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:30:22,172 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:30:22,331 INFO ]: With dead ends: 1619 [2018-06-24 20:30:22,332 INFO ]: Without dead ends: 1494 [2018-06-24 20:30:22,332 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:30:22,332 INFO ]: Start minimizeSevpa. Operand 1494 states. [2018-06-24 20:30:22,771 INFO ]: Finished minimizeSevpa. Reduced states from 1494 to 1165. [2018-06-24 20:30:22,771 INFO ]: Start removeUnreachable. Operand 1165 states. [2018-06-24 20:30:22,815 INFO ]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 3846 transitions. [2018-06-24 20:30:22,815 INFO ]: Start accepts. Automaton has 1165 states and 3846 transitions. Word has length 9 [2018-06-24 20:30:22,815 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:30:22,815 INFO ]: Abstraction has 1165 states and 3846 transitions. [2018-06-24 20:30:22,815 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:30:22,815 INFO ]: Start isEmpty. Operand 1165 states and 3846 transitions. [2018-06-24 20:30:22,865 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:30:22,865 INFO ]: Found error trace [2018-06-24 20:30:22,865 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:30:22,865 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:30:22,865 INFO ]: Analyzing trace with hash 286880992, now seen corresponding path program 1 times [2018-06-24 20:30:22,865 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:30:22,865 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:30:22,867 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:30:22,867 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:30:22,867 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:30:22,903 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:30:23,342 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:30:23,342 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:30:23,342 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:30:23,342 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:30:23,342 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:30:23,342 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:30:23,343 INFO ]: Start difference. First operand 1165 states and 3846 transitions. Second operand 6 states. [2018-06-24 20:30:31,264 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:30:31,264 INFO ]: Finished difference Result 3408 states and 22025 transitions. [2018-06-24 20:30:31,264 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:30:31,264 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:30:31,264 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:30:32,041 INFO ]: With dead ends: 3408 [2018-06-24 20:30:32,041 INFO ]: Without dead ends: 3246 [2018-06-24 20:30:32,041 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:30:32,043 INFO ]: Start minimizeSevpa. Operand 3246 states. [2018-06-24 20:30:34,760 INFO ]: Finished minimizeSevpa. Reduced states from 3246 to 1991. [2018-06-24 20:30:34,760 INFO ]: Start removeUnreachable. Operand 1991 states. [2018-06-24 20:30:34,900 INFO ]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 7987 transitions. [2018-06-24 20:30:34,900 INFO ]: Start accepts. Automaton has 1991 states and 7987 transitions. Word has length 10 [2018-06-24 20:30:34,901 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:30:34,901 INFO ]: Abstraction has 1991 states and 7987 transitions. [2018-06-24 20:30:34,901 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:30:34,901 INFO ]: Start isEmpty. Operand 1991 states and 7987 transitions. [2018-06-24 20:30:34,937 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:30:34,937 INFO ]: Found error trace [2018-06-24 20:30:34,937 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:30:34,937 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:30:34,939 INFO ]: Analyzing trace with hash 772981913, now seen corresponding path program 1 times [2018-06-24 20:30:34,939 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:30:34,939 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:30:34,940 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:30:34,940 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:30:34,940 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:30:34,958 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:30:35,066 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:30:35,066 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:30:35,066 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:30:35,066 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:30:35,066 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:30:35,066 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:30:35,066 INFO ]: Start difference. First operand 1991 states and 7987 transitions. Second operand 6 states. [2018-06-24 20:30:38,018 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:30:38,018 INFO ]: Finished difference Result 3210 states and 19731 transitions. [2018-06-24 20:30:38,018 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:30:38,018 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:30:38,018 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:30:38,656 INFO ]: With dead ends: 3210 [2018-06-24 20:30:38,656 INFO ]: Without dead ends: 3200 [2018-06-24 20:30:38,656 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:30:38,658 INFO ]: Start minimizeSevpa. Operand 3200 states. [2018-06-24 20:30:40,036 INFO ]: Finished minimizeSevpa. Reduced states from 3200 to 2135. [2018-06-24 20:30:40,037 INFO ]: Start removeUnreachable. Operand 2135 states. [2018-06-24 20:30:40,207 INFO ]: Finished removeUnreachable. Reduced from 2135 states to 2135 states and 9687 transitions. [2018-06-24 20:30:40,207 INFO ]: Start accepts. Automaton has 2135 states and 9687 transitions. Word has length 10 [2018-06-24 20:30:40,207 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:30:40,207 INFO ]: Abstraction has 2135 states and 9687 transitions. [2018-06-24 20:30:40,207 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:30:40,207 INFO ]: Start isEmpty. Operand 2135 states and 9687 transitions. [2018-06-24 20:30:40,236 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:30:40,236 INFO ]: Found error trace [2018-06-24 20:30:40,236 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:30:40,236 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:30:40,237 INFO ]: Analyzing trace with hash -774971698, now seen corresponding path program 1 times [2018-06-24 20:30:40,237 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:30:40,237 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:30:40,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:30:40,237 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:30:40,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:30:40,279 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:30:40,418 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:30:40,418 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:30:40,418 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:30:40,419 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:30:40,419 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:30:40,419 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:30:40,419 INFO ]: Start difference. First operand 2135 states and 9687 transitions. Second operand 6 states. [2018-06-24 20:30:45,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:30:45,053 INFO ]: Finished difference Result 4514 states and 41566 transitions. [2018-06-24 20:30:45,053 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:30:45,053 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:30:45,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:30:47,355 INFO ]: With dead ends: 4514 [2018-06-24 20:30:47,355 INFO ]: Without dead ends: 3810 [2018-06-24 20:30:47,355 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:30:47,357 INFO ]: Start minimizeSevpa. Operand 3810 states. [2018-06-24 20:30:51,822 INFO ]: Finished minimizeSevpa. Reduced states from 3810 to 2497. [2018-06-24 20:30:51,822 INFO ]: Start removeUnreachable. Operand 2497 states. [2018-06-24 20:30:52,069 INFO ]: Finished removeUnreachable. Reduced from 2497 states to 2497 states and 12846 transitions. [2018-06-24 20:30:52,069 INFO ]: Start accepts. Automaton has 2497 states and 12846 transitions. Word has length 10 [2018-06-24 20:30:52,069 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:30:52,069 INFO ]: Abstraction has 2497 states and 12846 transitions. [2018-06-24 20:30:52,069 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:30:52,069 INFO ]: Start isEmpty. Operand 2497 states and 12846 transitions. [2018-06-24 20:30:52,106 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:30:52,106 INFO ]: Found error trace [2018-06-24 20:30:52,107 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:30:52,107 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:30:52,107 INFO ]: Analyzing trace with hash -774968815, now seen corresponding path program 1 times [2018-06-24 20:30:52,107 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:30:52,107 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:30:52,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:30:52,108 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:30:52,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:30:52,125 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:30:52,259 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:30:52,259 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:30:52,259 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:30:52,259 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:30:52,259 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:30:52,259 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:30:52,259 INFO ]: Start difference. First operand 2497 states and 12846 transitions. Second operand 6 states. [2018-06-24 20:30:53,041 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 14 Received shutdown request... [2018-06-24 20:31:02,837 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:31:02,837 WARN ]: Verification canceled [2018-06-24 20:31:02,840 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:31:02,842 WARN ]: Timeout [2018-06-24 20:31:02,842 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:31:02 BasicIcfg [2018-06-24 20:31:02,842 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:31:02,843 INFO ]: Toolchain (without parser) took 60227.88 ms. Allocated memory was 297.3 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 239.8 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 3.6 GB. [2018-06-24 20:31:02,844 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 297.3 MB. Free memory is still 262.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:31:02,844 INFO ]: ChcToBoogie took 84.93 ms. Allocated memory is still 297.3 MB. Free memory was 238.8 MB in the beginning and 235.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:31:02,845 INFO ]: Boogie Preprocessor took 54.08 ms. Allocated memory is still 297.3 MB. Free memory was 235.8 MB in the beginning and 232.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:31:02,845 INFO ]: RCFGBuilder took 1499.49 ms. Allocated memory was 297.3 MB in the beginning and 319.8 MB in the end (delta: 22.5 MB). Free memory was 232.9 MB in the beginning and 279.2 MB in the end (delta: -46.4 MB). Peak memory consumption was 62.8 MB. Max. memory is 3.6 GB. [2018-06-24 20:31:02,846 INFO ]: BlockEncodingV2 took 812.28 ms. Allocated memory is still 319.8 MB. Free memory was 279.2 MB in the beginning and 236.5 MB in the end (delta: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 3.6 GB. [2018-06-24 20:31:02,853 INFO ]: TraceAbstraction took 57768.35 ms. Allocated memory was 319.8 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 236.5 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 3.6 GB. [2018-06-24 20:31:02,856 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 145 locations, 278 edges - StatisticsResult: Encoded RCFG 135 locations, 267 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 297.3 MB. Free memory is still 262.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 84.93 ms. Allocated memory is still 297.3 MB. Free memory was 238.8 MB in the beginning and 235.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 54.08 ms. Allocated memory is still 297.3 MB. Free memory was 235.8 MB in the beginning and 232.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1499.49 ms. Allocated memory was 297.3 MB in the beginning and 319.8 MB in the end (delta: 22.5 MB). Free memory was 232.9 MB in the beginning and 279.2 MB in the end (delta: -46.4 MB). Peak memory consumption was 62.8 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 812.28 ms. Allocated memory is still 319.8 MB. Free memory was 279.2 MB in the beginning and 236.5 MB in the end (delta: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57768.35 ms. Allocated memory was 319.8 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 236.5 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (2497states) and interpolant automaton (currently 11 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (6423 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 135 locations, 1 error locations. TIMEOUT Result, 57.6s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 44.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4769 SDtfs, 1108 SDslu, 6341 SDs, 0 SdLazy, 19373 SolverSat, 3528 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2497occurred in iteration=8, 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: 10.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 4532 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 1568 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 14/14 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/graham-scan-full.34.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-31-02-871.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/graham-scan-full.34.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-31-02-871.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/graham-scan-full.34.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-31-02-871.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/graham-scan-full.34.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-31-02-871.csv Completed graceful shutdown