java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.44.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:43:40,264 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:43:40,266 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:43:40,277 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:43:40,277 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:43:40,278 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:43:40,281 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:43:40,285 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:43:40,287 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:43:40,288 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:43:40,288 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:43:40,289 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:43:40,289 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:43:40,290 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:43:40,291 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:43:40,292 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:43:40,294 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:43:40,295 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:43:40,297 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:43:40,298 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:43:40,299 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:43:40,301 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:43:40,301 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:43:40,302 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:43:40,302 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:43:40,303 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:43:40,304 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:43:40,305 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:43:40,306 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:43:40,306 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:43:40,307 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:43:40,308 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:43:40,308 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:43:40,309 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:43:40,309 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:43:40,310 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 10:43:40,333 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:43:40,333 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:43:40,333 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:43:40,333 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:43:40,334 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:43:40,334 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:43:40,335 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:43:40,335 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:43:40,337 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:43:40,337 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:43:40,337 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:43:40,337 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:43:40,337 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:43:40,338 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:43:40,338 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:43:40,338 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:43:40,338 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:43:40,338 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:43:40,338 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:43:40,340 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:43:40,340 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:43:40,383 INFO ]: Repository-Root is: /tmp [2018-06-22 10:43:40,399 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:43:40,403 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:43:40,404 INFO ]: Initializing SmtParser... [2018-06-22 10:43:40,404 INFO ]: SmtParser initialized [2018-06-22 10:43:40,406 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.44.smt2 [2018-06-22 10:43:40,407 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-22 10:43:40,496 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.44.smt2 unknown [2018-06-22 10:43:41,115 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.44.smt2 [2018-06-22 10:43:41,119 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:43:41,125 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:43:41,125 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:43:41,125 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:43:41,125 INFO ]: ChcToBoogie initialized [2018-06-22 10:43:41,129 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:43:41" (1/1) ... [2018-06-22 10:43:41,222 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:43:41 Unit [2018-06-22 10:43:41,222 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:43:41,223 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:43:41,223 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:43:41,223 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:43:41,246 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:43:41" (1/1) ... [2018-06-22 10:43:41,246 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:43:41" (1/1) ... [2018-06-22 10:43:41,262 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:43:41" (1/1) ... [2018-06-22 10:43:41,263 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:43:41" (1/1) ... [2018-06-22 10:43:41,279 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:43:41" (1/1) ... [2018-06-22 10:43:41,283 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:43:41" (1/1) ... [2018-06-22 10:43:41,286 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:43:41" (1/1) ... [2018-06-22 10:43:41,290 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:43:41,291 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:43:41,291 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:43:41,291 INFO ]: RCFGBuilder initialized [2018-06-22 10:43:41,292 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:43:41" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:43:41,301 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:43:41,301 INFO ]: Found specification of procedure False [2018-06-22 10:43:41,301 INFO ]: Found implementation of procedure False [2018-06-22 10:43:41,302 INFO ]: Specification and implementation of procedure step_lturn__bar given in one single declaration [2018-06-22 10:43:41,302 INFO ]: Found specification of procedure step_lturn__bar [2018-06-22 10:43:41,302 INFO ]: Found implementation of procedure step_lturn__bar [2018-06-22 10:43:41,302 INFO ]: Specification and implementation of procedure combined_lturn__bar given in one single declaration [2018-06-22 10:43:41,302 INFO ]: Found specification of procedure combined_lturn__bar [2018-06-22 10:43:41,302 INFO ]: Found implementation of procedure combined_lturn__bar [2018-06-22 10:43:41,302 INFO ]: Specification and implementation of procedure lturn__bar given in one single declaration [2018-06-22 10:43:41,302 INFO ]: Found specification of procedure lturn__bar [2018-06-22 10:43:41,302 INFO ]: Found implementation of procedure lturn__bar [2018-06-22 10:43:41,302 INFO ]: Specification and implementation of procedure step_lturn given in one single declaration [2018-06-22 10:43:41,302 INFO ]: Found specification of procedure step_lturn [2018-06-22 10:43:41,302 INFO ]: Found implementation of procedure step_lturn [2018-06-22 10:43:41,302 INFO ]: Specification and implementation of procedure combined_lturn given in one single declaration [2018-06-22 10:43:41,302 INFO ]: Found specification of procedure combined_lturn [2018-06-22 10:43:41,302 INFO ]: Found implementation of procedure combined_lturn [2018-06-22 10:43:41,302 INFO ]: Specification and implementation of procedure lturn given in one single declaration [2018-06-22 10:43:41,302 INFO ]: Found specification of procedure lturn [2018-06-22 10:43:41,302 INFO ]: Found implementation of procedure lturn [2018-06-22 10:43:41,302 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:43:41,302 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:43:41,302 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 10:43:42,887 INFO ]: Using library mode [2018-06-22 10:43:42,888 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:43:42 BoogieIcfgContainer [2018-06-22 10:43:42,888 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:43:42,889 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:43:42,889 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:43:42,892 INFO ]: TraceAbstraction initialized [2018-06-22 10:43:42,893 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:43:41" (1/3) ... [2018-06-22 10:43:42,893 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb2bdcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:43:42, skipping insertion in model container [2018-06-22 10:43:42,894 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:43:41" (2/3) ... [2018-06-22 10:43:42,894 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb2bdcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:43:42, skipping insertion in model container [2018-06-22 10:43:42,894 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:43:42" (3/3) ... [2018-06-22 10:43:42,897 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:43:42,906 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:43:42,918 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:43:42,968 INFO ]: Using default assertion order modulation [2018-06-22 10:43:42,968 INFO ]: Interprodecural is true [2018-06-22 10:43:42,968 INFO ]: Hoare is false [2018-06-22 10:43:42,968 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:43:42,968 INFO ]: Backedges is TWOTRACK [2018-06-22 10:43:42,968 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:43:42,968 INFO ]: Difference is false [2018-06-22 10:43:42,968 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:43:42,969 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:43:42,993 INFO ]: Start isEmpty. Operand 162 states. [2018-06-22 10:43:43,028 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:43:43,028 INFO ]: Found error trace [2018-06-22 10:43:43,029 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:43:43,029 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:43:43,034 INFO ]: Analyzing trace with hash 1268276134, now seen corresponding path program 1 times [2018-06-22 10:43:43,035 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:43:43,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:43:43,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:43:43,068 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:43:43,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:43:43,232 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:43:43,494 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:43:43,496 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:43:43,496 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:43:43,497 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:43:43,507 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:43:43,507 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:43:43,509 INFO ]: Start difference. First operand 162 states. Second operand 6 states. [2018-06-22 10:43:46,205 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:43:46,206 INFO ]: Finished difference Result 204 states and 532 transitions. [2018-06-22 10:43:46,206 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:43:46,207 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:43:46,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:43:46,232 INFO ]: With dead ends: 204 [2018-06-22 10:43:46,232 INFO ]: Without dead ends: 202 [2018-06-22 10:43:46,234 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:43:46,251 INFO ]: Start minimizeSevpa. Operand 202 states. [2018-06-22 10:43:46,410 INFO ]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-06-22 10:43:46,412 INFO ]: Start removeUnreachable. Operand 200 states. [2018-06-22 10:43:46,419 INFO ]: Finished removeUnreachable. Reduced from 200 states to 200 states and 528 transitions. [2018-06-22 10:43:46,421 INFO ]: Start accepts. Automaton has 200 states and 528 transitions. Word has length 17 [2018-06-22 10:43:46,422 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:43:46,422 INFO ]: Abstraction has 200 states and 528 transitions. [2018-06-22 10:43:46,422 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:43:46,422 INFO ]: Start isEmpty. Operand 200 states and 528 transitions. [2018-06-22 10:43:46,429 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:43:46,429 INFO ]: Found error trace [2018-06-22 10:43:46,429 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:43:46,430 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:43:46,430 INFO ]: Analyzing trace with hash -1844993287, now seen corresponding path program 1 times [2018-06-22 10:43:46,430 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:43:46,430 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:43:46,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:43:46,431 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:43:46,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:43:46,481 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:43:46,646 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:43:46,646 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:43:46,646 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:43:46,648 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:43:46,648 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:43:46,648 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:43:46,648 INFO ]: Start difference. First operand 200 states and 528 transitions. Second operand 6 states. [2018-06-22 10:43:47,981 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:43:47,981 INFO ]: Finished difference Result 246 states and 774 transitions. [2018-06-22 10:43:47,982 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:43:47,982 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:43:47,982 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:43:47,991 INFO ]: With dead ends: 246 [2018-06-22 10:43:47,991 INFO ]: Without dead ends: 246 [2018-06-22 10:43:47,991 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:43:47,993 INFO ]: Start minimizeSevpa. Operand 246 states. [2018-06-22 10:43:48,082 INFO ]: Finished minimizeSevpa. Reduced states from 246 to 200. [2018-06-22 10:43:48,082 INFO ]: Start removeUnreachable. Operand 200 states. [2018-06-22 10:43:48,087 INFO ]: Finished removeUnreachable. Reduced from 200 states to 200 states and 528 transitions. [2018-06-22 10:43:48,087 INFO ]: Start accepts. Automaton has 200 states and 528 transitions. Word has length 17 [2018-06-22 10:43:48,087 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:43:48,087 INFO ]: Abstraction has 200 states and 528 transitions. [2018-06-22 10:43:48,087 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:43:48,087 INFO ]: Start isEmpty. Operand 200 states and 528 transitions. [2018-06-22 10:43:48,091 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:43:48,091 INFO ]: Found error trace [2018-06-22 10:43:48,091 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:43:48,091 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:43:48,091 INFO ]: Analyzing trace with hash 1705271511, now seen corresponding path program 1 times [2018-06-22 10:43:48,091 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:43:48,091 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:43:48,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:43:48,093 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:43:48,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:43:48,120 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:43:48,286 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:43:48,286 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:43:48,286 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:43:48,286 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:43:48,287 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:43:48,287 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:43:48,287 INFO ]: Start difference. First operand 200 states and 528 transitions. Second operand 6 states. [2018-06-22 10:43:49,390 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:43:49,390 INFO ]: Finished difference Result 246 states and 774 transitions. [2018-06-22 10:43:49,390 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:43:49,390 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:43:49,390 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:43:49,397 INFO ]: With dead ends: 246 [2018-06-22 10:43:49,397 INFO ]: Without dead ends: 246 [2018-06-22 10:43:49,397 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:43:49,400 INFO ]: Start minimizeSevpa. Operand 246 states. [2018-06-22 10:43:49,464 INFO ]: Finished minimizeSevpa. Reduced states from 246 to 200. [2018-06-22 10:43:49,465 INFO ]: Start removeUnreachable. Operand 200 states. [2018-06-22 10:43:49,468 INFO ]: Finished removeUnreachable. Reduced from 200 states to 200 states and 528 transitions. [2018-06-22 10:43:49,468 INFO ]: Start accepts. Automaton has 200 states and 528 transitions. Word has length 17 [2018-06-22 10:43:49,469 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:43:49,469 INFO ]: Abstraction has 200 states and 528 transitions. [2018-06-22 10:43:49,469 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:43:49,469 INFO ]: Start isEmpty. Operand 200 states and 528 transitions. [2018-06-22 10:43:49,472 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:43:49,472 INFO ]: Found error trace [2018-06-22 10:43:49,472 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:43:49,472 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:43:49,472 INFO ]: Analyzing trace with hash 1987489655, now seen corresponding path program 1 times [2018-06-22 10:43:49,472 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:43:49,472 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:43:49,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:43:49,473 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:43:49,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:43:49,496 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:43:49,868 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:43:49,868 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:43:49,868 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:43:49,868 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:43:49,869 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:43:49,869 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:43:49,869 INFO ]: Start difference. First operand 200 states and 528 transitions. Second operand 6 states. [2018-06-22 10:43:51,157 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:43:51,157 INFO ]: Finished difference Result 252 states and 846 transitions. [2018-06-22 10:43:51,157 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:43:51,157 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 10:43:51,157 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:43:51,165 INFO ]: With dead ends: 252 [2018-06-22 10:43:51,165 INFO ]: Without dead ends: 252 [2018-06-22 10:43:51,165 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:43:51,166 INFO ]: Start minimizeSevpa. Operand 252 states. [2018-06-22 10:43:51,238 INFO ]: Finished minimizeSevpa. Reduced states from 252 to 245. [2018-06-22 10:43:51,238 INFO ]: Start removeUnreachable. Operand 245 states. [2018-06-22 10:43:51,293 INFO ]: Finished removeUnreachable. Reduced from 245 states to 245 states and 830 transitions. [2018-06-22 10:43:51,293 INFO ]: Start accepts. Automaton has 245 states and 830 transitions. Word has length 21 [2018-06-22 10:43:51,293 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:43:51,293 INFO ]: Abstraction has 245 states and 830 transitions. [2018-06-22 10:43:51,293 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:43:51,293 INFO ]: Start isEmpty. Operand 245 states and 830 transitions. [2018-06-22 10:43:51,302 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:43:51,302 INFO ]: Found error trace [2018-06-22 10:43:51,302 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:43:51,302 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:43:51,302 INFO ]: Analyzing trace with hash 511367061, now seen corresponding path program 1 times [2018-06-22 10:43:51,302 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:43:51,302 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:43:51,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:43:51,303 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:43:51,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:43:51,331 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:43:51,599 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:43:51,600 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:43:51,600 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:43:51,600 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:43:51,600 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:43:51,600 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:43:51,600 INFO ]: Start difference. First operand 245 states and 830 transitions. Second operand 6 states. [2018-06-22 10:43:52,728 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:43:52,728 INFO ]: Finished difference Result 343 states and 1496 transitions. [2018-06-22 10:43:52,728 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:43:52,728 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 10:43:52,729 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:43:52,740 INFO ]: With dead ends: 343 [2018-06-22 10:43:52,740 INFO ]: Without dead ends: 343 [2018-06-22 10:43:52,741 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:43:52,741 INFO ]: Start minimizeSevpa. Operand 343 states. [2018-06-22 10:43:52,879 INFO ]: Finished minimizeSevpa. Reduced states from 343 to 335. [2018-06-22 10:43:52,879 INFO ]: Start removeUnreachable. Operand 335 states. [2018-06-22 10:43:52,888 INFO ]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1474 transitions. [2018-06-22 10:43:52,889 INFO ]: Start accepts. Automaton has 335 states and 1474 transitions. Word has length 21 [2018-06-22 10:43:52,890 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:43:52,890 INFO ]: Abstraction has 335 states and 1474 transitions. [2018-06-22 10:43:52,890 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:43:52,890 INFO ]: Start isEmpty. Operand 335 states and 1474 transitions. [2018-06-22 10:43:52,897 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:43:52,897 INFO ]: Found error trace [2018-06-22 10:43:52,897 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:43:52,897 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:43:52,897 INFO ]: Analyzing trace with hash -1990067651, now seen corresponding path program 1 times [2018-06-22 10:43:52,897 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:43:52,897 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:43:52,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:43:52,898 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:43:52,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:43:52,921 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:43:53,443 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:43:53,443 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:43:53,443 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:43:53,444 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:43:53,444 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:43:53,444 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:43:53,444 INFO ]: Start difference. First operand 335 states and 1474 transitions. Second operand 7 states. [2018-06-22 10:43:55,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:43:55,486 INFO ]: Finished difference Result 553 states and 3027 transitions. [2018-06-22 10:43:55,489 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:43:55,489 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 10:43:55,489 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:43:55,509 INFO ]: With dead ends: 553 [2018-06-22 10:43:55,509 INFO ]: Without dead ends: 553 [2018-06-22 10:43:55,509 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:43:55,510 INFO ]: Start minimizeSevpa. Operand 553 states. [2018-06-22 10:43:55,868 INFO ]: Finished minimizeSevpa. Reduced states from 553 to 531. [2018-06-22 10:43:55,868 INFO ]: Start removeUnreachable. Operand 531 states. [2018-06-22 10:43:55,880 INFO ]: Finished removeUnreachable. Reduced from 531 states to 531 states and 2882 transitions. [2018-06-22 10:43:55,880 INFO ]: Start accepts. Automaton has 531 states and 2882 transitions. Word has length 21 [2018-06-22 10:43:55,880 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:43:55,880 INFO ]: Abstraction has 531 states and 2882 transitions. [2018-06-22 10:43:55,880 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:43:55,880 INFO ]: Start isEmpty. Operand 531 states and 2882 transitions. [2018-06-22 10:43:55,888 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:43:55,888 INFO ]: Found error trace [2018-06-22 10:43:55,889 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:43:55,889 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:43:55,889 INFO ]: Analyzing trace with hash 722847375, now seen corresponding path program 1 times [2018-06-22 10:43:55,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:43:55,889 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:43:55,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:43:55,890 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:43:55,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:43:55,912 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:43:56,074 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:43:56,074 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:43:56,074 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-22 10:43:56,092 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:43:56,145 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:43:56,159 INFO ]: Computing forward predicates... [2018-06-22 10:43:56,221 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:43:56,255 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:43:56,255 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 10:43:56,283 INFO ]: Interpolant automaton has 8 states [2018-06-22 10:43:56,283 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 10:43:56,283 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:43:56,283 INFO ]: Start difference. First operand 531 states and 2882 transitions. Second operand 8 states. [2018-06-22 10:44:00,200 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:44:00,200 INFO ]: Finished difference Result 961 states and 7751 transitions. [2018-06-22 10:44:00,200 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:44:00,201 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 10:44:00,201 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:44:00,272 INFO ]: With dead ends: 961 [2018-06-22 10:44:00,272 INFO ]: Without dead ends: 961 [2018-06-22 10:44:00,273 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:44:00,273 INFO ]: Start minimizeSevpa. Operand 961 states. [2018-06-22 10:44:01,386 INFO ]: Finished minimizeSevpa. Reduced states from 961 to 940. [2018-06-22 10:44:01,386 INFO ]: Start removeUnreachable. Operand 940 states. [2018-06-22 10:44:01,509 INFO ]: Finished removeUnreachable. Reduced from 940 states to 940 states and 7544 transitions. [2018-06-22 10:44:01,509 INFO ]: Start accepts. Automaton has 940 states and 7544 transitions. Word has length 25 [2018-06-22 10:44:01,509 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:44:01,509 INFO ]: Abstraction has 940 states and 7544 transitions. [2018-06-22 10:44:01,509 INFO ]: Interpolant automaton has 8 states. [2018-06-22 10:44:01,509 INFO ]: Start isEmpty. Operand 940 states and 7544 transitions. [2018-06-22 10:44:01,527 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:44:01,527 INFO ]: Found error trace [2018-06-22 10:44:01,527 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:44:01,527 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:44:01,527 INFO ]: Analyzing trace with hash -37077360, now seen corresponding path program 1 times [2018-06-22 10:44:01,527 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:44:01,527 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:44:01,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:44:01,529 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:44:01,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:44:01,553 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:44:01,810 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:44:01,810 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:44:01,810 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:44:01,810 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:44:01,811 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:44:01,811 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:44:01,811 INFO ]: Start difference. First operand 940 states and 7544 transitions. Second operand 7 states. [2018-06-22 10:44:02,898 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:44:02,898 INFO ]: Finished difference Result 1353 states and 13038 transitions. [2018-06-22 10:44:02,901 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:44:02,901 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 10:44:02,901 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:44:02,986 INFO ]: With dead ends: 1353 [2018-06-22 10:44:02,986 INFO ]: Without dead ends: 1353 [2018-06-22 10:44:02,986 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:44:02,987 INFO ]: Start minimizeSevpa. Operand 1353 states. [2018-06-22 10:44:04,145 INFO ]: Finished minimizeSevpa. Reduced states from 1353 to 1314. [2018-06-22 10:44:04,145 INFO ]: Start removeUnreachable. Operand 1314 states. [2018-06-22 10:44:04,207 INFO ]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 12585 transitions. [2018-06-22 10:44:04,208 INFO ]: Start accepts. Automaton has 1314 states and 12585 transitions. Word has length 21 [2018-06-22 10:44:04,208 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:44:04,208 INFO ]: Abstraction has 1314 states and 12585 transitions. [2018-06-22 10:44:04,208 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:44:04,208 INFO ]: Start isEmpty. Operand 1314 states and 12585 transitions. [2018-06-22 10:44:04,224 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:44:04,224 INFO ]: Found error trace [2018-06-22 10:44:04,224 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:44:04,224 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:44:04,225 INFO ]: Analyzing trace with hash -296900254, now seen corresponding path program 1 times [2018-06-22 10:44:04,225 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:44:04,225 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:44:04,226 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:44:04,226 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:44:04,226 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:44:04,243 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:44:04,515 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:44:04,515 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:44:04,515 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:44:04,520 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:44:04,572 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:44:04,576 INFO ]: Computing forward predicates... [2018-06-22 10:44:05,051 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:44:05,079 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:44:05,079 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 10:44:05,079 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:44:05,079 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:44:05,079 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:44:05,079 INFO ]: Start difference. First operand 1314 states and 12585 transitions. Second operand 14 states. [2018-06-22 10:44:09,058 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:44:09,059 INFO ]: Finished difference Result 1902 states and 19906 transitions. [2018-06-22 10:44:09,061 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:44:09,061 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 10:44:09,061 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:44:09,146 INFO ]: With dead ends: 1902 [2018-06-22 10:44:09,146 INFO ]: Without dead ends: 1902 [2018-06-22 10:44:09,147 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-06-22 10:44:09,148 INFO ]: Start minimizeSevpa. Operand 1902 states. [2018-06-22 10:44:11,120 INFO ]: Finished minimizeSevpa. Reduced states from 1902 to 1876. [2018-06-22 10:44:11,120 INFO ]: Start removeUnreachable. Operand 1876 states. [2018-06-22 10:44:11,186 INFO ]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 19580 transitions. [2018-06-22 10:44:11,186 INFO ]: Start accepts. Automaton has 1876 states and 19580 transitions. Word has length 25 [2018-06-22 10:44:11,186 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:44:11,186 INFO ]: Abstraction has 1876 states and 19580 transitions. [2018-06-22 10:44:11,186 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:44:11,186 INFO ]: Start isEmpty. Operand 1876 states and 19580 transitions. [2018-06-22 10:44:11,203 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:44:11,203 INFO ]: Found error trace [2018-06-22 10:44:11,203 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:44:11,203 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:44:11,205 INFO ]: Analyzing trace with hash -1900921234, now seen corresponding path program 1 times [2018-06-22 10:44:11,205 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:44:11,205 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:44:11,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:44:11,206 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:44:11,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:44:11,233 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:44:11,769 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:44:11,769 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:44:11,769 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:44:11,769 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:44:11,769 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:44:11,769 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:44:11,769 INFO ]: Start difference. First operand 1876 states and 19580 transitions. Second operand 7 states. [2018-06-22 10:44:13,707 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:44:13,707 INFO ]: Finished difference Result 2090 states and 22040 transitions. [2018-06-22 10:44:13,707 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:44:13,708 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 10:44:13,708 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:44:13,799 INFO ]: With dead ends: 2090 [2018-06-22 10:44:13,799 INFO ]: Without dead ends: 2090 [2018-06-22 10:44:13,800 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:44:13,801 INFO ]: Start minimizeSevpa. Operand 2090 states. [2018-06-22 10:44:15,603 INFO ]: Finished minimizeSevpa. Reduced states from 2090 to 2060. [2018-06-22 10:44:15,603 INFO ]: Start removeUnreachable. Operand 2060 states. [2018-06-22 10:44:15,685 INFO ]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 21659 transitions. [2018-06-22 10:44:15,685 INFO ]: Start accepts. Automaton has 2060 states and 21659 transitions. Word has length 21 [2018-06-22 10:44:15,685 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:44:15,685 INFO ]: Abstraction has 2060 states and 21659 transitions. [2018-06-22 10:44:15,685 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:44:15,685 INFO ]: Start isEmpty. Operand 2060 states and 21659 transitions. [2018-06-22 10:44:15,702 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:44:15,702 INFO ]: Found error trace [2018-06-22 10:44:15,702 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:44:15,702 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:44:15,702 INFO ]: Analyzing trace with hash -1989207516, now seen corresponding path program 1 times [2018-06-22 10:44:15,702 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:44:15,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:44:15,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:44:15,703 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:44:15,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:44:15,719 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:44:16,249 INFO ]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 10:44:16,250 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:44:16,250 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 10:44:16,258 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:44:16,313 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:44:16,316 INFO ]: Computing forward predicates... [2018-06-22 10:44:17,157 INFO ]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 10:44:17,177 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:44:17,177 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-06-22 10:44:17,177 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:44:17,177 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:44:17,177 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:44:17,177 INFO ]: Start difference. First operand 2060 states and 21659 transitions. Second operand 14 states. [2018-06-22 10:44:23,040 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:44:23,040 INFO ]: Finished difference Result 2575 states and 36511 transitions. [2018-06-22 10:44:23,040 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:44:23,040 INFO ]: Start accepts. Automaton has 14 states. Word has length 29 [2018-06-22 10:44:23,040 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:44:23,232 INFO ]: With dead ends: 2575 [2018-06-22 10:44:23,232 INFO ]: Without dead ends: 2575 [2018-06-22 10:44:23,232 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:44:23,234 INFO ]: Start minimizeSevpa. Operand 2575 states. [2018-06-22 10:44:26,725 INFO ]: Finished minimizeSevpa. Reduced states from 2575 to 2378. [2018-06-22 10:44:26,725 INFO ]: Start removeUnreachable. Operand 2378 states. [2018-06-22 10:44:26,879 INFO ]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 33599 transitions. [2018-06-22 10:44:26,880 INFO ]: Start accepts. Automaton has 2378 states and 33599 transitions. Word has length 29 [2018-06-22 10:44:26,880 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:44:26,880 INFO ]: Abstraction has 2378 states and 33599 transitions. [2018-06-22 10:44:26,880 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:44:26,880 INFO ]: Start isEmpty. Operand 2378 states and 33599 transitions. [2018-06-22 10:44:26,897 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:44:26,897 INFO ]: Found error trace [2018-06-22 10:44:26,897 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:44:26,897 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:44:26,899 INFO ]: Analyzing trace with hash -1063529065, now seen corresponding path program 1 times [2018-06-22 10:44:26,899 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:44:26,899 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:44:26,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:44:26,900 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:44:26,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:44:26,920 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:44:27,244 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:44:27,244 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:44:27,244 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:44:27,245 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:44:27,245 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:44:27,245 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:44:27,245 INFO ]: Start difference. First operand 2378 states and 33599 transitions. Second operand 7 states. [2018-06-22 10:44:28,088 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:44:28,089 INFO ]: Finished difference Result 2550 states and 35163 transitions. [2018-06-22 10:44:28,089 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:44:28,089 INFO ]: Start accepts. Automaton has 7 states. Word has length 29 [2018-06-22 10:44:28,089 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:44:28,368 INFO ]: With dead ends: 2550 [2018-06-22 10:44:28,369 INFO ]: Without dead ends: 2550 [2018-06-22 10:44:28,369 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:44:28,370 INFO ]: Start minimizeSevpa. Operand 2550 states. [2018-06-22 10:44:32,470 INFO ]: Finished minimizeSevpa. Reduced states from 2550 to 2447. [2018-06-22 10:44:32,470 INFO ]: Start removeUnreachable. Operand 2447 states. [2018-06-22 10:44:32,626 INFO ]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 34476 transitions. [2018-06-22 10:44:32,626 INFO ]: Start accepts. Automaton has 2447 states and 34476 transitions. Word has length 29 [2018-06-22 10:44:32,627 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:44:32,627 INFO ]: Abstraction has 2447 states and 34476 transitions. [2018-06-22 10:44:32,627 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:44:32,627 INFO ]: Start isEmpty. Operand 2447 states and 34476 transitions. [2018-06-22 10:44:32,643 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:44:32,643 INFO ]: Found error trace [2018-06-22 10:44:32,643 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:44:32,643 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:44:32,644 INFO ]: Analyzing trace with hash -1201672526, now seen corresponding path program 1 times [2018-06-22 10:44:32,644 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:44:32,644 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:44:32,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:44:32,644 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:44:32,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:44:32,660 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:44:32,919 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:44:32,919 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:44:32,919 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:44:32,919 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:44:32,919 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:44:32,919 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:44:32,919 INFO ]: Start difference. First operand 2447 states and 34476 transitions. Second operand 7 states. [2018-06-22 10:44:33,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:44:33,955 INFO ]: Finished difference Result 2450 states and 34387 transitions. [2018-06-22 10:44:33,955 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:44:33,955 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 10:44:33,956 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:44:34,340 INFO ]: With dead ends: 2450 [2018-06-22 10:44:34,340 INFO ]: Without dead ends: 2450 [2018-06-22 10:44:34,340 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:44:34,341 INFO ]: Start minimizeSevpa. Operand 2450 states. Received shutdown request... [2018-06-22 10:44:37,726 WARN ]: Verification canceled [2018-06-22 10:44:37,729 WARN ]: Timeout [2018-06-22 10:44:37,730 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:44:37 BoogieIcfgContainer [2018-06-22 10:44:37,730 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:44:37,730 INFO ]: Toolchain (without parser) took 56610.53 ms. Allocated memory was 302.5 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 233.1 MB in the beginning and 422.0 MB in the end (delta: -188.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 3.6 GB. [2018-06-22 10:44:37,732 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 302.5 MB. Free memory is still 267.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:44:37,732 INFO ]: ChcToBoogie took 97.47 ms. Allocated memory is still 302.5 MB. Free memory was 233.1 MB in the beginning and 229.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:44:37,733 INFO ]: Boogie Preprocessor took 67.29 ms. Allocated memory is still 302.5 MB. Free memory was 229.2 MB in the beginning and 227.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:44:37,733 INFO ]: RCFGBuilder took 1597.09 ms. Allocated memory was 302.5 MB in the beginning and 320.3 MB in the end (delta: 17.8 MB). Free memory was 227.2 MB in the beginning and 272.7 MB in the end (delta: -45.5 MB). Peak memory consumption was 51.4 MB. Max. memory is 3.6 GB. [2018-06-22 10:44:37,733 INFO ]: TraceAbstraction took 54840.28 ms. Allocated memory was 320.3 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 272.7 MB in the beginning and 422.0 MB in the end (delta: -149.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 3.6 GB. [2018-06-22 10:44:37,743 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 302.5 MB. Free memory is still 267.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 97.47 ms. Allocated memory is still 302.5 MB. Free memory was 233.1 MB in the beginning and 229.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 67.29 ms. Allocated memory is still 302.5 MB. Free memory was 229.2 MB in the beginning and 227.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1597.09 ms. Allocated memory was 302.5 MB in the beginning and 320.3 MB in the end (delta: 17.8 MB). Free memory was 227.2 MB in the beginning and 272.7 MB in the end (delta: -45.5 MB). Peak memory consumption was 51.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54840.28 ms. Allocated memory was 320.3 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 272.7 MB in the beginning and 422.0 MB in the end (delta: -149.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 162 locations, 1 error locations. TIMEOUT Result, 54.7s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 29.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4029 SDtfs, 193 SDslu, 20395 SDs, 0 SdLazy, 22494 SolverSat, 1059 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2447occurred 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: 18.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 547 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 364 NumberOfCodeBlocks, 364 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 21272 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1082 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 31/51 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/point-location.44.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-44-37-755.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.44.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-44-37-755.csv Completed graceful shutdown