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/fortune-half.24.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:27:00,850 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:27:00,852 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:27:00,865 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:27:00,865 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:27:00,866 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:27:00,867 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:27:00,875 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:27:00,879 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:27:00,879 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:27:00,882 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:27:00,882 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:27:00,883 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:27:00,884 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:27:00,887 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:27:00,887 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:27:00,888 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:27:00,901 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:27:00,903 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:27:00,904 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:27:00,905 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:27:00,906 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:27:00,908 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:27:00,908 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:27:00,908 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:27:00,909 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:27:00,910 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:27:00,910 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:27:00,911 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:27:00,912 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:27:00,912 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:27:00,913 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:27:00,913 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:27:00,913 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:27:00,914 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:27:00,914 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:27:00,915 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 17:27:00,928 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:27:00,928 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:27:00,928 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:27:00,928 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:27:00,929 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:27:00,929 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:27:00,930 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:27:00,930 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:27:00,930 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:27:00,930 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:27:00,930 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:27:00,931 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:27:00,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:27:00,931 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:27:00,931 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:27:00,931 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:27:00,932 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:27:00,932 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:27:00,932 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:27:00,932 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:27:00,932 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:27:00,934 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:27:00,934 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:27:00,987 INFO ]: Repository-Root is: /tmp [2018-06-26 17:27:01,000 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:27:01,003 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:27:01,005 INFO ]: Initializing SmtParser... [2018-06-26 17:27:01,005 INFO ]: SmtParser initialized [2018-06-26 17:27:01,006 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-half.24.smt2 [2018-06-26 17:27:01,007 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-26 17:27:01,101 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-half.24.smt2 unknown [2018-06-26 17:27:01,599 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-half.24.smt2 [2018-06-26 17:27:01,604 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:27:01,609 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:27:01,610 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:27:01,610 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:27:01,610 INFO ]: ChcToBoogie initialized [2018-06-26 17:27:01,613 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:27:01" (1/1) ... [2018-06-26 17:27:01,696 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:27:01 Unit [2018-06-26 17:27:01,696 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:27:01,697 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:27:01,697 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:27:01,697 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:27:01,720 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:27:01" (1/1) ... [2018-06-26 17:27:01,720 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:27:01" (1/1) ... [2018-06-26 17:27:01,735 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:27:01" (1/1) ... [2018-06-26 17:27:01,735 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:27:01" (1/1) ... [2018-06-26 17:27:01,750 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:27:01" (1/1) ... [2018-06-26 17:27:01,754 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:27:01" (1/1) ... [2018-06-26 17:27:01,757 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:27:01" (1/1) ... [2018-06-26 17:27:01,762 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:27:01,762 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:27:01,762 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:27:01,762 INFO ]: RCFGBuilder initialized [2018-06-26 17:27:01,763 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:27:01" (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-26 17:27:01,775 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:27:01,775 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:27:01,775 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:27:01,775 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:27:01,775 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:27:01,775 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-26 17:27:03,075 INFO ]: Using library mode [2018-06-26 17:27:03,077 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:27:03 BoogieIcfgContainer [2018-06-26 17:27:03,077 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:27:03,077 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:27:03,077 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:27:03,078 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:27:03,079 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:27:03" (1/1) ... [2018-06-26 17:27:03,126 INFO ]: Initial Icfg 144 locations, 278 edges [2018-06-26 17:27:03,127 INFO ]: Using Remove infeasible edges [2018-06-26 17:27:03,129 INFO ]: Using Maximize final states [2018-06-26 17:27:03,129 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:27:03,129 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:27:03,131 INFO ]: Using Remove sink states [2018-06-26 17:27:03,134 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:27:03,134 INFO ]: Using Use SBE [2018-06-26 17:27:03,146 INFO ]: SBE split 0 edges [2018-06-26 17:27:03,152 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-26 17:27:03,153 INFO ]: 0 new accepting states [2018-06-26 17:27:03,944 INFO ]: Removed 53 edges and 8 locations by large block encoding [2018-06-26 17:27:03,948 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-26 17:27:03,954 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:27:03,954 INFO ]: 0 new accepting states [2018-06-26 17:27:03,959 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:27:03,960 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:27:03,962 INFO ]: Encoded RCFG 133 locations, 266 edges [2018-06-26 17:27:03,967 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:27:03 BasicIcfg [2018-06-26 17:27:03,967 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:27:03,968 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:27:03,968 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:27:03,971 INFO ]: TraceAbstraction initialized [2018-06-26 17:27:03,971 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:27:01" (1/4) ... [2018-06-26 17:27:03,972 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ecb68e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:27:03, skipping insertion in model container [2018-06-26 17:27:03,972 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:27:01" (2/4) ... [2018-06-26 17:27:03,972 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ecb68e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:27:03, skipping insertion in model container [2018-06-26 17:27:03,973 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:27:03" (3/4) ... [2018-06-26 17:27:03,973 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ecb68e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:27:03, skipping insertion in model container [2018-06-26 17:27:03,973 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:27:03" (4/4) ... [2018-06-26 17:27:03,975 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:27:03,984 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:27:03,991 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:27:04,040 INFO ]: Using default assertion order modulation [2018-06-26 17:27:04,041 INFO ]: Interprodecural is true [2018-06-26 17:27:04,041 INFO ]: Hoare is false [2018-06-26 17:27:04,041 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:27:04,041 INFO ]: Backedges is TWOTRACK [2018-06-26 17:27:04,041 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:27:04,041 INFO ]: Difference is false [2018-06-26 17:27:04,041 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:27:04,041 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:27:04,062 INFO ]: Start isEmpty. Operand 133 states. [2018-06-26 17:27:04,127 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-26 17:27:04,127 INFO ]: Found error trace [2018-06-26 17:27:04,128 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-26 17:27:04,128 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:27:04,133 INFO ]: Analyzing trace with hash 5575794, now seen corresponding path program 1 times [2018-06-26 17:27:04,135 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:27:04,135 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:27:04,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:27:04,186 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:27:04,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:27:04,272 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:27:04,416 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:27:04,418 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:27:04,418 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:27:04,419 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:27:04,429 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:27:04,429 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:27:04,431 INFO ]: Start difference. First operand 133 states. Second operand 3 states. [2018-06-26 17:27:06,887 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:27:06,887 INFO ]: Finished difference Result 263 states and 529 transitions. [2018-06-26 17:27:06,888 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:27:06,889 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-26 17:27:06,889 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:27:06,923 INFO ]: With dead ends: 263 [2018-06-26 17:27:06,923 INFO ]: Without dead ends: 263 [2018-06-26 17:27:06,924 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-26 17:27:06,943 INFO ]: Start minimizeSevpa. Operand 263 states. [2018-06-26 17:27:07,055 INFO ]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-06-26 17:27:07,056 INFO ]: Start removeUnreachable. Operand 263 states. [2018-06-26 17:27:07,074 INFO ]: Finished removeUnreachable. Reduced from 263 states to 263 states and 529 transitions. [2018-06-26 17:27:07,075 INFO ]: Start accepts. Automaton has 263 states and 529 transitions. Word has length 4 [2018-06-26 17:27:07,077 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:27:07,077 INFO ]: Abstraction has 263 states and 529 transitions. [2018-06-26 17:27:07,077 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:27:07,077 INFO ]: Start isEmpty. Operand 263 states and 529 transitions. [2018-06-26 17:27:07,102 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:27:07,102 INFO ]: Found error trace [2018-06-26 17:27:07,102 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:27:07,102 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:27:07,102 INFO ]: Analyzing trace with hash 840082756, now seen corresponding path program 1 times [2018-06-26 17:27:07,102 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:27:07,102 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:27:07,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:27:07,103 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:27:07,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:27:07,134 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:27:07,221 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:27:07,221 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:27:07,221 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:27:07,223 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:27:07,223 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:27:07,223 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:27:07,223 INFO ]: Start difference. First operand 263 states and 529 transitions. Second operand 3 states. [2018-06-26 17:27:08,655 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:27:08,655 INFO ]: Finished difference Result 393 states and 788 transitions. [2018-06-26 17:27:08,656 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:27:08,656 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 17:27:08,656 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:27:08,674 INFO ]: With dead ends: 393 [2018-06-26 17:27:08,674 INFO ]: Without dead ends: 393 [2018-06-26 17:27:08,675 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-26 17:27:08,675 INFO ]: Start minimizeSevpa. Operand 393 states. [2018-06-26 17:27:08,783 INFO ]: Finished minimizeSevpa. Reduced states from 393 to 393. [2018-06-26 17:27:08,783 INFO ]: Start removeUnreachable. Operand 393 states. [2018-06-26 17:27:08,798 INFO ]: Finished removeUnreachable. Reduced from 393 states to 393 states and 788 transitions. [2018-06-26 17:27:08,799 INFO ]: Start accepts. Automaton has 393 states and 788 transitions. Word has length 8 [2018-06-26 17:27:08,799 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:27:08,799 INFO ]: Abstraction has 393 states and 788 transitions. [2018-06-26 17:27:08,799 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:27:08,799 INFO ]: Start isEmpty. Operand 393 states and 788 transitions. [2018-06-26 17:27:08,842 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:27:08,842 INFO ]: Found error trace [2018-06-26 17:27:08,842 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:27:08,842 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:27:08,843 INFO ]: Analyzing trace with hash -530673979, now seen corresponding path program 1 times [2018-06-26 17:27:08,843 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:27:08,843 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:27:08,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:27:08,844 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:27:08,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:27:08,881 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:27:09,066 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:27:09,067 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:27:09,127 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:27:09,128 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:27:09,128 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:27:09,128 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:27:09,128 INFO ]: Start difference. First operand 393 states and 788 transitions. Second operand 5 states. [2018-06-26 17:27:13,520 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:27:13,520 INFO ]: Finished difference Result 837 states and 2820 transitions. [2018-06-26 17:27:13,520 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:27:13,521 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:27:13,521 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:27:13,608 INFO ]: With dead ends: 837 [2018-06-26 17:27:13,608 INFO ]: Without dead ends: 833 [2018-06-26 17:27:13,609 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-26 17:27:13,609 INFO ]: Start minimizeSevpa. Operand 833 states. [2018-06-26 17:27:13,993 INFO ]: Finished minimizeSevpa. Reduced states from 833 to 605. [2018-06-26 17:27:13,993 INFO ]: Start removeUnreachable. Operand 605 states. [2018-06-26 17:27:14,014 INFO ]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1688 transitions. [2018-06-26 17:27:14,014 INFO ]: Start accepts. Automaton has 605 states and 1688 transitions. Word has length 9 [2018-06-26 17:27:14,014 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:27:14,014 INFO ]: Abstraction has 605 states and 1688 transitions. [2018-06-26 17:27:14,014 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:27:14,014 INFO ]: Start isEmpty. Operand 605 states and 1688 transitions. [2018-06-26 17:27:14,041 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:27:14,041 INFO ]: Found error trace [2018-06-26 17:27:14,041 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:27:14,041 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:27:14,043 INFO ]: Analyzing trace with hash -529750458, now seen corresponding path program 1 times [2018-06-26 17:27:14,043 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:27:14,043 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:27:14,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:27:14,044 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:27:14,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:27:14,073 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:27:14,437 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:27:14,437 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:27:14,437 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:27:14,437 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:27:14,437 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:27:14,437 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:27:14,437 INFO ]: Start difference. First operand 605 states and 1688 transitions. Second operand 5 states. [2018-06-26 17:27:19,816 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:27:19,816 INFO ]: Finished difference Result 1156 states and 4689 transitions. [2018-06-26 17:27:19,836 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:27:19,836 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:27:19,836 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:27:19,976 INFO ]: With dead ends: 1156 [2018-06-26 17:27:19,976 INFO ]: Without dead ends: 1151 [2018-06-26 17:27:19,976 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:27:19,977 INFO ]: Start minimizeSevpa. Operand 1151 states. [2018-06-26 17:27:20,575 INFO ]: Finished minimizeSevpa. Reduced states from 1151 to 846. [2018-06-26 17:27:20,576 INFO ]: Start removeUnreachable. Operand 846 states. [2018-06-26 17:27:20,607 INFO ]: Finished removeUnreachable. Reduced from 846 states to 846 states and 2949 transitions. [2018-06-26 17:27:20,608 INFO ]: Start accepts. Automaton has 846 states and 2949 transitions. Word has length 9 [2018-06-26 17:27:20,608 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:27:20,608 INFO ]: Abstraction has 846 states and 2949 transitions. [2018-06-26 17:27:20,608 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:27:20,608 INFO ]: Start isEmpty. Operand 846 states and 2949 transitions. [2018-06-26 17:27:20,644 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:27:20,644 INFO ]: Found error trace [2018-06-26 17:27:20,644 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:27:20,644 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:27:20,645 INFO ]: Analyzing trace with hash -528826937, now seen corresponding path program 1 times [2018-06-26 17:27:20,645 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:27:20,645 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:27:20,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:27:20,646 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:27:20,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:27:20,676 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:27:20,733 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:27:20,734 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:27:20,734 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:27:20,734 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:27:20,734 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:27:20,734 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:27:20,734 INFO ]: Start difference. First operand 846 states and 2949 transitions. Second operand 5 states. [2018-06-26 17:27:24,199 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:27:24,199 INFO ]: Finished difference Result 1597 states and 8783 transitions. [2018-06-26 17:27:24,199 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:27:24,199 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:27:24,199 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:27:24,378 INFO ]: With dead ends: 1597 [2018-06-26 17:27:24,379 INFO ]: Without dead ends: 1591 [2018-06-26 17:27:24,379 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-26 17:27:24,379 INFO ]: Start minimizeSevpa. Operand 1591 states. [2018-06-26 17:27:25,317 INFO ]: Finished minimizeSevpa. Reduced states from 1591 to 1184. [2018-06-26 17:27:25,317 INFO ]: Start removeUnreachable. Operand 1184 states. [2018-06-26 17:27:25,387 INFO ]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 5825 transitions. [2018-06-26 17:27:25,387 INFO ]: Start accepts. Automaton has 1184 states and 5825 transitions. Word has length 9 [2018-06-26 17:27:25,387 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:27:25,387 INFO ]: Abstraction has 1184 states and 5825 transitions. [2018-06-26 17:27:25,387 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:27:25,387 INFO ]: Start isEmpty. Operand 1184 states and 5825 transitions. [2018-06-26 17:27:25,441 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:27:25,441 INFO ]: Found error trace [2018-06-26 17:27:25,441 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:27:25,442 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:27:25,442 INFO ]: Analyzing trace with hash -498350744, now seen corresponding path program 1 times [2018-06-26 17:27:25,442 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:27:25,442 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:27:25,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:27:25,443 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:27:25,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:27:25,462 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:27:25,548 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:27:25,548 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:27:25,548 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:27:25,548 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:27:25,548 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:27:25,548 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:27:25,548 INFO ]: Start difference. First operand 1184 states and 5825 transitions. Second operand 3 states. [2018-06-26 17:27:27,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:27:27,118 INFO ]: Finished difference Result 1928 states and 8544 transitions. [2018-06-26 17:27:27,119 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:27:27,119 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 17:27:27,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:27:27,240 INFO ]: With dead ends: 1928 [2018-06-26 17:27:27,240 INFO ]: Without dead ends: 1928 [2018-06-26 17:27:27,241 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-26 17:27:27,242 INFO ]: Start minimizeSevpa. Operand 1928 states. [2018-06-26 17:27:27,968 INFO ]: Finished minimizeSevpa. Reduced states from 1928 to 1928. [2018-06-26 17:27:27,968 INFO ]: Start removeUnreachable. Operand 1928 states. [2018-06-26 17:27:28,105 INFO ]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 8544 transitions. [2018-06-26 17:27:28,105 INFO ]: Start accepts. Automaton has 1928 states and 8544 transitions. Word has length 9 [2018-06-26 17:27:28,105 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:27:28,105 INFO ]: Abstraction has 1928 states and 8544 transitions. [2018-06-26 17:27:28,105 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:27:28,105 INFO ]: Start isEmpty. Operand 1928 states and 8544 transitions. [2018-06-26 17:27:28,169 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:27:28,169 INFO ]: Found error trace [2018-06-26 17:27:28,169 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:27:28,169 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:27:28,169 INFO ]: Analyzing trace with hash -1107498982, now seen corresponding path program 1 times [2018-06-26 17:27:28,169 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:27:28,169 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:27:28,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:27:28,170 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:27:28,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:27:28,191 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:27:28,438 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:27:28,439 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:27:28,439 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:27:28,439 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:27:28,439 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:27:28,439 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:27:28,439 INFO ]: Start difference. First operand 1928 states and 8544 transitions. Second operand 5 states. [2018-06-26 17:27:29,918 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:27:29,918 INFO ]: Finished difference Result 3170 states and 16458 transitions. [2018-06-26 17:27:29,962 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:27:29,962 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:27:29,962 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:27:30,227 INFO ]: With dead ends: 3170 [2018-06-26 17:27:30,227 INFO ]: Without dead ends: 3170 [2018-06-26 17:27:30,227 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-26 17:27:30,228 INFO ]: Start minimizeSevpa. Operand 3170 states. [2018-06-26 17:27:31,368 INFO ]: Finished minimizeSevpa. Reduced states from 3170 to 2613. [2018-06-26 17:27:31,368 INFO ]: Start removeUnreachable. Operand 2613 states. [2018-06-26 17:27:31,505 INFO ]: Finished removeUnreachable. Reduced from 2613 states to 2613 states and 11415 transitions. [2018-06-26 17:27:31,505 INFO ]: Start accepts. Automaton has 2613 states and 11415 transitions. Word has length 9 [2018-06-26 17:27:31,505 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:27:31,505 INFO ]: Abstraction has 2613 states and 11415 transitions. [2018-06-26 17:27:31,505 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:27:31,505 INFO ]: Start isEmpty. Operand 2613 states and 11415 transitions. [2018-06-26 17:27:31,588 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:27:31,588 INFO ]: Found error trace [2018-06-26 17:27:31,588 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:27:31,588 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:27:31,588 INFO ]: Analyzing trace with hash -927895494, now seen corresponding path program 1 times [2018-06-26 17:27:31,588 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:27:31,588 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:27:31,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:27:31,590 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:27:31,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:27:31,608 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:27:31,705 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:27:31,706 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:27:31,706 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:27:31,706 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:27:31,706 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:27:31,706 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:27:31,706 INFO ]: Start difference. First operand 2613 states and 11415 transitions. Second operand 6 states. [2018-06-26 17:27:38,308 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:27:38,308 INFO ]: Finished difference Result 5232 states and 29698 transitions. [2018-06-26 17:27:38,308 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:27:38,308 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:27:38,308 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:27:38,980 INFO ]: With dead ends: 5232 [2018-06-26 17:27:38,980 INFO ]: Without dead ends: 5090 [2018-06-26 17:27:38,980 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-26 17:27:38,983 INFO ]: Start minimizeSevpa. Operand 5090 states. [2018-06-26 17:27:41,134 INFO ]: Finished minimizeSevpa. Reduced states from 5090 to 3010. [2018-06-26 17:27:41,134 INFO ]: Start removeUnreachable. Operand 3010 states. [2018-06-26 17:27:41,494 INFO ]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 13093 transitions. [2018-06-26 17:27:41,495 INFO ]: Start accepts. Automaton has 3010 states and 13093 transitions. Word has length 10 [2018-06-26 17:27:41,495 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:27:41,495 INFO ]: Abstraction has 3010 states and 13093 transitions. [2018-06-26 17:27:41,495 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:27:41,495 INFO ]: Start isEmpty. Operand 3010 states and 13093 transitions. [2018-06-26 17:27:41,525 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:27:41,525 INFO ]: Found error trace [2018-06-26 17:27:41,525 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:27:41,525 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:27:41,526 INFO ]: Analyzing trace with hash -899266343, now seen corresponding path program 1 times [2018-06-26 17:27:41,526 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:27:41,526 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:27:41,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:27:41,526 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:27:41,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:27:41,542 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:27:41,730 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:27:41,731 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:27:41,731 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:27:41,731 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:27:41,731 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:27:41,731 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:27:41,731 INFO ]: Start difference. First operand 3010 states and 13093 transitions. Second operand 6 states. [2018-06-26 17:27:48,502 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:27:48,502 INFO ]: Finished difference Result 8083 states and 45438 transitions. [2018-06-26 17:27:48,503 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:27:48,503 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:27:48,503 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:27:52,291 INFO ]: With dead ends: 8083 [2018-06-26 17:27:52,291 INFO ]: Without dead ends: 8083 [2018-06-26 17:27:52,292 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:27:52,295 INFO ]: Start minimizeSevpa. Operand 8083 states. [2018-06-26 17:27:54,613 INFO ]: Finished minimizeSevpa. Reduced states from 8083 to 5830. [2018-06-26 17:27:54,613 INFO ]: Start removeUnreachable. Operand 5830 states. [2018-06-26 17:27:55,173 INFO ]: Finished removeUnreachable. Reduced from 5830 states to 5830 states and 24619 transitions. [2018-06-26 17:27:55,173 INFO ]: Start accepts. Automaton has 5830 states and 24619 transitions. Word has length 10 [2018-06-26 17:27:55,173 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:27:55,173 INFO ]: Abstraction has 5830 states and 24619 transitions. [2018-06-26 17:27:55,173 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:27:55,173 INFO ]: Start isEmpty. Operand 5830 states and 24619 transitions. [2018-06-26 17:27:55,217 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:27:55,217 INFO ]: Found error trace [2018-06-26 17:27:55,217 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:27:55,217 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:27:55,219 INFO ]: Analyzing trace with hash -870637192, now seen corresponding path program 1 times [2018-06-26 17:27:55,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:27:55,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:27:55,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:27:55,219 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:27:55,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:27:55,232 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:27:55,302 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:27:55,302 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:27:55,302 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:27:55,302 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:27:55,302 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:27:55,302 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:27:55,302 INFO ]: Start difference. First operand 5830 states and 24619 transitions. Second operand 6 states. Received shutdown request... [2018-06-26 17:27:58,936 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:27:58,937 WARN ]: Verification canceled [2018-06-26 17:27:58,939 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:27:58,940 WARN ]: Timeout [2018-06-26 17:27:58,940 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:27:58 BasicIcfg [2018-06-26 17:27:58,940 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:27:58,941 INFO ]: Toolchain (without parser) took 57336.53 ms. Allocated memory was 309.9 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 249.2 MB in the beginning and 912.3 MB in the end (delta: -663.1 MB). Peak memory consumption was 844.3 MB. Max. memory is 3.6 GB. [2018-06-26 17:27:58,942 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 309.9 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:27:58,942 INFO ]: ChcToBoogie took 86.73 ms. Allocated memory is still 309.9 MB. Free memory was 248.2 MB in the beginning and 245.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:27:58,943 INFO ]: Boogie Preprocessor took 64.98 ms. Allocated memory is still 309.9 MB. Free memory was 245.2 MB in the beginning and 243.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:27:58,943 INFO ]: RCFGBuilder took 1314.39 ms. Allocated memory was 309.9 MB in the beginning and 325.1 MB in the end (delta: 15.2 MB). Free memory was 243.2 MB in the beginning and 279.2 MB in the end (delta: -36.0 MB). Peak memory consumption was 60.6 MB. Max. memory is 3.6 GB. [2018-06-26 17:27:58,944 INFO ]: BlockEncodingV2 took 889.67 ms. Allocated memory is still 325.1 MB. Free memory was 279.2 MB in the beginning and 239.7 MB in the end (delta: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 3.6 GB. [2018-06-26 17:27:58,944 INFO ]: TraceAbstraction took 54972.43 ms. Allocated memory was 325.1 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 239.7 MB in the beginning and 912.3 MB in the end (delta: -672.6 MB). Peak memory consumption was 819.5 MB. Max. memory is 3.6 GB. [2018-06-26 17:27:58,947 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 144 locations, 278 edges - StatisticsResult: Encoded RCFG 133 locations, 266 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 309.9 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 86.73 ms. Allocated memory is still 309.9 MB. Free memory was 248.2 MB in the beginning and 245.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 64.98 ms. Allocated memory is still 309.9 MB. Free memory was 245.2 MB in the beginning and 243.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1314.39 ms. Allocated memory was 309.9 MB in the beginning and 325.1 MB in the end (delta: 15.2 MB). Free memory was 243.2 MB in the beginning and 279.2 MB in the end (delta: -36.0 MB). Peak memory consumption was 60.6 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 889.67 ms. Allocated memory is still 325.1 MB. Free memory was 279.2 MB in the beginning and 239.7 MB in the end (delta: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54972.43 ms. Allocated memory was 325.1 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 239.7 MB in the beginning and 912.3 MB in the end (delta: -672.6 MB). Peak memory consumption was 819.5 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 (5830states) and interpolant automaton (currently 11 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (5615 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 133 locations, 1 error locations. TIMEOUT Result, 54.9s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 42.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6202 SDtfs, 1109 SDslu, 8267 SDs, 0 SdLazy, 22346 SolverSat, 4134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5830occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 9.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 5830 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 1537 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 18/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/fortune-half.24.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-27-58-958.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-half.24.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-27-58-958.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-half.24.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-27-58-958.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-half.24.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-27-58-958.csv Completed graceful shutdown