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.32.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:29:03,238 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:29:03,240 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:29:03,251 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:29:03,252 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:29:03,253 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:29:03,254 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:29:03,255 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:29:03,257 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:29:03,257 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:29:03,258 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:29:03,258 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:29:03,259 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:29:03,260 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:29:03,261 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:29:03,262 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:29:03,263 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:29:03,265 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:29:03,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:29:03,268 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:29:03,269 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:29:03,271 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:29:03,272 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:29:03,272 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:29:03,273 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:29:03,274 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:29:03,274 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:29:03,275 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:29:03,276 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:29:03,277 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:29:03,277 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:29:03,278 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:29:03,278 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:29:03,279 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:29:03,280 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:29:03,280 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:29:03,298 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:29:03,299 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:29:03,299 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:29:03,299 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:29:03,300 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:29:03,301 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:29:03,301 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:29:03,301 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:29:03,301 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:29:03,302 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:29:03,302 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:29:03,302 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:29:03,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:29:03,303 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:29:03,303 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:29:03,303 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:29:03,303 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:29:03,304 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:29:03,304 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:29:03,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:29:03,304 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:29:03,306 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:29:03,306 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:29:03,351 INFO ]: Repository-Root is: /tmp [2018-06-24 20:29:03,364 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:29:03,372 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:29:03,374 INFO ]: Initializing SmtParser... [2018-06-24 20:29:03,374 INFO ]: SmtParser initialized [2018-06-24 20:29:03,374 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/graham-scan-full.32.smt2 [2018-06-24 20:29:03,376 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:29:03,466 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/graham-scan-full.32.smt2 unknown [2018-06-24 20:29:03,944 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/graham-scan-full.32.smt2 [2018-06-24 20:29:03,952 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:29:03,961 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:29:03,961 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:29:03,961 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:29:03,962 INFO ]: ChcToBoogie initialized [2018-06-24 20:29:03,965 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:29:03" (1/1) ... [2018-06-24 20:29:04,067 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:29:04 Unit [2018-06-24 20:29:04,068 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:29:04,068 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:29:04,068 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:29:04,068 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:29:04,088 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:29:04" (1/1) ... [2018-06-24 20:29:04,088 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:29:04" (1/1) ... [2018-06-24 20:29:04,110 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:29:04" (1/1) ... [2018-06-24 20:29:04,111 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:29:04" (1/1) ... [2018-06-24 20:29:04,131 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:29:04" (1/1) ... [2018-06-24 20:29:04,135 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:29:04" (1/1) ... [2018-06-24 20:29:04,147 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:29:04" (1/1) ... [2018-06-24 20:29:04,151 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:29:04,157 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:29:04,157 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:29:04,157 INFO ]: RCFGBuilder initialized [2018-06-24 20:29:04,158 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:29:04" (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:29:04,181 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:29:04,181 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:29:04,181 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:29:04,181 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:29:04,181 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:29:04,181 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:29:05,868 INFO ]: Using library mode [2018-06-24 20:29:05,869 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:29:05 BoogieIcfgContainer [2018-06-24 20:29:05,869 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:29:05,869 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:29:05,869 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:29:05,870 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:29:05,871 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:29:05" (1/1) ... [2018-06-24 20:29:05,904 INFO ]: Initial Icfg 145 locations, 279 edges [2018-06-24 20:29:05,905 INFO ]: Using Remove infeasible edges [2018-06-24 20:29:05,906 INFO ]: Using Maximize final states [2018-06-24 20:29:05,906 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:29:05,906 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:29:05,908 INFO ]: Using Remove sink states [2018-06-24 20:29:05,909 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:29:05,909 INFO ]: Using Use SBE [2018-06-24 20:29:05,920 INFO ]: SBE split 0 edges [2018-06-24 20:29:05,925 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 20:29:05,927 INFO ]: 0 new accepting states [2018-06-24 20:29:06,641 INFO ]: Removed 49 edges and 7 locations by large block encoding [2018-06-24 20:29:06,644 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-24 20:29:06,649 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:29:06,649 INFO ]: 0 new accepting states [2018-06-24 20:29:06,654 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:29:06,655 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:29:06,657 INFO ]: Encoded RCFG 135 locations, 268 edges [2018-06-24 20:29:06,657 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:29:06 BasicIcfg [2018-06-24 20:29:06,657 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:29:06,658 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:29:06,658 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:29:06,661 INFO ]: TraceAbstraction initialized [2018-06-24 20:29:06,661 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:29:03" (1/4) ... [2018-06-24 20:29:06,662 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f34bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:29:06, skipping insertion in model container [2018-06-24 20:29:06,662 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:29:04" (2/4) ... [2018-06-24 20:29:06,663 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f34bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:29:06, skipping insertion in model container [2018-06-24 20:29:06,663 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:29:05" (3/4) ... [2018-06-24 20:29:06,663 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f34bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:29:06, skipping insertion in model container [2018-06-24 20:29:06,663 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:29:06" (4/4) ... [2018-06-24 20:29:06,665 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:29:06,674 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:29:06,689 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:29:06,736 INFO ]: Using default assertion order modulation [2018-06-24 20:29:06,737 INFO ]: Interprodecural is true [2018-06-24 20:29:06,737 INFO ]: Hoare is false [2018-06-24 20:29:06,737 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:29:06,737 INFO ]: Backedges is TWOTRACK [2018-06-24 20:29:06,737 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:29:06,737 INFO ]: Difference is false [2018-06-24 20:29:06,737 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:29:06,737 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:29:06,753 INFO ]: Start isEmpty. Operand 135 states. [2018-06-24 20:29:06,797 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:29:06,797 INFO ]: Found error trace [2018-06-24 20:29:06,798 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:29:06,798 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:29:06,803 INFO ]: Analyzing trace with hash 174884778, now seen corresponding path program 1 times [2018-06-24 20:29:06,805 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:29:06,806 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:29:06,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:29:06,852 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:29:06,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:29:06,943 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:29:07,180 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:29:07,181 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:29:07,181 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:29:07,183 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:29:07,193 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:29:07,193 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:29:07,195 INFO ]: Start difference. First operand 135 states. Second operand 3 states. [2018-06-24 20:29:09,188 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:29:09,189 INFO ]: Finished difference Result 267 states and 532 transitions. [2018-06-24 20:29:09,289 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:29:09,290 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:29:09,290 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:29:09,332 INFO ]: With dead ends: 267 [2018-06-24 20:29:09,332 INFO ]: Without dead ends: 267 [2018-06-24 20:29:09,334 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:29:09,351 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-24 20:29:09,483 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-06-24 20:29:09,484 INFO ]: Start removeUnreachable. Operand 267 states. [2018-06-24 20:29:09,518 INFO ]: Finished removeUnreachable. Reduced from 267 states to 267 states and 532 transitions. [2018-06-24 20:29:09,520 INFO ]: Start accepts. Automaton has 267 states and 532 transitions. Word has length 5 [2018-06-24 20:29:09,520 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:29:09,521 INFO ]: Abstraction has 267 states and 532 transitions. [2018-06-24 20:29:09,521 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:29:09,521 INFO ]: Start isEmpty. Operand 267 states and 532 transitions. [2018-06-24 20:29:09,535 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:29:09,535 INFO ]: Found error trace [2018-06-24 20:29:09,535 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:29:09,535 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:29:09,535 INFO ]: Analyzing trace with hash 174913608, now seen corresponding path program 1 times [2018-06-24 20:29:09,535 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:29:09,535 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:29:09,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:29:09,536 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:29:09,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:29:09,554 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:29:09,673 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:29:09,673 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:29:09,673 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:29:09,674 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:29:09,674 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:29:09,675 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:29:09,675 INFO ]: Start difference. First operand 267 states and 532 transitions. Second operand 3 states. [2018-06-24 20:29:11,598 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:29:11,598 INFO ]: Finished difference Result 399 states and 797 transitions. [2018-06-24 20:29:11,599 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:29:11,599 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:29:11,599 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:29:11,629 INFO ]: With dead ends: 399 [2018-06-24 20:29:11,629 INFO ]: Without dead ends: 399 [2018-06-24 20:29:11,630 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:29:11,631 INFO ]: Start minimizeSevpa. Operand 399 states. [2018-06-24 20:29:11,724 INFO ]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-06-24 20:29:11,724 INFO ]: Start removeUnreachable. Operand 399 states. [2018-06-24 20:29:11,784 INFO ]: Finished removeUnreachable. Reduced from 399 states to 399 states and 797 transitions. [2018-06-24 20:29:11,784 INFO ]: Start accepts. Automaton has 399 states and 797 transitions. Word has length 5 [2018-06-24 20:29:11,784 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:29:11,785 INFO ]: Abstraction has 399 states and 797 transitions. [2018-06-24 20:29:11,785 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:29:11,785 INFO ]: Start isEmpty. Operand 399 states and 797 transitions. [2018-06-24 20:29:11,813 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:29:11,813 INFO ]: Found error trace [2018-06-24 20:29:11,814 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:29:11,814 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:29:11,814 INFO ]: Analyzing trace with hash -2079966078, now seen corresponding path program 1 times [2018-06-24 20:29:11,814 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:29:11,814 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:29:11,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:29:11,815 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:29:11,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:29:11,891 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:29:12,122 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:29:12,122 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:29:12,122 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:29:12,122 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:29:12,123 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:29:12,123 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:29:12,123 INFO ]: Start difference. First operand 399 states and 797 transitions. Second operand 5 states. [2018-06-24 20:29:15,228 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:29:15,228 INFO ]: Finished difference Result 840 states and 2152 transitions. [2018-06-24 20:29:15,228 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:29:15,229 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:29:15,229 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:29:15,397 INFO ]: With dead ends: 840 [2018-06-24 20:29:15,397 INFO ]: Without dead ends: 739 [2018-06-24 20:29:15,398 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:29:15,398 INFO ]: Start minimizeSevpa. Operand 739 states. [2018-06-24 20:29:15,605 INFO ]: Finished minimizeSevpa. Reduced states from 739 to 611. [2018-06-24 20:29:15,605 INFO ]: Start removeUnreachable. Operand 611 states. [2018-06-24 20:29:15,707 INFO ]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1353 transitions. [2018-06-24 20:29:15,707 INFO ]: Start accepts. Automaton has 611 states and 1353 transitions. Word has length 9 [2018-06-24 20:29:15,707 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:29:15,707 INFO ]: Abstraction has 611 states and 1353 transitions. [2018-06-24 20:29:15,707 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:29:15,708 INFO ]: Start isEmpty. Operand 611 states and 1353 transitions. [2018-06-24 20:29:15,735 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:29:15,735 INFO ]: Found error trace [2018-06-24 20:29:15,735 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:29:15,735 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:29:15,736 INFO ]: Analyzing trace with hash 873025211, now seen corresponding path program 1 times [2018-06-24 20:29:15,736 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:29:15,736 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:29:15,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:29:15,736 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:29:15,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:29:15,767 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:29:16,043 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:29:16,044 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:29:16,044 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:29:16,044 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:29:16,044 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:29:16,044 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:29:16,044 INFO ]: Start difference. First operand 611 states and 1353 transitions. Second operand 5 states. [2018-06-24 20:29:20,239 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:29:20,240 INFO ]: Finished difference Result 1288 states and 4154 transitions. [2018-06-24 20:29:20,325 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:29:20,325 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:29:20,325 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:29:20,501 INFO ]: With dead ends: 1288 [2018-06-24 20:29:20,501 INFO ]: Without dead ends: 1132 [2018-06-24 20:29:20,501 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:29:20,502 INFO ]: Start minimizeSevpa. Operand 1132 states. [2018-06-24 20:29:20,871 INFO ]: Finished minimizeSevpa. Reduced states from 1132 to 767. [2018-06-24 20:29:20,871 INFO ]: Start removeUnreachable. Operand 767 states. [2018-06-24 20:29:20,910 INFO ]: Finished removeUnreachable. Reduced from 767 states to 767 states and 2128 transitions. [2018-06-24 20:29:20,910 INFO ]: Start accepts. Automaton has 767 states and 2128 transitions. Word has length 9 [2018-06-24 20:29:20,910 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:29:20,910 INFO ]: Abstraction has 767 states and 2128 transitions. [2018-06-24 20:29:20,910 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:29:20,910 INFO ]: Start isEmpty. Operand 767 states and 2128 transitions. [2018-06-24 20:29:20,939 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:29:20,939 INFO ]: Found error trace [2018-06-24 20:29:20,939 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:29:20,939 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:29:20,940 INFO ]: Analyzing trace with hash 875795774, now seen corresponding path program 1 times [2018-06-24 20:29:20,940 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:29:20,940 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:29:20,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:29:20,941 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:29:20,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:29:20,978 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:29:21,286 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:29:21,286 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:29:21,286 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:29:21,286 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:29:21,286 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:29:21,286 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:29:21,287 INFO ]: Start difference. First operand 767 states and 2128 transitions. Second operand 5 states. [2018-06-24 20:29:24,352 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:29:24,352 INFO ]: Finished difference Result 1709 states and 7153 transitions. [2018-06-24 20:29:24,355 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:29:24,355 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:29:24,355 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:29:24,619 INFO ]: With dead ends: 1709 [2018-06-24 20:29:24,619 INFO ]: Without dead ends: 1702 [2018-06-24 20:29:24,619 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:29:24,620 INFO ]: Start minimizeSevpa. Operand 1702 states. [2018-06-24 20:29:25,319 INFO ]: Finished minimizeSevpa. Reduced states from 1702 to 1194. [2018-06-24 20:29:25,319 INFO ]: Start removeUnreachable. Operand 1194 states. [2018-06-24 20:29:25,403 INFO ]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 4592 transitions. [2018-06-24 20:29:25,403 INFO ]: Start accepts. Automaton has 1194 states and 4592 transitions. Word has length 9 [2018-06-24 20:29:25,403 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:29:25,403 INFO ]: Abstraction has 1194 states and 4592 transitions. [2018-06-24 20:29:25,403 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:29:25,403 INFO ]: Start isEmpty. Operand 1194 states and 4592 transitions. [2018-06-24 20:29:25,444 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:29:25,444 INFO ]: Found error trace [2018-06-24 20:29:25,444 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:29:25,444 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:29:25,445 INFO ]: Analyzing trace with hash -373373884, now seen corresponding path program 1 times [2018-06-24 20:29:25,445 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:29:25,445 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:29:25,445 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:29:25,445 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:29:25,445 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:29:25,469 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:29:25,858 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:29:25,858 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:29:25,858 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:29:25,858 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:29:25,858 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:29:25,858 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:29:25,858 INFO ]: Start difference. First operand 1194 states and 4592 transitions. Second operand 6 states. [2018-06-24 20:29:29,351 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:29:29,351 INFO ]: Finished difference Result 2706 states and 17769 transitions. [2018-06-24 20:29:29,351 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:29:29,351 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:29:29,351 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:29:29,911 INFO ]: With dead ends: 2706 [2018-06-24 20:29:29,911 INFO ]: Without dead ends: 2365 [2018-06-24 20:29:29,911 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:29:29,913 INFO ]: Start minimizeSevpa. Operand 2365 states. [2018-06-24 20:29:31,289 INFO ]: Finished minimizeSevpa. Reduced states from 2365 to 1449. [2018-06-24 20:29:31,289 INFO ]: Start removeUnreachable. Operand 1449 states. [2018-06-24 20:29:31,456 INFO ]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 6137 transitions. [2018-06-24 20:29:31,456 INFO ]: Start accepts. Automaton has 1449 states and 6137 transitions. Word has length 10 [2018-06-24 20:29:31,456 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:29:31,456 INFO ]: Abstraction has 1449 states and 6137 transitions. [2018-06-24 20:29:31,456 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:29:31,456 INFO ]: Start isEmpty. Operand 1449 states and 6137 transitions. [2018-06-24 20:29:31,505 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:29:31,505 INFO ]: Found error trace [2018-06-24 20:29:31,505 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:29:31,506 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:29:31,506 INFO ]: Analyzing trace with hash -373371001, now seen corresponding path program 1 times [2018-06-24 20:29:31,506 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:29:31,506 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:29:31,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:29:31,507 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:29:31,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:29:31,533 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:29:31,842 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:29:31,842 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:29:31,842 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:29:31,842 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:29:31,842 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:29:31,842 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:29:31,842 INFO ]: Start difference. First operand 1449 states and 6137 transitions. Second operand 6 states. [2018-06-24 20:29:34,570 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:29:34,571 INFO ]: Finished difference Result 2475 states and 13720 transitions. [2018-06-24 20:29:34,571 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:29:34,573 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:29:34,573 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:29:34,919 INFO ]: With dead ends: 2475 [2018-06-24 20:29:34,919 INFO ]: Without dead ends: 2403 [2018-06-24 20:29:34,919 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:29:34,921 INFO ]: Start minimizeSevpa. Operand 2403 states. [2018-06-24 20:29:35,796 INFO ]: Finished minimizeSevpa. Reduced states from 2403 to 1481. [2018-06-24 20:29:35,796 INFO ]: Start removeUnreachable. Operand 1481 states. [2018-06-24 20:29:35,925 INFO ]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 6320 transitions. [2018-06-24 20:29:35,925 INFO ]: Start accepts. Automaton has 1481 states and 6320 transitions. Word has length 10 [2018-06-24 20:29:35,925 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:29:35,925 INFO ]: Abstraction has 1481 states and 6320 transitions. [2018-06-24 20:29:35,925 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:29:35,925 INFO ]: Start isEmpty. Operand 1481 states and 6320 transitions. [2018-06-24 20:29:35,946 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:29:35,946 INFO ]: Found error trace [2018-06-24 20:29:35,946 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:29:35,946 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:29:35,946 INFO ]: Analyzing trace with hash 1479328731, now seen corresponding path program 1 times [2018-06-24 20:29:35,946 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:29:35,946 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:29:35,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:29:35,947 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:29:35,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:29:35,973 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:29:36,258 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:29:36,259 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:29:36,259 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-24 20:29:37,011 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:29:37,131 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:29:37,140 INFO ]: Computing forward predicates... [2018-06-24 20:29:37,539 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:29:37,575 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:29:37,575 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 20:29:37,575 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:29:37,575 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:29:37,575 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:29:37,575 INFO ]: Start difference. First operand 1481 states and 6320 transitions. Second operand 10 states. [2018-06-24 20:29:52,065 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:29:52,065 INFO ]: Finished difference Result 4431 states and 31946 transitions. [2018-06-24 20:29:52,065 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:29:52,065 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-24 20:29:52,065 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:29:53,328 INFO ]: With dead ends: 4431 [2018-06-24 20:29:53,328 INFO ]: Without dead ends: 3589 [2018-06-24 20:29:53,329 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:29:53,330 INFO ]: Start minimizeSevpa. Operand 3589 states. [2018-06-24 20:29:55,875 INFO ]: Finished minimizeSevpa. Reduced states from 3589 to 2359. [2018-06-24 20:29:55,875 INFO ]: Start removeUnreachable. Operand 2359 states. [2018-06-24 20:29:56,081 INFO ]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 11342 transitions. [2018-06-24 20:29:56,081 INFO ]: Start accepts. Automaton has 2359 states and 11342 transitions. Word has length 10 [2018-06-24 20:29:56,081 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:29:56,081 INFO ]: Abstraction has 2359 states and 11342 transitions. [2018-06-24 20:29:56,081 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:29:56,081 INFO ]: Start isEmpty. Operand 2359 states and 11342 transitions. [2018-06-24 20:29:56,164 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:29:56,164 INFO ]: Found error trace [2018-06-24 20:29:56,164 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:29:56,164 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:29:56,166 INFO ]: Analyzing trace with hash 1582573185, now seen corresponding path program 1 times [2018-06-24 20:29:56,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:29:56,166 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:29:56,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:29:56,166 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:29:56,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:29:56,193 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:29:56,565 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:29:56,565 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:29:56,565 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:29:56,565 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:29:56,566 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:29:56,566 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:29:56,566 INFO ]: Start difference. First operand 2359 states and 11342 transitions. Second operand 6 states. Received shutdown request... [2018-06-24 20:29:58,833 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:29:58,833 WARN ]: Verification canceled [2018-06-24 20:29:58,836 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:29:58,837 WARN ]: Timeout [2018-06-24 20:29:58,837 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:29:58 BasicIcfg [2018-06-24 20:29:58,837 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:29:58,838 INFO ]: Toolchain (without parser) took 54885.40 ms. Allocated memory was 308.8 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 247.3 MB in the beginning and 1.1 GB in the end (delta: -813.1 MB). Peak memory consumption was 487.2 MB. Max. memory is 3.6 GB. [2018-06-24 20:29:58,839 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:29:58,840 INFO ]: ChcToBoogie took 106.59 ms. Allocated memory is still 308.8 MB. Free memory was 247.3 MB in the beginning and 243.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:29:58,840 INFO ]: Boogie Preprocessor took 82.36 ms. Allocated memory is still 308.8 MB. Free memory was 243.3 MB in the beginning and 241.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-24 20:29:58,840 INFO ]: RCFGBuilder took 1711.75 ms. Allocated memory was 308.8 MB in the beginning and 324.5 MB in the end (delta: 15.7 MB). Free memory was 241.2 MB in the beginning and 278.2 MB in the end (delta: -37.0 MB). Peak memory consumption was 59.7 MB. Max. memory is 3.6 GB. [2018-06-24 20:29:58,849 INFO ]: BlockEncodingV2 took 787.77 ms. Allocated memory is still 324.5 MB. Free memory was 278.2 MB in the beginning and 230.2 MB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:29:58,850 INFO ]: TraceAbstraction took 52179.15 ms. Allocated memory was 324.5 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 230.2 MB in the beginning and 1.1 GB in the end (delta: -830.1 MB). Peak memory consumption was 454.4 MB. Max. memory is 3.6 GB. [2018-06-24 20:29:58,853 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 145 locations, 279 edges - StatisticsResult: Encoded RCFG 135 locations, 268 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 106.59 ms. Allocated memory is still 308.8 MB. Free memory was 247.3 MB in the beginning and 243.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 82.36 ms. Allocated memory is still 308.8 MB. Free memory was 243.3 MB in the beginning and 241.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1711.75 ms. Allocated memory was 308.8 MB in the beginning and 324.5 MB in the end (delta: 15.7 MB). Free memory was 241.2 MB in the beginning and 278.2 MB in the end (delta: -37.0 MB). Peak memory consumption was 59.7 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 787.77 ms. Allocated memory is still 324.5 MB. Free memory was 278.2 MB in the beginning and 230.2 MB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 52179.15 ms. Allocated memory was 324.5 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 230.2 MB in the beginning and 1.1 GB in the end (delta: -830.1 MB). Peak memory consumption was 454.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (2359states) and interpolant automaton (currently 11 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (1676 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 135 locations, 1 error locations. TIMEOUT Result, 52.1s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 40.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6494 SDtfs, 1359 SDslu, 11271 SDs, 0 SdLazy, 26501 SolverSat, 4524 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2359occurred 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: 7.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 4069 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 1329 SizeOfPredicates, 4 NumberOfNonLiveVariables, 485 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 16/18 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.32.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-29-58-866.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/graham-scan-full.32.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-29-58-866.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/graham-scan-full.32.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-29-58-866.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/graham-scan-full.32.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-29-58-866.csv Completed graceful shutdown