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-full.12.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:21:01,154 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:21:01,156 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:21:01,166 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:21:01,167 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:21:01,168 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:21:01,169 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:21:01,171 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:21:01,172 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:21:01,173 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:21:01,174 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:21:01,174 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:21:01,175 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:21:01,176 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:21:01,176 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:21:01,177 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:21:01,182 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:21:01,184 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:21:01,185 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:21:01,196 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:21:01,197 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:21:01,199 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:21:01,199 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:21:01,199 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:21:01,200 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:21:01,201 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:21:01,202 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:21:01,202 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:21:01,203 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:21:01,204 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:21:01,210 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:21:01,211 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:21:01,211 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:21:01,212 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:21:01,213 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:21:01,213 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:21:01,228 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:21:01,229 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:21:01,229 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:21:01,229 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:21:01,230 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:21:01,230 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:21:01,230 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:21:01,231 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:21:01,231 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:21:01,231 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:21:01,231 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:21:01,231 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:21:01,232 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:21:01,232 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:21:01,233 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:21:01,233 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:21:01,233 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:21:01,233 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:21:01,233 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:21:01,234 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:21:01,234 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:21:01,235 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:21:01,235 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:21:01,291 INFO ]: Repository-Root is: /tmp [2018-06-24 20:21:01,310 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:21:01,315 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:21:01,316 INFO ]: Initializing SmtParser... [2018-06-24 20:21:01,316 INFO ]: SmtParser initialized [2018-06-24 20:21:01,317 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.12.smt2 [2018-06-24 20:21:01,318 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:21:01,410 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.12.smt2 unknown [2018-06-24 20:21:02,362 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.12.smt2 [2018-06-24 20:21:02,367 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:21:02,381 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:21:02,382 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:21:02,382 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:21:02,382 INFO ]: ChcToBoogie initialized [2018-06-24 20:21:02,385 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:21:02" (1/1) ... [2018-06-24 20:21:02,513 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:21:02 Unit [2018-06-24 20:21:02,513 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:21:02,514 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:21:02,514 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:21:02,514 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:21:02,535 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:21:02" (1/1) ... [2018-06-24 20:21:02,535 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:21:02" (1/1) ... [2018-06-24 20:21:02,567 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:21:02" (1/1) ... [2018-06-24 20:21:02,567 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:21:02" (1/1) ... [2018-06-24 20:21:02,603 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:21:02" (1/1) ... [2018-06-24 20:21:02,612 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:21:02" (1/1) ... [2018-06-24 20:21:02,623 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:21:02" (1/1) ... [2018-06-24 20:21:02,640 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:21:02,641 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:21:02,641 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:21:02,641 INFO ]: RCFGBuilder initialized [2018-06-24 20:21:02,642 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:21:02" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 20:21:02,661 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:21:02,661 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:21:02,661 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:21:02,661 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:21:02,661 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:21:02,661 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:21:04,974 INFO ]: Using library mode [2018-06-24 20:21:04,975 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:21:04 BoogieIcfgContainer [2018-06-24 20:21:04,975 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:21:04,975 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:21:04,975 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:21:04,976 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:21:04,977 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:21:04" (1/1) ... [2018-06-24 20:21:05,022 INFO ]: Initial Icfg 144 locations, 281 edges [2018-06-24 20:21:05,024 INFO ]: Using Remove infeasible edges [2018-06-24 20:21:05,024 INFO ]: Using Maximize final states [2018-06-24 20:21:05,026 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:21:05,026 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:21:05,028 INFO ]: Using Remove sink states [2018-06-24 20:21:05,028 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:21:05,028 INFO ]: Using Use SBE [2018-06-24 20:21:05,055 INFO ]: SBE split 0 edges [2018-06-24 20:21:05,068 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 20:21:05,070 INFO ]: 0 new accepting states [2018-06-24 20:21:06,195 INFO ]: Removed 59 edges and 8 locations by large block encoding [2018-06-24 20:21:06,198 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-24 20:21:06,201 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:21:06,202 INFO ]: 0 new accepting states [2018-06-24 20:21:06,204 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:21:06,205 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:21:06,207 INFO ]: Encoded RCFG 133 locations, 269 edges [2018-06-24 20:21:06,208 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:21:06 BasicIcfg [2018-06-24 20:21:06,208 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:21:06,209 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:21:06,209 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:21:06,212 INFO ]: TraceAbstraction initialized [2018-06-24 20:21:06,212 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:21:02" (1/4) ... [2018-06-24 20:21:06,213 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ce20f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:21:06, skipping insertion in model container [2018-06-24 20:21:06,213 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:21:02" (2/4) ... [2018-06-24 20:21:06,213 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ce20f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:21:06, skipping insertion in model container [2018-06-24 20:21:06,214 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:21:04" (3/4) ... [2018-06-24 20:21:06,214 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ce20f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:21:06, skipping insertion in model container [2018-06-24 20:21:06,214 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:21:06" (4/4) ... [2018-06-24 20:21:06,216 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:21:06,225 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:21:06,233 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:21:06,276 INFO ]: Using default assertion order modulation [2018-06-24 20:21:06,277 INFO ]: Interprodecural is true [2018-06-24 20:21:06,277 INFO ]: Hoare is false [2018-06-24 20:21:06,277 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:21:06,277 INFO ]: Backedges is TWOTRACK [2018-06-24 20:21:06,277 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:21:06,277 INFO ]: Difference is false [2018-06-24 20:21:06,277 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:21:06,277 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:21:06,293 INFO ]: Start isEmpty. Operand 133 states. [2018-06-24 20:21:06,364 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 20:21:06,364 INFO ]: Found error trace [2018-06-24 20:21:06,365 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 20:21:06,365 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:21:06,370 INFO ]: Analyzing trace with hash 5761552, now seen corresponding path program 1 times [2018-06-24 20:21:06,372 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:21:06,373 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:21:06,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:06,423 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:21:06,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:06,573 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:21:06,873 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:21:06,875 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:21:06,875 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:21:06,877 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:21:06,892 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:21:06,893 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:21:06,895 INFO ]: Start difference. First operand 133 states. Second operand 3 states. [2018-06-24 20:21:08,565 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:21:08,566 INFO ]: Finished difference Result 134 states and 366 transitions. [2018-06-24 20:21:08,566 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:21:08,567 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 20:21:08,568 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:21:08,602 INFO ]: With dead ends: 134 [2018-06-24 20:21:08,602 INFO ]: Without dead ends: 134 [2018-06-24 20:21:08,604 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:21:08,622 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-24 20:21:08,742 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-06-24 20:21:08,743 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-24 20:21:08,755 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 366 transitions. [2018-06-24 20:21:08,756 INFO ]: Start accepts. Automaton has 134 states and 366 transitions. Word has length 4 [2018-06-24 20:21:08,757 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:21:08,757 INFO ]: Abstraction has 134 states and 366 transitions. [2018-06-24 20:21:08,757 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:21:08,757 INFO ]: Start isEmpty. Operand 134 states and 366 transitions. [2018-06-24 20:21:08,768 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:21:08,768 INFO ]: Found error trace [2018-06-24 20:21:08,768 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:21:08,768 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:21:08,768 INFO ]: Analyzing trace with hash 177706555, now seen corresponding path program 1 times [2018-06-24 20:21:08,768 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:21:08,768 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:21:08,769 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:08,769 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:21:08,769 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:08,790 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:21:08,920 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:21:08,920 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:21:08,920 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:21:08,922 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:21:08,922 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:21:08,922 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:21:08,922 INFO ]: Start difference. First operand 134 states and 366 transitions. Second operand 3 states. [2018-06-24 20:21:10,543 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:21:10,543 INFO ]: Finished difference Result 264 states and 591 transitions. [2018-06-24 20:21:10,544 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:21:10,544 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:21:10,544 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:21:10,567 INFO ]: With dead ends: 264 [2018-06-24 20:21:10,567 INFO ]: Without dead ends: 264 [2018-06-24 20:21:10,568 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:21:10,568 INFO ]: Start minimizeSevpa. Operand 264 states. [2018-06-24 20:21:10,651 INFO ]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-06-24 20:21:10,651 INFO ]: Start removeUnreachable. Operand 264 states. [2018-06-24 20:21:10,666 INFO ]: Finished removeUnreachable. Reduced from 264 states to 264 states and 591 transitions. [2018-06-24 20:21:10,666 INFO ]: Start accepts. Automaton has 264 states and 591 transitions. Word has length 5 [2018-06-24 20:21:10,667 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:21:10,667 INFO ]: Abstraction has 264 states and 591 transitions. [2018-06-24 20:21:10,667 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:21:10,667 INFO ]: Start isEmpty. Operand 264 states and 591 transitions. [2018-06-24 20:21:10,678 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:21:10,678 INFO ]: Found error trace [2018-06-24 20:21:10,678 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:21:10,678 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:21:10,678 INFO ]: Analyzing trace with hash 177744034, now seen corresponding path program 1 times [2018-06-24 20:21:10,678 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:21:10,678 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:21:10,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:10,679 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:21:10,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:10,705 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:21:10,821 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:21:10,821 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:21:10,822 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:21:10,822 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:21:10,822 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:21:10,822 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:21:10,822 INFO ]: Start difference. First operand 264 states and 591 transitions. Second operand 3 states. [2018-06-24 20:21:12,036 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:21:12,036 INFO ]: Finished difference Result 394 states and 801 transitions. [2018-06-24 20:21:12,145 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:21:12,146 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:21:12,146 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:21:12,165 INFO ]: With dead ends: 394 [2018-06-24 20:21:12,165 INFO ]: Without dead ends: 394 [2018-06-24 20:21:12,165 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:21:12,166 INFO ]: Start minimizeSevpa. Operand 394 states. [2018-06-24 20:21:12,237 INFO ]: Finished minimizeSevpa. Reduced states from 394 to 394. [2018-06-24 20:21:12,238 INFO ]: Start removeUnreachable. Operand 394 states. [2018-06-24 20:21:12,252 INFO ]: Finished removeUnreachable. Reduced from 394 states to 394 states and 801 transitions. [2018-06-24 20:21:12,252 INFO ]: Start accepts. Automaton has 394 states and 801 transitions. Word has length 5 [2018-06-24 20:21:12,252 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:21:12,253 INFO ]: Abstraction has 394 states and 801 transitions. [2018-06-24 20:21:12,253 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:21:12,253 INFO ]: Start isEmpty. Operand 394 states and 801 transitions. [2018-06-24 20:21:12,275 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:21:12,275 INFO ]: Found error trace [2018-06-24 20:21:12,275 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:21:12,275 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:21:12,275 INFO ]: Analyzing trace with hash 1894732814, now seen corresponding path program 1 times [2018-06-24 20:21:12,275 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:21:12,275 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:21:12,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:12,276 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:21:12,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:12,328 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:21:12,470 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:21:12,470 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:21:12,470 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:21:12,471 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:21:12,471 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:21:12,471 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:21:12,471 INFO ]: Start difference. First operand 394 states and 801 transitions. Second operand 5 states. [2018-06-24 20:21:15,436 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:21:15,436 INFO ]: Finished difference Result 796 states and 2041 transitions. [2018-06-24 20:21:15,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:21:15,437 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:21:15,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:21:15,521 INFO ]: With dead ends: 796 [2018-06-24 20:21:15,521 INFO ]: Without dead ends: 792 [2018-06-24 20:21:15,522 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:21:15,522 INFO ]: Start minimizeSevpa. Operand 792 states. [2018-06-24 20:21:15,702 INFO ]: Finished minimizeSevpa. Reduced states from 792 to 614. [2018-06-24 20:21:15,702 INFO ]: Start removeUnreachable. Operand 614 states. [2018-06-24 20:21:15,727 INFO ]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1387 transitions. [2018-06-24 20:21:15,727 INFO ]: Start accepts. Automaton has 614 states and 1387 transitions. Word has length 9 [2018-06-24 20:21:15,728 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:21:15,728 INFO ]: Abstraction has 614 states and 1387 transitions. [2018-06-24 20:21:15,728 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:21:15,728 INFO ]: Start isEmpty. Operand 614 states and 1387 transitions. [2018-06-24 20:21:15,853 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:21:15,854 INFO ]: Found error trace [2018-06-24 20:21:15,854 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:21:15,854 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:21:15,854 INFO ]: Analyzing trace with hash -531505585, now seen corresponding path program 1 times [2018-06-24 20:21:15,854 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:21:15,854 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:21:15,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:15,855 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:21:15,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:15,930 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:21:16,259 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:21:16,260 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:21:16,260 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:21:16,260 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:21:16,260 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:21:16,260 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:21:16,260 INFO ]: Start difference. First operand 614 states and 1387 transitions. Second operand 5 states. [2018-06-24 20:21:17,660 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:21:17,660 INFO ]: Finished difference Result 1404 states and 4524 transitions. [2018-06-24 20:21:17,660 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:21:17,660 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:21:17,660 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:21:17,836 INFO ]: With dead ends: 1404 [2018-06-24 20:21:17,836 INFO ]: Without dead ends: 1107 [2018-06-24 20:21:17,837 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:21:17,837 INFO ]: Start minimizeSevpa. Operand 1107 states. [2018-06-24 20:21:18,178 INFO ]: Finished minimizeSevpa. Reduced states from 1107 to 756. [2018-06-24 20:21:18,178 INFO ]: Start removeUnreachable. Operand 756 states. [2018-06-24 20:21:18,201 INFO ]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1768 transitions. [2018-06-24 20:21:18,202 INFO ]: Start accepts. Automaton has 756 states and 1768 transitions. Word has length 9 [2018-06-24 20:21:18,202 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:21:18,202 INFO ]: Abstraction has 756 states and 1768 transitions. [2018-06-24 20:21:18,202 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:21:18,202 INFO ]: Start isEmpty. Operand 756 states and 1768 transitions. [2018-06-24 20:21:18,237 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:21:18,237 INFO ]: Found error trace [2018-06-24 20:21:18,237 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:21:18,237 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:21:18,237 INFO ]: Analyzing trace with hash -531504624, now seen corresponding path program 1 times [2018-06-24 20:21:18,237 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:21:18,237 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:21:18,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:18,238 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:21:18,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:18,288 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:21:18,458 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:21:18,458 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:21:18,458 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:21:18,458 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:21:18,458 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:21:18,458 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:21:18,458 INFO ]: Start difference. First operand 756 states and 1768 transitions. Second operand 5 states. [2018-06-24 20:21:20,223 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:21:20,223 INFO ]: Finished difference Result 1107 states and 3526 transitions. [2018-06-24 20:21:20,225 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:21:20,225 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:21:20,225 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:21:20,325 INFO ]: With dead ends: 1107 [2018-06-24 20:21:20,325 INFO ]: Without dead ends: 1107 [2018-06-24 20:21:20,326 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:21:20,326 INFO ]: Start minimizeSevpa. Operand 1107 states. [2018-06-24 20:21:20,637 INFO ]: Finished minimizeSevpa. Reduced states from 1107 to 756. [2018-06-24 20:21:20,637 INFO ]: Start removeUnreachable. Operand 756 states. [2018-06-24 20:21:20,660 INFO ]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1743 transitions. [2018-06-24 20:21:20,661 INFO ]: Start accepts. Automaton has 756 states and 1743 transitions. Word has length 9 [2018-06-24 20:21:20,661 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:21:20,661 INFO ]: Abstraction has 756 states and 1743 transitions. [2018-06-24 20:21:20,661 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:21:20,661 INFO ]: Start isEmpty. Operand 756 states and 1743 transitions. [2018-06-24 20:21:20,695 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:21:20,695 INFO ]: Found error trace [2018-06-24 20:21:20,695 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:21:20,695 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:21:20,696 INFO ]: Analyzing trace with hash -531498858, now seen corresponding path program 1 times [2018-06-24 20:21:20,696 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:21:20,696 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:21:20,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:20,696 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:21:20,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:20,744 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:21:21,052 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:21:21,052 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:21:21,052 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:21:21,052 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:21:21,052 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:21:21,052 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:21:21,053 INFO ]: Start difference. First operand 756 states and 1743 transitions. Second operand 5 states. [2018-06-24 20:21:21,874 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:21:21,874 INFO ]: Finished difference Result 1107 states and 3521 transitions. [2018-06-24 20:21:21,875 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:21:21,875 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:21:21,875 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:21:21,972 INFO ]: With dead ends: 1107 [2018-06-24 20:21:21,972 INFO ]: Without dead ends: 1107 [2018-06-24 20:21:21,972 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:21:21,973 INFO ]: Start minimizeSevpa. Operand 1107 states. [2018-06-24 20:21:22,176 INFO ]: Finished minimizeSevpa. Reduced states from 1107 to 756. [2018-06-24 20:21:22,176 INFO ]: Start removeUnreachable. Operand 756 states. [2018-06-24 20:21:22,225 INFO ]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1738 transitions. [2018-06-24 20:21:22,226 INFO ]: Start accepts. Automaton has 756 states and 1738 transitions. Word has length 9 [2018-06-24 20:21:22,226 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:21:22,226 INFO ]: Abstraction has 756 states and 1738 transitions. [2018-06-24 20:21:22,226 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:21:22,226 INFO ]: Start isEmpty. Operand 756 states and 1738 transitions. [2018-06-24 20:21:22,263 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:21:22,263 INFO ]: Found error trace [2018-06-24 20:21:22,263 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:21:22,263 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:21:22,263 INFO ]: Analyzing trace with hash 1685330044, now seen corresponding path program 1 times [2018-06-24 20:21:22,263 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:21:22,263 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:21:22,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:22,265 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:21:22,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:22,303 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:21:22,791 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:21:22,792 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:21:22,792 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:21:22,792 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:21:22,792 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:21:22,792 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:21:22,792 INFO ]: Start difference. First operand 756 states and 1738 transitions. Second operand 6 states. [2018-06-24 20:21:27,480 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:21:27,480 INFO ]: Finished difference Result 1606 states and 7700 transitions. [2018-06-24 20:21:27,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:21:27,517 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:21:27,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:21:27,683 INFO ]: With dead ends: 1606 [2018-06-24 20:21:27,683 INFO ]: Without dead ends: 1606 [2018-06-24 20:21:27,683 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:21:27,685 INFO ]: Start minimizeSevpa. Operand 1606 states. [2018-06-24 20:21:28,210 INFO ]: Finished minimizeSevpa. Reduced states from 1606 to 1004. [2018-06-24 20:21:28,210 INFO ]: Start removeUnreachable. Operand 1004 states. [2018-06-24 20:21:28,248 INFO ]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 2564 transitions. [2018-06-24 20:21:28,248 INFO ]: Start accepts. Automaton has 1004 states and 2564 transitions. Word has length 10 [2018-06-24 20:21:28,248 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:21:28,248 INFO ]: Abstraction has 1004 states and 2564 transitions. [2018-06-24 20:21:28,248 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:21:28,249 INFO ]: Start isEmpty. Operand 1004 states and 2564 transitions. [2018-06-24 20:21:28,285 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:21:28,285 INFO ]: Found error trace [2018-06-24 20:21:28,285 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:21:28,285 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:21:28,286 INFO ]: Analyzing trace with hash 1685331005, now seen corresponding path program 1 times [2018-06-24 20:21:28,286 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:21:28,286 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:21:28,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:28,286 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:21:28,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:28,328 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:21:28,584 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:21:28,584 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:21:28,584 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:21:28,584 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:21:28,584 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:21:28,584 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:21:28,584 INFO ]: Start difference. First operand 1004 states and 2564 transitions. Second operand 6 states. [2018-06-24 20:21:32,259 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:21:32,259 INFO ]: Finished difference Result 2450 states and 15589 transitions. [2018-06-24 20:21:32,259 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:21:32,259 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:21:32,259 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:21:32,563 INFO ]: With dead ends: 2450 [2018-06-24 20:21:32,563 INFO ]: Without dead ends: 2450 [2018-06-24 20:21:32,564 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:21:32,581 INFO ]: Start minimizeSevpa. Operand 2450 states. [2018-06-24 20:21:33,456 INFO ]: Finished minimizeSevpa. Reduced states from 2450 to 1549. [2018-06-24 20:21:33,456 INFO ]: Start removeUnreachable. Operand 1549 states. [2018-06-24 20:21:33,536 INFO ]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 4883 transitions. [2018-06-24 20:21:33,536 INFO ]: Start accepts. Automaton has 1549 states and 4883 transitions. Word has length 10 [2018-06-24 20:21:33,536 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:21:33,536 INFO ]: Abstraction has 1549 states and 4883 transitions. [2018-06-24 20:21:33,536 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:21:33,536 INFO ]: Start isEmpty. Operand 1549 states and 4883 transitions. [2018-06-24 20:21:33,555 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:21:33,555 INFO ]: Found error trace [2018-06-24 20:21:33,555 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:21:33,555 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:21:33,556 INFO ]: Analyzing trace with hash 1685336771, now seen corresponding path program 1 times [2018-06-24 20:21:33,556 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:21:33,556 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:21:33,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:33,556 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:21:33,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:33,615 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:21:34,096 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:21:34,096 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:21:34,096 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:21:34,097 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:21:34,097 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:21:34,097 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:21:34,097 INFO ]: Start difference. First operand 1549 states and 4883 transitions. Second operand 6 states. [2018-06-24 20:21:37,350 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:21:37,350 INFO ]: Finished difference Result 2378 states and 15437 transitions. [2018-06-24 20:21:37,351 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:21:37,351 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:21:37,351 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:21:37,617 INFO ]: With dead ends: 2378 [2018-06-24 20:21:37,617 INFO ]: Without dead ends: 2378 [2018-06-24 20:21:37,617 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:21:37,654 INFO ]: Start minimizeSevpa. Operand 2378 states. [2018-06-24 20:21:38,275 INFO ]: Finished minimizeSevpa. Reduced states from 2378 to 1541. [2018-06-24 20:21:38,275 INFO ]: Start removeUnreachable. Operand 1541 states. [2018-06-24 20:21:38,357 INFO ]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 4787 transitions. [2018-06-24 20:21:38,357 INFO ]: Start accepts. Automaton has 1541 states and 4787 transitions. Word has length 10 [2018-06-24 20:21:38,357 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:21:38,357 INFO ]: Abstraction has 1541 states and 4787 transitions. [2018-06-24 20:21:38,357 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:21:38,357 INFO ]: Start isEmpty. Operand 1541 states and 4787 transitions. [2018-06-24 20:21:38,378 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:21:38,378 INFO ]: Found error trace [2018-06-24 20:21:38,378 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:21:38,378 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:21:38,378 INFO ]: Analyzing trace with hash 695612998, now seen corresponding path program 1 times [2018-06-24 20:21:38,378 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:21:38,378 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:21:38,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:38,379 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:21:38,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:38,421 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:21:38,614 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:21:38,614 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:21:38,614 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:21:38,619 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:21:38,745 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:21:38,754 INFO ]: Computing forward predicates... [2018-06-24 20:21:39,649 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:21:39,683 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:21:39,683 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-24 20:21:39,683 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:21:39,683 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:21:39,683 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:21:39,683 INFO ]: Start difference. First operand 1541 states and 4787 transitions. Second operand 8 states. [2018-06-24 20:21:44,977 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:21:44,977 INFO ]: Finished difference Result 2333 states and 11451 transitions. [2018-06-24 20:21:44,978 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:21:44,978 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-24 20:21:44,978 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:21:45,305 INFO ]: With dead ends: 2333 [2018-06-24 20:21:45,305 INFO ]: Without dead ends: 2324 [2018-06-24 20:21:45,306 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:21:45,307 INFO ]: Start minimizeSevpa. Operand 2324 states. [2018-06-24 20:21:46,627 INFO ]: Finished minimizeSevpa. Reduced states from 2324 to 1789. [2018-06-24 20:21:46,627 INFO ]: Start removeUnreachable. Operand 1789 states. [2018-06-24 20:21:46,729 INFO ]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 5876 transitions. [2018-06-24 20:21:46,729 INFO ]: Start accepts. Automaton has 1789 states and 5876 transitions. Word has length 10 [2018-06-24 20:21:46,729 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:21:46,729 INFO ]: Abstraction has 1789 states and 5876 transitions. [2018-06-24 20:21:46,729 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:21:46,729 INFO ]: Start isEmpty. Operand 1789 states and 5876 transitions. [2018-06-24 20:21:46,778 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:21:46,778 INFO ]: Found error trace [2018-06-24 20:21:46,778 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:21:46,778 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:21:46,780 INFO ]: Analyzing trace with hash 702927791, now seen corresponding path program 1 times [2018-06-24 20:21:46,780 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:21:46,780 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:21:46,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:46,781 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:21:46,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:46,852 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:21:47,312 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:21:47,312 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:21:47,312 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:21:47,312 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:21:47,312 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:21:47,312 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:21:47,312 INFO ]: Start difference. First operand 1789 states and 5876 transitions. Second operand 6 states. [2018-06-24 20:21:51,442 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:21:51,442 INFO ]: Finished difference Result 4451 states and 29198 transitions. [2018-06-24 20:21:51,442 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:21:51,442 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:21:51,442 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:21:52,112 INFO ]: With dead ends: 4451 [2018-06-24 20:21:52,112 INFO ]: Without dead ends: 4451 [2018-06-24 20:21:52,112 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:21:52,114 INFO ]: Start minimizeSevpa. Operand 4451 states. [2018-06-24 20:21:53,877 INFO ]: Finished minimizeSevpa. Reduced states from 4451 to 2210. [2018-06-24 20:21:53,877 INFO ]: Start removeUnreachable. Operand 2210 states. [2018-06-24 20:21:54,023 INFO ]: Finished removeUnreachable. Reduced from 2210 states to 2210 states and 7512 transitions. [2018-06-24 20:21:54,023 INFO ]: Start accepts. Automaton has 2210 states and 7512 transitions. Word has length 10 [2018-06-24 20:21:54,023 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:21:54,023 INFO ]: Abstraction has 2210 states and 7512 transitions. [2018-06-24 20:21:54,023 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:21:54,023 INFO ]: Start isEmpty. Operand 2210 states and 7512 transitions. [2018-06-24 20:21:54,052 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:21:54,052 INFO ]: Found error trace [2018-06-24 20:21:54,052 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:21:54,052 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:21:54,052 INFO ]: Analyzing trace with hash 697773948, now seen corresponding path program 1 times [2018-06-24 20:21:54,053 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:21:54,053 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:21:54,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:54,053 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:21:54,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:21:54,089 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:21:54,445 WARN ]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2018-06-24 20:21:54,729 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:21:54,729 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:21:54,729 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:21:54,730 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:21:54,730 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:21:54,730 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:21:54,730 INFO ]: Start difference. First operand 2210 states and 7512 transitions. Second operand 6 states. Received shutdown request... [2018-06-24 20:21:55,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:21:55,255 WARN ]: Verification canceled [2018-06-24 20:21:55,258 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:21:55,260 WARN ]: Timeout [2018-06-24 20:21:55,260 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:21:55 BasicIcfg [2018-06-24 20:21:55,260 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:21:55,261 INFO ]: Toolchain (without parser) took 52893.69 ms. Allocated memory was 309.3 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 191.9 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 130.3 MB. Max. memory is 3.6 GB. [2018-06-24 20:21:55,262 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:21:55,262 INFO ]: ChcToBoogie took 132.41 ms. Allocated memory was 309.3 MB in the beginning and 323.0 MB in the end (delta: 13.6 MB). Free memory was 191.9 MB in the beginning and 291.3 MB in the end (delta: -99.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 3.6 GB. [2018-06-24 20:21:55,262 INFO ]: Boogie Preprocessor took 126.03 ms. Allocated memory is still 323.0 MB. Free memory was 291.3 MB in the beginning and 286.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 3.6 GB. [2018-06-24 20:21:55,267 INFO ]: RCFGBuilder took 2334.04 ms. Allocated memory was 323.0 MB in the beginning and 357.6 MB in the end (delta: 34.6 MB). Free memory was 286.7 MB in the beginning and 244.9 MB in the end (delta: 41.7 MB). Peak memory consumption was 115.9 MB. Max. memory is 3.6 GB. [2018-06-24 20:21:55,267 INFO ]: BlockEncodingV2 took 1232.67 ms. Allocated memory was 357.6 MB in the beginning and 393.2 MB in the end (delta: 35.7 MB). Free memory was 244.9 MB in the beginning and 299.0 MB in the end (delta: -54.0 MB). Peak memory consumption was 74.8 MB. Max. memory is 3.6 GB. [2018-06-24 20:21:55,268 INFO ]: TraceAbstraction took 49050.77 ms. Allocated memory was 393.2 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 299.0 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 153.5 MB. Max. memory is 3.6 GB. [2018-06-24 20:21:55,271 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 144 locations, 281 edges - StatisticsResult: Encoded RCFG 133 locations, 269 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 132.41 ms. Allocated memory was 309.3 MB in the beginning and 323.0 MB in the end (delta: 13.6 MB). Free memory was 191.9 MB in the beginning and 291.3 MB in the end (delta: -99.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 126.03 ms. Allocated memory is still 323.0 MB. Free memory was 291.3 MB in the beginning and 286.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 3.6 GB. * RCFGBuilder took 2334.04 ms. Allocated memory was 323.0 MB in the beginning and 357.6 MB in the end (delta: 34.6 MB). Free memory was 286.7 MB in the beginning and 244.9 MB in the end (delta: 41.7 MB). Peak memory consumption was 115.9 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1232.67 ms. Allocated memory was 357.6 MB in the beginning and 393.2 MB in the end (delta: 35.7 MB). Free memory was 244.9 MB in the beginning and 299.0 MB in the end (delta: -54.0 MB). Peak memory consumption was 74.8 MB. Max. memory is 3.6 GB. * TraceAbstraction took 49050.77 ms. Allocated memory was 393.2 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 299.0 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 153.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 (2210states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (60 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 133 locations, 1 error locations. TIMEOUT Result, 48.9s OverallTime, 13 OverallIterations, 1 TraceHistogramMax, 35.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7989 SDtfs, 1434 SDslu, 14910 SDs, 0 SdLazy, 16404 SolverSat, 2680 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2210occurred in iteration=12, 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.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 6347 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 1908 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1013 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 22/24 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-full.12.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-21-55-285.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.12.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-21-55-285.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.12.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-21-55-285.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.12.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-21-55-285.csv Completed graceful shutdown