java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/014d-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:12:49,113 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:12:49,115 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:12:49,132 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:12:49,132 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:12:49,133 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:12:49,134 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:12:49,138 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:12:49,140 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:12:49,141 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:12:49,142 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:12:49,143 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:12:49,144 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:12:49,145 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:12:49,149 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:12:49,149 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:12:49,151 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:12:49,164 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:12:49,166 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:12:49,167 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:12:49,168 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:12:49,173 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:12:49,173 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:12:49,173 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:12:49,174 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:12:49,175 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:12:49,176 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:12:49,176 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:12:49,177 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:12:49,178 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:12:49,178 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:12:49,179 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:12:49,179 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:12:49,180 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:12:49,181 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:12:49,181 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:12:49,200 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:12:49,200 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:12:49,201 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:12:49,201 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:12:49,202 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:12:49,202 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:12:49,202 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:12:49,202 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:12:49,203 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:12:49,203 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:12:49,203 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:12:49,203 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:12:49,203 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:12:49,204 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:12:49,206 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:12:49,206 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:12:49,206 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:12:49,206 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:12:49,206 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:12:49,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:12:49,207 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:12:49,208 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:12:49,208 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:12:49,245 INFO ]: Repository-Root is: /tmp [2018-06-25 09:12:49,260 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:12:49,265 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:12:49,266 INFO ]: Initializing SmtParser... [2018-06-25 09:12:49,267 INFO ]: SmtParser initialized [2018-06-25 09:12:49,269 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/014d-horn.smt2 [2018-06-25 09:12:49,270 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-25 09:12:49,363 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/014d-horn.smt2 unknown [2018-06-25 09:12:49,602 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/014d-horn.smt2 [2018-06-25 09:12:49,612 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:12:49,617 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:12:49,618 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:12:49,618 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:12:49,618 INFO ]: ChcToBoogie initialized [2018-06-25 09:12:49,621 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:12:49" (1/1) ... [2018-06-25 09:12:49,678 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:12:49 Unit [2018-06-25 09:12:49,678 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:12:49,679 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:12:49,679 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:12:49,679 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:12:49,700 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:12:49" (1/1) ... [2018-06-25 09:12:49,700 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:12:49" (1/1) ... [2018-06-25 09:12:49,706 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:12:49" (1/1) ... [2018-06-25 09:12:49,706 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:12:49" (1/1) ... [2018-06-25 09:12:49,713 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:12:49" (1/1) ... [2018-06-25 09:12:49,716 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:12:49" (1/1) ... [2018-06-25 09:12:49,717 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:12:49" (1/1) ... [2018-06-25 09:12:49,719 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:12:49,719 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:12:49,719 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:12:49,719 INFO ]: RCFGBuilder initialized [2018-06-25 09:12:49,720 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:12:49" (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-25 09:12:49,734 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:12:49,735 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:12:49,735 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:12:49,735 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:12:49,735 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:12:49,735 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-25 09:12:50,046 INFO ]: Using library mode [2018-06-25 09:12:50,047 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:12:50 BoogieIcfgContainer [2018-06-25 09:12:50,047 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:12:50,048 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:12:50,048 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:12:50,051 INFO ]: TraceAbstraction initialized [2018-06-25 09:12:50,052 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:12:49" (1/3) ... [2018-06-25 09:12:50,053 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e375cd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:12:50, skipping insertion in model container [2018-06-25 09:12:50,053 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:12:49" (2/3) ... [2018-06-25 09:12:50,053 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e375cd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:12:50, skipping insertion in model container [2018-06-25 09:12:50,053 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:12:50" (3/3) ... [2018-06-25 09:12:50,055 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:12:50,063 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:12:50,069 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:12:50,104 INFO ]: Using default assertion order modulation [2018-06-25 09:12:50,105 INFO ]: Interprodecural is true [2018-06-25 09:12:50,105 INFO ]: Hoare is false [2018-06-25 09:12:50,105 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:12:50,105 INFO ]: Backedges is TWOTRACK [2018-06-25 09:12:50,105 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:12:50,105 INFO ]: Difference is false [2018-06-25 09:12:50,105 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:12:50,105 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:12:50,117 INFO ]: Start isEmpty. Operand 12 states. [2018-06-25 09:12:50,127 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 09:12:50,127 INFO ]: Found error trace [2018-06-25 09:12:50,128 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 09:12:50,129 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:50,136 INFO ]: Analyzing trace with hash -1603530992, now seen corresponding path program 1 times [2018-06-25 09:12:50,139 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:50,140 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:50,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:50,184 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:12:50,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:50,210 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:50,239 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:50,241 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:12:50,241 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-25 09:12:50,242 INFO ]: Interpolant automaton has 2 states [2018-06-25 09:12:50,252 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-25 09:12:50,253 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-25 09:12:50,254 INFO ]: Start difference. First operand 12 states. Second operand 2 states. [2018-06-25 09:12:50,272 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:50,272 INFO ]: Finished difference Result 10 states and 19 transitions. [2018-06-25 09:12:50,272 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-25 09:12:50,273 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-25 09:12:50,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:50,282 INFO ]: With dead ends: 10 [2018-06-25 09:12:50,282 INFO ]: Without dead ends: 10 [2018-06-25 09:12:50,283 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-25 09:12:50,306 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:12:50,320 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:12:50,321 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:12:50,322 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2018-06-25 09:12:50,323 INFO ]: Start accepts. Automaton has 10 states and 19 transitions. Word has length 6 [2018-06-25 09:12:50,323 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:50,323 INFO ]: Abstraction has 10 states and 19 transitions. [2018-06-25 09:12:50,323 INFO ]: Interpolant automaton has 2 states. [2018-06-25 09:12:50,323 INFO ]: Start isEmpty. Operand 10 states and 19 transitions. [2018-06-25 09:12:50,323 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:12:50,323 INFO ]: Found error trace [2018-06-25 09:12:50,324 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:50,324 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:50,324 INFO ]: Analyzing trace with hash 1839704129, now seen corresponding path program 1 times [2018-06-25 09:12:50,324 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:50,324 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:50,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:50,325 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:12:50,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:50,337 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:50,406 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:50,406 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:12:50,406 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:12:50,407 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:12:50,408 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:12:50,408 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:12:50,408 INFO ]: Start difference. First operand 10 states and 19 transitions. Second operand 3 states. [2018-06-25 09:12:50,488 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:50,488 INFO ]: Finished difference Result 14 states and 28 transitions. [2018-06-25 09:12:50,489 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:12:50,489 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:12:50,489 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:50,492 INFO ]: With dead ends: 14 [2018-06-25 09:12:50,492 INFO ]: Without dead ends: 14 [2018-06-25 09:12:50,493 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-25 09:12:50,493 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:12:50,496 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-25 09:12:50,496 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:12:50,498 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-06-25 09:12:50,498 INFO ]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 7 [2018-06-25 09:12:50,499 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:50,499 INFO ]: Abstraction has 11 states and 23 transitions. [2018-06-25 09:12:50,499 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:12:50,499 INFO ]: Start isEmpty. Operand 11 states and 23 transitions. [2018-06-25 09:12:50,499 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:12:50,500 INFO ]: Found error trace [2018-06-25 09:12:50,500 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:50,500 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:50,500 INFO ]: Analyzing trace with hash 1842117200, now seen corresponding path program 1 times [2018-06-25 09:12:50,500 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:50,500 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:50,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:50,501 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:12:50,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:50,511 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:50,531 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:50,531 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:12:50,531 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:12:50,532 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:12:50,532 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:12:50,532 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:12:50,532 INFO ]: Start difference. First operand 11 states and 23 transitions. Second operand 3 states. [2018-06-25 09:12:50,542 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:50,542 INFO ]: Finished difference Result 12 states and 24 transitions. [2018-06-25 09:12:50,543 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:12:50,543 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:12:50,543 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:50,543 INFO ]: With dead ends: 12 [2018-06-25 09:12:50,543 INFO ]: Without dead ends: 12 [2018-06-25 09:12:50,544 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-25 09:12:50,544 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 09:12:50,545 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 09:12:50,546 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:12:50,546 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2018-06-25 09:12:50,546 INFO ]: Start accepts. Automaton has 12 states and 24 transitions. Word has length 7 [2018-06-25 09:12:50,546 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:50,546 INFO ]: Abstraction has 12 states and 24 transitions. [2018-06-25 09:12:50,546 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:12:50,546 INFO ]: Start isEmpty. Operand 12 states and 24 transitions. [2018-06-25 09:12:50,549 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:12:50,549 INFO ]: Found error trace [2018-06-25 09:12:50,549 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:50,549 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:50,549 INFO ]: Analyzing trace with hash 1836010045, now seen corresponding path program 1 times [2018-06-25 09:12:50,549 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:50,549 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:50,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:50,550 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:12:50,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:50,560 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:50,602 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:50,602 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:12:50,602 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:12:50,602 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:12:50,602 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:12:50,602 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:12:50,602 INFO ]: Start difference. First operand 12 states and 24 transitions. Second operand 3 states. [2018-06-25 09:12:50,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:50,663 INFO ]: Finished difference Result 17 states and 33 transitions. [2018-06-25 09:12:50,663 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:12:50,663 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:12:50,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:50,664 INFO ]: With dead ends: 17 [2018-06-25 09:12:50,664 INFO ]: Without dead ends: 17 [2018-06-25 09:12:50,664 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-25 09:12:50,665 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 09:12:50,668 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-06-25 09:12:50,668 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:12:50,669 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2018-06-25 09:12:50,669 INFO ]: Start accepts. Automaton has 14 states and 29 transitions. Word has length 7 [2018-06-25 09:12:50,669 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:50,669 INFO ]: Abstraction has 14 states and 29 transitions. [2018-06-25 09:12:50,669 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:12:50,669 INFO ]: Start isEmpty. Operand 14 states and 29 transitions. [2018-06-25 09:12:50,669 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:12:50,669 INFO ]: Found error trace [2018-06-25 09:12:50,669 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:50,669 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:50,669 INFO ]: Analyzing trace with hash 1202116396, now seen corresponding path program 1 times [2018-06-25 09:12:50,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:50,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:50,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:50,670 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:12:50,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:50,680 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:50,730 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:50,730 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:12:50,730 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-25 09:12:50,738 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:12:50,782 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:50,791 INFO ]: Computing forward predicates... [2018-06-25 09:12:50,826 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:50,859 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:12:50,859 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:12:50,860 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:12:50,860 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:12:50,860 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:12:50,860 INFO ]: Start difference. First operand 14 states and 29 transitions. Second operand 4 states. [2018-06-25 09:12:51,134 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:51,135 INFO ]: Finished difference Result 21 states and 43 transitions. [2018-06-25 09:12:51,137 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:12:51,137 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:12:51,137 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:51,137 INFO ]: With dead ends: 21 [2018-06-25 09:12:51,137 INFO ]: Without dead ends: 21 [2018-06-25 09:12:51,138 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:12:51,138 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 09:12:51,140 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-06-25 09:12:51,140 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:12:51,143 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 33 transitions. [2018-06-25 09:12:51,143 INFO ]: Start accepts. Automaton has 15 states and 33 transitions. Word has length 8 [2018-06-25 09:12:51,143 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:51,143 INFO ]: Abstraction has 15 states and 33 transitions. [2018-06-25 09:12:51,143 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:12:51,143 INFO ]: Start isEmpty. Operand 15 states and 33 transitions. [2018-06-25 09:12:51,143 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:12:51,144 INFO ]: Found error trace [2018-06-25 09:12:51,144 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:51,144 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:51,144 INFO ]: Analyzing trace with hash 1269175937, now seen corresponding path program 1 times [2018-06-25 09:12:51,144 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:51,144 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:51,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:51,145 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:12:51,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:51,161 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:51,245 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:51,245 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:12:51,245 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:12:51,245 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:12:51,245 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:12:51,245 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:12:51,245 INFO ]: Start difference. First operand 15 states and 33 transitions. Second operand 3 states. [2018-06-25 09:12:51,273 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:51,273 INFO ]: Finished difference Result 17 states and 34 transitions. [2018-06-25 09:12:51,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:12:51,273 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:12:51,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:51,274 INFO ]: With dead ends: 17 [2018-06-25 09:12:51,274 INFO ]: Without dead ends: 16 [2018-06-25 09:12:51,274 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-25 09:12:51,274 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 09:12:51,276 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-06-25 09:12:51,276 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:12:51,277 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2018-06-25 09:12:51,277 INFO ]: Start accepts. Automaton has 14 states and 31 transitions. Word has length 8 [2018-06-25 09:12:51,277 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:51,277 INFO ]: Abstraction has 14 states and 31 transitions. [2018-06-25 09:12:51,277 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:12:51,277 INFO ]: Start isEmpty. Operand 14 states and 31 transitions. [2018-06-25 09:12:51,277 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:12:51,277 INFO ]: Found error trace [2018-06-25 09:12:51,277 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:51,277 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:51,277 INFO ]: Analyzing trace with hash 1093706947, now seen corresponding path program 1 times [2018-06-25 09:12:51,277 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:51,278 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:51,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:51,278 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:12:51,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:51,290 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:51,365 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:51,365 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:12:51,365 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:12:51,365 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:12:51,365 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:12:51,365 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:12:51,366 INFO ]: Start difference. First operand 14 states and 31 transitions. Second operand 4 states. [2018-06-25 09:12:51,498 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:51,498 INFO ]: Finished difference Result 18 states and 36 transitions. [2018-06-25 09:12:51,499 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:12:51,499 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:12:51,499 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:51,499 INFO ]: With dead ends: 18 [2018-06-25 09:12:51,499 INFO ]: Without dead ends: 18 [2018-06-25 09:12:51,500 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-25 09:12:51,500 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 09:12:51,502 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-06-25 09:12:51,502 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:12:51,502 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 32 transitions. [2018-06-25 09:12:51,502 INFO ]: Start accepts. Automaton has 15 states and 32 transitions. Word has length 8 [2018-06-25 09:12:51,503 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:51,503 INFO ]: Abstraction has 15 states and 32 transitions. [2018-06-25 09:12:51,503 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:12:51,503 INFO ]: Start isEmpty. Operand 15 states and 32 transitions. [2018-06-25 09:12:51,503 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:12:51,503 INFO ]: Found error trace [2018-06-25 09:12:51,503 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:51,503 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:51,503 INFO ]: Analyzing trace with hash 1087599792, now seen corresponding path program 1 times [2018-06-25 09:12:51,503 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:51,503 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:51,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:51,504 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:12:51,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:51,513 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:51,577 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:51,578 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:12:51,578 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-25 09:12:51,588 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:12:51,612 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:51,615 INFO ]: Computing forward predicates... [2018-06-25 09:12:51,631 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:51,669 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:12:51,669 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:12:51,670 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:12:51,670 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:12:51,670 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:12:51,670 INFO ]: Start difference. First operand 15 states and 32 transitions. Second operand 4 states. [2018-06-25 09:12:51,739 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:51,739 INFO ]: Finished difference Result 14 states and 22 transitions. [2018-06-25 09:12:51,740 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:12:51,740 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:12:51,740 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:51,740 INFO ]: With dead ends: 14 [2018-06-25 09:12:51,740 INFO ]: Without dead ends: 14 [2018-06-25 09:12:51,740 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 9 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-25 09:12:51,740 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:12:51,742 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-25 09:12:51,742 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:12:51,742 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2018-06-25 09:12:51,742 INFO ]: Start accepts. Automaton has 13 states and 20 transitions. Word has length 8 [2018-06-25 09:12:51,742 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:51,742 INFO ]: Abstraction has 13 states and 20 transitions. [2018-06-25 09:12:51,742 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:12:51,742 INFO ]: Start isEmpty. Operand 13 states and 20 transitions. [2018-06-25 09:12:51,743 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:12:51,743 INFO ]: Found error trace [2018-06-25 09:12:51,743 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:51,743 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:51,743 INFO ]: Analyzing trace with hash -456705426, now seen corresponding path program 1 times [2018-06-25 09:12:51,743 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:51,743 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:51,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:51,744 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:12:51,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:51,753 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:51,791 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:51,791 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:12:51,791 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:12:51,791 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:12:51,792 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:12:51,792 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:12:51,792 INFO ]: Start difference. First operand 13 states and 20 transitions. Second operand 4 states. [2018-06-25 09:12:51,820 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:51,820 INFO ]: Finished difference Result 13 states and 18 transitions. [2018-06-25 09:12:51,821 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:12:51,821 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:12:51,821 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:51,821 INFO ]: With dead ends: 13 [2018-06-25 09:12:51,821 INFO ]: Without dead ends: 12 [2018-06-25 09:12:51,822 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-25 09:12:51,822 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 09:12:51,823 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-25 09:12:51,823 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:12:51,823 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-06-25 09:12:51,823 INFO ]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 9 [2018-06-25 09:12:51,823 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:51,823 INFO ]: Abstraction has 11 states and 15 transitions. [2018-06-25 09:12:51,823 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:12:51,823 INFO ]: Start isEmpty. Operand 11 states and 15 transitions. [2018-06-25 09:12:51,823 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:12:51,823 INFO ]: Found error trace [2018-06-25 09:12:51,823 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:51,824 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:51,824 INFO ]: Analyzing trace with hash -632174416, now seen corresponding path program 1 times [2018-06-25 09:12:51,824 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:51,824 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:51,824 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:51,824 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:12:51,824 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:51,850 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:51,955 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:51,955 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:12:51,955 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-25 09:12:51,962 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:12:51,990 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:51,993 INFO ]: Computing forward predicates... [2018-06-25 09:12:52,181 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:52,205 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:12:52,205 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 09:12:52,205 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:12:52,206 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:12:52,206 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:12:52,206 INFO ]: Start difference. First operand 11 states and 15 transitions. Second operand 8 states. [2018-06-25 09:12:52,462 WARN ]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-25 09:12:52,582 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:52,582 INFO ]: Finished difference Result 14 states and 20 transitions. [2018-06-25 09:12:52,582 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:12:52,582 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-25 09:12:52,582 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:52,582 INFO ]: With dead ends: 14 [2018-06-25 09:12:52,582 INFO ]: Without dead ends: 13 [2018-06-25 09:12:52,583 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:12:52,583 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:12:52,584 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-25 09:12:52,584 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:12:52,584 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-06-25 09:12:52,584 INFO ]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 9 [2018-06-25 09:12:52,584 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:52,584 INFO ]: Abstraction has 12 states and 17 transitions. [2018-06-25 09:12:52,584 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:12:52,585 INFO ]: Start isEmpty. Operand 12 states and 17 transitions. [2018-06-25 09:12:52,585 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:12:52,585 INFO ]: Found error trace [2018-06-25 09:12:52,585 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:52,585 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:52,585 INFO ]: Analyzing trace with hash 81384927, now seen corresponding path program 1 times [2018-06-25 09:12:52,585 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:52,585 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:52,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:52,586 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:12:52,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:52,597 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:52,643 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:52,643 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:12:52,643 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-25 09:12:52,654 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:12:52,668 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:52,669 INFO ]: Computing forward predicates... [2018-06-25 09:12:52,675 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:52,696 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:12:52,696 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-25 09:12:52,696 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:12:52,696 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:12:52,696 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:12:52,696 INFO ]: Start difference. First operand 12 states and 17 transitions. Second operand 5 states. [2018-06-25 09:12:52,736 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:52,736 INFO ]: Finished difference Result 13 states and 19 transitions. [2018-06-25 09:12:52,737 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:12:52,737 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-25 09:12:52,737 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:52,737 INFO ]: With dead ends: 13 [2018-06-25 09:12:52,737 INFO ]: Without dead ends: 13 [2018-06-25 09:12:52,738 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:12:52,738 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:12:52,739 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 09:12:52,739 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:12:52,739 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-06-25 09:12:52,739 INFO ]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 10 [2018-06-25 09:12:52,739 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:52,739 INFO ]: Abstraction has 13 states and 19 transitions. [2018-06-25 09:12:52,739 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:12:52,739 INFO ]: Start isEmpty. Operand 13 states and 19 transitions. [2018-06-25 09:12:52,739 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:12:52,739 INFO ]: Found error trace [2018-06-25 09:12:52,740 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:52,740 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:52,740 INFO ]: Analyzing trace with hash -1949385964, now seen corresponding path program 2 times [2018-06-25 09:12:52,740 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:52,740 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:52,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:52,740 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:12:52,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:52,752 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:52,890 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:52,890 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:12:52,890 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-25 09:12:52,899 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:12:52,937 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:12:52,937 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:52,939 INFO ]: Computing forward predicates... [2018-06-25 09:12:52,945 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:52,966 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:12:52,966 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-25 09:12:52,966 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:12:52,966 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:12:52,966 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:12:52,966 INFO ]: Start difference. First operand 13 states and 19 transitions. Second operand 6 states. [2018-06-25 09:12:52,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:52,990 INFO ]: Finished difference Result 14 states and 21 transitions. [2018-06-25 09:12:52,990 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:12:52,990 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-25 09:12:52,990 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:52,991 INFO ]: With dead ends: 14 [2018-06-25 09:12:52,991 INFO ]: Without dead ends: 14 [2018-06-25 09:12:52,991 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:12:52,991 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:12:52,992 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 09:12:52,992 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:12:52,993 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2018-06-25 09:12:52,993 INFO ]: Start accepts. Automaton has 14 states and 21 transitions. Word has length 11 [2018-06-25 09:12:52,993 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:52,993 INFO ]: Abstraction has 14 states and 21 transitions. [2018-06-25 09:12:52,993 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:12:52,993 INFO ]: Start isEmpty. Operand 14 states and 21 transitions. [2018-06-25 09:12:52,993 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:12:52,993 INFO ]: Found error trace [2018-06-25 09:12:52,993 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:52,993 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:52,993 INFO ]: Analyzing trace with hash -478774145, now seen corresponding path program 3 times [2018-06-25 09:12:52,993 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:52,993 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:52,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:52,994 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:12:52,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:53,005 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:53,359 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:53,359 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:12:53,359 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-25 09:12:53,367 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:12:53,390 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:12:53,390 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:53,391 INFO ]: Computing forward predicates... [2018-06-25 09:12:53,466 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:53,486 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:12:53,486 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-25 09:12:53,486 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:12:53,486 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:12:53,486 INFO ]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:12:53,486 INFO ]: Start difference. First operand 14 states and 21 transitions. Second operand 13 states. [2018-06-25 09:12:53,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:53,886 INFO ]: Finished difference Result 30 states and 53 transitions. [2018-06-25 09:12:53,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-25 09:12:53,886 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-25 09:12:53,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:53,886 INFO ]: With dead ends: 30 [2018-06-25 09:12:53,886 INFO ]: Without dead ends: 30 [2018-06-25 09:12:53,887 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=503, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:12:53,887 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-25 09:12:53,889 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 15. [2018-06-25 09:12:53,889 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:12:53,889 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2018-06-25 09:12:53,889 INFO ]: Start accepts. Automaton has 15 states and 23 transitions. Word has length 12 [2018-06-25 09:12:53,889 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:53,889 INFO ]: Abstraction has 15 states and 23 transitions. [2018-06-25 09:12:53,889 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:12:53,889 INFO ]: Start isEmpty. Operand 15 states and 23 transitions. [2018-06-25 09:12:53,889 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:12:53,889 INFO ]: Found error trace [2018-06-25 09:12:53,890 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:53,893 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:53,893 INFO ]: Analyzing trace with hash -2134448012, now seen corresponding path program 4 times [2018-06-25 09:12:53,893 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:53,893 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:53,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:53,894 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:12:53,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:53,933 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:53,989 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:53,989 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:12:53,989 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-25 09:12:53,997 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:12:54,017 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:12:54,017 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:54,019 INFO ]: Computing forward predicates... [2018-06-25 09:12:54,074 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:54,092 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:12:54,092 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-25 09:12:54,092 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:12:54,092 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:12:54,092 INFO ]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:12:54,093 INFO ]: Start difference. First operand 15 states and 23 transitions. Second operand 15 states. [2018-06-25 09:12:54,506 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:54,506 INFO ]: Finished difference Result 37 states and 67 transitions. [2018-06-25 09:12:54,506 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-25 09:12:54,506 INFO ]: Start accepts. Automaton has 15 states. Word has length 13 [2018-06-25 09:12:54,506 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:54,507 INFO ]: With dead ends: 37 [2018-06-25 09:12:54,507 INFO ]: Without dead ends: 37 [2018-06-25 09:12:54,507 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=421, Invalid=839, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 09:12:54,508 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-25 09:12:54,509 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 16. [2018-06-25 09:12:54,509 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 09:12:54,510 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 25 transitions. [2018-06-25 09:12:54,510 INFO ]: Start accepts. Automaton has 16 states and 25 transitions. Word has length 13 [2018-06-25 09:12:54,510 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:54,510 INFO ]: Abstraction has 16 states and 25 transitions. [2018-06-25 09:12:54,510 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:12:54,510 INFO ]: Start isEmpty. Operand 16 states and 25 transitions. [2018-06-25 09:12:54,510 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:12:54,510 INFO ]: Found error trace [2018-06-25 09:12:54,510 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:54,510 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:54,511 INFO ]: Analyzing trace with hash -1920730337, now seen corresponding path program 5 times [2018-06-25 09:12:54,511 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:54,511 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:54,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:54,511 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:12:54,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:54,525 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:54,723 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:54,723 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:12:54,723 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-25 09:12:54,729 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:12:54,752 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 09:12:54,752 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:54,754 INFO ]: Computing forward predicates... [2018-06-25 09:12:54,834 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:54,853 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:12:54,853 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-06-25 09:12:54,853 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:12:54,853 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:12:54,853 INFO ]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:12:54,853 INFO ]: Start difference. First operand 16 states and 25 transitions. Second operand 17 states. [2018-06-25 09:12:55,277 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:55,277 INFO ]: Finished difference Result 45 states and 83 transitions. [2018-06-25 09:12:55,279 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-25 09:12:55,279 INFO ]: Start accepts. Automaton has 17 states. Word has length 14 [2018-06-25 09:12:55,279 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:55,280 INFO ]: With dead ends: 45 [2018-06-25 09:12:55,280 INFO ]: Without dead ends: 45 [2018-06-25 09:12:55,281 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=661, Invalid=1319, Unknown=0, NotChecked=0, Total=1980 [2018-06-25 09:12:55,281 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-25 09:12:55,283 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 17. [2018-06-25 09:12:55,283 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:12:55,283 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2018-06-25 09:12:55,283 INFO ]: Start accepts. Automaton has 17 states and 27 transitions. Word has length 14 [2018-06-25 09:12:55,283 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:55,283 INFO ]: Abstraction has 17 states and 27 transitions. [2018-06-25 09:12:55,283 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:12:55,284 INFO ]: Start isEmpty. Operand 17 states and 27 transitions. [2018-06-25 09:12:55,286 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:12:55,286 INFO ]: Found error trace [2018-06-25 09:12:55,286 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:55,286 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:55,286 INFO ]: Analyzing trace with hash 409550292, now seen corresponding path program 6 times [2018-06-25 09:12:55,286 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:55,286 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:55,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:55,287 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:12:55,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:55,300 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:55,612 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:55,612 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:12:55,612 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-25 09:12:55,619 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:12:55,692 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-25 09:12:55,692 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:55,694 INFO ]: Computing forward predicates... [2018-06-25 09:12:55,957 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:55,976 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:12:55,976 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-06-25 09:12:55,976 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:12:55,977 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:12:55,977 INFO ]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:12:55,977 INFO ]: Start difference. First operand 17 states and 27 transitions. Second operand 19 states. [2018-06-25 09:12:56,565 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:56,565 INFO ]: Finished difference Result 54 states and 101 transitions. [2018-06-25 09:12:56,565 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-25 09:12:56,565 INFO ]: Start accepts. Automaton has 19 states. Word has length 15 [2018-06-25 09:12:56,565 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:56,566 INFO ]: With dead ends: 54 [2018-06-25 09:12:56,566 INFO ]: Without dead ends: 54 [2018-06-25 09:12:56,567 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=991, Invalid=1979, Unknown=0, NotChecked=0, Total=2970 [2018-06-25 09:12:56,567 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-25 09:12:56,569 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 18. [2018-06-25 09:12:56,569 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:12:56,569 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2018-06-25 09:12:56,569 INFO ]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 15 [2018-06-25 09:12:56,569 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:56,569 INFO ]: Abstraction has 18 states and 29 transitions. [2018-06-25 09:12:56,569 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:12:56,569 INFO ]: Start isEmpty. Operand 18 states and 29 transitions. [2018-06-25 09:12:56,570 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:12:56,570 INFO ]: Found error trace [2018-06-25 09:12:56,570 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:56,570 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:56,570 INFO ]: Analyzing trace with hash -366194241, now seen corresponding path program 7 times [2018-06-25 09:12:56,570 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:56,570 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:56,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:56,571 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:12:56,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:56,588 INFO ]: Conjunction of SSA is sat [2018-06-25 09:12:56,592 INFO ]: Counterexample might be feasible [2018-06-25 09:12:56,608 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:12:56 BoogieIcfgContainer [2018-06-25 09:12:56,608 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:12:56,609 INFO ]: Toolchain (without parser) took 6996.52 ms. Allocated memory was 306.2 MB in the beginning and 381.2 MB in the end (delta: 75.0 MB). Free memory was 260.6 MB in the beginning and 312.3 MB in the end (delta: -51.8 MB). Peak memory consumption was 23.2 MB. Max. memory is 3.6 GB. [2018-06-25 09:12:56,610 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 306.2 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:12:56,610 INFO ]: ChcToBoogie took 60.38 ms. Allocated memory is still 306.2 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:12:56,610 INFO ]: Boogie Preprocessor took 39.88 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 256.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:12:56,611 INFO ]: RCFGBuilder took 327.84 ms. Allocated memory is still 306.2 MB. Free memory was 256.6 MB in the beginning and 246.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:12:56,611 INFO ]: TraceAbstraction took 6559.68 ms. Allocated memory was 306.2 MB in the beginning and 381.2 MB in the end (delta: 75.0 MB). Free memory was 246.6 MB in the beginning and 312.3 MB in the end (delta: -65.7 MB). Peak memory consumption was 9.3 MB. Max. memory is 3.6 GB. [2018-06-25 09:12:56,622 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 306.2 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 60.38 ms. Allocated memory is still 306.2 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.88 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 256.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 327.84 ms. Allocated memory is still 306.2 MB. Free memory was 256.6 MB in the beginning and 246.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 6559.68 ms. Allocated memory was 306.2 MB in the beginning and 381.2 MB in the end (delta: 75.0 MB). Free memory was 246.6 MB in the beginning and 312.3 MB in the end (delta: -65.7 MB). Peak memory consumption was 9.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] assume (((((hbv_False_1_Int + -1 == hbv_False_3_Int && hbv_False_2_Int + -1 == hbv_False_5_Int) && hbv_False_2_Int + -10 == 0) && !(hbv_False_2_Int <= 1)) && !(hbv_False_1_Int + hbv_False_4_Int + -10 == 0)) && !(hbv_False_1_Int <= 0)) && hbv_False_1_Int == hbv_False_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int; [L0] havoc hbv_False_5_Int, hbv_False_1_Int, hbv_False_2_Int, hbv_False_6_Int, hbv_False_4_Int, hbv_False_3_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int; [L0] assume (((hhv_REC_f_f_3_Int == hhv_REC_f_f_2_Int && hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int) && hhv_REC_f_f_2_Int <= 1; [L0] hhv_REC_f__0_Int, hhv_REC_f__1_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int; [L0] assume hhv_REC_f__1_Int == hhv_REC_f__0_Int && hhv_REC_f__0_Int <= 0; [L0] RET call gotoProc(0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. UNSAFE Result, 6.5s OverallTime, 17 OverallIterations, 8 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 202 SDtfs, 46 SDslu, 441 SDs, 0 SdLazy, 382 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1497 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=16, 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, 16 MinimizatonAttempts, 120 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 4820 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1027 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 25 InterpolantComputations, 7 PerfectInterpolantSequences, 2/174 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-12-56-638.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-12-56-638.csv Received shutdown request...