java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/HOLA/19.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 00:59:15,012 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 00:59:15,016 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 00:59:15,030 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 00:59:15,031 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 00:59:15,031 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 00:59:15,033 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 00:59:15,035 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 00:59:15,036 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 00:59:15,037 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 00:59:15,038 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 00:59:15,038 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 00:59:15,039 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 00:59:15,040 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 00:59:15,044 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 00:59:15,045 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 00:59:15,046 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 00:59:15,059 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 00:59:15,060 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 00:59:15,061 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 00:59:15,062 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 00:59:15,064 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 00:59:15,064 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 00:59:15,064 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 00:59:15,065 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 00:59:15,070 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 00:59:15,071 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 00:59:15,072 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 00:59:15,073 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 00:59:15,073 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 00:59:15,073 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 00:59:15,074 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 00:59:15,074 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 00:59:15,078 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 00:59:15,078 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 00:59:15,079 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 00:59:15,099 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 00:59:15,101 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 00:59:15,101 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 00:59:15,101 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 00:59:15,102 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 00:59:15,103 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 00:59:15,103 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 00:59:15,103 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 00:59:15,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 00:59:15,104 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 00:59:15,104 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 00:59:15,104 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 00:59:15,104 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 00:59:15,104 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 00:59:15,105 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 00:59:15,105 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 00:59:15,105 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 00:59:15,106 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 00:59:15,106 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 00:59:15,148 INFO ]: Repository-Root is: /tmp [2018-06-22 00:59:15,162 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 00:59:15,165 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 00:59:15,166 INFO ]: Initializing SmtParser... [2018-06-22 00:59:15,167 INFO ]: SmtParser initialized [2018-06-22 00:59:15,167 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/19.c.smt2 [2018-06-22 00:59:15,168 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 00:59:15,259 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/19.c.smt2 unknown [2018-06-22 00:59:15,659 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/19.c.smt2 [2018-06-22 00:59:15,663 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 00:59:15,672 INFO ]: Walking toolchain with 4 elements. [2018-06-22 00:59:15,673 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 00:59:15,673 INFO ]: Initializing ChcToBoogie... [2018-06-22 00:59:15,673 INFO ]: ChcToBoogie initialized [2018-06-22 00:59:15,676 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:59:15" (1/1) ... [2018-06-22 00:59:15,757 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:15 Unit [2018-06-22 00:59:15,757 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 00:59:15,758 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 00:59:15,758 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 00:59:15,758 INFO ]: Boogie Preprocessor initialized [2018-06-22 00:59:15,781 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:15" (1/1) ... [2018-06-22 00:59:15,781 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:15" (1/1) ... [2018-06-22 00:59:15,788 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:15" (1/1) ... [2018-06-22 00:59:15,788 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:15" (1/1) ... [2018-06-22 00:59:15,794 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:15" (1/1) ... [2018-06-22 00:59:15,796 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:15" (1/1) ... [2018-06-22 00:59:15,805 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:15" (1/1) ... [2018-06-22 00:59:15,808 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 00:59:15,809 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 00:59:15,809 INFO ]: Initializing RCFGBuilder... [2018-06-22 00:59:15,809 INFO ]: RCFGBuilder initialized [2018-06-22 00:59:15,809 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:15" (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 00:59:15,830 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 00:59:15,830 INFO ]: Found specification of procedure gotoProc [2018-06-22 00:59:15,830 INFO ]: Found implementation of procedure gotoProc [2018-06-22 00:59:15,830 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 00:59:15,830 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 00:59:15,830 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 00:59:16,277 INFO ]: Using library mode [2018-06-22 00:59:16,277 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:59:16 BoogieIcfgContainer [2018-06-22 00:59:16,277 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 00:59:16,279 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 00:59:16,279 INFO ]: Initializing TraceAbstraction... [2018-06-22 00:59:16,281 INFO ]: TraceAbstraction initialized [2018-06-22 00:59:16,282 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:59:15" (1/3) ... [2018-06-22 00:59:16,282 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664d96d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 12:59:16, skipping insertion in model container [2018-06-22 00:59:16,282 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:15" (2/3) ... [2018-06-22 00:59:16,283 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664d96d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:59:16, skipping insertion in model container [2018-06-22 00:59:16,283 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:59:16" (3/3) ... [2018-06-22 00:59:16,284 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 00:59:16,293 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 00:59:16,301 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 00:59:16,333 INFO ]: Using default assertion order modulation [2018-06-22 00:59:16,333 INFO ]: Interprodecural is true [2018-06-22 00:59:16,333 INFO ]: Hoare is false [2018-06-22 00:59:16,333 INFO ]: Compute interpolants for FPandBP [2018-06-22 00:59:16,333 INFO ]: Backedges is TWOTRACK [2018-06-22 00:59:16,333 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 00:59:16,333 INFO ]: Difference is false [2018-06-22 00:59:16,333 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 00:59:16,334 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 00:59:16,346 INFO ]: Start isEmpty. Operand 33 states. [2018-06-22 00:59:16,356 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 00:59:16,357 INFO ]: Found error trace [2018-06-22 00:59:16,357 INFO ]: trace histogram [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 00:59:16,358 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:16,361 INFO ]: Analyzing trace with hash -115339804, now seen corresponding path program 1 times [2018-06-22 00:59:16,363 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:16,363 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:16,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:16,394 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:16,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:16,475 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:17,064 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:59:17,069 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:59:17,069 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 00:59:17,072 INFO ]: Interpolant automaton has 12 states [2018-06-22 00:59:17,087 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 00:59:17,088 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 00:59:17,090 INFO ]: Start difference. First operand 33 states. Second operand 12 states. [2018-06-22 00:59:17,578 WARN ]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-22 00:59:18,024 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:18,024 INFO ]: Finished difference Result 68 states and 73 transitions. [2018-06-22 00:59:18,025 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 00:59:18,026 INFO ]: Start accepts. Automaton has 12 states. Word has length 23 [2018-06-22 00:59:18,026 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:18,035 INFO ]: With dead ends: 68 [2018-06-22 00:59:18,036 INFO ]: Without dead ends: 64 [2018-06-22 00:59:18,038 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2018-06-22 00:59:18,055 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 00:59:18,074 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 37. [2018-06-22 00:59:18,075 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 00:59:18,076 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-06-22 00:59:18,078 INFO ]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 23 [2018-06-22 00:59:18,078 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:18,078 INFO ]: Abstraction has 37 states and 40 transitions. [2018-06-22 00:59:18,078 INFO ]: Interpolant automaton has 12 states. [2018-06-22 00:59:18,078 INFO ]: Start isEmpty. Operand 37 states and 40 transitions. [2018-06-22 00:59:18,079 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 00:59:18,079 INFO ]: Found error trace [2018-06-22 00:59:18,079 INFO ]: trace histogram [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 00:59:18,079 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:18,079 INFO ]: Analyzing trace with hash 114514577, now seen corresponding path program 1 times [2018-06-22 00:59:18,079 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:18,079 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:18,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:18,080 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:18,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:18,117 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:18,410 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:59:18,410 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:59:18,410 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 00:59:18,411 INFO ]: Interpolant automaton has 14 states [2018-06-22 00:59:18,412 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 00:59:18,412 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 00:59:18,412 INFO ]: Start difference. First operand 37 states and 40 transitions. Second operand 14 states. [2018-06-22 00:59:19,127 WARN ]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-06-22 00:59:19,324 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:19,325 INFO ]: Finished difference Result 72 states and 78 transitions. [2018-06-22 00:59:19,328 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 00:59:19,328 INFO ]: Start accepts. Automaton has 14 states. Word has length 23 [2018-06-22 00:59:19,328 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:19,329 INFO ]: With dead ends: 72 [2018-06-22 00:59:19,329 INFO ]: Without dead ends: 66 [2018-06-22 00:59:19,330 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2018-06-22 00:59:19,330 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 00:59:19,335 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 33. [2018-06-22 00:59:19,335 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 00:59:19,336 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-06-22 00:59:19,336 INFO ]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 23 [2018-06-22 00:59:19,336 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:19,336 INFO ]: Abstraction has 33 states and 36 transitions. [2018-06-22 00:59:19,336 INFO ]: Interpolant automaton has 14 states. [2018-06-22 00:59:19,336 INFO ]: Start isEmpty. Operand 33 states and 36 transitions. [2018-06-22 00:59:19,337 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 00:59:19,337 INFO ]: Found error trace [2018-06-22 00:59:19,337 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:59:19,337 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:19,337 INFO ]: Analyzing trace with hash 1535435996, now seen corresponding path program 1 times [2018-06-22 00:59:19,337 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:19,338 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:19,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:19,338 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:19,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:19,374 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:19,583 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:59:19,584 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:59:19,584 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-22 00:59:19,584 INFO ]: Interpolant automaton has 16 states [2018-06-22 00:59:19,584 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 00:59:19,584 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 00:59:19,584 INFO ]: Start difference. First operand 33 states and 36 transitions. Second operand 16 states. [2018-06-22 00:59:20,237 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:20,237 INFO ]: Finished difference Result 103 states and 112 transitions. [2018-06-22 00:59:20,238 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 00:59:20,238 INFO ]: Start accepts. Automaton has 16 states. Word has length 29 [2018-06-22 00:59:20,238 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:20,239 INFO ]: With dead ends: 103 [2018-06-22 00:59:20,239 INFO ]: Without dead ends: 99 [2018-06-22 00:59:20,240 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=345, Invalid=777, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 00:59:20,240 INFO ]: Start minimizeSevpa. Operand 99 states. [2018-06-22 00:59:20,245 INFO ]: Finished minimizeSevpa. Reduced states from 99 to 43. [2018-06-22 00:59:20,245 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 00:59:20,246 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-06-22 00:59:20,246 INFO ]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 29 [2018-06-22 00:59:20,246 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:20,246 INFO ]: Abstraction has 43 states and 47 transitions. [2018-06-22 00:59:20,246 INFO ]: Interpolant automaton has 16 states. [2018-06-22 00:59:20,246 INFO ]: Start isEmpty. Operand 43 states and 47 transitions. [2018-06-22 00:59:20,247 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 00:59:20,247 INFO ]: Found error trace [2018-06-22 00:59:20,247 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:59:20,247 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:20,247 INFO ]: Analyzing trace with hash 807746505, now seen corresponding path program 1 times [2018-06-22 00:59:20,247 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:20,248 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:20,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:20,248 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:20,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:20,268 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:20,539 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:59:20,539 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:59:20,539 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 00:59:20,551 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:20,626 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:20,635 INFO ]: Computing forward predicates... [2018-06-22 00:59:20,952 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:59:20,973 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:59:20,973 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2018-06-22 00:59:20,973 INFO ]: Interpolant automaton has 26 states [2018-06-22 00:59:20,973 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 00:59:20,974 INFO ]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-06-22 00:59:20,974 INFO ]: Start difference. First operand 43 states and 47 transitions. Second operand 26 states. [2018-06-22 00:59:22,169 WARN ]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-06-22 00:59:23,061 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:23,062 INFO ]: Finished difference Result 142 states and 154 transitions. [2018-06-22 00:59:23,062 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 00:59:23,062 INFO ]: Start accepts. Automaton has 26 states. Word has length 29 [2018-06-22 00:59:23,062 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:23,063 INFO ]: With dead ends: 142 [2018-06-22 00:59:23,063 INFO ]: Without dead ends: 136 [2018-06-22 00:59:23,065 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=786, Invalid=2754, Unknown=0, NotChecked=0, Total=3540 [2018-06-22 00:59:23,065 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-22 00:59:23,070 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 37. [2018-06-22 00:59:23,070 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 00:59:23,071 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-06-22 00:59:23,071 INFO ]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 29 [2018-06-22 00:59:23,071 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:23,071 INFO ]: Abstraction has 37 states and 40 transitions. [2018-06-22 00:59:23,071 INFO ]: Interpolant automaton has 26 states. [2018-06-22 00:59:23,071 INFO ]: Start isEmpty. Operand 37 states and 40 transitions. [2018-06-22 00:59:23,072 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 00:59:23,072 INFO ]: Found error trace [2018-06-22 00:59:23,072 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:59:23,072 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:23,072 INFO ]: Analyzing trace with hash 1742357656, now seen corresponding path program 1 times [2018-06-22 00:59:23,072 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:23,072 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:23,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:23,073 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:23,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:23,122 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:23,453 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:59:23,453 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:59:23,453 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 00:59:23,460 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:23,519 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:23,524 INFO ]: Computing forward predicates... [2018-06-22 00:59:23,824 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:59:23,845 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:59:23,845 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 28 [2018-06-22 00:59:23,845 INFO ]: Interpolant automaton has 28 states [2018-06-22 00:59:23,845 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 00:59:23,845 INFO ]: CoverageRelationStatistics Valid=64, Invalid=692, Unknown=0, NotChecked=0, Total=756 [2018-06-22 00:59:23,846 INFO ]: Start difference. First operand 37 states and 40 transitions. Second operand 28 states. [2018-06-22 00:59:25,237 WARN ]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-06-22 00:59:25,423 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:25,423 INFO ]: Finished difference Result 114 states and 124 transitions. [2018-06-22 00:59:25,424 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 00:59:25,424 INFO ]: Start accepts. Automaton has 28 states. Word has length 30 [2018-06-22 00:59:25,424 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:25,425 INFO ]: With dead ends: 114 [2018-06-22 00:59:25,425 INFO ]: Without dead ends: 111 [2018-06-22 00:59:25,427 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=649, Invalid=2431, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 00:59:25,427 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-22 00:59:25,432 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 50. [2018-06-22 00:59:25,432 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 00:59:25,433 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-06-22 00:59:25,433 INFO ]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 30 [2018-06-22 00:59:25,433 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:25,433 INFO ]: Abstraction has 50 states and 55 transitions. [2018-06-22 00:59:25,433 INFO ]: Interpolant automaton has 28 states. [2018-06-22 00:59:25,433 INFO ]: Start isEmpty. Operand 50 states and 55 transitions. [2018-06-22 00:59:25,434 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 00:59:25,434 INFO ]: Found error trace [2018-06-22 00:59:25,434 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:59:25,434 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:25,434 INFO ]: Analyzing trace with hash 658819915, now seen corresponding path program 1 times [2018-06-22 00:59:25,434 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:25,434 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:25,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:25,436 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:25,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:25,457 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:25,799 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:59:25,799 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:59:25,799 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 00:59:25,816 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 00:59:25,874 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:25,878 INFO ]: Computing forward predicates... [2018-06-22 00:59:26,029 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:59:26,049 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 00:59:26,049 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 28 [2018-06-22 00:59:26,049 INFO ]: Interpolant automaton has 28 states [2018-06-22 00:59:26,050 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 00:59:26,050 INFO ]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2018-06-22 00:59:26,050 INFO ]: Start difference. First operand 50 states and 55 transitions. Second operand 28 states. [2018-06-22 00:59:26,915 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:26,915 INFO ]: Finished difference Result 124 states and 136 transitions. [2018-06-22 00:59:26,916 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 00:59:26,916 INFO ]: Start accepts. Automaton has 28 states. Word has length 30 [2018-06-22 00:59:26,916 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:26,917 INFO ]: With dead ends: 124 [2018-06-22 00:59:26,917 INFO ]: Without dead ends: 118 [2018-06-22 00:59:26,917 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=603, Invalid=1847, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 00:59:26,918 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-22 00:59:26,923 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 59. [2018-06-22 00:59:26,923 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 00:59:26,924 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-06-22 00:59:26,924 INFO ]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 30 [2018-06-22 00:59:26,924 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:26,924 INFO ]: Abstraction has 59 states and 66 transitions. [2018-06-22 00:59:26,924 INFO ]: Interpolant automaton has 28 states. [2018-06-22 00:59:26,924 INFO ]: Start isEmpty. Operand 59 states and 66 transitions. [2018-06-22 00:59:26,926 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 00:59:26,926 INFO ]: Found error trace [2018-06-22 00:59:26,926 INFO ]: trace histogram [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] [2018-06-22 00:59:26,926 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:26,926 INFO ]: Analyzing trace with hash 714876576, now seen corresponding path program 1 times [2018-06-22 00:59:26,926 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:26,926 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:26,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:26,927 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:26,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:26,943 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:27,258 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 00:59:27,259 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:59:27,259 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 00:59:27,270 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:27,327 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:27,331 INFO ]: Computing forward predicates... [2018-06-22 00:59:27,517 INFO ]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:59:27,537 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 00:59:27,537 INFO ]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2018-06-22 00:59:27,537 INFO ]: Interpolant automaton has 23 states [2018-06-22 00:59:27,537 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 00:59:27,537 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-22 00:59:27,538 INFO ]: Start difference. First operand 59 states and 66 transitions. Second operand 23 states. [2018-06-22 00:59:28,178 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:28,178 INFO ]: Finished difference Result 102 states and 110 transitions. [2018-06-22 00:59:28,178 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 00:59:28,179 INFO ]: Start accepts. Automaton has 23 states. Word has length 36 [2018-06-22 00:59:28,179 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:28,180 INFO ]: With dead ends: 102 [2018-06-22 00:59:28,180 INFO ]: Without dead ends: 81 [2018-06-22 00:59:28,181 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=319, Invalid=1487, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 00:59:28,181 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 00:59:28,185 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 58. [2018-06-22 00:59:28,185 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 00:59:28,186 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-06-22 00:59:28,186 INFO ]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 36 [2018-06-22 00:59:28,186 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:28,186 INFO ]: Abstraction has 58 states and 63 transitions. [2018-06-22 00:59:28,186 INFO ]: Interpolant automaton has 23 states. [2018-06-22 00:59:28,186 INFO ]: Start isEmpty. Operand 58 states and 63 transitions. [2018-06-22 00:59:28,187 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 00:59:28,187 INFO ]: Found error trace [2018-06-22 00:59:28,187 INFO ]: trace histogram [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] [2018-06-22 00:59:28,187 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:28,187 INFO ]: Analyzing trace with hash 421545104, now seen corresponding path program 2 times [2018-06-22 00:59:28,187 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:28,187 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:28,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:28,188 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:28,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:28,203 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:28,536 INFO ]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:59:28,536 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:59:28,536 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 00:59:28,542 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 00:59:28,608 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 00:59:28,608 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:28,616 INFO ]: Computing forward predicates... [2018-06-22 00:59:28,957 INFO ]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:59:28,976 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:59:28,976 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 35 [2018-06-22 00:59:28,976 INFO ]: Interpolant automaton has 35 states [2018-06-22 00:59:28,976 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 00:59:28,976 INFO ]: CoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 00:59:28,977 INFO ]: Start difference. First operand 58 states and 63 transitions. Second operand 35 states. [2018-06-22 00:59:29,984 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:29,984 INFO ]: Finished difference Result 94 states and 100 transitions. [2018-06-22 00:59:29,986 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 00:59:29,986 INFO ]: Start accepts. Automaton has 35 states. Word has length 36 [2018-06-22 00:59:29,986 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:29,986 INFO ]: With dead ends: 94 [2018-06-22 00:59:29,986 INFO ]: Without dead ends: 82 [2018-06-22 00:59:29,987 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=628, Invalid=2912, Unknown=0, NotChecked=0, Total=3540 [2018-06-22 00:59:29,987 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-22 00:59:29,990 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 58. [2018-06-22 00:59:29,990 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 00:59:29,991 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-06-22 00:59:29,991 INFO ]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 36 [2018-06-22 00:59:29,992 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:29,992 INFO ]: Abstraction has 58 states and 62 transitions. [2018-06-22 00:59:29,992 INFO ]: Interpolant automaton has 35 states. [2018-06-22 00:59:29,992 INFO ]: Start isEmpty. Operand 58 states and 62 transitions. [2018-06-22 00:59:29,992 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 00:59:29,992 INFO ]: Found error trace [2018-06-22 00:59:29,993 INFO ]: trace histogram [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] [2018-06-22 00:59:29,993 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:29,993 INFO ]: Analyzing trace with hash -1593198333, now seen corresponding path program 1 times [2018-06-22 00:59:29,993 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:29,993 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:29,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:29,993 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 00:59:29,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:30,008 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:30,304 INFO ]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:59:30,304 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:59:30,304 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 00:59:30,310 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:30,365 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:30,370 INFO ]: Computing forward predicates... [2018-06-22 00:59:30,861 INFO ]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:59:30,882 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:59:30,882 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 37 [2018-06-22 00:59:30,882 INFO ]: Interpolant automaton has 37 states [2018-06-22 00:59:30,882 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 00:59:30,882 INFO ]: CoverageRelationStatistics Valid=96, Invalid=1236, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 00:59:30,882 INFO ]: Start difference. First operand 58 states and 62 transitions. Second operand 37 states. [2018-06-22 00:59:32,308 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:32,308 INFO ]: Finished difference Result 85 states and 89 transitions. [2018-06-22 00:59:32,309 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 00:59:32,309 INFO ]: Start accepts. Automaton has 37 states. Word has length 36 [2018-06-22 00:59:32,309 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:32,310 INFO ]: With dead ends: 85 [2018-06-22 00:59:32,310 INFO ]: Without dead ends: 44 [2018-06-22 00:59:32,311 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=811, Invalid=3349, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 00:59:32,311 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 00:59:32,313 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-22 00:59:32,313 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 00:59:32,314 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-06-22 00:59:32,314 INFO ]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 36 [2018-06-22 00:59:32,314 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:32,314 INFO ]: Abstraction has 44 states and 46 transitions. [2018-06-22 00:59:32,314 INFO ]: Interpolant automaton has 37 states. [2018-06-22 00:59:32,314 INFO ]: Start isEmpty. Operand 44 states and 46 transitions. [2018-06-22 00:59:32,323 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 00:59:32,323 INFO ]: Found error trace [2018-06-22 00:59:32,323 INFO ]: trace histogram [3, 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] [2018-06-22 00:59:32,323 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:32,323 INFO ]: Analyzing trace with hash 1571478372, now seen corresponding path program 2 times [2018-06-22 00:59:32,323 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:32,323 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:32,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:32,324 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:32,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:32,338 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:33,596 INFO ]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:59:33,617 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:59:33,617 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 00:59:33,624 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 00:59:33,685 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 00:59:33,685 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:33,690 INFO ]: Computing forward predicates... [2018-06-22 00:59:33,956 INFO ]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:59:33,975 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:59:33,975 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 35 [2018-06-22 00:59:33,975 INFO ]: Interpolant automaton has 35 states [2018-06-22 00:59:33,976 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 00:59:33,976 INFO ]: CoverageRelationStatistics Valid=77, Invalid=1113, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 00:59:33,976 INFO ]: Start difference. First operand 44 states and 46 transitions. Second operand 35 states. [2018-06-22 00:59:35,511 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:35,511 INFO ]: Finished difference Result 83 states and 87 transitions. [2018-06-22 00:59:35,513 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 00:59:35,513 INFO ]: Start accepts. Automaton has 35 states. Word has length 37 [2018-06-22 00:59:35,513 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:35,514 INFO ]: With dead ends: 83 [2018-06-22 00:59:35,514 INFO ]: Without dead ends: 80 [2018-06-22 00:59:35,515 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=731, Invalid=3825, Unknown=0, NotChecked=0, Total=4556 [2018-06-22 00:59:35,515 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-22 00:59:35,518 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 51. [2018-06-22 00:59:35,518 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 00:59:35,519 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-06-22 00:59:35,519 INFO ]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 37 [2018-06-22 00:59:35,519 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:35,519 INFO ]: Abstraction has 51 states and 54 transitions. [2018-06-22 00:59:35,519 INFO ]: Interpolant automaton has 35 states. [2018-06-22 00:59:35,519 INFO ]: Start isEmpty. Operand 51 states and 54 transitions. [2018-06-22 00:59:35,520 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 00:59:35,520 INFO ]: Found error trace [2018-06-22 00:59:35,520 INFO ]: trace histogram [4, 3, 3, 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] [2018-06-22 00:59:35,520 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:35,520 INFO ]: Analyzing trace with hash -2128637348, now seen corresponding path program 3 times [2018-06-22 00:59:35,520 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:35,520 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:35,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:35,521 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 00:59:35,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:35,539 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:35,903 INFO ]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 00:59:35,903 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:59:35,903 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 00:59:35,909 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 00:59:35,982 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 00:59:35,982 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:35,988 INFO ]: Computing forward predicates... [2018-06-22 00:59:36,274 INFO ]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 00:59:36,309 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:59:36,309 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 37 [2018-06-22 00:59:36,309 INFO ]: Interpolant automaton has 37 states [2018-06-22 00:59:36,310 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 00:59:36,310 INFO ]: CoverageRelationStatistics Valid=82, Invalid=1250, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 00:59:36,310 INFO ]: Start difference. First operand 51 states and 54 transitions. Second operand 37 states. [2018-06-22 00:59:37,328 WARN ]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-06-22 00:59:37,950 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:37,950 INFO ]: Finished difference Result 66 states and 69 transitions. [2018-06-22 00:59:37,951 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 00:59:37,951 INFO ]: Start accepts. Automaton has 37 states. Word has length 43 [2018-06-22 00:59:37,951 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:37,951 INFO ]: With dead ends: 66 [2018-06-22 00:59:37,951 INFO ]: Without dead ends: 57 [2018-06-22 00:59:37,952 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=647, Invalid=3643, Unknown=0, NotChecked=0, Total=4290 [2018-06-22 00:59:37,952 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 00:59:37,954 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 51. [2018-06-22 00:59:37,954 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 00:59:37,956 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-06-22 00:59:37,956 INFO ]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 43 [2018-06-22 00:59:37,957 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:37,957 INFO ]: Abstraction has 51 states and 53 transitions. [2018-06-22 00:59:37,957 INFO ]: Interpolant automaton has 37 states. [2018-06-22 00:59:37,957 INFO ]: Start isEmpty. Operand 51 states and 53 transitions. [2018-06-22 00:59:37,957 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 00:59:37,957 INFO ]: Found error trace [2018-06-22 00:59:37,957 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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 00:59:37,957 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:37,958 INFO ]: Analyzing trace with hash -174766312, now seen corresponding path program 3 times [2018-06-22 00:59:37,958 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:37,958 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:37,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:37,958 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 00:59:37,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:37,976 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:38,411 INFO ]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:59:38,411 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:59:38,411 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 00:59:38,421 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 00:59:38,494 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 00:59:38,494 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:38,498 INFO ]: Computing forward predicates... [2018-06-22 00:59:38,734 INFO ]: Checked inductivity of 27 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 00:59:38,753 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:59:38,753 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 38 [2018-06-22 00:59:38,754 INFO ]: Interpolant automaton has 38 states [2018-06-22 00:59:38,754 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 00:59:38,754 INFO ]: CoverageRelationStatistics Valid=83, Invalid=1323, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 00:59:38,754 INFO ]: Start difference. First operand 51 states and 53 transitions. Second operand 38 states. [2018-06-22 00:59:39,199 WARN ]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-06-22 00:59:40,577 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:40,578 INFO ]: Finished difference Result 59 states and 60 transitions. [2018-06-22 00:59:40,578 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 00:59:40,578 INFO ]: Start accepts. Automaton has 38 states. Word has length 44 [2018-06-22 00:59:40,578 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:40,578 INFO ]: With dead ends: 59 [2018-06-22 00:59:40,578 INFO ]: Without dead ends: 56 [2018-06-22 00:59:40,579 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=647, Invalid=3513, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 00:59:40,579 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 00:59:40,581 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-06-22 00:59:40,581 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 00:59:40,582 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-06-22 00:59:40,582 INFO ]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 44 [2018-06-22 00:59:40,582 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:40,582 INFO ]: Abstraction has 51 states and 52 transitions. [2018-06-22 00:59:40,582 INFO ]: Interpolant automaton has 38 states. [2018-06-22 00:59:40,582 INFO ]: Start isEmpty. Operand 51 states and 52 transitions. [2018-06-22 00:59:40,582 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-22 00:59:40,582 INFO ]: Found error trace [2018-06-22 00:59:40,583 INFO ]: trace histogram [5, 4, 4, 4, 3, 3, 3, 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 00:59:40,583 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:40,583 INFO ]: Analyzing trace with hash 1848600336, now seen corresponding path program 4 times [2018-06-22 00:59:40,583 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:40,583 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:40,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:40,583 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 00:59:40,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:40,605 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:41,201 INFO ]: Checked inductivity of 44 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 00:59:41,201 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:59:41,201 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 00:59:41,206 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 00:59:41,289 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 00:59:41,289 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:41,295 INFO ]: Computing forward predicates... [2018-06-22 00:59:41,579 INFO ]: Checked inductivity of 44 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 00:59:41,602 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:59:41,602 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 40 [2018-06-22 00:59:41,603 INFO ]: Interpolant automaton has 40 states [2018-06-22 00:59:41,603 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 00:59:41,603 INFO ]: CoverageRelationStatistics Valid=88, Invalid=1472, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 00:59:41,603 INFO ]: Start difference. First operand 51 states and 52 transitions. Second operand 40 states. [2018-06-22 00:59:42,760 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:42,760 INFO ]: Finished difference Result 40 states and 41 transitions. [2018-06-22 00:59:42,760 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 00:59:42,760 INFO ]: Start accepts. Automaton has 40 states. Word has length 50 [2018-06-22 00:59:42,761 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:42,761 INFO ]: With dead ends: 40 [2018-06-22 00:59:42,761 INFO ]: Without dead ends: 0 [2018-06-22 00:59:42,761 INFO ]: 0 DeclaredPredicates, 110 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=564, Invalid=3342, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 00:59:42,761 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 00:59:42,762 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 00:59:42,762 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 00:59:42,762 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 00:59:42,762 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-06-22 00:59:42,762 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:42,762 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 00:59:42,762 INFO ]: Interpolant automaton has 40 states. [2018-06-22 00:59:42,762 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 00:59:42,762 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 00:59:42,767 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:59:42 BoogieIcfgContainer [2018-06-22 00:59:42,767 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 00:59:42,768 INFO ]: Toolchain (without parser) took 27104.07 ms. Allocated memory was 309.9 MB in the beginning and 586.2 MB in the end (delta: 276.3 MB). Free memory was 255.2 MB in the beginning and 502.1 MB in the end (delta: -246.8 MB). Peak memory consumption was 29.5 MB. Max. memory is 3.6 GB. [2018-06-22 00:59:42,768 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.9 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 00:59:42,768 INFO ]: ChcToBoogie took 84.50 ms. Allocated memory is still 309.9 MB. Free memory was 255.2 MB in the beginning and 252.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:59:42,769 INFO ]: Boogie Preprocessor took 50.28 ms. Allocated memory is still 309.9 MB. Free memory was 252.2 MB in the beginning and 251.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 00:59:42,769 INFO ]: RCFGBuilder took 468.62 ms. Allocated memory is still 309.9 MB. Free memory was 251.2 MB in the beginning and 227.1 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 3.6 GB. [2018-06-22 00:59:42,769 INFO ]: TraceAbstraction took 26488.30 ms. Allocated memory was 309.9 MB in the beginning and 586.2 MB in the end (delta: 276.3 MB). Free memory was 227.1 MB in the beginning and 502.1 MB in the end (delta: -275.0 MB). Peak memory consumption was 1.3 MB. Max. memory is 3.6 GB. [2018-06-22 00:59:42,772 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.9 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 84.50 ms. Allocated memory is still 309.9 MB. Free memory was 255.2 MB in the beginning and 252.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 50.28 ms. Allocated memory is still 309.9 MB. Free memory was 252.2 MB in the beginning and 251.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 468.62 ms. Allocated memory is still 309.9 MB. Free memory was 251.2 MB in the beginning and 227.1 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 26488.30 ms. Allocated memory was 309.9 MB in the beginning and 586.2 MB in the end (delta: 276.3 MB). Free memory was 227.1 MB in the beginning and 502.1 MB in the end (delta: -275.0 MB). Peak memory consumption was 1.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. SAFE Result, 26.4s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 16.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 409 SDtfs, 3401 SDslu, 8458 SDs, 0 SdLazy, 5084 SolverSat, 1425 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 972 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 652 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5204 ImplicationChecksByTransitivity, 18.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 422 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 817 NumberOfCodeBlocks, 817 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 794 ConstructedInterpolants, 0 QuantifiedInterpolants, 99492 SizeOfPredicates, 485 NumberOfNonLiveVariables, 5530 ConjunctsInSsa, 507 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 64/278 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/19.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_00-59-42-780.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/19.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_00-59-42-780.csv Received shutdown request...