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/hopv/lia/termination/Ackermann06.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:53:27,276 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:53:27,281 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:53:27,293 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:53:27,293 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:53:27,295 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:53:27,296 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:53:27,300 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:53:27,302 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:53:27,303 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:53:27,304 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:53:27,304 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:53:27,305 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:53:27,306 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:53:27,309 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:53:27,310 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:53:27,312 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:53:27,322 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:53:27,323 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:53:27,324 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:53:27,332 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:53:27,334 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:53:27,334 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:53:27,335 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:53:27,335 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:53:27,336 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:53:27,337 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:53:27,337 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:53:27,339 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:53:27,341 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:53:27,342 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:53:27,342 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:53:27,342 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:53:27,343 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:53:27,344 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:53:27,344 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:53:27,363 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:53:27,363 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:53:27,364 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:53:27,364 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:53:27,365 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:53:27,365 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:53:27,365 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:53:27,365 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:53:27,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:53:27,366 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:53:27,366 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:53:27,366 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:53:27,366 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:53:27,367 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:53:27,367 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:53:27,367 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:53:27,367 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:53:27,371 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:53:27,371 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:53:27,413 INFO ]: Repository-Root is: /tmp [2018-06-22 01:53:27,428 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:53:27,434 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:53:27,436 INFO ]: Initializing SmtParser... [2018-06-22 01:53:27,436 INFO ]: SmtParser initialized [2018-06-22 01:53:27,437 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/termination/Ackermann06.smt2 [2018-06-22 01:53:27,438 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:53:27,535 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/termination/Ackermann06.smt2 unknown [2018-06-22 01:53:28,295 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/termination/Ackermann06.smt2 [2018-06-22 01:53:28,300 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:53:28,307 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:53:28,308 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:53:28,308 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:53:28,308 INFO ]: ChcToBoogie initialized [2018-06-22 01:53:28,311 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:53:28" (1/1) ... [2018-06-22 01:53:28,402 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:53:28 Unit [2018-06-22 01:53:28,402 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:53:28,402 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:53:28,402 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:53:28,402 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:53:28,423 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:53:28" (1/1) ... [2018-06-22 01:53:28,423 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:53:28" (1/1) ... [2018-06-22 01:53:28,442 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:53:28" (1/1) ... [2018-06-22 01:53:28,442 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:53:28" (1/1) ... [2018-06-22 01:53:28,460 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:53:28" (1/1) ... [2018-06-22 01:53:28,475 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:53:28" (1/1) ... [2018-06-22 01:53:28,477 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:53:28" (1/1) ... [2018-06-22 01:53:28,481 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:53:28,491 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:53:28,491 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:53:28,491 INFO ]: RCFGBuilder initialized [2018-06-22 01:53:28,492 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:53:28" (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:53:28,518 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:53:28,518 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:53:28,518 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:53:28,518 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:53:28,518 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:53:28,518 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:53:29,650 INFO ]: Using library mode [2018-06-22 01:53:29,651 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:53:29 BoogieIcfgContainer [2018-06-22 01:53:29,651 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:53:29,653 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:53:29,653 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:53:29,656 INFO ]: TraceAbstraction initialized [2018-06-22 01:53:29,656 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:53:28" (1/3) ... [2018-06-22 01:53:29,657 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f320eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:53:29, skipping insertion in model container [2018-06-22 01:53:29,657 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:53:28" (2/3) ... [2018-06-22 01:53:29,657 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f320eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:53:29, skipping insertion in model container [2018-06-22 01:53:29,657 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:53:29" (3/3) ... [2018-06-22 01:53:29,659 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:53:29,668 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:53:29,684 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:53:29,744 INFO ]: Using default assertion order modulation [2018-06-22 01:53:29,744 INFO ]: Interprodecural is true [2018-06-22 01:53:29,744 INFO ]: Hoare is false [2018-06-22 01:53:29,744 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:53:29,745 INFO ]: Backedges is TWOTRACK [2018-06-22 01:53:29,745 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:53:29,745 INFO ]: Difference is false [2018-06-22 01:53:29,745 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:53:29,745 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:53:29,768 INFO ]: Start isEmpty. Operand 48 states. [2018-06-22 01:53:29,787 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:53:29,787 INFO ]: Found error trace [2018-06-22 01:53:29,790 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:53:29,790 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:29,795 INFO ]: Analyzing trace with hash -513527745, now seen corresponding path program 1 times [2018-06-22 01:53:29,797 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:29,798 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:29,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:29,846 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:53:29,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:29,891 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:30,090 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:53:30,093 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:53:30,093 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:53:30,095 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:53:30,110 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:53:30,111 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:53:30,113 INFO ]: Start difference. First operand 48 states. Second operand 4 states. [2018-06-22 01:53:30,892 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:53:30,892 INFO ]: Finished difference Result 70 states and 110 transitions. [2018-06-22 01:53:30,892 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:53:30,893 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 01:53:30,894 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:53:30,906 INFO ]: With dead ends: 70 [2018-06-22 01:53:30,906 INFO ]: Without dead ends: 56 [2018-06-22 01:53:30,912 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:53:30,937 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 01:53:30,971 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-06-22 01:53:30,972 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 01:53:30,976 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2018-06-22 01:53:30,977 INFO ]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 10 [2018-06-22 01:53:30,978 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:53:30,978 INFO ]: Abstraction has 56 states and 86 transitions. [2018-06-22 01:53:30,978 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:53:30,978 INFO ]: Start isEmpty. Operand 56 states and 86 transitions. [2018-06-22 01:53:30,981 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:53:30,981 INFO ]: Found error trace [2018-06-22 01:53:30,981 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:53:30,981 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:30,981 INFO ]: Analyzing trace with hash -305951427, now seen corresponding path program 1 times [2018-06-22 01:53:30,981 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:30,981 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:30,982 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:30,982 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:53:30,982 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:30,998 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:31,071 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:53:31,071 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:53:31,071 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:53:31,073 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:53:31,073 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:53:31,073 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:53:31,073 INFO ]: Start difference. First operand 56 states and 86 transitions. Second operand 4 states. [2018-06-22 01:53:31,315 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:53:31,315 INFO ]: Finished difference Result 74 states and 113 transitions. [2018-06-22 01:53:31,315 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:53:31,315 INFO ]: Start accepts. Automaton has 4 states. Word has length 12 [2018-06-22 01:53:31,316 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:53:31,319 INFO ]: With dead ends: 74 [2018-06-22 01:53:31,319 INFO ]: Without dead ends: 74 [2018-06-22 01:53:31,320 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:53:31,320 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 01:53:31,329 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-06-22 01:53:31,329 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 01:53:31,331 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 113 transitions. [2018-06-22 01:53:31,332 INFO ]: Start accepts. Automaton has 74 states and 113 transitions. Word has length 12 [2018-06-22 01:53:31,332 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:53:31,332 INFO ]: Abstraction has 74 states and 113 transitions. [2018-06-22 01:53:31,332 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:53:31,332 INFO ]: Start isEmpty. Operand 74 states and 113 transitions. [2018-06-22 01:53:31,334 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:53:31,335 INFO ]: Found error trace [2018-06-22 01:53:31,335 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:53:31,335 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:31,335 INFO ]: Analyzing trace with hash -2144757738, now seen corresponding path program 1 times [2018-06-22 01:53:31,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:31,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:31,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:31,336 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:53:31,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:31,358 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:31,540 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:53:31,541 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:53:31,541 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:53:31,542 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:53:31,542 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:53:31,542 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:53:31,542 INFO ]: Start difference. First operand 74 states and 113 transitions. Second operand 4 states. [2018-06-22 01:53:31,806 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:53:31,806 INFO ]: Finished difference Result 83 states and 126 transitions. [2018-06-22 01:53:31,806 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:53:31,806 INFO ]: Start accepts. Automaton has 4 states. Word has length 14 [2018-06-22 01:53:31,806 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:53:31,809 INFO ]: With dead ends: 83 [2018-06-22 01:53:31,809 INFO ]: Without dead ends: 74 [2018-06-22 01:53:31,809 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:53:31,809 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 01:53:31,819 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-06-22 01:53:31,819 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 01:53:31,822 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2018-06-22 01:53:31,822 INFO ]: Start accepts. Automaton has 74 states and 112 transitions. Word has length 14 [2018-06-22 01:53:31,823 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:53:31,823 INFO ]: Abstraction has 74 states and 112 transitions. [2018-06-22 01:53:31,823 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:53:31,823 INFO ]: Start isEmpty. Operand 74 states and 112 transitions. [2018-06-22 01:53:31,825 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:53:31,825 INFO ]: Found error trace [2018-06-22 01:53:31,825 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:53:31,825 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:31,825 INFO ]: Analyzing trace with hash 878542101, now seen corresponding path program 1 times [2018-06-22 01:53:31,825 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:31,826 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:31,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:31,826 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:53:31,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:31,878 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:31,967 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:53:31,967 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:53:31,967 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:53:31,967 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:53:31,967 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:53:31,967 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:53:31,967 INFO ]: Start difference. First operand 74 states and 112 transitions. Second operand 3 states. [2018-06-22 01:53:32,035 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:53:32,036 INFO ]: Finished difference Result 89 states and 139 transitions. [2018-06-22 01:53:32,036 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:53:32,036 INFO ]: Start accepts. Automaton has 3 states. Word has length 16 [2018-06-22 01:53:32,036 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:53:32,039 INFO ]: With dead ends: 89 [2018-06-22 01:53:32,039 INFO ]: Without dead ends: 89 [2018-06-22 01:53:32,039 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:53:32,040 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-22 01:53:32,049 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 77. [2018-06-22 01:53:32,050 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 01:53:32,052 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 121 transitions. [2018-06-22 01:53:32,052 INFO ]: Start accepts. Automaton has 77 states and 121 transitions. Word has length 16 [2018-06-22 01:53:32,052 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:53:32,052 INFO ]: Abstraction has 77 states and 121 transitions. [2018-06-22 01:53:32,052 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:53:32,052 INFO ]: Start isEmpty. Operand 77 states and 121 transitions. [2018-06-22 01:53:32,054 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:53:32,054 INFO ]: Found error trace [2018-06-22 01:53:32,054 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:53:32,055 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:32,055 INFO ]: Analyzing trace with hash 1157199154, now seen corresponding path program 1 times [2018-06-22 01:53:32,055 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:32,055 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:32,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:32,056 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:53:32,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:32,101 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:32,192 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:53:32,192 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:53:32,192 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:53:32,192 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:53:32,192 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:53:32,192 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:53:32,192 INFO ]: Start difference. First operand 77 states and 121 transitions. Second operand 4 states. [2018-06-22 01:53:32,440 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:53:32,440 INFO ]: Finished difference Result 117 states and 214 transitions. [2018-06-22 01:53:32,460 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:53:32,460 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 01:53:32,460 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:53:32,466 INFO ]: With dead ends: 117 [2018-06-22 01:53:32,466 INFO ]: Without dead ends: 117 [2018-06-22 01:53:32,466 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:53:32,466 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-22 01:53:32,484 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 81. [2018-06-22 01:53:32,484 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-22 01:53:32,486 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 129 transitions. [2018-06-22 01:53:32,486 INFO ]: Start accepts. Automaton has 81 states and 129 transitions. Word has length 17 [2018-06-22 01:53:32,487 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:53:32,487 INFO ]: Abstraction has 81 states and 129 transitions. [2018-06-22 01:53:32,487 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:53:32,487 INFO ]: Start isEmpty. Operand 81 states and 129 transitions. [2018-06-22 01:53:32,490 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:53:32,490 INFO ]: Found error trace [2018-06-22 01:53:32,490 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:53:32,490 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:32,490 INFO ]: Analyzing trace with hash 768087569, now seen corresponding path program 1 times [2018-06-22 01:53:32,490 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:32,490 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:32,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:32,491 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:53:32,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:32,549 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:32,628 INFO ]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:53:32,628 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:53:32,628 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:53:32,628 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:53:32,629 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:53:32,629 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:53:32,629 INFO ]: Start difference. First operand 81 states and 129 transitions. Second operand 4 states. [2018-06-22 01:53:33,051 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:53:33,051 INFO ]: Finished difference Result 130 states and 211 transitions. [2018-06-22 01:53:33,051 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:53:33,051 INFO ]: Start accepts. Automaton has 4 states. Word has length 29 [2018-06-22 01:53:33,052 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:53:33,053 INFO ]: With dead ends: 130 [2018-06-22 01:53:33,054 INFO ]: Without dead ends: 103 [2018-06-22 01:53:33,054 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:53:33,054 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-22 01:53:33,065 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-06-22 01:53:33,065 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-22 01:53:33,067 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 159 transitions. [2018-06-22 01:53:33,067 INFO ]: Start accepts. Automaton has 103 states and 159 transitions. Word has length 29 [2018-06-22 01:53:33,067 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:53:33,067 INFO ]: Abstraction has 103 states and 159 transitions. [2018-06-22 01:53:33,067 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:53:33,067 INFO ]: Start isEmpty. Operand 103 states and 159 transitions. [2018-06-22 01:53:33,069 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:53:33,070 INFO ]: Found error trace [2018-06-22 01:53:33,070 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:53:33,070 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:33,070 INFO ]: Analyzing trace with hash -130053792, now seen corresponding path program 1 times [2018-06-22 01:53:33,070 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:33,070 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:33,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:33,071 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:53:33,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:33,099 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:33,199 INFO ]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:53:33,199 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:53:33,199 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:53:33,199 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:53:33,199 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:53:33,199 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:53:33,200 INFO ]: Start difference. First operand 103 states and 159 transitions. Second operand 4 states. [2018-06-22 01:53:33,567 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:53:33,567 INFO ]: Finished difference Result 130 states and 205 transitions. [2018-06-22 01:53:33,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:53:33,568 INFO ]: Start accepts. Automaton has 4 states. Word has length 31 [2018-06-22 01:53:33,568 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:53:33,571 INFO ]: With dead ends: 130 [2018-06-22 01:53:33,571 INFO ]: Without dead ends: 103 [2018-06-22 01:53:33,571 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:53:33,571 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-22 01:53:33,579 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-06-22 01:53:33,579 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-22 01:53:33,581 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 156 transitions. [2018-06-22 01:53:33,581 INFO ]: Start accepts. Automaton has 103 states and 156 transitions. Word has length 31 [2018-06-22 01:53:33,581 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:53:33,581 INFO ]: Abstraction has 103 states and 156 transitions. [2018-06-22 01:53:33,581 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:53:33,581 INFO ]: Start isEmpty. Operand 103 states and 156 transitions. [2018-06-22 01:53:33,583 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:53:33,583 INFO ]: Found error trace [2018-06-22 01:53:33,583 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:53:33,583 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:33,583 INFO ]: Analyzing trace with hash -1469524116, now seen corresponding path program 1 times [2018-06-22 01:53:33,583 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:33,583 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:33,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:33,584 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:53:33,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:33,611 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:33,996 INFO ]: Checked inductivity of 15 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:53:33,996 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:53:33,996 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:53:34,015 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:53:34,114 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:34,125 INFO ]: Computing forward predicates... [2018-06-22 01:53:34,636 INFO ]: Checked inductivity of 15 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:53:34,673 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:53:34,673 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 01:53:34,674 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:53:34,674 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:53:34,674 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:53:34,674 INFO ]: Start difference. First operand 103 states and 156 transitions. Second operand 10 states. [2018-06-22 01:53:35,816 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:53:35,816 INFO ]: Finished difference Result 161 states and 263 transitions. [2018-06-22 01:53:35,817 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:53:35,817 INFO ]: Start accepts. Automaton has 10 states. Word has length 31 [2018-06-22 01:53:35,817 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:53:35,820 INFO ]: With dead ends: 161 [2018-06-22 01:53:35,821 INFO ]: Without dead ends: 161 [2018-06-22 01:53:35,821 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:53:35,821 INFO ]: Start minimizeSevpa. Operand 161 states. [2018-06-22 01:53:35,837 INFO ]: Finished minimizeSevpa. Reduced states from 161 to 120. [2018-06-22 01:53:35,837 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-22 01:53:35,839 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 195 transitions. [2018-06-22 01:53:35,839 INFO ]: Start accepts. Automaton has 120 states and 195 transitions. Word has length 31 [2018-06-22 01:53:35,839 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:53:35,839 INFO ]: Abstraction has 120 states and 195 transitions. [2018-06-22 01:53:35,839 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:53:35,839 INFO ]: Start isEmpty. Operand 120 states and 195 transitions. [2018-06-22 01:53:35,843 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:53:35,843 INFO ]: Found error trace [2018-06-22 01:53:35,843 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:53:35,843 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:35,843 INFO ]: Analyzing trace with hash -891027025, now seen corresponding path program 2 times [2018-06-22 01:53:35,843 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:35,843 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:35,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:35,844 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:53:35,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:35,877 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:36,082 INFO ]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 01:53:36,082 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:53:36,082 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:53:36,083 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:53:36,083 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:53:36,083 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:53:36,083 INFO ]: Start difference. First operand 120 states and 195 transitions. Second operand 4 states. [2018-06-22 01:53:36,142 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:53:36,142 INFO ]: Finished difference Result 145 states and 245 transitions. [2018-06-22 01:53:36,143 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:53:36,143 INFO ]: Start accepts. Automaton has 4 states. Word has length 32 [2018-06-22 01:53:36,143 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:53:36,145 INFO ]: With dead ends: 145 [2018-06-22 01:53:36,146 INFO ]: Without dead ends: 145 [2018-06-22 01:53:36,146 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:53:36,146 INFO ]: Start minimizeSevpa. Operand 145 states. [2018-06-22 01:53:36,159 INFO ]: Finished minimizeSevpa. Reduced states from 145 to 125. [2018-06-22 01:53:36,159 INFO ]: Start removeUnreachable. Operand 125 states. [2018-06-22 01:53:36,161 INFO ]: Finished removeUnreachable. Reduced from 125 states to 125 states and 210 transitions. [2018-06-22 01:53:36,161 INFO ]: Start accepts. Automaton has 125 states and 210 transitions. Word has length 32 [2018-06-22 01:53:36,161 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:53:36,161 INFO ]: Abstraction has 125 states and 210 transitions. [2018-06-22 01:53:36,161 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:53:36,161 INFO ]: Start isEmpty. Operand 125 states and 210 transitions. [2018-06-22 01:53:36,164 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 01:53:36,164 INFO ]: Found error trace [2018-06-22 01:53:36,164 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:53:36,164 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:36,164 INFO ]: Analyzing trace with hash 2135131096, now seen corresponding path program 3 times [2018-06-22 01:53:36,165 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:36,165 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:36,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:36,165 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:53:36,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:36,214 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:36,361 INFO ]: Checked inductivity of 24 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 01:53:36,361 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:53:36,361 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 01:53:36,374 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:53:36,476 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:53:36,476 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:36,484 INFO ]: Computing forward predicates... [2018-06-22 01:53:36,649 WARN ]: expecting exponential blowup for input size 6 [2018-06-22 01:53:36,821 INFO ]: Checked inductivity of 24 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 01:53:36,856 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:53:36,856 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-06-22 01:53:36,856 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:53:36,857 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:53:36,857 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:53:36,857 INFO ]: Start difference. First operand 125 states and 210 transitions. Second operand 11 states. [2018-06-22 01:53:37,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:53:37,667 INFO ]: Finished difference Result 265 states and 549 transitions. [2018-06-22 01:53:37,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:53:37,667 INFO ]: Start accepts. Automaton has 11 states. Word has length 33 [2018-06-22 01:53:37,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:53:37,675 INFO ]: With dead ends: 265 [2018-06-22 01:53:37,676 INFO ]: Without dead ends: 249 [2018-06-22 01:53:37,676 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:53:37,676 INFO ]: Start minimizeSevpa. Operand 249 states. [2018-06-22 01:53:37,711 INFO ]: Finished minimizeSevpa. Reduced states from 249 to 143. [2018-06-22 01:53:37,711 INFO ]: Start removeUnreachable. Operand 143 states. [2018-06-22 01:53:37,714 INFO ]: Finished removeUnreachable. Reduced from 143 states to 143 states and 255 transitions. [2018-06-22 01:53:37,714 INFO ]: Start accepts. Automaton has 143 states and 255 transitions. Word has length 33 [2018-06-22 01:53:37,714 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:53:37,714 INFO ]: Abstraction has 143 states and 255 transitions. [2018-06-22 01:53:37,714 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:53:37,714 INFO ]: Start isEmpty. Operand 143 states and 255 transitions. [2018-06-22 01:53:37,720 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:53:37,720 INFO ]: Found error trace [2018-06-22 01:53:37,720 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:53:37,720 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:37,720 INFO ]: Analyzing trace with hash -1595882711, now seen corresponding path program 1 times [2018-06-22 01:53:37,720 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:37,720 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:37,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:37,724 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:53:37,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:37,746 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:37,822 INFO ]: Checked inductivity of 42 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 01:53:37,822 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:53:37,822 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:53:37,829 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:53:37,919 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:37,924 INFO ]: Computing forward predicates... [2018-06-22 01:53:38,069 INFO ]: Checked inductivity of 42 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 01:53:38,090 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:53:38,090 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 12 [2018-06-22 01:53:38,090 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:53:38,090 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:53:38,090 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:53:38,090 INFO ]: Start difference. First operand 143 states and 255 transitions. Second operand 12 states. [2018-06-22 01:53:39,513 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:53:39,513 INFO ]: Finished difference Result 280 states and 588 transitions. [2018-06-22 01:53:39,516 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 01:53:39,516 INFO ]: Start accepts. Automaton has 12 states. Word has length 43 [2018-06-22 01:53:39,516 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:53:39,523 INFO ]: With dead ends: 280 [2018-06-22 01:53:39,523 INFO ]: Without dead ends: 280 [2018-06-22 01:53:39,524 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=238, Invalid=1168, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:53:39,524 INFO ]: Start minimizeSevpa. Operand 280 states. [2018-06-22 01:53:39,548 INFO ]: Finished minimizeSevpa. Reduced states from 280 to 169. [2018-06-22 01:53:39,548 INFO ]: Start removeUnreachable. Operand 169 states. [2018-06-22 01:53:39,551 INFO ]: Finished removeUnreachable. Reduced from 169 states to 169 states and 313 transitions. [2018-06-22 01:53:39,551 INFO ]: Start accepts. Automaton has 169 states and 313 transitions. Word has length 43 [2018-06-22 01:53:39,551 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:53:39,551 INFO ]: Abstraction has 169 states and 313 transitions. [2018-06-22 01:53:39,551 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:53:39,551 INFO ]: Start isEmpty. Operand 169 states and 313 transitions. [2018-06-22 01:53:39,556 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 01:53:39,556 INFO ]: Found error trace [2018-06-22 01:53:39,556 INFO ]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:53:39,556 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:39,557 INFO ]: Analyzing trace with hash -1034408256, now seen corresponding path program 1 times [2018-06-22 01:53:39,557 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:39,557 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:39,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:39,557 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:53:39,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:39,574 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:40,003 INFO ]: Checked inductivity of 75 backedges. 36 proven. 13 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 01:53:40,003 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:53:40,003 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:53:40,019 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:53:40,136 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:40,142 INFO ]: Computing forward predicates... [2018-06-22 01:53:40,306 INFO ]: Checked inductivity of 75 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-06-22 01:53:40,341 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:53:40,342 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-06-22 01:53:40,342 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:53:40,342 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:53:40,342 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:53:40,342 INFO ]: Start difference. First operand 169 states and 313 transitions. Second operand 7 states. [2018-06-22 01:53:40,553 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:53:40,553 INFO ]: Finished difference Result 208 states and 386 transitions. [2018-06-22 01:53:40,553 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:53:40,553 INFO ]: Start accepts. Automaton has 7 states. Word has length 49 [2018-06-22 01:53:40,553 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:53:40,556 INFO ]: With dead ends: 208 [2018-06-22 01:53:40,556 INFO ]: Without dead ends: 205 [2018-06-22 01:53:40,558 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:53:40,558 INFO ]: Start minimizeSevpa. Operand 205 states. [2018-06-22 01:53:40,571 INFO ]: Finished minimizeSevpa. Reduced states from 205 to 148. [2018-06-22 01:53:40,571 INFO ]: Start removeUnreachable. Operand 148 states. [2018-06-22 01:53:40,572 INFO ]: Finished removeUnreachable. Reduced from 148 states to 148 states and 253 transitions. [2018-06-22 01:53:40,573 INFO ]: Start accepts. Automaton has 148 states and 253 transitions. Word has length 49 [2018-06-22 01:53:40,573 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:53:40,573 INFO ]: Abstraction has 148 states and 253 transitions. [2018-06-22 01:53:40,573 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:53:40,573 INFO ]: Start isEmpty. Operand 148 states and 253 transitions. [2018-06-22 01:53:40,576 INFO ]: Finished isEmpty. Found accepting run of length 67 [2018-06-22 01:53:40,576 INFO ]: Found error trace [2018-06-22 01:53:40,576 INFO ]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 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 01:53:40,576 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:40,576 INFO ]: Analyzing trace with hash -1208621768, now seen corresponding path program 1 times [2018-06-22 01:53:40,576 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:40,576 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:40,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:40,577 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:53:40,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:40,597 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:40,780 INFO ]: Checked inductivity of 112 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-22 01:53:40,780 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:53:40,780 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:53:40,794 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:53:40,984 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:40,991 INFO ]: Computing forward predicates... [2018-06-22 01:53:41,010 INFO ]: Checked inductivity of 112 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-22 01:53:41,048 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:53:41,048 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:53:41,048 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:53:41,048 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:53:41,048 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:53:41,048 INFO ]: Start difference. First operand 148 states and 253 transitions. Second operand 4 states. [2018-06-22 01:53:41,157 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:53:41,157 INFO ]: Finished difference Result 209 states and 368 transitions. [2018-06-22 01:53:41,158 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:53:41,158 INFO ]: Start accepts. Automaton has 4 states. Word has length 66 [2018-06-22 01:53:41,158 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:53:41,160 INFO ]: With dead ends: 209 [2018-06-22 01:53:41,160 INFO ]: Without dead ends: 209 [2018-06-22 01:53:41,160 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:53:41,160 INFO ]: Start minimizeSevpa. Operand 209 states. [2018-06-22 01:53:41,181 INFO ]: Finished minimizeSevpa. Reduced states from 209 to 183. [2018-06-22 01:53:41,181 INFO ]: Start removeUnreachable. Operand 183 states. [2018-06-22 01:53:41,183 INFO ]: Finished removeUnreachable. Reduced from 183 states to 183 states and 309 transitions. [2018-06-22 01:53:41,183 INFO ]: Start accepts. Automaton has 183 states and 309 transitions. Word has length 66 [2018-06-22 01:53:41,186 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:53:41,186 INFO ]: Abstraction has 183 states and 309 transitions. [2018-06-22 01:53:41,186 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:53:41,186 INFO ]: Start isEmpty. Operand 183 states and 309 transitions. [2018-06-22 01:53:41,190 INFO ]: Finished isEmpty. Found accepting run of length 92 [2018-06-22 01:53:41,190 INFO ]: Found error trace [2018-06-22 01:53:41,190 INFO ]: trace histogram [7, 7, 7, 7, 6, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:53:41,190 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:41,190 INFO ]: Analyzing trace with hash 6302826, now seen corresponding path program 1 times [2018-06-22 01:53:41,190 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:41,190 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:41,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:41,192 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:53:41,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:41,221 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:41,611 INFO ]: Checked inductivity of 221 backedges. 64 proven. 26 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-06-22 01:53:41,611 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:53:41,611 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:53:41,617 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:53:41,832 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:41,844 INFO ]: Computing forward predicates... [2018-06-22 01:53:42,075 INFO ]: Checked inductivity of 221 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-06-22 01:53:42,106 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:53:42,106 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2018-06-22 01:53:42,107 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:53:42,108 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:53:42,108 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:53:42,108 INFO ]: Start difference. First operand 183 states and 309 transitions. Second operand 11 states. [2018-06-22 01:53:43,181 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:53:43,181 INFO ]: Finished difference Result 390 states and 887 transitions. [2018-06-22 01:53:43,182 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 01:53:43,182 INFO ]: Start accepts. Automaton has 11 states. Word has length 91 [2018-06-22 01:53:43,182 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:53:43,189 INFO ]: With dead ends: 390 [2018-06-22 01:53:43,189 INFO ]: Without dead ends: 390 [2018-06-22 01:53:43,189 INFO ]: 0 DeclaredPredicates, 123 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:53:43,189 INFO ]: Start minimizeSevpa. Operand 390 states. [2018-06-22 01:53:43,222 INFO ]: Finished minimizeSevpa. Reduced states from 390 to 212. [2018-06-22 01:53:43,222 INFO ]: Start removeUnreachable. Operand 212 states. [2018-06-22 01:53:43,227 INFO ]: Finished removeUnreachable. Reduced from 212 states to 212 states and 374 transitions. [2018-06-22 01:53:43,227 INFO ]: Start accepts. Automaton has 212 states and 374 transitions. Word has length 91 [2018-06-22 01:53:43,227 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:53:43,227 INFO ]: Abstraction has 212 states and 374 transitions. [2018-06-22 01:53:43,227 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:53:43,227 INFO ]: Start isEmpty. Operand 212 states and 374 transitions. [2018-06-22 01:53:43,232 INFO ]: Finished isEmpty. Found accepting run of length 93 [2018-06-22 01:53:43,232 INFO ]: Found error trace [2018-06-22 01:53:43,232 INFO ]: trace histogram [7, 7, 7, 7, 6, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:53:43,233 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:43,233 INFO ]: Analyzing trace with hash 1478134817, now seen corresponding path program 2 times [2018-06-22 01:53:43,233 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:43,233 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:43,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:43,233 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:53:43,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:43,261 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:43,646 WARN ]: Spent 212.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-06-22 01:53:43,752 INFO ]: Checked inductivity of 234 backedges. 92 proven. 11 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-06-22 01:53:43,752 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:53:43,752 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:53:43,766 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:53:43,983 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:53:43,983 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:43,995 INFO ]: Computing forward predicates... [2018-06-22 01:53:44,692 INFO ]: Checked inductivity of 234 backedges. 97 proven. 31 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-06-22 01:53:44,721 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:53:44,721 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 14 [2018-06-22 01:53:44,721 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:53:44,721 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:53:44,722 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:53:44,722 INFO ]: Start difference. First operand 212 states and 374 transitions. Second operand 14 states. [2018-06-22 01:53:46,615 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:53:46,615 INFO ]: Finished difference Result 413 states and 878 transitions. [2018-06-22 01:53:46,618 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:53:46,618 INFO ]: Start accepts. Automaton has 14 states. Word has length 92 [2018-06-22 01:53:46,618 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:53:46,625 INFO ]: With dead ends: 413 [2018-06-22 01:53:46,625 INFO ]: Without dead ends: 413 [2018-06-22 01:53:46,625 INFO ]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=161, Invalid=895, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:53:46,625 INFO ]: Start minimizeSevpa. Operand 413 states. [2018-06-22 01:53:46,654 INFO ]: Finished minimizeSevpa. Reduced states from 413 to 285. [2018-06-22 01:53:46,654 INFO ]: Start removeUnreachable. Operand 285 states. [2018-06-22 01:53:46,661 INFO ]: Finished removeUnreachable. Reduced from 285 states to 285 states and 559 transitions. [2018-06-22 01:53:46,662 INFO ]: Start accepts. Automaton has 285 states and 559 transitions. Word has length 92 [2018-06-22 01:53:46,662 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:53:46,662 INFO ]: Abstraction has 285 states and 559 transitions. [2018-06-22 01:53:46,662 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:53:46,662 INFO ]: Start isEmpty. Operand 285 states and 559 transitions. [2018-06-22 01:53:46,669 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 01:53:46,669 INFO ]: Found error trace [2018-06-22 01:53:46,669 INFO ]: trace histogram [7, 7, 7, 7, 6, 6, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:53:46,669 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:46,673 INFO ]: Analyzing trace with hash -1530628420, now seen corresponding path program 1 times [2018-06-22 01:53:46,673 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:46,673 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:46,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:46,673 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:53:46,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:46,697 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:46,815 INFO ]: Checked inductivity of 248 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-06-22 01:53:46,815 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:53:46,815 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:53:46,815 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:53:46,815 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:53:46,815 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:53:46,815 INFO ]: Start difference. First operand 285 states and 559 transitions. Second operand 4 states. [2018-06-22 01:53:46,837 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:53:46,837 INFO ]: Finished difference Result 332 states and 703 transitions. [2018-06-22 01:53:46,840 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:53:46,840 INFO ]: Start accepts. Automaton has 4 states. Word has length 93 [2018-06-22 01:53:46,840 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:53:46,847 INFO ]: With dead ends: 332 [2018-06-22 01:53:46,847 INFO ]: Without dead ends: 332 [2018-06-22 01:53:46,847 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:53:46,847 INFO ]: Start minimizeSevpa. Operand 332 states. [2018-06-22 01:53:46,868 INFO ]: Finished minimizeSevpa. Reduced states from 332 to 277. [2018-06-22 01:53:46,868 INFO ]: Start removeUnreachable. Operand 277 states. [2018-06-22 01:53:46,873 INFO ]: Finished removeUnreachable. Reduced from 277 states to 277 states and 537 transitions. [2018-06-22 01:53:46,873 INFO ]: Start accepts. Automaton has 277 states and 537 transitions. Word has length 93 [2018-06-22 01:53:46,873 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:53:46,873 INFO ]: Abstraction has 277 states and 537 transitions. [2018-06-22 01:53:46,873 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:53:46,873 INFO ]: Start isEmpty. Operand 277 states and 537 transitions. [2018-06-22 01:53:46,880 INFO ]: Finished isEmpty. Found accepting run of length 95 [2018-06-22 01:53:46,880 INFO ]: Found error trace [2018-06-22 01:53:46,880 INFO ]: trace histogram [7, 7, 7, 7, 7, 6, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:53:46,880 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:46,880 INFO ]: Analyzing trace with hash -476443977, now seen corresponding path program 3 times [2018-06-22 01:53:46,880 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:46,880 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:46,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:46,881 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:53:46,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:46,930 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:47,449 INFO ]: Checked inductivity of 263 backedges. 106 proven. 46 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-06-22 01:53:47,449 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:53:47,449 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:53:47,460 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:53:47,655 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 01:53:47,655 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:47,662 INFO ]: Computing forward predicates... [2018-06-22 01:53:47,798 INFO ]: Checked inductivity of 263 backedges. 117 proven. 38 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-06-22 01:53:47,818 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:53:47,819 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2018-06-22 01:53:47,819 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:53:47,819 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:53:47,819 INFO ]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:53:47,819 INFO ]: Start difference. First operand 277 states and 537 transitions. Second operand 22 states. [2018-06-22 01:53:48,857 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 01:53:49,861 WARN ]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 01:53:51,933 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:53:51,933 INFO ]: Finished difference Result 613 states and 1553 transitions. [2018-06-22 01:53:51,933 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-22 01:53:51,933 INFO ]: Start accepts. Automaton has 22 states. Word has length 94 [2018-06-22 01:53:51,934 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:53:51,950 INFO ]: With dead ends: 613 [2018-06-22 01:53:51,950 INFO ]: Without dead ends: 613 [2018-06-22 01:53:51,953 INFO ]: 0 DeclaredPredicates, 170 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=498, Invalid=2924, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 01:53:51,953 INFO ]: Start minimizeSevpa. Operand 613 states. [2018-06-22 01:53:52,016 INFO ]: Finished minimizeSevpa. Reduced states from 613 to 290. [2018-06-22 01:53:52,016 INFO ]: Start removeUnreachable. Operand 290 states. [2018-06-22 01:53:52,021 INFO ]: Finished removeUnreachable. Reduced from 290 states to 290 states and 584 transitions. [2018-06-22 01:53:52,021 INFO ]: Start accepts. Automaton has 290 states and 584 transitions. Word has length 94 [2018-06-22 01:53:52,021 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:53:52,021 INFO ]: Abstraction has 290 states and 584 transitions. [2018-06-22 01:53:52,021 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:53:52,021 INFO ]: Start isEmpty. Operand 290 states and 584 transitions. [2018-06-22 01:53:52,028 INFO ]: Finished isEmpty. Found accepting run of length 96 [2018-06-22 01:53:52,028 INFO ]: Found error trace [2018-06-22 01:53:52,028 INFO ]: trace histogram [8, 7, 7, 7, 7, 6, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:53:52,028 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:52,028 INFO ]: Analyzing trace with hash 1539679252, now seen corresponding path program 4 times [2018-06-22 01:53:52,028 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:52,028 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:52,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:52,029 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:53:52,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:52,136 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:52,517 INFO ]: Checked inductivity of 279 backedges. 66 proven. 83 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-06-22 01:53:52,517 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:53:52,517 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:53:52,524 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:53:52,693 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:53:52,693 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:52,700 INFO ]: Computing forward predicates... [2018-06-22 01:53:52,892 INFO ]: Checked inductivity of 279 backedges. 83 proven. 97 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-06-22 01:53:52,913 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:53:52,913 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 23 [2018-06-22 01:53:52,913 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:53:52,914 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:53:52,914 INFO ]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:53:52,914 INFO ]: Start difference. First operand 290 states and 584 transitions. Second operand 23 states. [2018-06-22 01:53:57,441 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:53:57,441 INFO ]: Finished difference Result 1312 states and 4355 transitions. [2018-06-22 01:53:57,441 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-06-22 01:53:57,441 INFO ]: Start accepts. Automaton has 23 states. Word has length 95 [2018-06-22 01:53:57,441 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:53:57,515 INFO ]: With dead ends: 1312 [2018-06-22 01:53:57,515 INFO ]: Without dead ends: 1172 [2018-06-22 01:53:57,517 INFO ]: 0 DeclaredPredicates, 180 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2021 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=671, Invalid=6301, Unknown=0, NotChecked=0, Total=6972 [2018-06-22 01:53:57,518 INFO ]: Start minimizeSevpa. Operand 1172 states. [2018-06-22 01:53:57,682 INFO ]: Finished minimizeSevpa. Reduced states from 1172 to 581. [2018-06-22 01:53:57,682 INFO ]: Start removeUnreachable. Operand 581 states. [2018-06-22 01:53:57,698 INFO ]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1554 transitions. [2018-06-22 01:53:57,698 INFO ]: Start accepts. Automaton has 581 states and 1554 transitions. Word has length 95 [2018-06-22 01:53:57,698 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:53:57,698 INFO ]: Abstraction has 581 states and 1554 transitions. [2018-06-22 01:53:57,698 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:53:57,698 INFO ]: Start isEmpty. Operand 581 states and 1554 transitions. [2018-06-22 01:53:57,713 INFO ]: Finished isEmpty. Found accepting run of length 97 [2018-06-22 01:53:57,713 INFO ]: Found error trace [2018-06-22 01:53:57,713 INFO ]: trace histogram [8, 7, 7, 7, 7, 6, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:53:57,713 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:57,713 INFO ]: Analyzing trace with hash -1629456582, now seen corresponding path program 5 times [2018-06-22 01:53:57,713 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:57,713 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:57,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:57,714 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:53:57,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:57,746 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:57,926 INFO ]: Checked inductivity of 283 backedges. 89 proven. 45 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-06-22 01:53:57,926 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:53:57,926 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:53:57,938 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:53:58,124 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 01:53:58,124 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:58,132 INFO ]: Computing forward predicates... [2018-06-22 01:53:58,142 INFO ]: Checked inductivity of 283 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-06-22 01:53:58,176 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:53:58,176 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-22 01:53:58,176 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:53:58,176 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:53:58,176 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:53:58,176 INFO ]: Start difference. First operand 581 states and 1554 transitions. Second operand 4 states. [2018-06-22 01:53:58,573 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:53:58,573 INFO ]: Finished difference Result 643 states and 1720 transitions. [2018-06-22 01:53:58,574 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:53:58,574 INFO ]: Start accepts. Automaton has 4 states. Word has length 96 [2018-06-22 01:53:58,574 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:53:58,598 INFO ]: With dead ends: 643 [2018-06-22 01:53:58,598 INFO ]: Without dead ends: 580 [2018-06-22 01:53:58,598 INFO ]: 0 DeclaredPredicates, 101 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:53:58,598 INFO ]: Start minimizeSevpa. Operand 580 states. [2018-06-22 01:53:58,655 INFO ]: Finished minimizeSevpa. Reduced states from 580 to 580. [2018-06-22 01:53:58,655 INFO ]: Start removeUnreachable. Operand 580 states. [2018-06-22 01:53:58,671 INFO ]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1550 transitions. [2018-06-22 01:53:58,671 INFO ]: Start accepts. Automaton has 580 states and 1550 transitions. Word has length 96 [2018-06-22 01:53:58,671 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:53:58,671 INFO ]: Abstraction has 580 states and 1550 transitions. [2018-06-22 01:53:58,671 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:53:58,671 INFO ]: Start isEmpty. Operand 580 states and 1550 transitions. [2018-06-22 01:53:58,686 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 01:53:58,686 INFO ]: Found error trace [2018-06-22 01:53:58,686 INFO ]: trace histogram [8, 7, 7, 7, 7, 6, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:53:58,687 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:58,687 INFO ]: Analyzing trace with hash 754775085, now seen corresponding path program 1 times [2018-06-22 01:53:58,687 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:58,687 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:58,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:58,687 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:53:58,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:58,718 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:58,900 INFO ]: Checked inductivity of 284 backedges. 91 proven. 44 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-06-22 01:53:58,901 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:53:58,901 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:53:58,979 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:53:59,213 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:53:59,223 INFO ]: Computing forward predicates... [2018-06-22 01:53:59,234 INFO ]: Checked inductivity of 284 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-06-22 01:53:59,271 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:53:59,272 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-22 01:53:59,272 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:53:59,272 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:53:59,272 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:53:59,272 INFO ]: Start difference. First operand 580 states and 1550 transitions. Second operand 4 states. [2018-06-22 01:53:59,453 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:53:59,453 INFO ]: Finished difference Result 592 states and 1582 transitions. [2018-06-22 01:53:59,456 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:53:59,456 INFO ]: Start accepts. Automaton has 4 states. Word has length 97 [2018-06-22 01:53:59,456 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:53:59,478 INFO ]: With dead ends: 592 [2018-06-22 01:53:59,478 INFO ]: Without dead ends: 576 [2018-06-22 01:53:59,479 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:53:59,479 INFO ]: Start minimizeSevpa. Operand 576 states. [2018-06-22 01:53:59,531 INFO ]: Finished minimizeSevpa. Reduced states from 576 to 576. [2018-06-22 01:53:59,531 INFO ]: Start removeUnreachable. Operand 576 states. [2018-06-22 01:53:59,548 INFO ]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1538 transitions. [2018-06-22 01:53:59,548 INFO ]: Start accepts. Automaton has 576 states and 1538 transitions. Word has length 97 [2018-06-22 01:53:59,549 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:53:59,549 INFO ]: Abstraction has 576 states and 1538 transitions. [2018-06-22 01:53:59,549 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:53:59,549 INFO ]: Start isEmpty. Operand 576 states and 1538 transitions. [2018-06-22 01:53:59,563 INFO ]: Finished isEmpty. Found accepting run of length 87 [2018-06-22 01:53:59,563 INFO ]: Found error trace [2018-06-22 01:53:59,563 INFO ]: trace histogram [7, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:53:59,564 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:53:59,564 INFO ]: Analyzing trace with hash -1567634663, now seen corresponding path program 1 times [2018-06-22 01:53:59,564 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:53:59,564 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:53:59,564 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:59,565 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:53:59,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:53:59,597 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:54:00,178 INFO ]: Checked inductivity of 233 backedges. 70 proven. 63 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-06-22 01:54:00,178 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:54:00,178 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:54:00,185 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:54:00,359 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:54:00,365 INFO ]: Computing forward predicates... [2018-06-22 01:54:00,512 INFO ]: Checked inductivity of 233 backedges. 70 proven. 63 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-06-22 01:54:00,533 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:54:00,533 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 01:54:00,534 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:54:00,534 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:54:00,534 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:54:00,534 INFO ]: Start difference. First operand 576 states and 1538 transitions. Second operand 16 states. [2018-06-22 01:54:02,046 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:54:02,046 INFO ]: Finished difference Result 1202 states and 3932 transitions. [2018-06-22 01:54:02,046 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:54:02,046 INFO ]: Start accepts. Automaton has 16 states. Word has length 86 [2018-06-22 01:54:02,046 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:54:02,103 INFO ]: With dead ends: 1202 [2018-06-22 01:54:02,103 INFO ]: Without dead ends: 1100 [2018-06-22 01:54:02,104 INFO ]: 0 DeclaredPredicates, 138 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=242, Invalid=1480, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:54:02,105 INFO ]: Start minimizeSevpa. Operand 1100 states. [2018-06-22 01:54:02,228 INFO ]: Finished minimizeSevpa. Reduced states from 1100 to 611. [2018-06-22 01:54:02,228 INFO ]: Start removeUnreachable. Operand 611 states. [2018-06-22 01:54:02,242 INFO ]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1633 transitions. [2018-06-22 01:54:02,243 INFO ]: Start accepts. Automaton has 611 states and 1633 transitions. Word has length 86 [2018-06-22 01:54:02,243 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:54:02,243 INFO ]: Abstraction has 611 states and 1633 transitions. [2018-06-22 01:54:02,243 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:54:02,243 INFO ]: Start isEmpty. Operand 611 states and 1633 transitions. [2018-06-22 01:54:02,257 INFO ]: Finished isEmpty. Found accepting run of length 88 [2018-06-22 01:54:02,257 INFO ]: Found error trace [2018-06-22 01:54:02,257 INFO ]: trace histogram [8, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:54:02,257 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:54:02,257 INFO ]: Analyzing trace with hash -510416894, now seen corresponding path program 2 times [2018-06-22 01:54:02,257 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:54:02,257 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:54:02,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:54:02,258 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:54:02,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:54:02,304 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:54:02,484 INFO ]: Checked inductivity of 249 backedges. 120 proven. 4 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-06-22 01:54:02,485 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:54:02,485 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:54:02,497 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:54:02,703 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:54:02,703 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:54:02,710 INFO ]: Computing forward predicates... [2018-06-22 01:54:02,722 INFO ]: Checked inductivity of 249 backedges. 120 proven. 4 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-06-22 01:54:02,756 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:54:02,756 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:54:02,756 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:54:02,756 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:54:02,756 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:54:02,756 INFO ]: Start difference. First operand 611 states and 1633 transitions. Second operand 4 states. [2018-06-22 01:54:03,341 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:54:03,342 INFO ]: Finished difference Result 686 states and 1831 transitions. [2018-06-22 01:54:03,343 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:54:03,343 INFO ]: Start accepts. Automaton has 4 states. Word has length 87 [2018-06-22 01:54:03,343 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:54:03,353 INFO ]: With dead ends: 686 [2018-06-22 01:54:03,353 INFO ]: Without dead ends: 580 [2018-06-22 01:54:03,353 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:54:03,354 INFO ]: Start minimizeSevpa. Operand 580 states. [2018-06-22 01:54:03,396 INFO ]: Finished minimizeSevpa. Reduced states from 580 to 580. [2018-06-22 01:54:03,396 INFO ]: Start removeUnreachable. Operand 580 states. [2018-06-22 01:54:03,405 INFO ]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1521 transitions. [2018-06-22 01:54:03,406 INFO ]: Start accepts. Automaton has 580 states and 1521 transitions. Word has length 87 [2018-06-22 01:54:03,406 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:54:03,406 INFO ]: Abstraction has 580 states and 1521 transitions. [2018-06-22 01:54:03,406 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:54:03,406 INFO ]: Start isEmpty. Operand 580 states and 1521 transitions. [2018-06-22 01:54:03,415 INFO ]: Finished isEmpty. Found accepting run of length 112 [2018-06-22 01:54:03,415 INFO ]: Found error trace [2018-06-22 01:54:03,415 INFO ]: trace histogram [10, 8, 8, 8, 8, 7, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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 01:54:03,416 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:54:03,416 INFO ]: Analyzing trace with hash 2033758894, now seen corresponding path program 6 times [2018-06-22 01:54:03,416 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:54:03,416 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:54:03,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:54:03,416 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:54:03,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:54:03,517 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:54:03,846 WARN ]: Spent 187.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-06-22 01:54:04,313 WARN ]: Spent 259.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-22 01:54:04,518 WARN ]: Spent 114.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 6 [2018-06-22 01:54:04,629 INFO ]: Checked inductivity of 410 backedges. 73 proven. 177 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-06-22 01:54:04,629 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:54:04,629 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:54:04,635 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:54:04,814 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:54:04,814 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:54:04,824 INFO ]: Computing forward predicates... [2018-06-22 01:54:05,100 INFO ]: Checked inductivity of 410 backedges. 38 proven. 58 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2018-06-22 01:54:05,121 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:54:05,121 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 18 [2018-06-22 01:54:05,121 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:54:05,121 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:54:05,121 INFO ]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:54:05,121 INFO ]: Start difference. First operand 580 states and 1521 transitions. Second operand 18 states. [2018-06-22 01:54:07,081 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:54:07,082 INFO ]: Finished difference Result 1280 states and 4739 transitions. [2018-06-22 01:54:07,082 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 01:54:07,082 INFO ]: Start accepts. Automaton has 18 states. Word has length 111 [2018-06-22 01:54:07,082 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:54:07,153 INFO ]: With dead ends: 1280 [2018-06-22 01:54:07,153 INFO ]: Without dead ends: 1204 [2018-06-22 01:54:07,154 INFO ]: 0 DeclaredPredicates, 174 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=272, Invalid=1890, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 01:54:07,156 INFO ]: Start minimizeSevpa. Operand 1204 states. [2018-06-22 01:54:07,317 INFO ]: Finished minimizeSevpa. Reduced states from 1204 to 731. [2018-06-22 01:54:07,317 INFO ]: Start removeUnreachable. Operand 731 states. [2018-06-22 01:54:07,336 INFO ]: Finished removeUnreachable. Reduced from 731 states to 731 states and 2110 transitions. [2018-06-22 01:54:07,336 INFO ]: Start accepts. Automaton has 731 states and 2110 transitions. Word has length 111 [2018-06-22 01:54:07,336 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:54:07,336 INFO ]: Abstraction has 731 states and 2110 transitions. [2018-06-22 01:54:07,336 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:54:07,336 INFO ]: Start isEmpty. Operand 731 states and 2110 transitions. [2018-06-22 01:54:07,382 INFO ]: Finished isEmpty. Found accepting run of length 354 [2018-06-22 01:54:07,382 INFO ]: Found error trace [2018-06-22 01:54:07,382 INFO ]: trace histogram [33, 25, 25, 25, 25, 23, 18, 18, 17, 14, 12, 12, 12, 12, 12, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:54:07,382 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:54:07,382 INFO ]: Analyzing trace with hash 1223354851, now seen corresponding path program 1 times [2018-06-22 01:54:07,382 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:54:07,382 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:54:07,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:54:07,383 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:54:07,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:54:07,569 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:54:09,108 INFO ]: Checked inductivity of 5015 backedges. 1296 proven. 198 refuted. 0 times theorem prover too weak. 3521 trivial. 0 not checked. [2018-06-22 01:54:09,109 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:54:09,109 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:54:09,116 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:54:09,937 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:54:09,969 INFO ]: Computing forward predicates... [2018-06-22 01:54:10,708 INFO ]: Checked inductivity of 5015 backedges. 1405 proven. 615 refuted. 0 times theorem prover too weak. 2995 trivial. 0 not checked. [2018-06-22 01:54:10,735 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:54:10,735 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 32 [2018-06-22 01:54:10,736 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:54:10,736 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:54:10,736 INFO ]: CoverageRelationStatistics Valid=68, Invalid=924, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:54:10,736 INFO ]: Start difference. First operand 731 states and 2110 transitions. Second operand 32 states. [2018-06-22 01:54:12,481 WARN ]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-22 01:54:13,737 WARN ]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 12 Received shutdown request... [2018-06-22 01:54:23,458 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-06-22 01:54:23,458 WARN ]: Verification canceled [2018-06-22 01:54:23,462 WARN ]: Timeout [2018-06-22 01:54:23,463 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:54:23 BoogieIcfgContainer [2018-06-22 01:54:23,463 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:54:23,464 INFO ]: Toolchain (without parser) took 55163.12 ms. Allocated memory was 304.6 MB in the beginning and 1.2 GB in the end (delta: 859.8 MB). Free memory was 232.2 MB in the beginning and 1.1 GB in the end (delta: -829.5 MB). Peak memory consumption was 30.4 MB. Max. memory is 3.6 GB. [2018-06-22 01:54:23,464 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 304.6 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:54:23,464 INFO ]: ChcToBoogie took 94.39 ms. Allocated memory is still 304.6 MB. Free memory was 232.2 MB in the beginning and 228.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 01:54:23,471 INFO ]: Boogie Preprocessor took 79.02 ms. Allocated memory is still 304.6 MB. Free memory was 228.2 MB in the beginning and 226.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 01:54:23,472 INFO ]: RCFGBuilder took 1160.19 ms. Allocated memory was 304.6 MB in the beginning and 321.9 MB in the end (delta: 17.3 MB). Free memory was 226.2 MB in the beginning and 285.6 MB in the end (delta: -59.4 MB). Peak memory consumption was 48.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:54:23,472 INFO ]: TraceAbstraction took 53810.13 ms. Allocated memory was 321.9 MB in the beginning and 1.2 GB in the end (delta: 842.5 MB). Free memory was 285.6 MB in the beginning and 1.1 GB in the end (delta: -776.1 MB). Peak memory consumption was 66.4 MB. Max. memory is 3.6 GB. [2018-06-22 01:54:23,474 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.10 ms. Allocated memory is still 304.6 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 94.39 ms. Allocated memory is still 304.6 MB. Free memory was 232.2 MB in the beginning and 228.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 79.02 ms. Allocated memory is still 304.6 MB. Free memory was 228.2 MB in the beginning and 226.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1160.19 ms. Allocated memory was 304.6 MB in the beginning and 321.9 MB in the end (delta: 17.3 MB). Free memory was 226.2 MB in the beginning and 285.6 MB in the end (delta: -59.4 MB). Peak memory consumption was 48.5 MB. Max. memory is 3.6 GB. * TraceAbstraction took 53810.13 ms. Allocated memory was 321.9 MB in the beginning and 1.2 GB in the end (delta: 842.5 MB). Free memory was 285.6 MB in the beginning and 1.1 GB in the end (delta: -776.1 MB). Peak memory consumption was 66.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (731states) and interpolant automaton (currently 215 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 233 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. TIMEOUT Result, 53.7s OverallTime, 24 OverallIterations, 33 TraceHistogramMax, 35.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2239 SDtfs, 3292 SDslu, 13621 SDs, 0 SdLazy, 26181 SolverSat, 4353 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2149 GetRequests, 1517 SyntacticMatches, 7 SemanticMatches, 624 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23907 ImplicationChecksByTransitivity, 19.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=731occurred in iteration=23, 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: 1.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 2646 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 3102 NumberOfCodeBlocks, 3002 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 3063 ConstructedInterpolants, 0 QuantifiedInterpolants, 677149 SizeOfPredicates, 87 NumberOfNonLiveVariables, 21617 ConjunctsInSsa, 274 ConjunctsInUnsatCore, 39 InterpolantComputations, 13 PerfectInterpolantSequences, 14126/15773 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/Ackermann06.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-54-23-487.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ackermann06.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-54-23-487.csv Completed graceful shutdown