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_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/009b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:24:52,366 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:24:52,368 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:24:52,379 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:24:52,379 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:24:52,380 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:24:52,381 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:24:52,383 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:24:52,385 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:24:52,385 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:24:52,386 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:24:52,387 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:24:52,387 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:24:52,389 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:24:52,389 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:24:52,390 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:24:52,392 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:24:52,394 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:24:52,396 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:24:52,397 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:24:52,399 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:24:52,401 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:24:52,401 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:24:52,402 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:24:52,402 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:24:52,403 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:24:52,404 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:24:52,405 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:24:52,406 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:24:52,406 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:24:52,407 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:24:52,407 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:24:52,408 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:24:52,409 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:24:52,409 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:24:52,410 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:24:52,423 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:24:52,423 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:24:52,423 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:24:52,424 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:24:52,425 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:24:52,425 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:24:52,425 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:24:52,426 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:24:52,426 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:24:52,426 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:24:52,426 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:24:52,427 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:24:52,427 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:24:52,427 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:24:52,427 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:24:52,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:24:52,428 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:24:52,429 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:24:52,429 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:24:52,476 INFO ]: Repository-Root is: /tmp [2018-06-22 01:24:52,491 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:24:52,494 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:24:52,495 INFO ]: Initializing SmtParser... [2018-06-22 01:24:52,496 INFO ]: SmtParser initialized [2018-06-22 01:24:52,496 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/009b-horn.smt2 [2018-06-22 01:24:52,498 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 01:24:52,591 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/009b-horn.smt2 unknown [2018-06-22 01:24:53,081 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/009b-horn.smt2 [2018-06-22 01:24:53,087 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:24:53,093 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:24:53,094 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:24:53,094 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:24:53,095 INFO ]: ChcToBoogie initialized [2018-06-22 01:24:53,098 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:24:53" (1/1) ... [2018-06-22 01:24:53,177 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:24:53 Unit [2018-06-22 01:24:53,177 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:24:53,178 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:24:53,178 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:24:53,178 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:24:53,199 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:24:53" (1/1) ... [2018-06-22 01:24:53,200 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:24:53" (1/1) ... [2018-06-22 01:24:53,223 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:24:53" (1/1) ... [2018-06-22 01:24:53,223 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:24:53" (1/1) ... [2018-06-22 01:24:53,245 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:24:53" (1/1) ... [2018-06-22 01:24:53,257 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:24:53" (1/1) ... [2018-06-22 01:24:53,261 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:24:53" (1/1) ... [2018-06-22 01:24:53,272 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:24:53,273 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:24:53,273 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:24:53,273 INFO ]: RCFGBuilder initialized [2018-06-22 01:24:53,274 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:24:53" (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-22 01:24:53,295 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:24:53,295 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:24:53,295 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:24:53,295 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:24:53,295 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:24:53,295 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-22 01:24:54,315 INFO ]: Using library mode [2018-06-22 01:24:54,316 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:24:54 BoogieIcfgContainer [2018-06-22 01:24:54,316 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:24:54,320 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:24:54,320 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:24:54,325 INFO ]: TraceAbstraction initialized [2018-06-22 01:24:54,326 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:24:53" (1/3) ... [2018-06-22 01:24:54,327 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c65875c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:24:54, skipping insertion in model container [2018-06-22 01:24:54,327 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:24:53" (2/3) ... [2018-06-22 01:24:54,327 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c65875c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:24:54, skipping insertion in model container [2018-06-22 01:24:54,327 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:24:54" (3/3) ... [2018-06-22 01:24:54,330 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:24:54,339 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:24:54,349 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:24:54,404 INFO ]: Using default assertion order modulation [2018-06-22 01:24:54,404 INFO ]: Interprodecural is true [2018-06-22 01:24:54,405 INFO ]: Hoare is false [2018-06-22 01:24:54,405 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:24:54,405 INFO ]: Backedges is TWOTRACK [2018-06-22 01:24:54,405 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:24:54,405 INFO ]: Difference is false [2018-06-22 01:24:54,405 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:24:54,405 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:24:54,427 INFO ]: Start isEmpty. Operand 10 states. [2018-06-22 01:24:54,439 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:24:54,439 INFO ]: Found error trace [2018-06-22 01:24:54,440 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:54,440 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:54,446 INFO ]: Analyzing trace with hash 1903177198, now seen corresponding path program 1 times [2018-06-22 01:24:54,448 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:54,449 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:54,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:54,498 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:54,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:54,543 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:54,648 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:54,651 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:24:54,651 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:24:54,653 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:24:54,667 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:24:54,668 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:54,670 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-22 01:24:55,303 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:55,303 INFO ]: Finished difference Result 9 states and 65 transitions. [2018-06-22 01:24:55,304 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:24:55,305 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:24:55,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:55,315 INFO ]: With dead ends: 9 [2018-06-22 01:24:55,315 INFO ]: Without dead ends: 9 [2018-06-22 01:24:55,317 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-22 01:24:55,334 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 01:24:55,352 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 01:24:55,353 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 01:24:55,354 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2018-06-22 01:24:55,355 INFO ]: Start accepts. Automaton has 9 states and 65 transitions. Word has length 7 [2018-06-22 01:24:55,356 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:55,356 INFO ]: Abstraction has 9 states and 65 transitions. [2018-06-22 01:24:55,356 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:24:55,356 INFO ]: Start isEmpty. Operand 9 states and 65 transitions. [2018-06-22 01:24:55,357 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:24:55,357 INFO ]: Found error trace [2018-06-22 01:24:55,357 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:55,357 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:55,357 INFO ]: Analyzing trace with hash -1136267950, now seen corresponding path program 1 times [2018-06-22 01:24:55,357 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:55,357 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:55,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:55,358 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:55,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:55,386 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:55,508 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:55,508 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:24:55,508 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:24:55,509 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:24:55,509 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:24:55,509 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:55,510 INFO ]: Start difference. First operand 9 states and 65 transitions. Second operand 3 states. [2018-06-22 01:24:56,049 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:56,049 INFO ]: Finished difference Result 11 states and 123 transitions. [2018-06-22 01:24:56,049 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:24:56,050 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:24:56,050 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:56,051 INFO ]: With dead ends: 11 [2018-06-22 01:24:56,051 INFO ]: Without dead ends: 11 [2018-06-22 01:24:56,051 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-22 01:24:56,052 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:24:56,054 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:24:56,054 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:24:56,056 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2018-06-22 01:24:56,056 INFO ]: Start accepts. Automaton has 11 states and 123 transitions. Word has length 8 [2018-06-22 01:24:56,056 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:56,056 INFO ]: Abstraction has 11 states and 123 transitions. [2018-06-22 01:24:56,056 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:24:56,056 INFO ]: Start isEmpty. Operand 11 states and 123 transitions. [2018-06-22 01:24:56,056 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:24:56,056 INFO ]: Found error trace [2018-06-22 01:24:56,056 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:56,056 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:56,057 INFO ]: Analyzing trace with hash -1191679210, now seen corresponding path program 1 times [2018-06-22 01:24:56,057 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:56,057 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:56,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:56,058 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:56,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:56,073 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:56,136 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:56,136 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:56,136 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 01:24:56,143 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:56,176 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:56,185 INFO ]: Computing forward predicates... [2018-06-22 01:24:56,283 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:56,316 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:56,317 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:24:56,317 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:24:56,317 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:24:56,317 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:24:56,317 INFO ]: Start difference. First operand 11 states and 123 transitions. Second operand 4 states. [2018-06-22 01:24:57,065 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:57,065 INFO ]: Finished difference Result 13 states and 181 transitions. [2018-06-22 01:24:57,065 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:24:57,065 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:24:57,065 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:57,066 INFO ]: With dead ends: 13 [2018-06-22 01:24:57,066 INFO ]: Without dead ends: 13 [2018-06-22 01:24:57,067 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:24:57,067 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:24:57,071 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 01:24:57,071 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:24:57,073 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 181 transitions. [2018-06-22 01:24:57,073 INFO ]: Start accepts. Automaton has 13 states and 181 transitions. Word has length 8 [2018-06-22 01:24:57,073 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:57,073 INFO ]: Abstraction has 13 states and 181 transitions. [2018-06-22 01:24:57,073 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:24:57,073 INFO ]: Start isEmpty. Operand 13 states and 181 transitions. [2018-06-22 01:24:57,074 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:24:57,074 INFO ]: Found error trace [2018-06-22 01:24:57,074 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:57,074 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:57,074 INFO ]: Analyzing trace with hash -1126109219, now seen corresponding path program 1 times [2018-06-22 01:24:57,074 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:57,074 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:57,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:57,075 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:57,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:57,090 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:57,121 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:57,121 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:24:57,121 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:24:57,121 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:24:57,121 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:24:57,121 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:57,121 INFO ]: Start difference. First operand 13 states and 181 transitions. Second operand 3 states. [2018-06-22 01:24:57,738 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:57,738 INFO ]: Finished difference Result 18 states and 326 transitions. [2018-06-22 01:24:57,739 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:24:57,739 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:24:57,740 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:57,741 INFO ]: With dead ends: 18 [2018-06-22 01:24:57,741 INFO ]: Without dead ends: 18 [2018-06-22 01:24:57,741 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-22 01:24:57,741 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:24:57,749 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-06-22 01:24:57,749 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:24:57,750 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 297 transitions. [2018-06-22 01:24:57,750 INFO ]: Start accepts. Automaton has 17 states and 297 transitions. Word has length 8 [2018-06-22 01:24:57,750 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:57,750 INFO ]: Abstraction has 17 states and 297 transitions. [2018-06-22 01:24:57,750 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:24:57,750 INFO ]: Start isEmpty. Operand 17 states and 297 transitions. [2018-06-22 01:24:57,752 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:24:57,752 INFO ]: Found error trace [2018-06-22 01:24:57,753 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:57,753 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:57,753 INFO ]: Analyzing trace with hash -1107638799, now seen corresponding path program 1 times [2018-06-22 01:24:57,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:57,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:57,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:57,754 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:57,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:57,780 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:57,844 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:57,844 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:24:57,844 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:24:57,844 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:24:57,844 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:24:57,844 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:57,844 INFO ]: Start difference. First operand 17 states and 297 transitions. Second operand 3 states. [2018-06-22 01:24:58,022 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:58,022 INFO ]: Finished difference Result 23 states and 471 transitions. [2018-06-22 01:24:58,022 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:24:58,022 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:24:58,022 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:58,024 INFO ]: With dead ends: 23 [2018-06-22 01:24:58,024 INFO ]: Without dead ends: 23 [2018-06-22 01:24:58,024 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-22 01:24:58,024 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:24:58,028 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-06-22 01:24:58,028 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:24:58,030 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 355 transitions. [2018-06-22 01:24:58,030 INFO ]: Start accepts. Automaton has 19 states and 355 transitions. Word has length 8 [2018-06-22 01:24:58,030 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:58,030 INFO ]: Abstraction has 19 states and 355 transitions. [2018-06-22 01:24:58,030 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:24:58,030 INFO ]: Start isEmpty. Operand 19 states and 355 transitions. [2018-06-22 01:24:58,031 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:24:58,031 INFO ]: Found error trace [2018-06-22 01:24:58,031 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:58,031 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:58,031 INFO ]: Analyzing trace with hash -880869278, now seen corresponding path program 1 times [2018-06-22 01:24:58,031 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:58,031 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:58,032 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:58,032 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:58,032 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:58,065 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:58,161 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:24:58,162 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:24:58,162 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:24:58,162 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:24:58,162 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:24:58,162 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:58,162 INFO ]: Start difference. First operand 19 states and 355 transitions. Second operand 3 states. [2018-06-22 01:24:58,334 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:58,334 INFO ]: Finished difference Result 21 states and 349 transitions. [2018-06-22 01:24:58,335 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:24:58,335 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:24:58,335 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:58,335 INFO ]: With dead ends: 21 [2018-06-22 01:24:58,335 INFO ]: Without dead ends: 17 [2018-06-22 01:24:58,335 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 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-22 01:24:58,335 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:24:58,338 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 01:24:58,338 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:24:58,339 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 197 transitions. [2018-06-22 01:24:58,339 INFO ]: Start accepts. Automaton has 17 states and 197 transitions. Word has length 9 [2018-06-22 01:24:58,339 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:58,339 INFO ]: Abstraction has 17 states and 197 transitions. [2018-06-22 01:24:58,339 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:24:58,339 INFO ]: Start isEmpty. Operand 17 states and 197 transitions. [2018-06-22 01:24:58,339 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:24:58,339 INFO ]: Found error trace [2018-06-22 01:24:58,340 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:58,340 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:58,340 INFO ]: Analyzing trace with hash -37694605, now seen corresponding path program 1 times [2018-06-22 01:24:58,340 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:58,340 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:58,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:58,341 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:58,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:58,350 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:58,392 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:58,393 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:24:58,393 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:24:58,393 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:24:58,393 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:24:58,393 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:58,393 INFO ]: Start difference. First operand 17 states and 197 transitions. Second operand 3 states. [2018-06-22 01:24:58,492 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:58,492 INFO ]: Finished difference Result 23 states and 249 transitions. [2018-06-22 01:24:58,493 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:24:58,493 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:24:58,493 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:58,495 INFO ]: With dead ends: 23 [2018-06-22 01:24:58,495 INFO ]: Without dead ends: 23 [2018-06-22 01:24:58,495 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-22 01:24:58,497 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:24:58,500 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-06-22 01:24:58,500 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:24:58,501 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 231 transitions. [2018-06-22 01:24:58,501 INFO ]: Start accepts. Automaton has 20 states and 231 transitions. Word has length 9 [2018-06-22 01:24:58,501 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:58,501 INFO ]: Abstraction has 20 states and 231 transitions. [2018-06-22 01:24:58,501 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:24:58,501 INFO ]: Start isEmpty. Operand 20 states and 231 transitions. [2018-06-22 01:24:58,501 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:24:58,501 INFO ]: Found error trace [2018-06-22 01:24:58,501 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:58,501 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:58,502 INFO ]: Analyzing trace with hash -22918269, now seen corresponding path program 1 times [2018-06-22 01:24:58,502 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:58,502 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:58,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:58,502 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:58,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:58,516 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:58,554 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:58,555 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:24:58,555 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:24:58,555 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:24:58,555 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:24:58,555 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:58,555 INFO ]: Start difference. First operand 20 states and 231 transitions. Second operand 3 states. [2018-06-22 01:24:58,638 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:58,639 INFO ]: Finished difference Result 25 states and 165 transitions. [2018-06-22 01:24:58,639 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:24:58,639 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:24:58,639 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:58,639 INFO ]: With dead ends: 25 [2018-06-22 01:24:58,639 INFO ]: Without dead ends: 19 [2018-06-22 01:24:58,640 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-22 01:24:58,640 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:24:58,642 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-22 01:24:58,642 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:24:58,642 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 98 transitions. [2018-06-22 01:24:58,642 INFO ]: Start accepts. Automaton has 17 states and 98 transitions. Word has length 9 [2018-06-22 01:24:58,642 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:58,643 INFO ]: Abstraction has 17 states and 98 transitions. [2018-06-22 01:24:58,643 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:24:58,643 INFO ]: Start isEmpty. Operand 17 states and 98 transitions. [2018-06-22 01:24:58,643 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:24:58,643 INFO ]: Found error trace [2018-06-22 01:24:58,643 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:58,643 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:58,643 INFO ]: Analyzing trace with hash 6634403, now seen corresponding path program 1 times [2018-06-22 01:24:58,643 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:58,643 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:58,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:58,644 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:58,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:58,666 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:58,742 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:24:58,742 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:24:58,742 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:24:58,742 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:24:58,742 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:24:58,742 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:58,742 INFO ]: Start difference. First operand 17 states and 98 transitions. Second operand 3 states. [2018-06-22 01:24:58,880 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:58,880 INFO ]: Finished difference Result 20 states and 114 transitions. [2018-06-22 01:24:58,880 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:24:58,880 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:24:58,880 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:58,881 INFO ]: With dead ends: 20 [2018-06-22 01:24:58,881 INFO ]: Without dead ends: 18 [2018-06-22 01:24:58,881 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 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-22 01:24:58,881 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:24:58,883 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-06-22 01:24:58,883 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:24:58,883 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2018-06-22 01:24:58,883 INFO ]: Start accepts. Automaton has 14 states and 35 transitions. Word has length 9 [2018-06-22 01:24:58,883 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:58,883 INFO ]: Abstraction has 14 states and 35 transitions. [2018-06-22 01:24:58,883 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:24:58,883 INFO ]: Start isEmpty. Operand 14 states and 35 transitions. [2018-06-22 01:24:58,884 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:24:58,884 INFO ]: Found error trace [2018-06-22 01:24:58,884 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:58,884 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:58,884 INFO ]: Analyzing trace with hash -381244417, now seen corresponding path program 1 times [2018-06-22 01:24:58,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:58,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:58,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:58,885 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:58,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:58,898 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:58,968 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:58,968 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:24:58,968 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:24:58,969 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:24:58,969 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:24:58,969 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:58,969 INFO ]: Start difference. First operand 14 states and 35 transitions. Second operand 3 states. [2018-06-22 01:24:59,107 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:59,107 INFO ]: Finished difference Result 15 states and 37 transitions. [2018-06-22 01:24:59,108 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:24:59,108 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:24:59,108 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:59,109 INFO ]: With dead ends: 15 [2018-06-22 01:24:59,109 INFO ]: Without dead ends: 15 [2018-06-22 01:24:59,109 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:59,109 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:24:59,110 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 01:24:59,110 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:24:59,110 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 37 transitions. [2018-06-22 01:24:59,110 INFO ]: Start accepts. Automaton has 15 states and 37 transitions. Word has length 9 [2018-06-22 01:24:59,110 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:59,110 INFO ]: Abstraction has 15 states and 37 transitions. [2018-06-22 01:24:59,110 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:24:59,110 INFO ]: Start isEmpty. Operand 15 states and 37 transitions. [2018-06-22 01:24:59,111 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:24:59,111 INFO ]: Found error trace [2018-06-22 01:24:59,111 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:59,111 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:59,111 INFO ]: Analyzing trace with hash 549664751, now seen corresponding path program 1 times [2018-06-22 01:24:59,111 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:59,111 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:59,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:59,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:59,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:59,130 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:59,157 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:59,157 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:24:59,157 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:24:59,157 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:24:59,157 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:24:59,157 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:59,158 INFO ]: Start difference. First operand 15 states and 37 transitions. Second operand 3 states. [2018-06-22 01:24:59,189 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:59,189 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-22 01:24:59,189 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:24:59,189 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:24:59,189 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:59,189 INFO ]: With dead ends: 9 [2018-06-22 01:24:59,189 INFO ]: Without dead ends: 0 [2018-06-22 01:24:59,189 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-22 01:24:59,189 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:24:59,190 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:24:59,190 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:24:59,190 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:24:59,190 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2018-06-22 01:24:59,190 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:59,190 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:24:59,190 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:24:59,190 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:24:59,190 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:24:59,195 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:24:59 BoogieIcfgContainer [2018-06-22 01:24:59,195 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:24:59,196 INFO ]: Toolchain (without parser) took 6107.80 ms. Allocated memory was 308.8 MB in the beginning and 350.2 MB in the end (delta: 41.4 MB). Free memory was 236.3 MB in the beginning and 188.1 MB in the end (delta: 48.2 MB). Peak memory consumption was 89.6 MB. Max. memory is 3.6 GB. [2018-06-22 01:24:59,197 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:24:59,198 INFO ]: ChcToBoogie took 83.75 ms. Allocated memory is still 308.8 MB. Free memory was 235.3 MB in the beginning and 230.3 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:24:59,198 INFO ]: Boogie Preprocessor took 94.84 ms. Allocated memory is still 308.8 MB. Free memory was 230.3 MB in the beginning and 228.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:24:59,199 INFO ]: RCFGBuilder took 1042.59 ms. Allocated memory was 308.8 MB in the beginning and 324.5 MB in the end (delta: 15.7 MB). Free memory was 228.3 MB in the beginning and 277.8 MB in the end (delta: -49.5 MB). Peak memory consumption was 45.8 MB. Max. memory is 3.6 GB. [2018-06-22 01:24:59,199 INFO ]: TraceAbstraction took 4875.20 ms. Allocated memory was 324.5 MB in the beginning and 350.2 MB in the end (delta: 25.7 MB). Free memory was 277.8 MB in the beginning and 188.1 MB in the end (delta: 89.7 MB). Peak memory consumption was 115.4 MB. Max. memory is 3.6 GB. [2018-06-22 01:24:59,202 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 83.75 ms. Allocated memory is still 308.8 MB. Free memory was 235.3 MB in the beginning and 230.3 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 94.84 ms. Allocated memory is still 308.8 MB. Free memory was 230.3 MB in the beginning and 228.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1042.59 ms. Allocated memory was 308.8 MB in the beginning and 324.5 MB in the end (delta: 15.7 MB). Free memory was 228.3 MB in the beginning and 277.8 MB in the end (delta: -49.5 MB). Peak memory consumption was 45.8 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4875.20 ms. Allocated memory was 324.5 MB in the beginning and 350.2 MB in the end (delta: 25.7 MB). Free memory was 277.8 MB in the beginning and 188.1 MB in the end (delta: 89.7 MB). Peak memory consumption was 115.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. SAFE Result, 4.8s OverallTime, 11 OverallIterations, 1 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 253 SDtfs, 5 SDslu, 55 SDs, 0 SdLazy, 520 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=7, 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: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 14 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 1394 SizeOfPredicates, 2 NumberOfNonLiveVariables, 96 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 21/23 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/009b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-24-59-213.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/009b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-24-59-213.csv Received shutdown request...